답안 #945111

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
945111	2024-03-13T12:15:29 Z	Wansur	커다란 상품 (IOI17_prize)	C++14	97.63 / 100	31 ms	5812 KB

prize

#include <bits/stdc++.h>
#define f first
#define s second
#define ent '\n'

typedef long long ll;
using namespace std;

struct asd{
    int a, b, w, ca, cb;
};

vector<int> ask(int i);
const string out[2]={"NO\n","YES\n"};
const ll dx[]={0,1,0,-1,-1,1,1,-1};
const ll dy[]={1,0,-1,0,-1,1,-1,1};
const int mod=998244353;
const int md=1e9+7;
const int mx=2e5+12;
const bool T=0;

vector<int> ans[mx];
int ma;

vector<int> Ask(int i){
    if(ans[i].size()>0){
        return ans[i];
    }
    ans[i]=ask(i);
    return ans[i];
}

int find(int l,int r,int x,int left,int right){
    if(!x || l>r)return -1;
    int mid=(l+r)/2, cnt=0;
    for(int i=mid;i<=r;i++){
        auto a=ask(i);
        if(a[0]+a[1]<ma){
            if(a[0]+a[1]==0){
                return i;
            }
            cnt++;
        }
        else{
            int val=find(i+1, r, a[1] - right, a[0], right);
            if(val!=-1){
                return val;
            }
            return find(l, mid-1, a[0] - left - cnt, left, a[1] + cnt);
        }
    }
    return find(l, mid-1, x-cnt, left, right - cnt);
}

int find_best(int n){
    srand(time(0));
    int pos=0, c=0;
    for(int i=0;i<478;i++){
        auto a=Ask(i);
        if(a[0]+a[1]==0){
            return i;
        }
        if(a[0]+a[1]>ma){
            ma=a[0]+a[1];
            pos=i;
        }
        if(ma>500)break;
    }
    for(int i=0;i<=pos;i++){
        auto a=Ask(i);
        if(a[0]+a[1]!=ma){
            c++;
        }
    }
    return find(pos+1, n-1, ma - c, c, 0);
}

Subtask #1

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	5136 KB	Output is correct
2	Correct	4 ms	5392 KB	Output is correct
3	Correct	3 ms	5144 KB	Output is correct
4	Correct	3 ms	5392 KB	Output is correct
5	Correct	4 ms	5396 KB	Output is correct
6	Correct	2 ms	4948 KB	Output is correct
7	Correct	3 ms	5388 KB	Output is correct
8	Correct	3 ms	5140 KB	Output is correct
9	Correct	3 ms	5140 KB	Output is correct
10	Correct	4 ms	5136 KB	Output is correct

Subtask #2

77.63 / 80.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	5148 KB	Output is correct
2	Correct	4 ms	5652 KB	Output is correct
3	Correct	4 ms	5396 KB	Output is correct
4	Correct	3 ms	5384 KB	Output is correct
5	Correct	3 ms	5396 KB	Output is correct
6	Correct	1 ms	5132 KB	Output is correct
7	Correct	3 ms	5396 KB	Output is correct
8	Correct	4 ms	5392 KB	Output is correct
9	Correct	3 ms	5396 KB	Output is correct
10	Correct	4 ms	5152 KB	Output is correct
11	Correct	5 ms	5600 KB	Output is correct
12	Correct	5 ms	5140 KB	Output is correct
13	Correct	3 ms	5392 KB	Output is correct
14	Correct	10 ms	5132 KB	Output is correct
15	Correct	22 ms	5396 KB	Output is correct
16	Correct	6 ms	5392 KB	Output is correct
17	Correct	3 ms	5404 KB	Output is correct
18	Correct	3 ms	5392 KB	Output is correct
19	Correct	3 ms	5400 KB	Output is correct
20	Correct	12 ms	5648 KB	Output is correct
21	Correct	15 ms	5140 KB	Output is correct
22	Correct	19 ms	5640 KB	Output is correct
23	Correct	4 ms	5392 KB	Output is correct
24	Correct	6 ms	5648 KB	Output is correct
25	Correct	11 ms	5224 KB	Output is correct
26	Correct	17 ms	5388 KB	Output is correct
27	Correct	4 ms	5396 KB	Output is correct
28	Correct	4 ms	5392 KB	Output is correct
29	Correct	6 ms	5392 KB	Output is correct
30	Correct	3 ms	5396 KB	Output is correct
31	Correct	3 ms	5396 KB	Output is correct
32	Correct	4 ms	5392 KB	Output is correct
33	Correct	2 ms	4952 KB	Output is correct
34	Correct	14 ms	5144 KB	Output is correct
35	Correct	4 ms	5392 KB	Output is correct
36	Correct	21 ms	5392 KB	Output is correct
37	Correct	4 ms	5392 KB	Output is correct
38	Correct	3 ms	5388 KB	Output is correct
39	Correct	21 ms	5392 KB	Output is correct
40	Correct	3 ms	5584 KB	Output is correct
41	Correct	16 ms	5812 KB	Output is correct
42	Correct	12 ms	5396 KB	Output is correct
43	Correct	10 ms	5392 KB	Output is correct
44	Correct	21 ms	5396 KB	Output is correct
45	Correct	14 ms	5396 KB	Output is correct
46	Correct	3 ms	5388 KB	Output is correct
47	Correct	14 ms	5140 KB	Output is correct
48	Correct	12 ms	5404 KB	Output is correct
49	Correct	18 ms	5388 KB	Output is correct
50	Correct	3 ms	5392 KB	Output is correct
51	Correct	14 ms	5392 KB	Output is correct
52	Correct	22 ms	5644 KB	Output is correct
53	Correct	3 ms	5644 KB	Output is correct
54	Correct	22 ms	5648 KB	Output is correct
55	Correct	3 ms	5392 KB	Output is correct
56	Correct	3 ms	5396 KB	Output is correct
57	Correct	13 ms	5396 KB	Output is correct
58	Correct	8 ms	5132 KB	Output is correct
59	Correct	9 ms	5648 KB	Output is correct
60	Correct	16 ms	5140 KB	Output is correct
61	Correct	4 ms	5396 KB	Output is correct
62	Correct	4 ms	5656 KB	Output is correct
63	Correct	4 ms	5392 KB	Output is correct
64	Correct	3 ms	5392 KB	Output is correct
65	Correct	4 ms	5648 KB	Output is correct
66	Correct	6 ms	5392 KB	Output is correct
67	Correct	6 ms	5392 KB	Output is correct
68	Correct	4 ms	5640 KB	Output is correct
69	Correct	5 ms	5392 KB	Output is correct
70	Correct	4 ms	5400 KB	Output is correct
71	Partially correct	23 ms	5144 KB	Partially correct - number of queries: 5237
72	Correct	5 ms	5400 KB	Output is correct
73	Partially correct	31 ms	5392 KB	Partially correct - number of queries: 5174
74	Partially correct	24 ms	5140 KB	Partially correct - number of queries: 5201
75	Correct	3 ms	5144 KB	Output is correct
76	Correct	24 ms	5144 KB	Output is correct
77	Correct	27 ms	5396 KB	Output is correct
78	Correct	8 ms	5140 KB	Output is correct
79	Correct	15 ms	5392 KB	Output is correct
80	Correct	24 ms	5652 KB	Output is correct
81	Correct	25 ms	5388 KB	Output is correct
82	Correct	27 ms	5388 KB	Output is correct
83	Correct	4 ms	5392 KB	Output is correct
84	Correct	22 ms	5396 KB	Output is correct
85	Correct	26 ms	5392 KB	Output is correct
86	Correct	3 ms	5392 KB	Output is correct
87	Correct	3 ms	5392 KB	Output is correct
88	Correct	4 ms	5396 KB	Output is correct
89	Correct	3 ms	5384 KB	Output is correct
90	Correct	5 ms	5392 KB	Output is correct
91	Correct	3 ms	5388 KB	Output is correct
92	Correct	3 ms	5396 KB	Output is correct
93	Correct	5 ms	5644 KB	Output is correct
94	Correct	4 ms	5140 KB	Output is correct
95	Correct	5 ms	5144 KB	Output is correct
96	Correct	4 ms	5140 KB	Output is correct
97	Correct	3 ms	5388 KB	Output is correct