oj.uz

답안 #50151

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
50151 2018-06-08T01:16:33 Z Mamnoon_Siam 커다란 상품 (IOI17_prize) C++17
20 / 100
 84 ms 10188 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(i < 0) return 0;
	if(memo[i].empty()) memo[i] = ask(i);
	return memo[i][0];
}
int Right(int i) {
	if(i < 0) return 0;
	if(memo[i].empty()) memo[i] = ask(i);
	return memo[i][1];
}
int Total(int i) {
	if(i < 0) return 0;
	if(memo[i].empty()) memo[i] = ask(i);
	return memo[i][0] + memo[i][1];
}

int find_best(int n) {
	if(n <= 5000) { // fix
		for(int i = 0; i < n; i++) {
			if(Total(i) == 0) {
				return i;
			}
		}
	}
	int mx_tot = 0, id = -1;
	for(int i = 0; i < 460; i++) { // fix
		mx_tot = max(mx_tot, Total(i));
	}

	int now = 0;
	int cnt = 0;
	while(now < n) {
		while(Total(now) < mx_tot and now < n) {
			if(Total(now) == 0) return now;
			now++;
			cnt++;
			assert(cnt < 2000000);
		}
		int lo = now, hi = n - 1;
		int ret = -1;
		while(lo <= hi) {
			int mid = lo + hi >> 1;
			bool full = ((Left(mid) - Left(now) == 0) and (Total(mid) == mx_tot));
			if(!full) {
				hi = mid - 1;
			} else {
				lo = mid + 1;
				ret = mid;
			}
		}
		now = ret + 1;
		cnt++;
		assert(cnt < 2000000);
	}
	return 0;
}

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:70:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
    int mid = lo + hi >> 1;
              ~~~^~~~
prize.cpp:53:18: warning: unused variable 'id' [-Wunused-variable]
  int mx_tot = 0, id = -1;
                  ^~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 4984 KB Output is correct
2 Correct 10 ms 5044 KB Output is correct
3 Correct 8 ms 5044 KB Output is correct
4 Correct 7 ms 5168 KB Output is correct
5 Correct 9 ms 5168 KB Output is correct
6 Correct 11 ms 5168 KB Output is correct
7 Correct 11 ms 5168 KB Output is correct
8 Correct 11 ms 5236 KB Output is correct
9 Correct 11 ms 5236 KB Output is correct
10 Correct 11 ms 5236 KB Output is correct

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 5264 KB Output is correct
2 Correct 11 ms 5264 KB Output is correct
3 Correct 10 ms 5264 KB Output is correct
4 Correct 12 ms 5264 KB Output is correct
5 Correct 9 ms 5264 KB Output is correct
6 Correct 12 ms 5264 KB Output is correct
7 Correct 9 ms 5264 KB Output is correct
8 Correct 8 ms 5264 KB Output is correct
9 Correct 8 ms 5264 KB Output is correct
10 Correct 9 ms 5264 KB Output is correct
11 Correct 9 ms 5264 KB Output is correct
12 Correct 9 ms 5264 KB Output is correct
13 Correct 13 ms 5292 KB Output is correct
14 Correct 12 ms 5292 KB Output is correct
15 Correct 17 ms 5292 KB Output is correct
16 Partially correct 59 ms 5556 KB Partially correct - number of queries: 7179
17 Correct 10 ms 5556 KB Output is correct
18 Partially correct 83 ms 5556 KB Partially correct - number of queries: 8339
19 Correct 11 ms 5556 KB Output is correct
20 Correct 23 ms 5556 KB Output is correct
21 Correct 42 ms 5556 KB Output is correct
22 Correct 14 ms 5556 KB Output is correct
23 Correct 12 ms 5556 KB Output is correct
24 Correct 9 ms 5556 KB Output is correct
25 Correct 51 ms 5556 KB Output is correct
26 Correct 38 ms 5556 KB Output is correct
27 Correct 12 ms 5556 KB Output is correct
28 Partially correct 69 ms 5556 KB Partially correct - number of queries: 7864
29 Partially correct 52 ms 5556 KB Partially correct - number of queries: 6103
30 Partially correct 73 ms 5556 KB Partially correct - number of queries: 8268
31 Correct 10 ms 5556 KB Output is correct
32 Correct 11 ms 5556 KB Output is correct
33 Correct 6 ms 5556 KB Output is correct
34 Correct 39 ms 5556 KB Output is correct
35 Correct 14 ms 5556 KB Output is correct
36 Correct 28 ms 5556 KB Output is correct
37 Correct 12 ms 5556 KB Output is correct
38 Correct 10 ms 5556 KB Output is correct
39 Correct 37 ms 5556 KB Output is correct
40 Partially correct 68 ms 5556 KB Partially correct - number of queries: 7144
41 Partially correct 49 ms 5556 KB Partially correct - number of queries: 5199
42 Partially correct 49 ms 5556 KB Partially correct - number of queries: 5199
43 Correct 42 ms 5556 KB Output is correct
44 Correct 39 ms 5556 KB Output is correct
45 Correct 35 ms 5556 KB Output is correct
46 Correct 10 ms 5556 KB Output is correct
47 Correct 40 ms 5556 KB Output is correct
48 Partially correct 58 ms 5556 KB Partially correct - number of queries: 6295
49 Correct 12 ms 5556 KB Output is correct
50 Partially correct 67 ms 5556 KB Partially correct - number of queries: 8340
51 Correct 44 ms 5556 KB Output is correct
52 Correct 13 ms 5556 KB Output is correct
53 Correct 11 ms 5556 KB Output is correct
54 Correct 35 ms 5556 KB Output is correct
55 Correct 10 ms 5556 KB Output is correct
56 Partially correct 79 ms 5580 KB Partially correct - number of queries: 8335
57 Partially correct 71 ms 5580 KB Partially correct - number of queries: 6199
58 Partially correct 54 ms 5580 KB Partially correct - number of queries: 6281
59 Partially correct 78 ms 5580 KB Partially correct - number of queries: 5196
60 Correct 49 ms 5580 KB Output is correct
61 Correct 9 ms 5580 KB Output is correct
62 Correct 11 ms 5580 KB Output is correct
63 Correct 9 ms 5580 KB Output is correct
64 Correct 12 ms 5580 KB Output is correct
65 Correct 10 ms 5580 KB Output is correct
66 Correct 17 ms 5580 KB Output is correct
67 Correct 10 ms 5580 KB Output is correct
68 Correct 9 ms 5580 KB Output is correct
69 Correct 12 ms 5580 KB Output is correct
70 Correct 9 ms 5580 KB Output is correct
71 Partially correct 65 ms 5608 KB Partially correct - number of queries: 8230
72 Correct 14 ms 5608 KB Output is correct
73 Partially correct 55 ms 5624 KB Partially correct - number of queries: 8119
74 Partially correct 66 ms 5624 KB Partially correct - number of queries: 8179
75 Correct 9 ms 5624 KB Output is correct
76 Partially correct 58 ms 5624 KB Partially correct - number of queries: 7076
77 Partially correct 67 ms 5624 KB Partially correct - number of queries: 8376
78 Correct 17 ms 5624 KB Output is correct
79 Correct 36 ms 5624 KB Output is correct
80 Partially correct 73 ms 5624 KB Partially correct - number of queries: 8361
81 Partially correct 67 ms 5624 KB Partially correct - number of queries: 8379
82 Partially correct 64 ms 5624 KB Partially correct - number of queries: 8342
83 Correct 10 ms 5624 KB Output is correct
84 Partially correct 65 ms 5624 KB Partially correct - number of queries: 6920
85 Partially correct 67 ms 5624 KB Partially correct - number of queries: 8375
86 Runtime error 84 ms 10188 KB Execution killed with signal 11 (could be triggered by violating memory limits)
87 Halted 0 ms 0 KB -