답안 #50190 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
50190	2018-06-08T08:24:36 Z	Mamnoon_Siam	커다란 상품 (IOI17_prize)	C++17	97.65 / 100	60 ms	5588 KB

prize

//#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 mx_tot = 0;
vector<int> blocks;

int Left(int i) {
	if(memo[i].empty()) memo[i] = ask(i);
	return memo[i][0];
}
int Total(int i) {
	if(memo[i].empty()) memo[i] = ask(i);
	return memo[i][0] + memo[i][1];
}
bool IsThere(int i, int j) {
	if(Total(j) < mx_tot) return true;
	return (Left(j) - Left(i)) > 0;
}
bool Thicc(int i) {
	return Total(i) < mx_tot;
}

int next_thicc(int i) {
	if(Thicc(i)) return i;
	int it = lower_bound(all(blocks), i) - blocks.begin();
	while(!IsThere(i, blocks[it])) it++;
	int lo = i, hi = blocks[it];
	int ret = -1;
	while(lo <= hi) {
		int mid = lo + hi >> 1;
		if(IsThere(i, mid)) {
			ret = mid;
			hi = mid - 1;
		} else {
			lo = mid + 1;
		}
	} return ret;
}

int find_best(int n) { int debug = 0;
	if(!debug) if(n <= 5000)
		for(int i = 0; i < n; i++)
			if(Total(i) == 0)
				return i;

	int k = 600; int sz = n / k;
	for(int i = 0; i < n; i += sz) {
		blocks.push_back(i);
	} if(blocks.back() != n-1) blocks.push_back(n-1);
	for(int b : blocks) mx_tot = max(mx_tot, Total(b));
	int now = 0;
	while(true) {
		now = next_thicc(now);
		if(Total(now) == 0) return now;
		now++;
	}
}

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 next_thicc(int)':
prize.cpp:54:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   int mid = lo + hi >> 1;
             ~~~^~~~

Subtask #1
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	10 ms	4984 KB	Output is correct
2	Correct	8 ms	5092 KB	Output is correct
3	Correct	11 ms	5120 KB	Output is correct
4	Correct	10 ms	5276 KB	Output is correct
5	Correct	9 ms	5276 KB	Output is correct
6	Correct	12 ms	5276 KB	Output is correct
7	Correct	12 ms	5276 KB	Output is correct
8	Correct	13 ms	5276 KB	Output is correct
9	Correct	9 ms	5392 KB	Output is correct
10	Correct	11 ms	5392 KB	Output is correct

Subtask #2
77.65 / 80.0

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	5392 KB	Output is correct
2	Correct	13 ms	5392 KB	Output is correct
3	Correct	11 ms	5392 KB	Output is correct
4	Correct	13 ms	5392 KB	Output is correct
5	Correct	11 ms	5392 KB	Output is correct
6	Correct	14 ms	5392 KB	Output is correct
7	Correct	15 ms	5392 KB	Output is correct
8	Correct	12 ms	5392 KB	Output is correct
9	Correct	10 ms	5392 KB	Output is correct
10	Correct	16 ms	5392 KB	Output is correct
11	Correct	16 ms	5392 KB	Output is correct
12	Correct	11 ms	5392 KB	Output is correct
13	Correct	14 ms	5392 KB	Output is correct
14	Correct	12 ms	5392 KB	Output is correct
15	Correct	14 ms	5392 KB	Output is correct
16	Correct	43 ms	5392 KB	Output is correct
17	Correct	12 ms	5392 KB	Output is correct
18	Partially correct	39 ms	5580 KB	Partially correct - number of queries: 5235
19	Correct	13 ms	5580 KB	Output is correct
20	Correct	24 ms	5580 KB	Output is correct
21	Correct	34 ms	5580 KB	Output is correct
22	Correct	15 ms	5580 KB	Output is correct
23	Correct	14 ms	5580 KB	Output is correct
24	Correct	9 ms	5580 KB	Output is correct
25	Correct	33 ms	5580 KB	Output is correct
26	Correct	37 ms	5580 KB	Output is correct
27	Correct	13 ms	5580 KB	Output is correct
28	Correct	45 ms	5580 KB	Output is correct
29	Correct	48 ms	5580 KB	Output is correct
30	Partially correct	52 ms	5580 KB	Partially correct - number of queries: 5193
31	Correct	13 ms	5580 KB	Output is correct
32	Correct	16 ms	5580 KB	Output is correct
33	Correct	6 ms	5580 KB	Output is correct
34	Correct	20 ms	5580 KB	Output is correct
35	Correct	11 ms	5580 KB	Output is correct
36	Correct	20 ms	5580 KB	Output is correct
37	Correct	11 ms	5580 KB	Output is correct
38	Correct	12 ms	5580 KB	Output is correct
39	Correct	18 ms	5580 KB	Output is correct
40	Correct	50 ms	5580 KB	Output is correct
41	Correct	22 ms	5580 KB	Output is correct
42	Correct	30 ms	5580 KB	Output is correct
43	Correct	30 ms	5580 KB	Output is correct
44	Correct	27 ms	5580 KB	Output is correct
45	Correct	30 ms	5580 KB	Output is correct
46	Correct	13 ms	5580 KB	Output is correct
47	Correct	24 ms	5580 KB	Output is correct
48	Correct	34 ms	5580 KB	Output is correct
49	Correct	15 ms	5580 KB	Output is correct
50	Partially correct	25 ms	5580 KB	Partially correct - number of queries: 5220
51	Correct	22 ms	5580 KB	Output is correct
52	Correct	10 ms	5580 KB	Output is correct
53	Correct	13 ms	5580 KB	Output is correct
54	Correct	36 ms	5580 KB	Output is correct
55	Correct	11 ms	5580 KB	Output is correct
56	Partially correct	46 ms	5580 KB	Partially correct - number of queries: 5214
57	Correct	32 ms	5580 KB	Output is correct
58	Correct	38 ms	5580 KB	Output is correct
59	Correct	18 ms	5580 KB	Output is correct
60	Correct	37 ms	5580 KB	Output is correct
61	Correct	13 ms	5580 KB	Output is correct
62	Correct	8 ms	5580 KB	Output is correct
63	Correct	13 ms	5580 KB	Output is correct
64	Correct	10 ms	5580 KB	Output is correct
65	Correct	8 ms	5580 KB	Output is correct
66	Correct	16 ms	5580 KB	Output is correct
67	Correct	14 ms	5580 KB	Output is correct
68	Correct	20 ms	5580 KB	Output is correct
69	Correct	13 ms	5580 KB	Output is correct
70	Correct	10 ms	5580 KB	Output is correct
71	Correct	48 ms	5580 KB	Output is correct
72	Correct	16 ms	5580 KB	Output is correct
73	Correct	49 ms	5588 KB	Output is correct
74	Correct	49 ms	5588 KB	Output is correct
75	Correct	8 ms	5588 KB	Output is correct
76	Correct	41 ms	5588 KB	Output is correct
77	Partially correct	45 ms	5588 KB	Partially correct - number of queries: 5190
78	Correct	13 ms	5588 KB	Output is correct
79	Correct	30 ms	5588 KB	Output is correct
80	Partially correct	46 ms	5588 KB	Partially correct - number of queries: 5170
81	Partially correct	49 ms	5588 KB	Partially correct - number of queries: 5168
82	Partially correct	45 ms	5588 KB	Partially correct - number of queries: 5136
83	Correct	14 ms	5588 KB	Output is correct
84	Correct	45 ms	5588 KB	Output is correct
85	Partially correct	57 ms	5588 KB	Partially correct - number of queries: 5164
86	Correct	34 ms	5588 KB	Output is correct
87	Correct	16 ms	5588 KB	Output is correct
88	Correct	42 ms	5588 KB	Output is correct
89	Correct	40 ms	5588 KB	Output is correct
90	Correct	8 ms	5588 KB	Output is correct
91	Correct	32 ms	5588 KB	Output is correct
92	Correct	23 ms	5588 KB	Output is correct
93	Correct	44 ms	5588 KB	Output is correct
94	Correct	39 ms	5588 KB	Output is correct
95	Correct	44 ms	5588 KB	Output is correct
96	Correct	42 ms	5588 KB	Output is correct
97	Correct	60 ms	5588 KB	Output is correct

답안 #50190

Compilation message

Subtask #1 20.0 / 20.0

Subtask #2 77.65 / 80.0

Subtask #1
20.0 / 20.0

Subtask #2
77.65 / 80.0