Submission #1005214

---

Source Code Expand

#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>

#define FOR(i,k,n) for (int (i)=(k); (i)<(n); ++(i))
#define rep(i,n) FOR(i,0,n)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
#define all(v) begin(v), end(v)
#define debug(x) cerr<< #x <<": "<<x<<endl
#define debug2(x,y) cerr<< #x <<": "<< x <<", "<< #y <<": "<< y <<endl

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef vector<ll> vll;
typedef vector<vector<ll> > vvll;
template<class T> using vv=vector<vector< T > >;

int main() {
  int s = 86400;
  int n;
  scanf("%d", &n);
  vi a(n);
  vi b(n);
  rep (i, n) {
    scanf("%d%d", &a[i], &b[i]);
  }
  int current = 0;
  vi wakeup(s, 0);
  current = (current + a[0]) % s;
  wakeup[current] += 1;
  rep (i, n-1) {
    current = (current + b[i] + a[i+1]) % s;
    wakeup[current] += 1;
  }

  int p = 10800;
  vi early(s, 0);
  rep (i, p+1) {
    early[0] += wakeup[i];
  }
  int maxi = early[0];

  FOR (i, 1, s) {
    early[i] = early[i-1] - wakeup[i-1] + wakeup[(i+p)%s];
    maxi = max(maxi, early[i]);
  }
  printf("%d\n", maxi);

  return 0;
}

Submission Info

Judge Result