oj.uz

Submission #135980

# Submission time Handle Problem Language Result Execution time Memory
135980 2019-07-24T14:59:19 Z JustasZ The Big Prize (IOI17_prize) C++14
20 / 100
 94 ms 504 KB 
#include "prize.h"
#include <bits/stdc++.h>
#define pb push_back
#define all(a) a.begin(), a.end()
#define sz(a) (int)a.size()
#define x first
#define y second
#define debug(...) cout << "[" << #__VA_ARGS__ << ": " << __VA_ARGS__ << "]\n"
#define rd() abs((int)rng())
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int>pii;
const int maxn = 2e5 + 100;
const int mod = 1e9 + 7;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
/*vector<int> ask(int i)
{
	cout << "? " << i << endl;
	vector<int>a(2);
	cin >> a[0] >> a[1];
	return a;
}*/
int find_best(int n)
{
	vector<int>a;
	if(n < 5000)
	{
		for(int i = 0; i < n; i++)
		{
			a = ask(i);
			if(a[0] == 0 && a[1] == 0)
				return i;
		}
	}

	int mx = 0;
	for(int it = 0; it < 10; it++)
	{
		int p = rd() % n;
		a = ask(p);
		mx = max(mx, a[0] + a[1]);
	}

	int i = 0;
	while(i < n)
	{
		a = ask(i);
		if(a[0] + a[1] == 0)
			return i;
		if(a[0] + a[1] == mx)
		{
			int fi = a[0], se = a[1];
			int l = i + 1, r = n - 1;
			while(l < r)
			{
				int mid = (l + r) / 2;
				a = ask(mid);
				if(a[0] + a[1] != mx)
					r = mid;
				else
				{
					if(a[0] > fi)
						r = mid;
					else
						l = mid + 1;
				}
			}
			a = ask(l);
			if(a[0] + a[1] == 0)
				return l;
			i = l;
		}
		i++;
	}
}

Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:53:19: warning: unused variable 'se' [-Wunused-variable]
    int fi = a[0], se = a[1];
                   ^~
prize.cpp:76:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 312 KB Output is correct
2 Correct 2 ms 392 KB Output is correct
3 Correct 2 ms 312 KB Output is correct
4 Correct 2 ms 400 KB Output is correct
5 Correct 2 ms 308 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 248 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 248 KB Output is correct
10 Correct 3 ms 376 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 400 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 248 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 252 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 248 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 6 ms 312 KB Output is correct
12 Correct 2 ms 312 KB Output is correct
13 Correct 8 ms 252 KB Output is correct
14 Correct 5 ms 248 KB Output is correct
15 Correct 16 ms 248 KB Output is correct
16 Partially correct 73 ms 248 KB Partially correct - number of queries: 7343
17 Correct 2 ms 248 KB Output is correct
18 Partially correct 74 ms 376 KB Partially correct - number of queries: 8621
19 Correct 2 ms 376 KB Output is correct
20 Correct 13 ms 376 KB Output is correct
21 Correct 43 ms 376 KB Output is correct
22 Correct 10 ms 376 KB Output is correct
23 Correct 2 ms 504 KB Output is correct
24 Correct 2 ms 312 KB Output is correct
25 Correct 26 ms 312 KB Output is correct
26 Correct 25 ms 380 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Partially correct 84 ms 248 KB Partially correct - number of queries: 8187
29 Partially correct 61 ms 248 KB Partially correct - number of queries: 6203
30 Partially correct 94 ms 248 KB Partially correct - number of queries: 8570
31 Correct 2 ms 504 KB Output is correct
32 Correct 6 ms 248 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 30 ms 376 KB Output is correct
35 Correct 3 ms 376 KB Output is correct
36 Correct 23 ms 376 KB Output is correct
37 Correct 4 ms 248 KB Output is correct
38 Correct 2 ms 252 KB Output is correct
39 Correct 42 ms 248 KB Output is correct
40 Partially correct 51 ms 308 KB Partially correct - number of queries: 7326
41 Partially correct 52 ms 392 KB Partially correct - number of queries: 5164
42 Partially correct 47 ms 248 KB Partially correct - number of queries: 5164
43 Correct 49 ms 248 KB Output is correct
44 Correct 34 ms 376 KB Output is correct
45 Correct 23 ms 252 KB Output is correct
46 Correct 2 ms 400 KB Output is correct
47 Correct 43 ms 248 KB Output is correct
48 Partially correct 39 ms 376 KB Partially correct - number of queries: 6378
49 Correct 9 ms 392 KB Output is correct
50 Partially correct 48 ms 392 KB Partially correct - number of queries: 8618
51 Correct 37 ms 376 KB Output is correct
52 Correct 2 ms 376 KB Output is correct
53 Correct 3 ms 504 KB Output is correct
54 Correct 38 ms 248 KB Output is correct
55 Correct 2 ms 276 KB Output is correct
56 Partially correct 83 ms 392 KB Partially correct - number of queries: 8631
57 Partially correct 32 ms 396 KB Partially correct - number of queries: 6298
58 Partially correct 47 ms 392 KB Partially correct - number of queries: 6383
59 Partially correct 47 ms 376 KB Partially correct - number of queries: 5164
60 Correct 33 ms 396 KB Output is correct
61 Correct 3 ms 424 KB Output is correct
62 Correct 2 ms 248 KB Output is correct
63 Correct 3 ms 396 KB Output is correct
64 Correct 2 ms 316 KB Output is correct
65 Correct 2 ms 376 KB Output is correct
66 Correct 8 ms 376 KB Output is correct
67 Correct 2 ms 248 KB Output is correct
68 Correct 4 ms 316 KB Output is correct
69 Correct 6 ms 248 KB Output is correct
70 Correct 2 ms 312 KB Output is correct
71 Partially correct 79 ms 248 KB Partially correct - number of queries: 8827
72 Correct 10 ms 376 KB Output is correct
73 Partially correct 85 ms 376 KB Partially correct - number of queries: 8699
74 Partially correct 88 ms 376 KB Partially correct - number of queries: 8760
75 Correct 4 ms 248 KB Output is correct
76 Partially correct 78 ms 248 KB Partially correct - number of queries: 7483
77 Partially correct 58 ms 248 KB Partially correct - number of queries: 8678
78 Correct 5 ms 376 KB Output is correct
79 Correct 21 ms 504 KB Output is correct
80 Partially correct 59 ms 248 KB Partially correct - number of queries: 8682
81 Partially correct 92 ms 248 KB Partially correct - number of queries: 8698
82 Partially correct 88 ms 248 KB Partially correct - number of queries: 8616
83 Correct 4 ms 248 KB Output is correct
84 Partially correct 78 ms 376 KB Partially correct - number of queries: 7080
85 Partially correct 85 ms 248 KB Partially correct - number of queries: 8705
86 Incorrect 85 ms 392 KB Incorrect
87 Halted 0 ms 0 KB -