# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
78353 | ansol4328 | 트리 (KOI16_tree) | C++98 | 668 ms | 41416 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<stdio.h>
#include<memory.h>
#include<vector>
#include<algorithm>
#define SIZE 524288
using namespace std;
struct seg_tree
{
int limit[SIZE+2], base;
void setup(int a)
{
base=1;
while(base<a) base*=2;
for(int i=1 ; i<=base*2 ; i++) limit[i]=1;
base--;
}
void propagate(int ns, int nf, int num)
{
if(limit[num]!=1)
{
if(ns<nf)
{
limit[num*2]=max(limit[num*2],limit[num]);
limit[num*2+1]=max(limit[num*2+1],limit[num]);
}
}
}
int get_limit(int st, int fn, int ns, int nf, int num)
Compilation message (stderr)
# | 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... |