# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
16030 | jihoon | 수족관 1 (KOI13_aqua1) | C++98 | 2 ms | 1384 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<cstdio>
#include<algorithm>
#include<map>
#define base 4096
#define MAX_N 5001
using namespace std;
pair<int,int> su;
map<int,int> wichi;
int n,m,k,head;
int sum=0;
int idxtree[base*2]={0};
class badak{
public:
int from,to,deep;
}info[MAX_N];
class TR{
public:
int parent,child[2],value;
}tree[MAX_N];
int fndmax(int ss,int ee){
ss+=base;
ee+=base;
bool first=true;
int res=-1;
while(1){
if(ss%2){
if(first){
res=idxtree[ss];
first=false;
# | 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... |