답안 #986116

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
986116	2024-05-19T18:25:02 Z	AlphaMale06	커다란 상품 (IOI17_prize)	C++17	96.39 / 100	44 ms	11604 KB

prize

#include <bits/stdc++.h>

#include "prize.h"

using namespace std;
using ll = long long;

vector<int> ask(int i);

vector<int> a[200006];
int summ = 0;

int solve(int l, int r){
    if(l+1>=r)return 0;
    int cnt = a[l][1]-a[r][1];
    if(cnt==0)return 0;
    int s = l+r>>1;
    if(a[s][0]==-1)a[s]=ask(s);
    if(a[s][0]+a[s][1]==summ)return max(solve(l, s), solve(s, r));
    if(a[s][0]+a[s][1]==0)return s;
    int R = s-1, L = s+1;
    for(int i=s-1; i>=l; i--){
        if(a[i][0]==-1)a[i]=ask(i);
        if(a[i][0]+a[i][1]==0)return i;
        if(a[i][0]+a[i][1]==summ){
            R=i;
            break;
        }
    }
    for(int i=s+1; i<=r; i++){
        if(a[i][0]==-1)a[i]=ask(i);
        if(a[i][0]+a[i][1]==0)return i;
        if(a[i][0]+a[i][1]==summ){
            L=i;
            break;
        }
    }
    return max(solve(l, R), solve(L, r));
}

int find_best(int n){
	if(n<=5000){
        for(int i=0; i<n; i++){
            vector<int> ans = ask(i);
            if(ans[0]==0 && ans[1]==0)return i;
        }
	}
	for(int i=0; i< n; i++){
        a[i].push_back(-1);
	}
	int L = -1, R = -1;
    for(int i=0; i<300; i++){
        a[i] = ask(i);
        summ=max(summ, a[i][0]+a[i][1]);
        if(a[i][0]+a[i][1]==0)return i;
    }
    for(int i=n-1; i>=n-300; i--){
        a[i]=ask(i);
        summ=max(summ, a[i][0]+a[i][1]);
        if(a[i][0]+a[i][1]==0)return i;
    }
    for(int i=300; i<n; i++){
        a[i]=ask(i);
        if(a[i][0]+a[i][1]==0)return i;
        if(a[i][0]+a[i][1]==summ){
            L=i;
            break;
        }
    }
    for(int i=n-301; i>=0; i--){
        a[i]=ask(i);
        if(a[i][0]+a[i][1]==0)return i;
        if(a[i][0]+a[i][1]==summ){
            R=i;
            break;
        }
    }
    return solve(L, R);
}

Compilation message

prize.cpp: In function 'int solve(int, int)':
prize.cpp:17:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   17 |     int s = l+r>>1;
      |             ~^~

Subtask #1

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	12 ms	11364 KB	Output is correct
2	Correct	11 ms	11352 KB	Output is correct
3	Correct	12 ms	11348 KB	Output is correct
4	Correct	10 ms	11352 KB	Output is correct
5	Correct	11 ms	11352 KB	Output is correct
6	Correct	9 ms	11352 KB	Output is correct
7	Correct	12 ms	11352 KB	Output is correct
8	Correct	11 ms	11352 KB	Output is correct
9	Correct	11 ms	11352 KB	Output is correct
10	Correct	12 ms	11352 KB	Output is correct

Subtask #2

76.39 / 80.0

#	결과	실행 시간	메모리	Grader output
1	Correct	11 ms	11352 KB	Output is correct
2	Correct	11 ms	11352 KB	Output is correct
3	Correct	11 ms	11352 KB	Output is correct
4	Correct	11 ms	11352 KB	Output is correct
5	Correct	12 ms	11268 KB	Output is correct
6	Correct	8 ms	11352 KB	Output is correct
7	Correct	11 ms	11352 KB	Output is correct
8	Correct	11 ms	11604 KB	Output is correct
9	Correct	11 ms	11352 KB	Output is correct
10	Correct	11 ms	11352 KB	Output is correct
11	Correct	12 ms	11604 KB	Output is correct
12	Correct	15 ms	11352 KB	Output is correct
13	Correct	15 ms	11352 KB	Output is correct
14	Correct	8 ms	5720 KB	Output is correct
15	Partially correct	32 ms	11352 KB	Partially correct - number of queries: 5023
16	Partially correct	30 ms	11352 KB	Partially correct - number of queries: 5206
17	Partially correct	36 ms	11352 KB	Partially correct - number of queries: 5195
18	Partially correct	32 ms	11352 KB	Partially correct - number of queries: 5217
19	Correct	31 ms	11352 KB	Output is correct
20	Correct	21 ms	8024 KB	Output is correct
21	Partially correct	34 ms	11352 KB	Partially correct - number of queries: 5152
22	Correct	36 ms	11352 KB	Output is correct
23	Correct	13 ms	11352 KB	Output is correct
24	Correct	13 ms	11352 KB	Output is correct
25	Correct	26 ms	11352 KB	Output is correct
26	Correct	39 ms	11352 KB	Output is correct
27	Correct	11 ms	11348 KB	Output is correct
28	Correct	27 ms	11352 KB	Output is correct
29	Correct	35 ms	11352 KB	Output is correct
30	Partially correct	35 ms	11352 KB	Partially correct - number of queries: 5164
31	Partially correct	39 ms	11352 KB	Partially correct - number of queries: 5174
32	Correct	13 ms	11352 KB	Output is correct
33	Correct	1 ms	4952 KB	Output is correct
34	Partially correct	31 ms	11272 KB	Partially correct - number of queries: 5196
35	Correct	13 ms	11352 KB	Output is correct
36	Partially correct	31 ms	11352 KB	Partially correct - number of queries: 5180
37	Correct	15 ms	11352 KB	Output is correct
38	Correct	14 ms	11352 KB	Output is correct
39	Partially correct	39 ms	11352 KB	Partially correct - number of queries: 5135
40	Correct	32 ms	11352 KB	Output is correct
41	Partially correct	31 ms	11352 KB	Partially correct - number of queries: 5236
42	Partially correct	31 ms	11352 KB	Partially correct - number of queries: 5236
43	Partially correct	40 ms	11352 KB	Partially correct - number of queries: 5087
44	Partially correct	33 ms	11352 KB	Partially correct - number of queries: 5205
45	Correct	30 ms	11352 KB	Output is correct
46	Partially correct	39 ms	11348 KB	Partially correct - number of queries: 5229
47	Correct	33 ms	11352 KB	Output is correct
48	Partially correct	32 ms	11352 KB	Partially correct - number of queries: 5192
49	Partially correct	31 ms	11352 KB	Partially correct - number of queries: 5227
50	Partially correct	34 ms	11352 KB	Partially correct - number of queries: 5214
51	Partially correct	31 ms	11352 KB	Partially correct - number of queries: 5227
52	Partially correct	35 ms	11352 KB	Partially correct - number of queries: 5186
53	Correct	11 ms	11352 KB	Output is correct
54	Partially correct	30 ms	11352 KB	Partially correct - number of queries: 5189
55	Partially correct	39 ms	11352 KB	Partially correct - number of queries: 5180
56	Partially correct	44 ms	11352 KB	Partially correct - number of queries: 5201
57	Partially correct	28 ms	11348 KB	Partially correct - number of queries: 5160
58	Partially correct	42 ms	11352 KB	Partially correct - number of queries: 5203
59	Partially correct	29 ms	11352 KB	Partially correct - number of queries: 5209
60	Partially correct	32 ms	11352 KB	Partially correct - number of queries: 5199
61	Correct	12 ms	11352 KB	Output is correct
62	Correct	12 ms	11352 KB	Output is correct
63	Correct	11 ms	11352 KB	Output is correct
64	Correct	12 ms	11352 KB	Output is correct
65	Correct	10 ms	11604 KB	Output is correct
66	Correct	10 ms	11352 KB	Output is correct
67	Correct	13 ms	11352 KB	Output is correct
68	Correct	11 ms	11352 KB	Output is correct
69	Correct	11 ms	11292 KB	Output is correct
70	Correct	11 ms	11352 KB	Output is correct
71	Partially correct	44 ms	11352 KB	Partially correct - number of queries: 5361
72	Correct	13 ms	11352 KB	Output is correct
73	Partially correct	32 ms	11352 KB	Partially correct - number of queries: 5298
74	Partially correct	30 ms	11352 KB	Partially correct - number of queries: 5325
75	Correct	11 ms	11352 KB	Output is correct
76	Correct	26 ms	11352 KB	Output is correct
77	Partially correct	40 ms	11352 KB	Partially correct - number of queries: 5317
78	Correct	13 ms	11352 KB	Output is correct
79	Correct	20 ms	11348 KB	Output is correct
80	Partially correct	30 ms	11352 KB	Partially correct - number of queries: 5324
81	Partially correct	38 ms	11352 KB	Partially correct - number of queries: 5351
82	Partially correct	37 ms	11352 KB	Partially correct - number of queries: 5269
83	Correct	12 ms	11352 KB	Output is correct
84	Correct	27 ms	11352 KB	Output is correct
85	Partially correct	39 ms	11604 KB	Partially correct - number of queries: 5298
86	Correct	11 ms	11352 KB	Output is correct
87	Correct	11 ms	11348 KB	Output is correct
88	Correct	11 ms	11352 KB	Output is correct
89	Correct	11 ms	11352 KB	Output is correct
90	Correct	11 ms	11348 KB	Output is correct
91	Correct	12 ms	11352 KB	Output is correct
92	Correct	11 ms	11352 KB	Output is correct
93	Correct	16 ms	11352 KB	Output is correct
94	Correct	13 ms	11352 KB	Output is correct
95	Correct	14 ms	11352 KB	Output is correct
96	Correct	12 ms	11352 KB	Output is correct
97	Correct	11 ms	11352 KB	Output is correct