Submission #1247082
Source Code Expand
#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#include<cassert>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define reps(X,S,Y) for (int (X) = S;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X))
#define rreps(X,S,Y) for (int (X) = (Y)-1;(X) >= (S);--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())
#define Endl endl
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T> using vv=vector<vector<T>>;
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}
template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}
#define out(args...){vector<string> a_r_g_s=s_p_l_i_t(#args, ','); e_r_r(a_r_g_s.begin(), args); }
vector<string> s_p_l_i_t(const string &s, char c){vector<string> v;int d=0,f=0;string t;for(char c:s){if(!d&&c==',')v.pb(t),t="";else t+=c;if(c=='\"'||c=='\'')f^=1;if(!f&&c=='(')++d;if(!f&&c==')')--d;}v.pb(t);return move(v);}
void e_r_r(vector<string>::iterator it) {}
template<typename T, typename... Args> void e_r_r(vector<string>::iterator it, T a, Args... args){ if(*it==" 1"||*it=="1") cerr<<endl; else cerr << it -> substr((*it)[0] == ' ', it -> length()) << " = " << a << ", "; e_r_r(++it, args...);}
const ll MOD=1e9+7;
int sum[112345];
const int m=86400;
int main(){
ios_base::sync_with_stdio(false);
cout<<fixed<<setprecision(0);
int n;
cin>>n;
ll s=0;
rep(i,n){
int x,y;
cin>>x>>y;
(x+=s)%=m;
++sum[x];
//--sum[y];
//if(x>y) ++sum[0];
s=(x+y)%m;
}
//rep(i,m) sum[i+1]+=sum[i];
rep(i,11234) sum[i+m]=sum[i];
s=0;
rep(i,10801) s+=sum[i];
ll re=s;
rep(i,m+1){
MX(re,s);
s+=sum[10801+i]-sum[i];
}
cout<<re<<endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
H - Early Bird |
User |
nuip |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
2686 Byte |
Status |
AC |
Exec Time |
18 ms |
Memory |
640 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
100 / 100 |
Status |
|
|
Set Name |
Test Cases |
Sample |
sample_01.txt, sample_02.txt |
All |
sample_01.txt, sample_02.txt, sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt |
Case Name |
Status |
Exec Time |
Memory |
sample_01.txt |
AC |
1 ms |
256 KB |
sample_02.txt |
AC |
1 ms |
384 KB |
subtask1_01.txt |
AC |
18 ms |
640 KB |
subtask1_02.txt |
AC |
18 ms |
640 KB |
subtask1_03.txt |
AC |
18 ms |
640 KB |
subtask1_04.txt |
AC |
18 ms |
640 KB |
subtask1_05.txt |
AC |
18 ms |
640 KB |
subtask1_06.txt |
AC |
18 ms |
640 KB |
subtask1_07.txt |
AC |
18 ms |
640 KB |
subtask1_08.txt |
AC |
18 ms |
640 KB |
subtask1_09.txt |
AC |
18 ms |
640 KB |
subtask1_10.txt |
AC |
18 ms |
640 KB |
subtask1_11.txt |
AC |
18 ms |
640 KB |
subtask1_12.txt |
AC |
18 ms |
640 KB |
subtask1_13.txt |
AC |
18 ms |
640 KB |
subtask1_14.txt |
AC |
18 ms |
640 KB |
subtask1_15.txt |
AC |
18 ms |
640 KB |
subtask1_16.txt |
AC |
18 ms |
640 KB |
subtask1_17.txt |
AC |
18 ms |
640 KB |
subtask1_18.txt |
AC |
18 ms |
640 KB |
subtask1_19.txt |
AC |
18 ms |
640 KB |