# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
199201 | 2020-01-30T03:45:44 Z | arnold518 | None (JOI15_memory) | C++14 | 2756 ms | 283936 KB |
#include "Memory_lib.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; int Memory(int N, int M) { int i, j; if(N%2) return -2; if(M==0) return 33; int pos=(M&31), mask=M>>5, sz; if(mask==0) return -2; if(pos==0) return -2; for(i=16; i>=0; i--) if(mask&(1<<i)) { sz=16-i; break; } if(sz>N/2) return -2; if(mask>=(1<<sz)) return -2; if(pos==N+1) { if(sz==0 && mask==0) return -1; return -2; } if(pos>N) return -2; char t=Get(pos); if(t=='<') { mask<<=1; sz++; if(sz>N/2) return -2; } else if(t=='[') { mask<<=1; sz++; mask|=1; if(sz>N/2) return -2; } else if(t=='>') { if(sz==0) return -2; if((mask&1)==1) return -2; sz--; mask>>=1; } else if(t==']') { if(sz==0) return -2; if((mask&1)==0) return -2; sz--; mask>>=1; } pos++; return (mask<<5)|pos; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2653 ms | 283936 KB | Output is correct |
2 | Incorrect | 2756 ms | 283688 KB | Wrong Answer [6] |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2653 ms | 283936 KB | Output is correct |
2 | Incorrect | 2756 ms | 283688 KB | Wrong Answer [6] |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2653 ms | 283936 KB | Output is correct |
2 | Incorrect | 2756 ms | 283688 KB | Wrong Answer [6] |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2653 ms | 283936 KB | Output is correct |
2 | Incorrect | 2756 ms | 283688 KB | Wrong Answer [6] |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2729 ms | 283868 KB | Wrong Answer [6] |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2653 ms | 283936 KB | Output is correct |
2 | Incorrect | 2756 ms | 283688 KB | Wrong Answer [6] |
3 | Halted | 0 ms | 0 KB | - |