# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
430237 | AmineWeslati | The Big Prize (IOI17_prize) | C++14 | 104 ms | 3532 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;
typedef long long ll;
typedef vector<int>vi;
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x),end(x)
#define FOR(i,a,b) for(int i=a; i<b; i++)
//-----------------------------------------------------
const int MX=2e5+10;
int memo[MX][2];
int cnt=0;
vi query(int i){
if(memo[i][0]==-1){
cnt++;
if(cnt>10000) assert(0);
vi vec=ask(i);
memo[i][0]=vec[0];
memo[i][1]=vec[1];
}
return vi{memo[i][0],memo[i][1]};
}
int sq(int x){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |