답안 #63630 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
63630	2018-08-02T09:31:32 Z	radoslav11	커다란 상품 (IOI17_prize)	C++14	97.7 / 100	129 ms	25800 KB

prize

#include <bits/stdc++.h>
#include "prize.h"
//#include "Lgrader.cpp"
 
using namespace std;
template<class T, class T2> inline int chkmax(T &x, const T2 &y) { return x < y ? x = y, 1 : 0; }
template<class T, class T2> inline int chkmin(T &x, const T2 &y) { return x > y ? x = y, 1 : 0; }
const int MAXN = (1 << 20);
 
vector<int> memo[MAXN];
int Q = 0;
bool stop;
bool dummy[MAXN];
 
vector<int> query(int i) 
{
	if(!memo[i].empty()) return memo[i];
	if(stop || dummy[i]) return vector<int>(2, 1e9);
 
	memo[i] = ask(i), Q++;
	if(Q == 10000) assert(false);
	return memo[i];
}
 
int n;
mt19937 mt(42);
 
bool useless(int l, int r)
{
	if(query(l)[1] - query(r)[1] == 0) return true;
	//if(query(r)[0] - query(l)[0] == 0) return true;
	return false;
}
int sum(int x) { return query(x)[0]+query(x)[1];}
 int better(int l, int r)
   {
       return sum(l)>sum(r);
   }
 
int cnt(int l, int r) { return query(l)[1] - query(r)[1] - better(l,r); }
 
void rec(int l, int r)
{
	if(r < l) return;
 
	int mid = (l + r) >> 1;
	if(query(l - 1)[0] + query(l - 1)[1] == 0) stop = 1;	
	
	if(query(r + 1)[0] + query(r + 1)[1] == 0) stop = 1;
 
	if(useless(l - 1, r + 1))
	{
		for(int i = l; i <= r; i++)
			memo[i] = query(l - 1);
		return;
	}
  /*
    if(cnt() && )
      {
      for(int i = l; i< mid;i++)dummy[i] = 1;
      for(int i = mid+1; i< r+1;i++)dummy[i] = 1;           return;
      }
   */
   	
    if(cnt(l - 1, mid) > cnt(mid, r + 1))
	{
		if(useless(l - 1, mid))
			for(int i = l; i < mid; i++)
				dummy[i] = 1;
		else
			rec(l, mid - 1);
 
		if(useless(mid, r + 1))
			for(int i = mid + 1; i <= r; i++)
				dummy[i] = 1;
		else
			rec(mid + 1, r);	
	}
	else
	{
		if(useless(mid, r + 1))
			for(int i = mid + 1; i <= r; i++)
				dummy[i] = 1;
		else
			rec(mid + 1, r);	
		
		if(useless(l - 1, mid))
			for(int i = l; i < mid; i++)
				dummy[i] = 1;
		else
			rec(l, mid - 1);
 
 
	}
}
 
int find_best(int n) 
{	
	::n = n;
	rec(1, n - 2);
	for(int i = 0; i < n; i++)
		if(query(i)[0] + query(i)[1] == 0)
			return i;
 
	return -1;
}

Subtask #1
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	27 ms	25208 KB	Output is correct
2	Correct	35 ms	25248 KB	Output is correct
3	Correct	40 ms	25248 KB	Output is correct
4	Correct	51 ms	25280 KB	Output is correct
5	Correct	38 ms	25280 KB	Output is correct
6	Correct	31 ms	25336 KB	Output is correct
7	Correct	33 ms	25336 KB	Output is correct
8	Correct	38 ms	25336 KB	Output is correct
9	Correct	40 ms	25360 KB	Output is correct
10	Correct	42 ms	25360 KB	Output is correct

Subtask #2
77.7 / 80.0

#	결과	실행 시간	메모리	Grader output
1	Correct	34 ms	25360 KB	Output is correct
2	Correct	43 ms	25360 KB	Output is correct
3	Correct	37 ms	25360 KB	Output is correct
4	Correct	65 ms	25360 KB	Output is correct
5	Correct	45 ms	25360 KB	Output is correct
6	Correct	28 ms	25360 KB	Output is correct
7	Correct	37 ms	25360 KB	Output is correct
8	Correct	48 ms	25360 KB	Output is correct
9	Correct	47 ms	25360 KB	Output is correct
10	Correct	45 ms	25384 KB	Output is correct
11	Correct	37 ms	25384 KB	Output is correct
12	Correct	36 ms	25404 KB	Output is correct
13	Correct	62 ms	25404 KB	Output is correct
14	Correct	35 ms	25404 KB	Output is correct
15	Correct	58 ms	25404 KB	Output is correct
16	Correct	76 ms	25404 KB	Output is correct
17	Partially correct	79 ms	25540 KB	Partially correct - number of queries: 5071
18	Partially correct	129 ms	25580 KB	Partially correct - number of queries: 5065
19	Correct	96 ms	25580 KB	Output is correct
20	Correct	54 ms	25580 KB	Output is correct
21	Correct	56 ms	25580 KB	Output is correct
22	Correct	74 ms	25580 KB	Output is correct
23	Correct	30 ms	25580 KB	Output is correct
24	Correct	38 ms	25580 KB	Output is correct
25	Correct	74 ms	25580 KB	Output is correct
26	Correct	115 ms	25580 KB	Output is correct
27	Correct	38 ms	25580 KB	Output is correct
28	Correct	70 ms	25580 KB	Output is correct
29	Correct	77 ms	25580 KB	Output is correct
30	Partially correct	101 ms	25580 KB	Partially correct - number of queries: 5021
31	Partially correct	89 ms	25668 KB	Partially correct - number of queries: 5025
32	Correct	38 ms	25668 KB	Output is correct
33	Correct	26 ms	25668 KB	Output is correct
34	Correct	38 ms	25668 KB	Output is correct
35	Correct	43 ms	25668 KB	Output is correct
36	Partially correct	82 ms	25668 KB	Partially correct - number of queries: 5064
37	Correct	39 ms	25668 KB	Output is correct
38	Correct	35 ms	25668 KB	Output is correct
39	Partially correct	91 ms	25800 KB	Partially correct - number of queries: 5063
40	Correct	82 ms	25800 KB	Output is correct
41	Correct	63 ms	25800 KB	Output is correct
42	Correct	73 ms	25800 KB	Output is correct
43	Correct	48 ms	25800 KB	Output is correct
44	Correct	56 ms	25800 KB	Output is correct
45	Correct	95 ms	25800 KB	Output is correct
46	Partially correct	76 ms	25800 KB	Partially correct - number of queries: 5068
47	Correct	91 ms	25800 KB	Output is correct
48	Correct	38 ms	25800 KB	Output is correct
49	Correct	52 ms	25800 KB	Output is correct
50	Partially correct	120 ms	25800 KB	Partially correct - number of queries: 5069
51	Partially correct	108 ms	25800 KB	Partially correct - number of queries: 5070
52	Partially correct	112 ms	25800 KB	Partially correct - number of queries: 5031
53	Correct	49 ms	25800 KB	Output is correct
54	Correct	33 ms	25800 KB	Output is correct
55	Partially correct	94 ms	25800 KB	Partially correct - number of queries: 5067
56	Correct	76 ms	25800 KB	Output is correct
57	Correct	82 ms	25800 KB	Output is correct
58	Partially correct	98 ms	25800 KB	Partially correct - number of queries: 5092
59	Partially correct	120 ms	25800 KB	Partially correct - number of queries: 5071
60	Correct	74 ms	25800 KB	Output is correct
61	Correct	49 ms	25800 KB	Output is correct
62	Correct	28 ms	25800 KB	Output is correct
63	Correct	49 ms	25800 KB	Output is correct
64	Correct	46 ms	25800 KB	Output is correct
65	Correct	49 ms	25800 KB	Output is correct
66	Correct	49 ms	25800 KB	Output is correct
67	Correct	63 ms	25800 KB	Output is correct
68	Correct	28 ms	25800 KB	Output is correct
69	Correct	42 ms	25800 KB	Output is correct
70	Correct	43 ms	25800 KB	Output is correct
71	Correct	100 ms	25800 KB	Output is correct
72	Correct	37 ms	25800 KB	Output is correct
73	Correct	67 ms	25800 KB	Output is correct
74	Correct	87 ms	25800 KB	Output is correct
75	Correct	33 ms	25800 KB	Output is correct
76	Correct	86 ms	25800 KB	Output is correct
77	Partially correct	102 ms	25800 KB	Partially correct - number of queries: 5230
78	Correct	36 ms	25800 KB	Output is correct
79	Correct	60 ms	25800 KB	Output is correct
80	Partially correct	94 ms	25800 KB	Partially correct - number of queries: 5219
81	Partially correct	90 ms	25800 KB	Partially correct - number of queries: 5181
82	Partially correct	74 ms	25800 KB	Partially correct - number of queries: 5178
83	Correct	34 ms	25800 KB	Output is correct
84	Correct	106 ms	25800 KB	Output is correct
85	Partially correct	115 ms	25800 KB	Partially correct - number of queries: 5190
86	Correct	43 ms	25800 KB	Output is correct
87	Correct	33 ms	25800 KB	Output is correct
88	Correct	34 ms	25800 KB	Output is correct
89	Correct	43 ms	25800 KB	Output is correct
90	Correct	37 ms	25800 KB	Output is correct
91	Correct	36 ms	25800 KB	Output is correct
92	Correct	53 ms	25800 KB	Output is correct
93	Correct	44 ms	25800 KB	Output is correct
94	Correct	54 ms	25800 KB	Output is correct
95	Correct	53 ms	25800 KB	Output is correct
96	Correct	32 ms	25800 KB	Output is correct
97	Correct	43 ms	25800 KB	Output is correct

답안 #63630

Compilation message

Subtask #1 20.0 / 20.0

Subtask #2 77.7 / 80.0

Subtask #1
20.0 / 20.0

Subtask #2
77.7 / 80.0