Submission #1036240

#TimeUsernameProblemLanguageResultExecution timeMemory
1036240Alihan_8The Big Prize (IOI17_prize)C++17
0 / 100
67 ms5596 KiB
#include "prize.h" #include <bits/stdc++.h> using namespace std; #define all(x) x.begin(), x.end() #define ar array #define pb push_back #define ln '\n' //#define int long long using i64 = long long; template <class F, class _S> bool chmin(F &u, const _S &v){ bool flag = false; if ( u > v ){ u = v; flag |= true; } return flag; } template <class F, class _S> bool chmax(F &u, const _S &v){ bool flag = false; if ( u < v ){ u = v; flag |= true; } return flag; } int find_best(int n){ vector <vector<int>> dp(n); auto f = [&](int j){ if ( dp[j].empty() ){ dp[j] = ask(j); } return dp[j]; }; int ans = -1; map <int,int> us; for ( int i = n - 1; i >= 0; i-- ){ auto c = f(i); int s = c[0] + c[1]; if ( us.count(s) ) continue; if ( c[0] + c[1] == 0 ){ ans = i; } us[s] = true; int l = 0, r = i; while ( l < r ){ int m = (l + r) / 2; if ( f(m) != c ){ l = m + 1; } else r = m; } i = l; } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...