# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
412632 | nxteru | The Big Prize (IOI17_prize) | C++14 | 72 ms | 1864 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 "prize.h"
#include <bits/stdc++.h>
using namespace std;
int ma,mma;
pair<int,int> ret[200005];
int lt(int i){
if(ret[i].first==-1){
vector<int>x=ask(i);
ret[i]=make_pair(x[0],x[1]);
}
return ret[i].first;
}
int rt(int i){
if(ret[i].second==-1){
vector<int>x=ask(i);
ret[i]=make_pair(x[0],x[1]);
}
return ret[i].second;
}
int ss(int i){
return lt(i)+rt(i);
}
int type(int i){
int x=ss(i);
if(x==0)return i;
else if(ma<x){
mma=x;
return -1;
}else if(ma==x)return -2;
else return -3;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |