# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
235550 | pit4h | Mechanical Doll (IOI18_doll) | C++14 | 157 ms | 12216 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 pii pair<int, int>
#include "doll.h"
using namespace std;
const int MAXN =4e5+5;
int n, base=1, e[2*MAXN][2], rep[2*MAXN];
bool turn[2*MAXN];
void get_edges(int id, int l, int r) {
if(l==r) {
if((base-l) * 2 >= n) {
e[id][1]=1;
}
if((base-l) * 2 + 1 >= n) {
e[id][0]=1;
}
return;
}
int m = (l+r)/2;
e[id][0] = id*2;
e[id][1] = id*2+1;
if((base-r) * 2 >= n) {
e[id][1]=1;
}
if((base-m) * 2 >= n) {
e[id][0]=1;
}
if(e[id][0]==id*2) {
get_edges(id*2, l, m);
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |