Submission #295503

#TimeUsernameProblemLanguageResultExecution timeMemory
295503Aldas25The Big Prize (IOI17_prize)C++14
0 / 100
1 ms376 KiB
#include "prize.h" #include <bits/stdc++.h> using namespace std; #define FAST_IO ios_base::sync_with_stdio(0); cin.tie(nullptr) #define FOR(i, a, b) for(int i = (a); i <= (b); i++) #define REP(n) FOR(O, 1, (n)) #define pb push_back #define f first #define s second typedef long double ld; typedef long long ll; typedef pair<int, int> pii; typedef pair<int, pii> piii; typedef vector<int> vi; typedef vector<pii> vii; typedef vector<ll> vl; typedef vector<piii> viii; int find_best(int n) { int le = 0, ri = n-1; while (le < ri) { int mid = (le + ri)/2; vi a = ask(mid); if (a[0] + a[1] == 0) return mid; if (a[0] > 0) ri = mid-1; else le = mid+1; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...