답안 #117563

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
117563 2019-06-16T14:51:40 Z nvmdava 커다란 상품 (IOI17_prize) C++17
100 / 100
51 ms 5260 KB
//#include "prize.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> ask(int i);

vector<int> res[200005];
int ans;
int big, nn;

vector<int> query(int i){
   if(i == 0)
      return vector<int>({0, big});
   if(i == nn + 1)
      return vector<int>({big, 0});
   return ask(i - 1);
}

void find(int l, int r){
   if(ans) return;
   if(res[l][0] == res[r][0]) return;
   int ll, rr, m = (l + r) >> 1;
   res[m] = query(m);
   if(res[m][0] + res[m][1] == big){
      find(l, m);
      find(m, r);
      return;
   }

   if(res[m][0] + res[m][1] == 0){
         ans = m;return;
   }
   for(rr = m + 1; rr < r; rr++){
      res[rr] = query(rr);
      if(res[rr][0] + res[rr][1] == big){
         find(rr, r);
         break;
      }
      if(res[rr][0] + res[rr][1] == 0){
         ans = rr;
         return;
      }
   }
   for(ll = m - 1; ll > l; ll--){
      res[ll] = query(ll);
      if(res[ll][0] + res[ll][1] == big){
         find(l, ll);
         break;
      }
      if(res[ll][0] + res[ll][1] == 0){
         ans = ll;
         return;
      }
   }

}

int find_best(int n) {
   nn = n;
   int lol = 0;
	for(int i = 0; i < 480; i++) {
		res[i + 1] = ask(i);
		if(res[i + 1][0] + res[i + 1][1] == 0)
			return i;
      if(big <= res[i + 1][0] + res[i + 1][1]){
         big = res[i + 1][0] + res[i + 1][1];
         lol = i + 1;
      }
      if(big > 50) break;
	}
   res[0] = query(0);
   res[nn + 1] = query(nn + 1);

   find(lol, nn + 1);

	return ans - 1;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 4992 KB Output is correct
2 Correct 11 ms 4992 KB Output is correct
3 Correct 11 ms 4992 KB Output is correct
4 Correct 8 ms 4992 KB Output is correct
5 Correct 9 ms 4992 KB Output is correct
6 Correct 6 ms 5120 KB Output is correct
7 Correct 11 ms 4992 KB Output is correct
8 Correct 9 ms 4992 KB Output is correct
9 Correct 9 ms 4992 KB Output is correct
10 Correct 9 ms 4992 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 5112 KB Output is correct
2 Correct 11 ms 5032 KB Output is correct
3 Correct 7 ms 5020 KB Output is correct
4 Correct 8 ms 5136 KB Output is correct
5 Correct 9 ms 4992 KB Output is correct
6 Correct 6 ms 4992 KB Output is correct
7 Correct 10 ms 5012 KB Output is correct
8 Correct 7 ms 5112 KB Output is correct
9 Correct 10 ms 5016 KB Output is correct
10 Correct 8 ms 4992 KB Output is correct
11 Correct 9 ms 4992 KB Output is correct
12 Correct 9 ms 4992 KB Output is correct
13 Correct 15 ms 5008 KB Output is correct
14 Correct 6 ms 4992 KB Output is correct
15 Correct 10 ms 4992 KB Output is correct
16 Correct 33 ms 5112 KB Output is correct
17 Correct 6 ms 4992 KB Output is correct
18 Correct 34 ms 5148 KB Output is correct
19 Correct 6 ms 5012 KB Output is correct
20 Correct 16 ms 4992 KB Output is correct
21 Correct 22 ms 5112 KB Output is correct
22 Correct 9 ms 5004 KB Output is correct
23 Correct 10 ms 4992 KB Output is correct
24 Correct 9 ms 4992 KB Output is correct
25 Correct 28 ms 4992 KB Output is correct
26 Correct 31 ms 5136 KB Output is correct
27 Correct 14 ms 5032 KB Output is correct
28 Correct 51 ms 5052 KB Output is correct
29 Correct 36 ms 5016 KB Output is correct
30 Correct 47 ms 5112 KB Output is correct
31 Correct 6 ms 5112 KB Output is correct
32 Correct 17 ms 5120 KB Output is correct
33 Correct 6 ms 4992 KB Output is correct
34 Correct 20 ms 4992 KB Output is correct
35 Correct 8 ms 5148 KB Output is correct
36 Correct 15 ms 4992 KB Output is correct
37 Correct 9 ms 5028 KB Output is correct
38 Correct 9 ms 5112 KB Output is correct
39 Correct 26 ms 4992 KB Output is correct
40 Correct 28 ms 5124 KB Output is correct
41 Correct 31 ms 4992 KB Output is correct
42 Correct 23 ms 5012 KB Output is correct
43 Correct 29 ms 4992 KB Output is correct
44 Correct 16 ms 5040 KB Output is correct
45 Correct 21 ms 5008 KB Output is correct
46 Correct 6 ms 5116 KB Output is correct
47 Correct 12 ms 5164 KB Output is correct
48 Correct 29 ms 5112 KB Output is correct
49 Correct 9 ms 4992 KB Output is correct
50 Correct 21 ms 5260 KB Output is correct
51 Correct 17 ms 4992 KB Output is correct
52 Correct 7 ms 4992 KB Output is correct
53 Correct 13 ms 5112 KB Output is correct
54 Correct 19 ms 4992 KB Output is correct
55 Correct 6 ms 5112 KB Output is correct
56 Correct 36 ms 5112 KB Output is correct
57 Correct 26 ms 5112 KB Output is correct
58 Correct 23 ms 5212 KB Output is correct
59 Correct 27 ms 5112 KB Output is correct
60 Correct 20 ms 4992 KB Output is correct
61 Correct 13 ms 5008 KB Output is correct
62 Correct 10 ms 5028 KB Output is correct
63 Correct 11 ms 4992 KB Output is correct
64 Correct 10 ms 5112 KB Output is correct
65 Correct 11 ms 4992 KB Output is correct
66 Correct 8 ms 4992 KB Output is correct
67 Correct 8 ms 5128 KB Output is correct
68 Correct 11 ms 4992 KB Output is correct
69 Correct 9 ms 4992 KB Output is correct
70 Correct 10 ms 4992 KB Output is correct
71 Correct 47 ms 5148 KB Output is correct
72 Correct 11 ms 5036 KB Output is correct
73 Correct 35 ms 5248 KB Output is correct
74 Correct 30 ms 5220 KB Output is correct
75 Correct 13 ms 5016 KB Output is correct
76 Correct 43 ms 5108 KB Output is correct
77 Correct 46 ms 5176 KB Output is correct
78 Correct 14 ms 5120 KB Output is correct
79 Correct 20 ms 4992 KB Output is correct
80 Correct 40 ms 5160 KB Output is correct
81 Correct 31 ms 5152 KB Output is correct
82 Correct 29 ms 5124 KB Output is correct
83 Correct 13 ms 5040 KB Output is correct
84 Correct 49 ms 5180 KB Output is correct
85 Correct 22 ms 5240 KB Output is correct
86 Correct 10 ms 4992 KB Output is correct
87 Correct 7 ms 5128 KB Output is correct
88 Correct 11 ms 4992 KB Output is correct
89 Correct 9 ms 4992 KB Output is correct
90 Correct 8 ms 4992 KB Output is correct
91 Correct 7 ms 5128 KB Output is correct
92 Correct 7 ms 5108 KB Output is correct
93 Correct 8 ms 5044 KB Output is correct
94 Correct 11 ms 4992 KB Output is correct
95 Correct 14 ms 5120 KB Output is correct
96 Correct 12 ms 4992 KB Output is correct
97 Correct 9 ms 4992 KB Output is correct