# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
260267 | youssefbou62 | Crayfish scrivener (IOI12_scrivener) | C++14 | 1054 ms | 12384 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 pb push_back
#define sz(x) (int)x.size()
#define fi first
#define se second
using namespace std ;
const int MAXN = 1e6+6 ;
int state , cnt , par[MAXN][20];
// string ans[MAXN] ;
vector<pair<int,int>> queries;
void Init() {
}
// void new_state(int s){
// for(int i=1;i<19;i++){
// par[s][i] = par[par[s][i-1]][i-1];
// }
// cerr << "current answer: " << ans[state] << endl;
// }
// int kth_anc(int u,int k){
// for(int i = 18 ; i >= 0 ; i-- ){
// if(k&(1<<i)){
// k-=(1<<i);
// u = par[u][i] ;
# | 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... |