# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
290805 | 2020-09-04T13:11:42 Z | gs14004 | CATS (NOI14_cats) | C++17 | 1500 ms | 40092 KB |
#include <cstdio> #include <cstring> struct cat_stack{ int stack[5000005], sz; int top(){ if(sz == 0) return 0; return stack[sz-1]; } void pop(){ if(sz != 0) sz--; } void push(int x){ stack[sz++] = x; } }s1; int main(){ int q; scanf("%d",&q); while (q--) { int x,l,n; scanf("%d %d %d",&x,&l,&n); int s2 = 0; s1.sz = 0; int g = 0; while (x) { s2 = s1.top() ^ g; s1.pop(); g ^= 1; if(s2 > l){ x--; if(x == 0){ printf("%d\n",s2); break; } } else{ s2 += 2*n; s1.push(s2^g); s1.push(s2^g); } } } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 256 KB | Output is correct |
2 | Correct | 2 ms | 256 KB | Output is correct |
3 | Correct | 2 ms | 256 KB | Output is correct |
4 | Correct | 2 ms | 256 KB | Output is correct |
5 | Correct | 2 ms | 256 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 101 ms | 352 KB | Output is correct |
2 | Correct | 52 ms | 256 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 967 ms | 376 KB | Output is correct |
2 | Correct | 541 ms | 376 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1581 ms | 1400 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 60 ms | 40060 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 60 ms | 40092 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |