# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
772695 | cnastea | Fountain (eJOI20_fountain) | C++14 | 1558 ms | 34876 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>
using namespace std;
#define int long long
int u[100000][20];
int s[100000][20];
vector<int> c(100000);
int j(int v, int x){
bool b[20];
for(int i = 0; i < 20; i++){
if((x >> i) & 1) b[i] = 1;
else b[i] = 0;
}
int r = v;
for(int i = 0; i < 20; i++){
if(b[i]){
r = u[r][i];
}
}
return r;
}
int f(int v, int x){
bool b[20];
for(int i = 0; i < 20; i++){
if((x >> i) & 1) b[i] = 1;
else b[i] = 0;
}
int p = 0;
int r = v;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |