# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
578168 | handlename | Game (APIO22_game) | C++17 | 1263 ms | 262144 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 pb push_back
#define mp make_pair
const int MOD=1e9+7;
int n,k;
vector<int> adj[300001],rev[300001];
struct node{
node *l,*r;
//left node stores stuff which can reach m
//right node stores stuff which m can reach
int s,m,e;
unordered_set<int> stuff;
node(int ss,int ee){
s=ss;
e=ee;
m=(s+e)/2;
if (s<e){
l=new node(s,m);
r=new node(m+1,e);
for (int i=s;i<=m;i++) l->stuff.insert(i);
for (int i=m;i<=e;i++) r->stuff.insert(i);
}
if (s==e){
l=new node(s,-1);
r=new node(s,-1);
l->stuff.insert(s);
r->stuff.insert(s);
}
}
# | 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... |