# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
289201 | Touubs | The Big Prize (IOI17_prize) | C++17 | 77 ms | 5368 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"
using namespace std;
#include <bits/stdc++.h>
int non_worst_box_cnt = 0;
bool notworst(vector<int> res) {
return (res[0] + res[1] != non_worst_box_cnt);
}
bool best(vector<int> res) {
return (res[0] + res[1] == 0);
}
bool contains(int a, vector<int> ares, int b, vector<int> bres) {
//cout << " checking between " << a << " and " << b << "\n";
return bres[0] != ares[0];
}
vector<vector<int>> askcache(200000);
vector<bool> asked(200000);
vector<int> ask_(int i) {
//cout << "asking " << i << "\n";
if (!asked[i]) {
asked[i] = true;
askcache[i] = ask(i);
}
return askcache[i];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |