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
Submission Time | |
---|---|
Task | H - Early Bird |
User | tspcx |
Language | C++14 (Clang 3.8.0) |
Score | 100 |
Code Size | 1559 Byte |
Status | AC |
Exec Time | 22 ms |
Memory | 1408 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, 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 | AC | 22 ms | 1408 KB |
subtask1_02.txt | AC | 22 ms | 1408 KB |
subtask1_03.txt | AC | 22 ms | 1408 KB |
subtask1_04.txt | AC | 22 ms | 1408 KB |
subtask1_05.txt | AC | 22 ms | 1408 KB |
subtask1_06.txt | AC | 22 ms | 1408 KB |
subtask1_07.txt | AC | 22 ms | 1408 KB |
subtask1_08.txt | AC | 22 ms | 1408 KB |
subtask1_09.txt | AC | 22 ms | 1408 KB |
subtask1_10.txt | AC | 22 ms | 1408 KB |
subtask1_11.txt | AC | 22 ms | 1408 KB |
subtask1_12.txt | AC | 22 ms | 1408 KB |
subtask1_13.txt | AC | 22 ms | 1408 KB |
subtask1_14.txt | AC | 22 ms | 1408 KB |
subtask1_15.txt | AC | 22 ms | 1408 KB |
subtask1_16.txt | AC | 22 ms | 1408 KB |
subtask1_17.txt | AC | 22 ms | 1408 KB |
subtask1_18.txt | AC | 22 ms | 1408 KB |
subtask1_19.txt | AC | 22 ms | 1408 KB |