oj.uz

답안 #50150

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
50150 2018-06-08T01:15:15 Z Mamnoon_Siam 커다란 상품 (IOI17_prize) C++17
20 / 100
 103 ms 10172 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 < 455; 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 < 1000000);
		}
		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 < 1000000);
	}
	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 11 ms 5172 KB Output is correct
3 Correct 9 ms 5172 KB Output is correct
4 Correct 9 ms 5172 KB Output is correct
5 Correct 8 ms 5172 KB Output is correct
6 Correct 8 ms 5236 KB Output is correct
7 Correct 9 ms 5236 KB Output is correct
8 Correct 11 ms 5236 KB Output is correct
9 Correct 11 ms 5284 KB Output is correct
10 Correct 10 ms 5284 KB Output is correct

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 5284 KB Output is correct
2 Correct 11 ms 5284 KB Output is correct
3 Correct 12 ms 5284 KB Output is correct
4 Correct 9 ms 5284 KB Output is correct
5 Correct 9 ms 5284 KB Output is correct
6 Correct 10 ms 5284 KB Output is correct
7 Correct 9 ms 5284 KB Output is correct
8 Correct 11 ms 5284 KB Output is correct
9 Correct 10 ms 5284 KB Output is correct
10 Correct 9 ms 5284 KB Output is correct
11 Correct 12 ms 5284 KB Output is correct
12 Correct 9 ms 5284 KB Output is correct
13 Correct 14 ms 5284 KB Output is correct
14 Correct 11 ms 5284 KB Output is correct
15 Correct 27 ms 5308 KB Output is correct
16 Partially correct 90 ms 5436 KB Partially correct - number of queries: 7174
17 Correct 10 ms 5436 KB Output is correct
18 Partially correct 79 ms 5436 KB Partially correct - number of queries: 8334
19 Correct 7 ms 5436 KB Output is correct
20 Correct 25 ms 5436 KB Output is correct
21 Correct 33 ms 5436 KB Output is correct
22 Correct 10 ms 5436 KB Output is correct
23 Correct 10 ms 5436 KB Output is correct
24 Correct 8 ms 5436 KB Output is correct
25 Correct 52 ms 5436 KB Output is correct
26 Correct 48 ms 5436 KB Output is correct
27 Correct 12 ms 5436 KB Output is correct
28 Partially correct 86 ms 5448 KB Partially correct - number of queries: 7859
29 Partially correct 64 ms 5596 KB Partially correct - number of queries: 6098
30 Partially correct 103 ms 5596 KB Partially correct - number of queries: 8263
31 Correct 14 ms 5596 KB Output is correct
32 Correct 16 ms 5596 KB Output is correct
33 Correct 8 ms 5596 KB Output is correct
34 Correct 26 ms 5596 KB Output is correct
35 Correct 9 ms 5596 KB Output is correct
36 Correct 28 ms 5596 KB Output is correct
37 Correct 8 ms 5596 KB Output is correct
38 Correct 9 ms 5596 KB Output is correct
39 Correct 40 ms 5596 KB Output is correct
40 Partially correct 42 ms 5596 KB Partially correct - number of queries: 7139
41 Partially correct 52 ms 5596 KB Partially correct - number of queries: 5194
42 Partially correct 52 ms 5596 KB Partially correct - number of queries: 5194
43 Correct 46 ms 5596 KB Output is correct
44 Correct 20 ms 5596 KB Output is correct
45 Correct 38 ms 5596 KB Output is correct
46 Correct 8 ms 5596 KB Output is correct
47 Correct 30 ms 5596 KB Output is correct
48 Partially correct 48 ms 5596 KB Partially correct - number of queries: 6290
49 Correct 15 ms 5596 KB Output is correct
50 Partially correct 79 ms 5616 KB Partially correct - number of queries: 8335
51 Correct 33 ms 5616 KB Output is correct
52 Correct 13 ms 5616 KB Output is correct
53 Correct 11 ms 5616 KB Output is correct
54 Correct 37 ms 5616 KB Output is correct
55 Correct 10 ms 5616 KB Output is correct
56 Partially correct 101 ms 5616 KB Partially correct - number of queries: 8330
57 Partially correct 58 ms 5616 KB Partially correct - number of queries: 6194
58 Partially correct 52 ms 5616 KB Partially correct - number of queries: 6276
59 Partially correct 48 ms 5616 KB Partially correct - number of queries: 5191
60 Correct 48 ms 5616 KB Output is correct
61 Correct 12 ms 5616 KB Output is correct
62 Correct 8 ms 5616 KB Output is correct
63 Correct 10 ms 5616 KB Output is correct
64 Correct 9 ms 5616 KB Output is correct
65 Correct 11 ms 5616 KB Output is correct
66 Correct 12 ms 5616 KB Output is correct
67 Correct 10 ms 5616 KB Output is correct
68 Correct 9 ms 5616 KB Output is correct
69 Correct 15 ms 5616 KB Output is correct
70 Correct 10 ms 5616 KB Output is correct
71 Partially correct 70 ms 5616 KB Partially correct - number of queries: 8225
72 Correct 11 ms 5616 KB Output is correct
73 Partially correct 67 ms 5616 KB Partially correct - number of queries: 8114
74 Partially correct 65 ms 5616 KB Partially correct - number of queries: 8174
75 Correct 11 ms 5616 KB Output is correct
76 Partially correct 75 ms 5616 KB Partially correct - number of queries: 7071
77 Partially correct 66 ms 5616 KB Partially correct - number of queries: 8371
78 Correct 16 ms 5616 KB Output is correct
79 Correct 46 ms 5616 KB Output is correct
80 Partially correct 77 ms 5616 KB Partially correct - number of queries: 8369
81 Partially correct 66 ms 5616 KB Partially correct - number of queries: 8405
82 Partially correct 39 ms 5616 KB Partially correct - number of queries: 8301
83 Correct 11 ms 5616 KB Output is correct
84 Partially correct 63 ms 5616 KB Partially correct - number of queries: 6929
85 Partially correct 72 ms 5616 KB Partially correct - number of queries: 8345
86 Runtime error 72 ms 10172 KB Execution killed with signal 11 (could be triggered by violating memory limits)
87 Halted 0 ms 0 KB -