# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
199203 | 2020-01-30T03:54:12 Z | arnold518 | None (JOI15_memory) | C++14 | 2790 ms | 284040 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; //printf("%d\n", M); 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=i; break; } if(sz>N/2) return -2; if(pos==N+1) { if(sz==0 && mask==1) return -1; return -2; } if(pos>N) return -2; char t=Get(pos); //printf("%d -> %d %d %d %c\n", M, pos, mask, sz, t); 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 | 2617 ms | 283860 KB | Output is correct |
2 | Correct | 2761 ms | 283732 KB | Output is correct |
3 | Correct | 2761 ms | 283712 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2617 ms | 283860 KB | Output is correct |
2 | Correct | 2761 ms | 283732 KB | Output is correct |
3 | Correct | 2761 ms | 283712 KB | Output is correct |
4 | Correct | 2746 ms | 283904 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2617 ms | 283860 KB | Output is correct |
2 | Correct | 2761 ms | 283732 KB | Output is correct |
3 | Correct | 2761 ms | 283712 KB | Output is correct |
4 | Correct | 2746 ms | 283904 KB | Output is correct |
5 | Correct | 2728 ms | 284040 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2617 ms | 283860 KB | Output is correct |
2 | Correct | 2761 ms | 283732 KB | Output is correct |
3 | Correct | 2761 ms | 283712 KB | Output is correct |
4 | Correct | 2746 ms | 283904 KB | Output is correct |
5 | Correct | 2728 ms | 284040 KB | Output is correct |
6 | Correct | 2790 ms | 283848 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 256 KB | Wrong Answer [1] |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2617 ms | 283860 KB | Output is correct |
2 | Correct | 2761 ms | 283732 KB | Output is correct |
3 | Correct | 2761 ms | 283712 KB | Output is correct |
4 | Correct | 2746 ms | 283904 KB | Output is correct |
5 | Correct | 2728 ms | 284040 KB | Output is correct |
6 | Correct | 2790 ms | 283848 KB | Output is correct |
7 | Incorrect | 5 ms | 256 KB | Wrong Answer [1] |