# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
117919 | 2019-06-17T12:26:12 Z | onjo0127 | Segway (COI19_segway) | C++11 | 90 ms | 6520 KB |
#include <bits/stdc++.h> using namespace std; int cnt[333]; int a[20009], b[20009], c[20009], l[20009], p[20009], ans[20009]; bool chk[333]; vector<int> ev[55]; int MOD = 55, now = 0; int main() { int N; scanf("%d",&N); for(int i=1; i<=N; i++) { scanf("%d%d%d", &a[i], &b[i], &c[i]); ev[a[i]].push_back(i); } int M; scanf("%d",&M); while(M--) { int foo; scanf("%d", &foo); chk[foo] = 1; } while(cnt[300] < N) { ++now; for(auto& it: ev[now % MOD]) { ++p[it]; if(chk[p[it]] && !l[it]) l[it] = cnt[p[it]] % 20; if(p[it] == 300) ans[it] = now; else if(l[it]) { --l[it]; ev[(now + 1) % MOD].push_back(it); } else { int nxt; if(p[it] < 100) nxt = (now + a[it]) % MOD; else if(p[it] < 200) nxt = (now + b[it]) % MOD; else nxt = (now + c[it]) % MOD; ev[nxt].push_back(it); } } for(auto& it: ev[now % MOD]) ++cnt[p[it]]; ev[now % MOD].clear(); } for(int i=1; i<=N; i++) printf("%d\n", ans[i]); return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 384 KB | Output is correct |
2 | Correct | 3 ms | 384 KB | Output is correct |
3 | Correct | 4 ms | 536 KB | Output is correct |
4 | Correct | 13 ms | 640 KB | Output is correct |
5 | Correct | 90 ms | 2680 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 384 KB | Output is correct |
2 | Correct | 2 ms | 384 KB | Output is correct |
3 | Correct | 2 ms | 384 KB | Output is correct |
4 | Correct | 2 ms | 384 KB | Output is correct |
5 | Correct | 3 ms | 384 KB | Output is correct |
6 | Correct | 2 ms | 384 KB | Output is correct |
7 | Correct | 3 ms | 384 KB | Output is correct |
8 | Correct | 3 ms | 384 KB | Output is correct |
9 | Correct | 4 ms | 384 KB | Output is correct |
10 | Correct | 3 ms | 356 KB | Output is correct |
11 | Correct | 3 ms | 384 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 384 KB | Output is correct |
2 | Correct | 3 ms | 384 KB | Output is correct |
3 | Correct | 4 ms | 536 KB | Output is correct |
4 | Correct | 13 ms | 640 KB | Output is correct |
5 | Correct | 90 ms | 2680 KB | Output is correct |
6 | Correct | 2 ms | 384 KB | Output is correct |
7 | Correct | 2 ms | 384 KB | Output is correct |
8 | Correct | 2 ms | 384 KB | Output is correct |
9 | Correct | 2 ms | 384 KB | Output is correct |
10 | Correct | 3 ms | 384 KB | Output is correct |
11 | Correct | 2 ms | 384 KB | Output is correct |
12 | Correct | 3 ms | 384 KB | Output is correct |
13 | Correct | 3 ms | 384 KB | Output is correct |
14 | Correct | 4 ms | 384 KB | Output is correct |
15 | Correct | 3 ms | 356 KB | Output is correct |
16 | Correct | 3 ms | 384 KB | Output is correct |
17 | Correct | 6 ms | 512 KB | Output is correct |
18 | Correct | 8 ms | 896 KB | Output is correct |
19 | Correct | 37 ms | 1792 KB | Output is correct |
20 | Correct | 45 ms | 1664 KB | Output is correct |
21 | Correct | 62 ms | 2684 KB | Output is correct |
22 | Correct | 81 ms | 4216 KB | Output is correct |
23 | Correct | 74 ms | 6520 KB | Output is correct |