oj.uz

Submission #622448

# Submission time Handle Problem Language Result Execution time Memory
622448 2022-08-04T09:41:54 Z IWTIM The Big Prize (IOI17_prize) C++14
90 / 100
 87 ms 336 KB 
#include "prize.h"
# include <bits/stdc++.h>
using namespace std;
using namespace std;
using ll = long long;
using db = long double; // or double, if TL is tight
using str = string; // yay python! 
 
// pairs
using pii = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;
#define mp make_pair
#define f first
#define s second
 
#define tcT template<class T
#define tcTU tcT, class U
// ^ lol this makes everything look weird but I'll try it
tcT> using V = vector<T>; 
tcT, size_t SZ> using AR = array<T,SZ>; 
using vi = V<int>;
using vb = V<bool>;
using vl = V<ll>;
using vd = V<db>;
using vs = V<str>;
using vpi = V<pii>;
using vpl = V<pl>;
using vpd = V<pd>;
 
// vectors
// oops size(x), rbegin(x), rend(x) need C++17
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend() 
#define sor(x) sort(all(x)) 
#define rsz resize
#define ins insert 
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk 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 rep(a) F0R(_,a)
#define each(a,x) for (auto& a: x)
const int MOD = 998244353;
const int MX = 2e5+5;
const ll BIG = 1e18; // not too close to LLONG_MAX
const db PI = acos((db)-1);
const int dx[4]{1,0,-1,0}, dy[4]{0,1,0,-1}; // for every grid problem!!
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 
template<class T> using pqg = priority_queue<T,vector<T>,greater<T>>;
struct DSU {
	vi e; void init(int N) { e = vi(N,-1); }
	int get(int x) { return e[x] < 0 ? x : e[x] = get(e[x]); } 
	bool sameSet(int a, int b) { return get(a) == get(b); }
	int size(int x) { return -e[get(x)]; }
	bool unite(int x, int y) { // union by size
		x = get(x), y = get(y); if (x == y) return 0;
		if (e[x] > e[y]) swap(x,y);
		e[x] += e[y]; e[y] = x; return 1;
	}
};
/*
inline namespace Helpers {
	//////////// is_iterable
	// https://stackoverflow.com/questions/13830158/check-if-a-variable-type-is-iterable
	// this gets used only when we can call begin() and end() on that type
	tcT, class = void> struct is_iterable : false_type {};
	tcT> struct is_iterable<T, void_t<decltype(begin(declval<T>())),
	                                  decltype(end(declval<T>()))
	                                 >
	                       > : true_type {};
	tcT> constexpr bool is_iterable_v = is_iterable<T>::value;
 
	//////////// is_readable
	tcT, class = void> struct is_readable : false_type {};
	tcT> struct is_readable<T,
	        typename std::enable_if_t<
	            is_same_v<decltype(cin >> declval<T&>()), istream&>
	        >
	    > : true_type {};
	tcT> constexpr bool is_readable_v = is_readable<T>::value;
 
	//////////// is_printable
	// // https://nafe.es/posts/2020-02-29-is-printable/
	tcT, class = void> struct is_printable : false_type {};
	tcT> struct is_printable<T,
	        typename std::enable_if_t<
	            is_same_v<decltype(cout << declval<T>()), ostream&>
	        >
	    > : true_type {};
	tcT> constexpr bool is_printable_v = is_printable<T>::value;
}*/
#define pb push_back
int mx;
int diamond(vector <int> ans) {
	return ((ans[0] + ans[1]) == 0);
}
int lollipop(vector <int> ans) {
	return ((ans[0] + ans[1]) == mx);
}
int find_best(int n) {
	vector <int> ans;
	int idx = 0;
	for (int i = 0; i < min(n, 500); i++) {
		ans = ask(i);
		if (diamond(ans)) {
			return i;
		}
		if (ans[0] + ans[1] > mx) {
			mx = max(mx, ans[0] + ans[1]);
			idx = i;
		}
	}
	for (int i = 500; i < n; i++) {
		vector <int> ans = ask(i);
		int pr = ans[0];
		if (diamond(ans)) {
			return i;
		}
		if (!lollipop(ans)) {
			continue;
		}
		int le = i + 1;
		int ri = n;
		int pas = 0;
		while (le <= ri) {
			int mid = (le + ri) / 2;
			ans = ask(mid);
			if (diamond(ans)) return mid;
			if (!lollipop(ans)) {
				pas = mid;
				ri = mid - 1;
				continue;
			}
			if (ans[0] == pr) {
				le = mid + 1;
			} else {
				pas = mid;
				ri = mid - 1;
			}
		}
		i = pas;
	}
}

Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:112:6: warning: variable 'idx' set but not used [-Wunused-but-set-variable]
  112 |  int idx = 0;
      |      ^~~
prize.cpp:111:15: warning: control reaches end of non-void function [-Wreturn-type]
  111 |  vector <int> ans;
      |               ^~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 208 KB Output is correct
2 Correct 5 ms 272 KB Output is correct
3 Correct 6 ms 208 KB Output is correct
4 Correct 6 ms 272 KB Output is correct
5 Correct 7 ms 208 KB Output is correct
6 Correct 1 ms 280 KB Output is correct
7 Correct 5 ms 296 KB Output is correct
8 Correct 6 ms 272 KB Output is correct
9 Correct 5 ms 276 KB Output is correct
10 Correct 7 ms 296 KB Output is correct

Subtask #2
70.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 208 KB Output is correct
2 Correct 4 ms 288 KB Output is correct
3 Correct 7 ms 272 KB Output is correct
4 Correct 3 ms 292 KB Output is correct
5 Correct 3 ms 288 KB Output is correct
6 Correct 1 ms 276 KB Output is correct
7 Correct 8 ms 276 KB Output is correct
8 Correct 8 ms 208 KB Output is correct
9 Correct 3 ms 280 KB Output is correct
10 Correct 7 ms 208 KB Output is correct
11 Correct 9 ms 296 KB Output is correct
12 Correct 5 ms 292 KB Output is correct
13 Correct 5 ms 272 KB Output is correct
14 Correct 4 ms 296 KB Output is correct
15 Correct 20 ms 208 KB Output is correct
16 Partially correct 69 ms 288 KB Partially correct - number of queries: 7423
17 Correct 4 ms 280 KB Output is correct
18 Partially correct 77 ms 208 KB Partially correct - number of queries: 8616
19 Correct 3 ms 300 KB Output is correct
20 Correct 16 ms 296 KB Output is correct
21 Correct 29 ms 272 KB Output is correct
22 Correct 10 ms 292 KB Output is correct
23 Correct 5 ms 208 KB Output is correct
24 Correct 9 ms 208 KB Output is correct
25 Partially correct 47 ms 208 KB Partially correct - number of queries: 5080
26 Partially correct 24 ms 292 KB Partially correct - number of queries: 5019
27 Correct 5 ms 208 KB Output is correct
28 Partially correct 36 ms 336 KB Partially correct - number of queries: 8204
29 Partially correct 52 ms 300 KB Partially correct - number of queries: 6350
30 Partially correct 84 ms 276 KB Partially correct - number of queries: 8564
31 Correct 2 ms 288 KB Output is correct
32 Correct 8 ms 208 KB Output is correct
33 Correct 0 ms 208 KB Output is correct
34 Correct 24 ms 296 KB Output is correct
35 Correct 6 ms 208 KB Output is correct
36 Correct 22 ms 292 KB Output is correct
37 Correct 4 ms 208 KB Output is correct
38 Correct 4 ms 292 KB Output is correct
39 Correct 40 ms 208 KB Output is correct
40 Partially correct 55 ms 292 KB Partially correct - number of queries: 7388
41 Partially correct 46 ms 292 KB Partially correct - number of queries: 5354
42 Partially correct 59 ms 208 KB Partially correct - number of queries: 5354
43 Correct 39 ms 208 KB Output is correct
44 Correct 27 ms 208 KB Output is correct
45 Correct 33 ms 208 KB Output is correct
46 Correct 4 ms 208 KB Output is correct
47 Correct 38 ms 292 KB Output is correct
48 Partially correct 63 ms 208 KB Partially correct - number of queries: 6510
49 Correct 11 ms 208 KB Output is correct
50 Partially correct 34 ms 276 KB Partially correct - number of queries: 8616
51 Correct 22 ms 296 KB Output is correct
52 Correct 6 ms 300 KB Output is correct
53 Correct 3 ms 276 KB Output is correct
54 Correct 40 ms 208 KB Output is correct
55 Correct 6 ms 208 KB Output is correct
56 Partially correct 87 ms 276 KB Partially correct - number of queries: 8620
57 Partially correct 47 ms 208 KB Partially correct - number of queries: 6438
58 Partially correct 45 ms 208 KB Partially correct - number of queries: 6537
59 Partially correct 37 ms 208 KB Partially correct - number of queries: 5354
60 Partially correct 46 ms 208 KB Partially correct - number of queries: 5012
61 Correct 6 ms 300 KB Output is correct
62 Correct 3 ms 208 KB Output is correct
63 Correct 5 ms 208 KB Output is correct
64 Correct 6 ms 220 KB Output is correct
65 Correct 4 ms 208 KB Output is correct
66 Correct 8 ms 208 KB Output is correct
67 Correct 6 ms 292 KB Output is correct
68 Correct 4 ms 208 KB Output is correct
69 Correct 4 ms 296 KB Output is correct
70 Correct 4 ms 292 KB Output is correct
71 Partially correct 73 ms 208 KB Partially correct - number of queries: 8773
72 Correct 10 ms 208 KB Output is correct
73 Partially correct 83 ms 208 KB Partially correct - number of queries: 8647
74 Partially correct 74 ms 208 KB Partially correct - number of queries: 8695
75 Correct 6 ms 208 KB Output is correct
76 Partially correct 35 ms 208 KB Partially correct - number of queries: 7560
77 Partially correct 69 ms 292 KB Partially correct - number of queries: 8632
78 Correct 17 ms 296 KB Output is correct
79 Correct 43 ms 296 KB Output is correct
80 Partially correct 49 ms 208 KB Partially correct - number of queries: 8653
81 Partially correct 66 ms 208 KB Partially correct - number of queries: 8630
82 Partially correct 67 ms 208 KB Partially correct - number of queries: 8550
83 Correct 6 ms 208 KB Output is correct
84 Partially correct 62 ms 208 KB Partially correct - number of queries: 7114
85 Partially correct 84 ms 208 KB Partially correct - number of queries: 8618
86 Correct 5 ms 296 KB Output is correct
87 Correct 5 ms 208 KB Output is correct
88 Correct 6 ms 208 KB Output is correct
89 Correct 5 ms 208 KB Output is correct
90 Correct 5 ms 208 KB Output is correct
91 Correct 8 ms 208 KB Output is correct
92 Correct 6 ms 208 KB Output is correct
93 Correct 9 ms 208 KB Output is correct
94 Correct 10 ms 208 KB Output is correct
95 Correct 9 ms 208 KB Output is correct
96 Correct 8 ms 208 KB Output is correct
97 Correct 5 ms 208 KB Output is correct