oj.uz

Submission #253149

# Submission time Handle Problem Language Result Execution time Memory
253149 2020-07-27T02:11:22 Z rqi The Big Prize (IOI17_prize) C++14
100 / 100
 59 ms 384 KB 
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef double db; 
typedef string str; 
 
typedef pair<int,int> pi;
typedef pair<ll,ll> pl; 
typedef pair<db,db> pd; 
 
typedef vector<int> vi; 
typedef vector<ll> vl; 
typedef vector<db> vd; 
typedef vector<str> vs; 
typedef vector<pi> vpi;
typedef vector<pl> vpl; 
typedef vector<pd> vpd; 
 
#define mp make_pair
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend() 
#define rsz resize
#define ins insert 
#define ft front() 
#define bk back()
#define pf push_front 
#define pb push_back
#define eb emplace_back 
#define lb lower_bound 
#define ub upper_bound 
 
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)
 
const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5; 
const ll INF = 1e18; 
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; 
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 
 
template<class T> bool ckmin(T& a, const T& b) { 
	return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { 
	return a < b ? a = b, 1 : 0; } 
int pct(int x) { return __builtin_popcount(x); } 
int bits(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) 
int cdiv(int a, int b) { return a/b+!(a<0||a%b == 0); } // division of a by b rounded up, assumes b > 0 
int fstTrue(function<bool(int)> f, int lo, int hi) {
	hi ++; assert(lo <= hi); // assuming f is increasing
	while (lo < hi) { // find first index such that f is true 
		int mid = (lo+hi)/2; 
		f(mid) ? hi = mid : lo = mid+1; 
	} 
	return lo;
}
 
// INPUT
template<class A> void re(complex<A>& c);
template<class A, class B> void re(pair<A,B>& p);
template<class A> void re(vector<A>& v);
template<class A, size_t SZ> void re(array<A,SZ>& a);
 
template<class T> void re(T& x) { cin >> x; }
void re(db& d) { str t; re(t); d = stod(t); }
void re(ld& d) { str t; re(t); d = stold(t); }
template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); }
 
template<class A> void re(complex<A>& c) { A a,b; re(a,b); c = {a,b}; }
template<class A, class B> void re(pair<A,B>& p) { re(p.f,p.s); }
template<class A> void re(vector<A>& x) { trav(a,x) re(a); }
template<class A, size_t SZ> void re(array<A,SZ>& x) { trav(a,x) re(a); }
 
// TO_STRING
#define ts to_string
str ts(char c) { return str(1,c); }
str ts(bool b) { return b ? "true" : "false"; }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
template<class A> str ts(complex<A> c) { 
	stringstream ss; ss << c; return ss.str(); }
str ts(vector<bool> v) { 
	str res = "{"; F0R(i,sz(v)) res += char('0'+v[i]);
	res += "}"; return res; }
template<size_t SZ> str ts(bitset<SZ> b) {
	str res = ""; F0R(i,SZ) res += char('0'+b[i]);
	return res; }
template<class A, class B> str ts(pair<A,B> p);
template<class T> str ts(T v) { // containers with begin(), end()
	bool fst = 1; str res = "{";
	for (const auto& x: v) {
		if (!fst) res += ", ";
		fst = 0; res += ts(x);
	}
	res += "}"; return res;
}
template<class A, class B> str ts(pair<A,B> p) {
	return "("+ts(p.f)+", "+ts(p.s)+")"; }
 
// OUTPUT
template<class A> void pr(A x) { cout << ts(x); }
template<class H, class... T> void pr(const H& h, const T&... t) { 
	pr(h); pr(t...); }
void ps() { pr("\n"); } // print w/ spaces
template<class H, class... T> void ps(const H& h, const T&... t) { 
	pr(h); if (sizeof...(t)) pr(" "); ps(t...); }
 
// DEBUG
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
	cerr << ts(h); if (sizeof...(t)) cerr << ", ";
	DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL
#define dbg(...) cerr << "LINE(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif
 
// FILE I/O
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { ios_base::sync_with_stdio(0); cin.tie(0); }
void setIO(string s = "") {
	unsyncIO();
	// cin.exceptions(cin.failbit); 
	// throws exception when do smth illegal
	// ex. try to read letter into int
	if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}
 
int maxval;
int ans = -1;
int Q;
 
pi query(int ind){
	Q++;
	//assert(Q <= 9995);
	vi a = ask(ind);

	if(a[0]+a[1] > maxval){
		ans = -2;
		ckmax(maxval, a[0]+a[1]);
	}
	return mp(a[0], a[1]);
}
 
void search(int L, int R, int numL, int numR){
	if(ans != -1) return;
	if(L > R) return;
 
	int M = (L+R)/2;
	pi a = query(M);
	pi oa = a;
 
	while(M <= R){
		if(a.f == 0 && a.s == 0){
			ans = M;
			return;
		}
		else if(a.f+a.s == maxval){
			if(a.s != numR){
				search(M+1, R, a.f, numR);
			}
			if(ans != -1) return;	
			break;
		}
		M++;
		if(M <= R){
			a = query(M);
			//assert(a.f+a.s <= maxval);
		}
	}
 
	M = (L+R)/2;
	a = oa;
	if(ans != -1) return;
 
	while(M >= L){
		if(a.f == 0 && a.s == 0){
			ans = M;
			return;
		}
		else if(a.f+a.s == maxval){
			if(a.f != numL){
				search(L, M-1, numL, a.s);
			}
			if(ans != -1) return;
			break;
		}
		M--;
		if(M >= L){
			a = query(M);
			//assert(a.f+a.s <= maxval);
		}
	}
}
 
int find_best(int n) {
	while(true){
		ans = -1;
		int ITER = 0;
		while(ITER < 10){
			pi a = query(rng() % n);
			ckmax(maxval, a.f+a.s);
			ITER++;
		}
		search(0, n-1, 0, 0);
		if(ans != -2) return ans;
	}
	
}

Compilation message

prize.cpp: In function 'void setIn(std::__cxx11::string)':
prize.cpp:129:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setIn(string s) { freopen(s.c_str(),"r",stdin); }
                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
prize.cpp: In function 'void setOut(std::__cxx11::string)':
prize.cpp:130:32: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setOut(string s) { freopen(s.c_str(),"w",stdout); }
                         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct

Subtask #2
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 7 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 10 ms 256 KB Output is correct
15 Correct 32 ms 256 KB Output is correct
16 Correct 8 ms 384 KB Output is correct
17 Correct 59 ms 256 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 34 ms 256 KB Output is correct
20 Correct 16 ms 256 KB Output is correct
21 Correct 24 ms 360 KB Output is correct
22 Correct 19 ms 256 KB Output is correct
23 Correct 1 ms 256 KB Output is correct
24 Correct 5 ms 364 KB Output is correct
25 Correct 14 ms 256 KB Output is correct
26 Correct 17 ms 256 KB Output is correct
27 Correct 1 ms 256 KB Output is correct
28 Correct 1 ms 376 KB Output is correct
29 Correct 4 ms 256 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 57 ms 256 KB Output is correct
32 Correct 3 ms 256 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 22 ms 256 KB Output is correct
35 Correct 1 ms 376 KB Output is correct
36 Correct 47 ms 256 KB Output is correct
37 Correct 4 ms 256 KB Output is correct
38 Correct 2 ms 256 KB Output is correct
39 Correct 21 ms 288 KB Output is correct
40 Correct 1 ms 360 KB Output is correct
41 Correct 18 ms 256 KB Output is correct
42 Correct 18 ms 256 KB Output is correct
43 Correct 16 ms 256 KB Output is correct
44 Correct 25 ms 256 KB Output is correct
45 Correct 18 ms 256 KB Output is correct
46 Correct 32 ms 256 KB Output is correct
47 Correct 22 ms 288 KB Output is correct
48 Correct 12 ms 256 KB Output is correct
49 Correct 36 ms 256 KB Output is correct
50 Correct 1 ms 256 KB Output is correct
51 Correct 39 ms 256 KB Output is correct
52 Correct 33 ms 256 KB Output is correct
53 Correct 1 ms 256 KB Output is correct
54 Correct 35 ms 256 KB Output is correct
55 Correct 24 ms 384 KB Output is correct
56 Correct 1 ms 256 KB Output is correct
57 Correct 10 ms 256 KB Output is correct
58 Correct 12 ms 256 KB Output is correct
59 Correct 17 ms 256 KB Output is correct
60 Correct 28 ms 256 KB Output is correct
61 Correct 1 ms 256 KB Output is correct
62 Correct 2 ms 256 KB Output is correct
63 Correct 1 ms 256 KB Output is correct
64 Correct 1 ms 256 KB Output is correct
65 Correct 1 ms 256 KB Output is correct
66 Correct 4 ms 256 KB Output is correct
67 Correct 4 ms 256 KB Output is correct
68 Correct 1 ms 256 KB Output is correct
69 Correct 4 ms 384 KB Output is correct
70 Correct 4 ms 256 KB Output is correct
71 Correct 42 ms 256 KB Output is correct
72 Correct 7 ms 256 KB Output is correct
73 Correct 45 ms 256 KB Output is correct
74 Correct 33 ms 256 KB Output is correct
75 Correct 3 ms 256 KB Output is correct
76 Correct 38 ms 256 KB Output is correct
77 Correct 54 ms 256 KB Output is correct
78 Correct 7 ms 256 KB Output is correct
79 Correct 21 ms 256 KB Output is correct
80 Correct 33 ms 256 KB Output is correct
81 Correct 54 ms 256 KB Output is correct
82 Correct 34 ms 256 KB Output is correct
83 Correct 2 ms 256 KB Output is correct
84 Correct 19 ms 384 KB Output is correct
85 Correct 37 ms 256 KB Output is correct
86 Correct 8 ms 256 KB Output is correct
87 Correct 3 ms 256 KB Output is correct
88 Correct 6 ms 256 KB Output is correct
89 Correct 13 ms 256 KB Output is correct
90 Correct 1 ms 256 KB Output is correct
91 Correct 6 ms 256 KB Output is correct
92 Correct 2 ms 256 KB Output is correct
93 Correct 2 ms 320 KB Output is correct
94 Correct 4 ms 256 KB Output is correct
95 Correct 5 ms 256 KB Output is correct
96 Correct 3 ms 256 KB Output is correct
97 Correct 1 ms 256 KB Output is correct