Submission #1710465

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define mt make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int N;
    cin >> N;
    const int A = 86400, B = 10800;

    priority_queue<pii, vector<pii>, greater<pii> > pq;
    int cur = 0, ans = 0, cnt = 0;
    rep(i, N) {
        int a, b;
        cin >> a >> b;
        (cur += a) %= A;
        if (cur <= B) {
            pq.push(mp(B - cur, 1));
            cnt++;
        } else {
            pq.push(mp(A - cur, 0));
        }
        (cur += b) %= A;
    }
    ans = cnt;

    for (int t = 0; t < A; ++t) {
        pii p;
        while (sz(pq) && (p = pq.top()).first == t && p.second == 0) {
            pq.pop();
            cnt++;
            pq.push(mp(t + B, 1));
        }
        smax(ans, cnt);

        while (sz(pq) && (p = pq.top()).first == t && p.second == 1) {
            pq.pop();
            cnt--;
            pq.push(mp(t + A-B, 0));
        }
    }

    cout << ans << endl;
}

Submission Info

Judge Result