답안 #981427

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
981427	2024-05-13T07:59:23 Z	vjudge1	커다란 상품 (IOI17_prize)	C++17	95.89 / 100	39 ms	2100 KB

prize

#include "prize.h"
#include<bits/stdc++.h>
using namespace std;
int unloli,ans=-1;
map<int,vector<int>> mem;
vector<int>ask2(int n){
    if(mem.count(n))
        return mem[n];
    return mem[n]=ask(n);
}
void calc(int l,int r,int tol,int tor){
    if(ans>=0)
        return;
    if(l>r)
        return;
    if(tol+tor==unloli)
        return;
    if(tol+tor+r-l+1==unloli){
        for(int i=l;i<=r;i++) {
            vector<int>x=ask2(i);
            if(x[0]+x[1]==0) {
                ans=i;
                return;
            }
        }
        return;
    }
    int mid=l+r>>1,pt=mid;
    vector<int>stuff=ask2(mid);
    if(stuff[0]+stuff[1]==0){
        ans=mid;
        return;
    }
    while(stuff[0]+stuff[1]-unloli&&pt>l){
        stuff=ask2(--pt);
        if(stuff[0]+stuff[1]==0){
            ans=pt;
            return;
        }
    }
    if(stuff[0]+stuff[1]==unloli)
        calc(l,pt-1,tol,stuff[1]),
        calc(mid+1,r,stuff[0],tor);
    else {
        stuff=ask2(++mid);
        if(stuff[0]+stuff[1]==0) {
            ans=mid;
            return;
        }
        while(stuff[0]+stuff[1]-unloli){
            stuff=ask2(++mid);
            if(stuff[0]+stuff[1]==0) {
                ans=mid;
                return;
            }
        }
        calc(mid+1,r,stuff[0],tor);
    }
}
int find_best(int n) {
    if(n<5002) {
        for(int i = 1; i < n; i++) {
            std::vector<int> res = ask2(i);
            if(res[0] + res[1] == 0)
                return i;
        }
	    return 0;
    }
    map<int,int>cnt;
    for(int i=0;i<473;i++){
        vector<int>x=ask2(i);
        if(x[0]+x[1]==0)
            return i;
        cnt[x[0]+x[1]]++;
        unloli=max(unloli,x[0]+x[1]);
    }
    int s=0;
    for(auto[i,j]:cnt)
        s+=(i<unloli)*j;
    calc(473,n-1,s,0);
    return ans;
}

Compilation message

prize.cpp: In function 'void calc(int, int, int, int)':
prize.cpp:28:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   28 |     int mid=l+r>>1,pt=mid;
      |             ~^~

Subtask #1

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	720 KB	Output is correct
2	Correct	2 ms	696 KB	Output is correct
3	Correct	2 ms	720 KB	Output is correct
4	Correct	2 ms	696 KB	Output is correct
5	Correct	2 ms	1220 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	3 ms	976 KB	Output is correct
8	Correct	2 ms	724 KB	Output is correct
9	Correct	3 ms	948 KB	Output is correct
10	Correct	2 ms	488 KB	Output is correct

Subtask #2

75.89 / 80.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	720 KB	Output is correct
2	Correct	2 ms	464 KB	Output is correct
3	Correct	2 ms	952 KB	Output is correct
4	Correct	2 ms	720 KB	Output is correct
5	Correct	2 ms	692 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	2 ms	724 KB	Output is correct
8	Correct	2 ms	464 KB	Output is correct
9	Correct	2 ms	704 KB	Output is correct
10	Correct	3 ms	1232 KB	Output is correct
11	Correct	4 ms	1240 KB	Output is correct
12	Correct	2 ms	716 KB	Output is correct
13	Correct	4 ms	1000 KB	Output is correct
14	Correct	3 ms	948 KB	Output is correct
15	Correct	5 ms	1048 KB	Output is correct
16	Correct	23 ms	1744 KB	Output is correct
17	Correct	2 ms	952 KB	Output is correct
18	Partially correct	25 ms	1672 KB	Partially correct - number of queries: 5236
19	Correct	2 ms	976 KB	Output is correct
20	Correct	7 ms	1312 KB	Output is correct
21	Correct	11 ms	776 KB	Output is correct
22	Correct	4 ms	996 KB	Output is correct
23	Correct	3 ms	716 KB	Output is correct
24	Correct	2 ms	716 KB	Output is correct
25	Correct	14 ms	1320 KB	Output is correct
26	Correct	11 ms	1588 KB	Output is correct
27	Correct	3 ms	996 KB	Output is correct
28	Correct	20 ms	1776 KB	Output is correct
29	Correct	20 ms	904 KB	Output is correct
30	Partially correct	25 ms	1940 KB	Partially correct - number of queries: 5198
31	Correct	2 ms	972 KB	Output is correct
32	Correct	4 ms	1004 KB	Output is correct
33	Correct	0 ms	344 KB	Output is correct
34	Correct	9 ms	1232 KB	Output is correct
35	Correct	4 ms	696 KB	Output is correct
36	Correct	7 ms	1052 KB	Output is correct
37	Correct	3 ms	728 KB	Output is correct
38	Correct	3 ms	712 KB	Output is correct
39	Correct	13 ms	1384 KB	Output is correct
40	Correct	19 ms	1680 KB	Output is correct
41	Correct	17 ms	1216 KB	Output is correct
42	Correct	19 ms	1624 KB	Output is correct
43	Correct	14 ms	1364 KB	Output is correct
44	Correct	13 ms	1304 KB	Output is correct
45	Correct	7 ms	1828 KB	Output is correct
46	Correct	2 ms	720 KB	Output is correct
47	Correct	12 ms	720 KB	Output is correct
48	Correct	16 ms	1736 KB	Output is correct
49	Correct	4 ms	720 KB	Output is correct
50	Partially correct	28 ms	1572 KB	Partially correct - number of queries: 5234
51	Correct	13 ms	1376 KB	Output is correct
52	Correct	2 ms	692 KB	Output is correct
53	Correct	3 ms	976 KB	Output is correct
54	Correct	15 ms	1056 KB	Output is correct
55	Correct	2 ms	464 KB	Output is correct
56	Partially correct	36 ms	1476 KB	Partially correct - number of queries: 5231
57	Correct	19 ms	1500 KB	Output is correct
58	Correct	26 ms	1288 KB	Output is correct
59	Correct	15 ms	1676 KB	Output is correct
60	Correct	12 ms	1024 KB	Output is correct
61	Correct	4 ms	460 KB	Output is correct
62	Correct	2 ms	460 KB	Output is correct
63	Correct	3 ms	624 KB	Output is correct
64	Correct	3 ms	696 KB	Output is correct
65	Correct	2 ms	868 KB	Output is correct
66	Correct	4 ms	744 KB	Output is correct
67	Correct	3 ms	732 KB	Output is correct
68	Correct	2 ms	464 KB	Output is correct
69	Correct	5 ms	772 KB	Output is correct
70	Correct	3 ms	728 KB	Output is correct
71	Partially correct	28 ms	1660 KB	Partially correct - number of queries: 5232
72	Correct	5 ms	748 KB	Output is correct
73	Partially correct	33 ms	1676 KB	Partially correct - number of queries: 5169
74	Partially correct	24 ms	1856 KB	Partially correct - number of queries: 5196
75	Correct	3 ms	724 KB	Output is correct
76	Correct	23 ms	1220 KB	Output is correct
77	Partially correct	36 ms	1892 KB	Partially correct - number of queries: 5392
78	Correct	4 ms	944 KB	Output is correct
79	Correct	20 ms	1460 KB	Output is correct
80	Partially correct	25 ms	1196 KB	Partially correct - number of queries: 5411
81	Partially correct	34 ms	1628 KB	Partially correct - number of queries: 5401
82	Partially correct	39 ms	1268 KB	Partially correct - number of queries: 5374
83	Correct	3 ms	952 KB	Output is correct
84	Correct	21 ms	2100 KB	Output is correct
85	Partially correct	32 ms	1452 KB	Partially correct - number of queries: 5404
86	Correct	2 ms	708 KB	Output is correct
87	Correct	3 ms	944 KB	Output is correct
88	Correct	2 ms	944 KB	Output is correct
89	Correct	2 ms	692 KB	Output is correct
90	Correct	2 ms	692 KB	Output is correct
91	Correct	2 ms	692 KB	Output is correct
92	Correct	4 ms	692 KB	Output is correct
93	Correct	6 ms	976 KB	Output is correct
94	Correct	4 ms	1004 KB	Output is correct
95	Correct	3 ms	740 KB	Output is correct
96	Correct	5 ms	464 KB	Output is correct
97	Correct	2 ms	864 KB	Output is correct