# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
66976 | ekrem | Snake Escaping (JOI18_snake_escaping) | C++98 | 1139 ms | 42012 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define N 1600005
using namespace std;
int n, m, a[(1<<20)+10], dp[N], prec[N], cvp[1000005], kaps[3000][200];
char c;
pair < int , int > q[1000005];
int main() {
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
for(int i = 0; i < 1594323; i++){
int x = i, crp = 1, ckr = -1, say = 0, bit = 0;
while(x){
if(x%3 == 2){
ckr = crp;
break;
}
bit += (1<<say)*(x%3);
say++;
crp *= 3;
x /= 3;
}
if(ckr == -1)
prec[i] = -bit;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |