Submission #299510

#TimeUsernameProblemLanguageResultExecution timeMemory
299510kevleeThe Big Prize (IOI17_prize)C++17
20 / 100
1 ms384 KiB
#include "prize.h" #include <bits/stdc++.h> using namespace std; #define pb push_back #define mod 1000000007 #define h1 7897897897897897 #define h2 7897466719774591 #define b1 98762051 #define b2 98765431 #define inf 1000000000 #define pi 3.1415926535897932384626 #define LMAX 9223372036854775807 #define ll long long #define fi first #define se second #define pii pair<int, int> #define pll pair<ll, ll> #define vi vector<int> #define vl vector<ll> #define vp vector<pii> #define SET(a, b) memset(a, b, sizeof(a)) #define all(x) (x).begin(), (x).end() #define FOR(i, a, b) for (int i = (a); i <= (b); i++) #define FORD(i, a, b) for (int i = (a); i >= (b); i--) int find_best(int n) { int l = 0, r = n-1, ans = -1; vi res; while (l <= r) { int mid = (l + r) >> 1; res = ask(mid); if (res[0] + res[1] == 0) return mid; if (res[0]) r = mid - 1; else l = mid + 1; } return 0; }

Compilation message (stderr)

prize.cpp: In function 'int find_best(int)':
prize.cpp:27:23: warning: unused variable 'ans' [-Wunused-variable]
   27 |   int l = 0, r = n-1, ans = -1;
      |                       ^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...