Submission #599609

#TimeUsernameProblemLanguageResultExecution timeMemory
599609joelau기억 압축 (JOI15_memory)C++14
100 / 100
2442 ms284176 KiB
#include "Memory_lib.h" #include <bits/stdc++.h> using namespace std; int Memory(int N, int M) { int a = M & ((1<<7)-1); M >>= 7; int b = M & ((1<<7)-1); M >>= 7; int c = M & ((1<<6)-1); M >>= 6; if (M >> 1) { M &= 1; if (a == N) return -1; if (a > N || b >= N || b < a || c > b-a) return -2; char ch = Get(b+1); if (a == b) { if (ch == '<') return (1<<21) | (c<<14) | ((b+1)<<7) | a; else if (ch == '[') return (3<<20) | (c<<14) | ((b+1)<<7) | a; else return (1<<21) | (c<<14) | ((b+1)<<7) | (a+1); } else { if (ch == '<' || ch == '[') return (1<<21) | (M<<20) | ((c+1)<<14) | ((b+1)<<7) | a; if (c > 0) return (1<<21) | (M<<20) | ((c-1)<<14) | ((b+1)<<7) | a; if (ch == '>' && M == 1) return -2; if (ch == ']' && M == 0) return -2; return (1<<21) | ((a+1)<<7) | (a+1); } } else { if (a > N) return -2; else if (a == N) { if (b == 0 && c == 0) return 1<<21; else return -2; } else { char ch = Get(a+1); if (ch == '<') b++; if (ch == '>') b--; if (ch == '[') c++; if (ch == ']') c--; if (b < 0 || c < 0 || b*2 > N || c*2 > N) return -2; else return (c<<14) | (b<<7) | (a+1); } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...