Submission #1261042

---

Source Code Expand

#define _USE_MATH_DEFINES
#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
#include <iterator>
using namespace std;

const int DAY   = 86400;
const int EARLY = 10800;

int main()
{
    int n;
    cin >> n;
    vector<int> a(n), b(n);
    for(int i=0; i<n; ++i)
        cin >> a[i] >> b[i];

    int t = 0;
    vector<int> cnt(DAY, 0);
    for(int i=0; i<n; ++i){
        t += a[i];
        t %= DAY;
        ++ cnt[t];
        t += b[i];
        t %= DAY;
    }

    int sum = accumulate(cnt.begin(), cnt.begin() + EARLY, 0);
    int ans = 0;
    for(int i=0; i<DAY; ++i){
        sum += cnt[(EARLY+i)%DAY];
        ans = max(ans, sum);
        sum -= cnt[i];
    }
    cout << ans << endl;

    return 0;
}

Submission Info

Judge Result