답안 #981387

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
981387 2024-05-13T06:48:26 Z vjudge1 커다란 상품 (IOI17_prize) C++17
20 / 100
45 ms 600 KB
#include "prize.h"
#include<bits/stdc++.h>
using namespace std;
int unloli,ans;
void calc(int l,int r,int tol,int tor){
    if(ans)
        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=ask(i);
            if(x[0]+x[1]==0) {
                ans=i;
                return;
            }
        }
        return;
    }
    int mid=l+r>>1,pt=mid;
    vector<int>stuff=ask(mid);
    if(stuff[0]+stuff[1]==0){
        ans=mid;
        return;
    }
    while(stuff[0]+stuff[1]-unloli&&pt>l){
        stuff=ask(--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=ask(++mid);
        if(stuff[0]+stuff[1]==0) {
            ans=mid;
            return;
        }
        while(stuff[0]+stuff[1]-unloli){
            stuff=ask(++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 = ask(i);
            if(res[0] + res[1] == 0)
                return i;
        }
	    return 0;
    }
    map<int,int>cnt;
    for(int i=0;i<455;i++){
        vector<int>x=ask(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(455,n-1,s,0);
    return ans;
}

Compilation message

prize.cpp: In function 'void calc(int, int, int, int)':
prize.cpp:22:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   22 |     int mid=l+r>>1,pt=mid;
      |             ~^~
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 3 ms 432 KB Output is correct
3 Correct 2 ms 344 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 2 ms 432 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 2 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 3 ms 432 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 2 ms 596 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 2 ms 432 KB Output is correct
9 Correct 2 ms 344 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 3 ms 344 KB Output is correct
12 Correct 2 ms 344 KB Output is correct
13 Correct 4 ms 344 KB Output is correct
14 Correct 2 ms 344 KB Output is correct
15 Correct 5 ms 600 KB Output is correct
16 Correct 23 ms 344 KB Output is correct
17 Correct 2 ms 344 KB Output is correct
18 Partially correct 28 ms 344 KB Partially correct - number of queries: 5219
19 Correct 2 ms 344 KB Output is correct
20 Correct 6 ms 504 KB Output is correct
21 Correct 10 ms 344 KB Output is correct
22 Correct 3 ms 344 KB Output is correct
23 Correct 2 ms 432 KB Output is correct
24 Correct 2 ms 344 KB Output is correct
25 Correct 17 ms 432 KB Output is correct
26 Correct 12 ms 344 KB Output is correct
27 Correct 2 ms 344 KB Output is correct
28 Correct 18 ms 340 KB Output is correct
29 Correct 20 ms 436 KB Output is correct
30 Partially correct 22 ms 344 KB Partially correct - number of queries: 5185
31 Correct 2 ms 344 KB Output is correct
32 Correct 3 ms 596 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 11 ms 344 KB Output is correct
35 Correct 3 ms 432 KB Output is correct
36 Correct 6 ms 432 KB Output is correct
37 Correct 2 ms 344 KB Output is correct
38 Correct 3 ms 344 KB Output is correct
39 Correct 15 ms 344 KB Output is correct
40 Correct 21 ms 344 KB Output is correct
41 Correct 18 ms 432 KB Output is correct
42 Correct 12 ms 344 KB Output is correct
43 Correct 13 ms 436 KB Output is correct
44 Correct 13 ms 432 KB Output is correct
45 Correct 10 ms 344 KB Output is correct
46 Correct 2 ms 344 KB Output is correct
47 Correct 11 ms 344 KB Output is correct
48 Correct 18 ms 344 KB Output is correct
49 Correct 3 ms 428 KB Output is correct
50 Partially correct 26 ms 344 KB Partially correct - number of queries: 5218
51 Correct 16 ms 432 KB Output is correct
52 Correct 3 ms 344 KB Output is correct
53 Correct 3 ms 432 KB Output is correct
54 Correct 11 ms 344 KB Output is correct
55 Correct 2 ms 344 KB Output is correct
56 Partially correct 27 ms 344 KB Partially correct - number of queries: 5218
57 Correct 16 ms 432 KB Output is correct
58 Correct 18 ms 344 KB Output is correct
59 Correct 12 ms 344 KB Output is correct
60 Correct 14 ms 600 KB Output is correct
61 Correct 2 ms 344 KB Output is correct
62 Correct 2 ms 600 KB Output is correct
63 Correct 3 ms 436 KB Output is correct
64 Correct 3 ms 540 KB Output is correct
65 Correct 2 ms 436 KB Output is correct
66 Correct 4 ms 344 KB Output is correct
67 Correct 2 ms 344 KB Output is correct
68 Correct 2 ms 344 KB Output is correct
69 Correct 4 ms 596 KB Output is correct
70 Correct 2 ms 344 KB Output is correct
71 Partially correct 25 ms 432 KB Partially correct - number of queries: 5214
72 Correct 4 ms 432 KB Output is correct
73 Partially correct 28 ms 344 KB Partially correct - number of queries: 5151
74 Partially correct 31 ms 344 KB Partially correct - number of queries: 5178
75 Correct 2 ms 344 KB Output is correct
76 Correct 17 ms 344 KB Output is correct
77 Partially correct 29 ms 344 KB Partially correct - number of queries: 5391
78 Correct 4 ms 440 KB Output is correct
79 Correct 13 ms 344 KB Output is correct
80 Partially correct 19 ms 432 KB Partially correct - number of queries: 5375
81 Partially correct 20 ms 344 KB Partially correct - number of queries: 5375
82 Partially correct 21 ms 344 KB Partially correct - number of queries: 5351
83 Correct 3 ms 436 KB Output is correct
84 Correct 28 ms 596 KB Output is correct
85 Partially correct 27 ms 344 KB Partially correct - number of queries: 5371
86 Incorrect 45 ms 344 KB Incorrect
87 Halted 0 ms 0 KB -