Submission #1398704
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long lint; typedef pair<int, int> pi; int n, q, chk[200005]; int main(){ scanf("%d",&n); int pos = 0; while(n--){ int x, y; scanf("%d %d",&x,&y); pos += x; pos %= 86400; chk[pos]++; pos += y; } for(int i=0; i<86400; i++) chk[i+86400] = chk[i]; for(int i=1; i<200000; i++) chk[i] += chk[i-1]; int ans = 0; for(int i=0; i<86400; i++) ans = max(ans, chk[i + 10801] - chk[i]); cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | H - Early Bird |
User | koosaga |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 502 Byte |
Status | AC |
Exec Time | 19 ms |
Memory | 1024 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:9:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&n); ^ ./Main.cpp:13:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d %d",&x,&y); ^
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 | 2 ms | 1024 KB |
sample_02.txt | AC | 2 ms | 1024 KB |
subtask1_01.txt | AC | 19 ms | 1024 KB |
subtask1_02.txt | AC | 19 ms | 1024 KB |
subtask1_03.txt | AC | 19 ms | 1024 KB |
subtask1_04.txt | AC | 19 ms | 1024 KB |
subtask1_05.txt | AC | 19 ms | 1024 KB |
subtask1_06.txt | AC | 19 ms | 1024 KB |
subtask1_07.txt | AC | 19 ms | 1024 KB |
subtask1_08.txt | AC | 19 ms | 1024 KB |
subtask1_09.txt | AC | 19 ms | 1024 KB |
subtask1_10.txt | AC | 19 ms | 1024 KB |
subtask1_11.txt | AC | 19 ms | 1024 KB |
subtask1_12.txt | AC | 19 ms | 1024 KB |
subtask1_13.txt | AC | 19 ms | 1024 KB |
subtask1_14.txt | AC | 19 ms | 1024 KB |
subtask1_15.txt | AC | 19 ms | 1024 KB |
subtask1_16.txt | AC | 19 ms | 1024 KB |
subtask1_17.txt | AC | 19 ms | 1024 KB |
subtask1_18.txt | AC | 19 ms | 1024 KB |
subtask1_19.txt | AC | 19 ms | 1024 KB |