# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
258605 | 2020-08-06T08:32:20 Z | dantoh000 | Devil's Share (RMI19_devil) | C++14 | 157 ms | 2168 KB |
#include <bits/stdc++.h> using namespace std; int k; int d[10]; int ans[100005]; int n; int main(){ int TC; scanf("%d",&TC); while (TC--){ scanf("%d",&k); n = 0; for (int i = 1; i <= 9; i++){ scanf("%d",&d[i]); n += d[i]; } if (k == 2){ int F = 1, S = 9; for (int i = n-1; i >= 0; i--){ while (d[F] == 0) F++; while (d[S] == 0) S--; //printf("%d digit: %d %d\n",i,F,S); if ((n-i) % 2 == 1){ ans[i] = S; d[S]--; } else{ ans[i] = F; d[F]--; } } for (int i = 0; i < n; i++){ printf("%d",ans[i]); } printf("\n"); } } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 384 KB | Token parameter [name=X] equals to "32323141414", doesn't correspond to pattern "[0-9]{7}" |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 157 ms | 2040 KB | Output is correct |
2 | Correct | 108 ms | 1784 KB | Output is correct |
3 | Correct | 106 ms | 1784 KB | Output is correct |
4 | Correct | 128 ms | 2168 KB | Output is correct |
5 | Correct | 95 ms | 1272 KB | Output is correct |
6 | Correct | 85 ms | 1272 KB | Output is correct |
7 | Correct | 82 ms | 1468 KB | Output is correct |
8 | Correct | 84 ms | 1272 KB | Output is correct |
9 | Correct | 75 ms | 1656 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 29 ms | 888 KB | Token parameter [name=X] equals to "111111111111111111111111111111121212121212", doesn't correspond to pattern "[0-9]{26}" |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 384 KB | Token parameter [name=X] equals to "32323141414", doesn't correspond to pattern "[0-9]{7}" |