제출 #673008

#제출 시각아이디문제언어결과실행 시간메모리
673008ghostwriter커다란 상품 (IOI17_prize)C++17
90 / 100
84 ms336 KiB
#include "prize.h" // #pragma GCC optimize ("Ofast") // #pragma GCC target ("avx2") #include <bits/stdc++.h> using namespace std; #ifdef LOCAL #include <debug.h> #include "grader.cpp" #else #define debug(...) #endif #define ft front #define bk back #define st first #define nd second #define ins insert #define ers erase #define pb push_back #define pf push_front #define _pb pop_back #define _pf pop_front #define lb lower_bound #define ub upper_bound #define mtp make_tuple #define bg begin #define ed end #define all(x) (x).bg(), (x).ed() #define sz(x) (int)(x).size() // #define int long long typedef long long ll; typedef unsigned long long ull; typedef double db; typedef long double ldb; typedef pair<int, int> pi; typedef pair<ll, ll> pll; typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll; typedef string str; #define FOR(i, l, r) for (int i = (l); i <= (r); ++i) #define FOS(i, r, l) for (int i = (r); i >= (l); --i) #define FRN(i, n) for (int i = 0; i < (n); ++i) #define FSN(i, n) for (int i = (n) - 1; i >= 0; --i) #define EACH(i, x) for (auto &i : (x)) #define WHILE while template<typename T> T gcd(T a, T b) { T d2 = (a | b) & -(a | b); a /= d2; b /= d2; WHILE(b) { a = a % b; swap(a, b); } return a * d2; } template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; } void _assert(bool statement) { if (statement) return; cerr << "\n>> Assertion failed!\n"; exit(0); } void _assert(bool statement, const str &message) { if (statement) return; cerr << "\n>> Assertion failed: " << message << '\n'; exit(0); } void _error(const str &message) { cerr << "\n>> Error: " << message << '\n'; exit(0); } #define file "TEST" mt19937 rd(chrono::steady_clock::now().time_since_epoch().count()); ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); } /* ---------------------------------------------------------------- END OF TEMPLATE ---------------------------------------------------------------- Tran The Bao - ghostwriter Training for VOI23 gold medal ---------------------------------------------------------------- GOAT ---------------------------------------------------------------- */ int find_best(int n) { int pos = -1; vi ansp; FRN(i, min(n, 474)) { if (pos == -1) { pos = i; ansp = ask(i); if (ansp[0] + ansp[1] == 0) return i; } else { vi tmp = ask(i); if (tmp[0] + tmp[1] == 0) return i; if (ansp[0] + ansp[1] < tmp[0] + tmp[1]) { pos = i; ansp = tmp; } } } int cnt = 0, pre = pos; WHILE(1) { int l = pre + 1, r = n - 1, ans = -1; WHILE(l <= r) { int mid = l + (r - l) / 2; vi tmp = ask(mid); if (tmp[0] + tmp[1] == 0) return mid; if (tmp[0] + tmp[1] < ansp[0] + ansp[1]) { ans = mid; r = mid - 1; } else if (tmp[0] - ansp[0] > cnt) r = mid - 1; else l = mid + 1; } ++cnt; pre = ans; } return 0; } /* 8 3 2 3 1 3 3 2 3 */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...