# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
125709 | 2019-07-06T09:12:49 Z | 임유진(#3071) | None (JOI16_ho_t5) | C++14 | 3 ms | 504 KB |
#include<stdio.h> int X[100], D[100], L[100]; int A[150][300]; int main() { int N, Q; scanf("%d%d", &N, &Q); for(int i = 0; i < Q; i++) scanf("%d%d%d", X + i, D + i, L + i); for(int i = 0; i < 150; i++) for(int j = 0; j < 300; j++) A[i][j] = i; for(int i = 0; i < Q; i++) { if(D[i] == 1) { for(int j = 0; j < 150; j++) for(int k = 1; k < 150 + X[i] - j; k++) A[j][k] = A[j + 1][k - 1]; } else { for(int j = 0; j < 150; j++) for(int k = 150 + X[i] + j; k < 299; k++) A[j][k] = A[j + 1][k + 1]; } } for(int i = 0; i < N; i++) printf("%d\n", A[0][150 + i]); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 504 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 504 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 504 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |