Submission #999049
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
struct Initializer {
Initializer() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(15);
}
} initializer;
template<typename T> inline istream& operator>>(istream &s, vector<T> &v) {
for (T &t : v) s >> t;
return s;
}
template<typename T> inline ostream& operator<<(ostream &s, const vector<T> &v) {
for (const T &t : v) s << t << endl;
return s;
}
template<typename T> inline T min(vector<T>& v) {return *min_element(v.begin(), v.end());}
template<typename T> inline T max(vector<T>& v) {return *max_element(v.begin(), v.end());}
template<typename T> inline int min_element(vector<T>& v) {return min_element(v.begin(), v.end()) - v.begin();}
template<typename T> inline int max_element(vector<T>& v) {return max_element(v.begin(), v.end()) - v.begin();}
template<typename T> inline void sort(vector<T>& v) {sort(v.begin(), v.end());}
template<typename T, typename Function> inline void sort(vector<T>& v, Function func) {sort(v.begin(), v.end(), func);}
template<typename T> inline void rsort(vector<T>& v) {sort(v.rbegin(), v.rend());}
template<typename T> inline void reverse(vector<T>& v) {reverse(v.begin(), v.end());}
template<typename T> inline void unique(vector<T>& v) {v.erase(unique(v.begin(), v.end()), v.end());}
template<typename T> inline void nth_element(vector<T>& v, int n) {nth_element(v.begin(), v.begin() + n, v.end());}
template<typename T> inline bool next_permutation(vector<T>& v) {return next_permutation(v.begin(), v.end());}
template<typename T> inline int find(vector<T>& v, T t) {return find(v.begin(), v.end(), t) - v.begin();}
template<typename T> inline int in(vector<T> v, T t) {return find(v, t) != (int)v.size();}
template<typename T> inline int lower_bound(vector<T>& v, T t) {return lower_bound(v.begin(), v.end(), t) - v.begin();}
template<typename T> inline int upper_bound(vector<T>& v, T t) {return upper_bound(v.begin(), v.end(), t) - v.begin();}
template<typename T> inline T accumulate(const vector<T>& v, function<T(T, T)> func = plus<T>()) {return accumulate(v.begin(), v.end(), T(), func);}
template<typename T> inline void adjacent_difference(vector<T>& v) {adjacent_difference(v.begin(), v.end(), v.begin());}
template<typename T> inline void adjacent_difference(vector<T>& v, vector<T>& u) {adjacent_difference(v.begin(), v.end(), u.begin());}
template<typename T> inline void partial_sum(vector<T>& v, vector<T>& u) {partial_sum(v.begin(), v.end(), u.begin());}
template<typename T> inline T inner_product(vector<T>& v, vector<T>& u) {return inner_product(v.begin(), v.end(), u.begin(), T(0));}
template<typename T> inline int count(const vector<T>& v, T t) {return count(v.begin(), v.end(), t);}
template<typename T, typename Function> inline int count_if(const vector<T>& v, Function func) {return count_if(v.begin(), v.end(), func);}
template<typename T, typename Function> inline void remove_if(vector<T>& v, Function func) {v.erase(remove_if(v.begin(), v.end(), func), v.end());}
template<typename T, typename Function> inline bool any_of(vector<T> v, Function func) {return any_of(v.begin(), v.end(), func);}
template<typename T> inline vector<T> subvector(vector<T>& v, int a, int b) {return vector<T>(v.begin() + a, v.begin() + b);}
template<typename T> inline int kinds(const vector<T>& v) {return set<T>(v.begin(), v.end()).size();}
template<typename T> inline void iota(vector<T>& v) {iota(v.begin(), v.end(), T());}
int main() {
int n;
cin >> n;
vector<int64_t> a(n), b(n);
for (int i = 0; i < n; ++i) cin >> a[i] >> b[i];
for (int i = 1; i < n; ++i) a[i] += b[i - 1];
a[0] = 0;
constexpr int SEC = 86400;
vector<int> mem(SEC);
partial_sum(a, a);
for (int i : a) ++mem[i % SEC];
int res, sum;
res = sum = accumulate(mem.begin(), mem.begin() + 10801, 0);
for (int i = 0; i < SEC; ++i) {
sum += -mem[i] + mem[(i + 10801) % SEC];
res = max(res, sum);
}
cout << res << endl;
}
Submission Info
Submission Time |
|
Task |
H - Early Bird |
User |
not |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
3996 Byte |
Status |
RE |
Exec Time |
127 ms |
Memory |
2176 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
0 / 100 |
Status |
|
|
Set Name |
Test Cases |
Sample |
sample_01.txt, sample_02.txt |
All |
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 |
3 ms |
640 KB |
sample_02.txt |
AC |
3 ms |
640 KB |
subtask1_01.txt |
RE |
124 ms |
2176 KB |
subtask1_02.txt |
RE |
125 ms |
2176 KB |
subtask1_03.txt |
RE |
126 ms |
2176 KB |
subtask1_04.txt |
RE |
124 ms |
2176 KB |
subtask1_05.txt |
RE |
126 ms |
2176 KB |
subtask1_06.txt |
RE |
124 ms |
2176 KB |
subtask1_07.txt |
RE |
126 ms |
2176 KB |
subtask1_08.txt |
RE |
126 ms |
2176 KB |
subtask1_09.txt |
RE |
125 ms |
2176 KB |
subtask1_10.txt |
RE |
126 ms |
2176 KB |
subtask1_11.txt |
RE |
127 ms |
2176 KB |
subtask1_12.txt |
RE |
124 ms |
2176 KB |
subtask1_13.txt |
RE |
124 ms |
2176 KB |
subtask1_14.txt |
RE |
123 ms |
2176 KB |
subtask1_15.txt |
RE |
124 ms |
2176 KB |
subtask1_16.txt |
RE |
124 ms |
2176 KB |
subtask1_17.txt |
RE |
126 ms |
2176 KB |
subtask1_18.txt |
RE |
124 ms |
2176 KB |
subtask1_19.txt |
RE |
124 ms |
2176 KB |