# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
862211 | RobBobBob | Deda (COCI17_deda) | C++14 | 82 ms | 6988 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;
const int inf = 1024*1024*1024;
struct aint
{
int nxtp2(int n)
{
int p=1;
while(p<n)p*=2;
return p;
}
int offset;
int *data;
aint(int n)
{
offset=nxtp2(n);
data=new int[offset*2];
for(int i=0;i<offset;i++)
{
data[offset+i]=inf;
}
init(0,offset-1,1);
}
void init(int st,int dr,int node)
{
if(st==dr)return;
else
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |