답안 #50174

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
50174 2018-06-08T06:52:32 Z Mamnoon_Siam 커다란 상품 (IOI17_prize) C++17
90 / 100
104 ms 5572 KB
//#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#include "prize.h"
#include <bits/stdc++.h>
using namespace std;

#define debug(s) cout<< #s <<" = "<< s <<endl
#define all(v) (v).begin(), (v).end()
#define KeepUnique(v) (v).erase( unique(all(v)), v.end() )
#define MEMSET(a,val) memset(a, val, sizeof a)
#define PB push_back
#define endl '\n'

inline int myrand(int l, int r) {
	int ret = rand(); ret <<= 15; ret ^= rand();
	if(ret < 0) ret = -ret; ret %= (r-l+1); ret += l;
	return ret;
}
template <typename F, typename S>
ostream& operator << (ostream& os, const pair< F, S>& p) {
    return os<<"(" <<p.first<<", "<<p.second<<")";
}

const int maxn = 200010;

vector<int> memo[maxn];

int Left(int i) {
	if(memo[i].empty()) memo[i] = ask(i);
	return memo[i][0];
}
int Right(int i) {
	if(memo[i].empty()) memo[i] = ask(i);
	return memo[i][1];
}
int Total(int i) {
	if(memo[i].empty()) memo[i] = ask(i);
	return memo[i][0] + memo[i][1];
}

int find_best(int n) { int debug = 0;
	if(!debug) if(n <= 5000) { // fix
		for(int i = 0; i < n; i++) {
			if(Total(i) == 0) {
				return i;
			}
		}
	}
	int mx_tot = 0;
	for(int i = 0; i < (debug ? 1 : 473); i++) { // fix
		mx_tot = max(mx_tot, Total(i));
	}
	int now = 0;
	while(true) {
		int ret;
		if(Total(now) < mx_tot) {
			ret = now;
		} else {
			int lo = now, hi = n - 1;
			while(lo <= hi) {
				int mid = lo + hi >> 1;
				bool IsGold = ((Total(mid) < mx_tot) or (Left(mid) - Left(now) > 0));
				if(IsGold) {
					ret = mid;
					hi = mid - 1;
				} else {
					lo = mid + 1;
				}
			}
		}
		if(Total(ret) == 0) return ret;
		now = ret + 1;
	} assert(false);
}

Compilation message

prize.cpp: In function 'int myrand(int, int)':
prize.cpp:17:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  if(ret < 0) ret = -ret; ret %= (r-l+1); ret += l;
  ^~
prize.cpp:17:26: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  if(ret < 0) ret = -ret; ret %= (r-l+1); ret += l;
                          ^~~
prize.cpp: In function 'int find_best(int)':
prize.cpp:62:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
     int mid = lo + hi >> 1;
               ~~~^~~~
prize.cpp:72:11: warning: 'ret' may be used uninitialized in this function [-Wmaybe-uninitialized]
   if(Total(ret) == 0) return ret;
      ~~~~~^~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 4984 KB Output is correct
2 Correct 9 ms 5048 KB Output is correct
3 Correct 12 ms 5104 KB Output is correct
4 Correct 12 ms 5104 KB Output is correct
5 Correct 10 ms 5104 KB Output is correct
6 Correct 8 ms 5156 KB Output is correct
7 Correct 9 ms 5156 KB Output is correct
8 Correct 14 ms 5156 KB Output is correct
9 Correct 8 ms 5232 KB Output is correct
10 Correct 10 ms 5232 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 5232 KB Output is correct
2 Correct 9 ms 5232 KB Output is correct
3 Correct 11 ms 5232 KB Output is correct
4 Correct 11 ms 5232 KB Output is correct
5 Correct 8 ms 5232 KB Output is correct
6 Correct 12 ms 5232 KB Output is correct
7 Correct 7 ms 5268 KB Output is correct
8 Correct 10 ms 5268 KB Output is correct
9 Correct 10 ms 5268 KB Output is correct
10 Correct 12 ms 5268 KB Output is correct
11 Correct 14 ms 5268 KB Output is correct
12 Correct 10 ms 5268 KB Output is correct
13 Correct 15 ms 5268 KB Output is correct
14 Correct 10 ms 5268 KB Output is correct
15 Correct 20 ms 5268 KB Output is correct
16 Partially correct 59 ms 5416 KB Partially correct - number of queries: 7192
17 Correct 12 ms 5416 KB Output is correct
18 Partially correct 96 ms 5564 KB Partially correct - number of queries: 8352
19 Correct 10 ms 5564 KB Output is correct
20 Correct 24 ms 5564 KB Output is correct
21 Correct 32 ms 5564 KB Output is correct
22 Correct 14 ms 5564 KB Output is correct
23 Correct 14 ms 5564 KB Output is correct
24 Correct 8 ms 5564 KB Output is correct
25 Correct 43 ms 5564 KB Output is correct
26 Correct 46 ms 5564 KB Output is correct
27 Correct 12 ms 5564 KB Output is correct
28 Partially correct 78 ms 5564 KB Partially correct - number of queries: 7876
29 Partially correct 48 ms 5564 KB Partially correct - number of queries: 6116
30 Partially correct 71 ms 5564 KB Partially correct - number of queries: 8281
31 Correct 10 ms 5564 KB Output is correct
32 Correct 13 ms 5564 KB Output is correct
33 Correct 5 ms 5564 KB Output is correct
34 Correct 29 ms 5564 KB Output is correct
35 Correct 12 ms 5564 KB Output is correct
36 Correct 24 ms 5564 KB Output is correct
37 Correct 13 ms 5564 KB Output is correct
38 Correct 9 ms 5564 KB Output is correct
39 Correct 20 ms 5564 KB Output is correct
40 Partially correct 77 ms 5564 KB Partially correct - number of queries: 7157
41 Partially correct 58 ms 5564 KB Partially correct - number of queries: 5212
42 Partially correct 58 ms 5564 KB Partially correct - number of queries: 5212
43 Correct 36 ms 5564 KB Output is correct
44 Correct 47 ms 5572 KB Output is correct
45 Correct 34 ms 5572 KB Output is correct
46 Correct 13 ms 5572 KB Output is correct
47 Correct 46 ms 5572 KB Output is correct
48 Partially correct 56 ms 5572 KB Partially correct - number of queries: 6308
49 Correct 9 ms 5572 KB Output is correct
50 Partially correct 67 ms 5572 KB Partially correct - number of queries: 8353
51 Correct 42 ms 5572 KB Output is correct
52 Correct 10 ms 5572 KB Output is correct
53 Correct 11 ms 5572 KB Output is correct
54 Correct 30 ms 5572 KB Output is correct
55 Correct 9 ms 5572 KB Output is correct
56 Partially correct 76 ms 5572 KB Partially correct - number of queries: 8348
57 Partially correct 54 ms 5572 KB Partially correct - number of queries: 6212
58 Partially correct 48 ms 5572 KB Partially correct - number of queries: 6294
59 Partially correct 47 ms 5572 KB Partially correct - number of queries: 5209
60 Correct 40 ms 5572 KB Output is correct
61 Correct 11 ms 5572 KB Output is correct
62 Correct 9 ms 5572 KB Output is correct
63 Correct 12 ms 5572 KB Output is correct
64 Correct 9 ms 5572 KB Output is correct
65 Correct 11 ms 5572 KB Output is correct
66 Correct 13 ms 5572 KB Output is correct
67 Correct 9 ms 5572 KB Output is correct
68 Correct 8 ms 5572 KB Output is correct
69 Correct 11 ms 5572 KB Output is correct
70 Correct 10 ms 5572 KB Output is correct
71 Partially correct 81 ms 5572 KB Partially correct - number of queries: 8243
72 Correct 14 ms 5572 KB Output is correct
73 Partially correct 69 ms 5572 KB Partially correct - number of queries: 8132
74 Partially correct 62 ms 5572 KB Partially correct - number of queries: 8192
75 Correct 10 ms 5572 KB Output is correct
76 Partially correct 57 ms 5572 KB Partially correct - number of queries: 7089
77 Partially correct 80 ms 5572 KB Partially correct - number of queries: 8404
78 Correct 14 ms 5572 KB Output is correct
79 Correct 45 ms 5572 KB Output is correct
80 Partially correct 81 ms 5572 KB Partially correct - number of queries: 8417
81 Partially correct 104 ms 5572 KB Partially correct - number of queries: 8377
82 Partially correct 77 ms 5572 KB Partially correct - number of queries: 8308
83 Correct 12 ms 5572 KB Output is correct
84 Partially correct 63 ms 5572 KB Partially correct - number of queries: 6925
85 Partially correct 85 ms 5572 KB Partially correct - number of queries: 8360
86 Correct 12 ms 5572 KB Output is correct
87 Correct 11 ms 5572 KB Output is correct
88 Correct 10 ms 5572 KB Output is correct
89 Correct 10 ms 5572 KB Output is correct
90 Correct 10 ms 5572 KB Output is correct
91 Correct 9 ms 5572 KB Output is correct
92 Correct 9 ms 5572 KB Output is correct
93 Correct 11 ms 5572 KB Output is correct
94 Correct 10 ms 5572 KB Output is correct
95 Correct 11 ms 5572 KB Output is correct
96 Correct 8 ms 5572 KB Output is correct
97 Correct 9 ms 5572 KB Output is correct