oj.uz

답안 #981444

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
981444 2024-05-13T08:23:58 Z vjudge1 커다란 상품 (IOI17_prize) C++17
100 / 100
 29 ms 2508 KB 
#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(mid+1,r,stuff[0],tor),
        calc(l,pt-1,tol,stuff[1]);
    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;
    int to=473;
    for(int i=0;i<to;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]);
        if(unloli>27)
            to=i+1;
    }
    int s=0;
    for(auto[i,j]:cnt)
        s+=(i<unloli)*j;
    calc(to,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 700 KB Output is correct
2 Correct 2 ms 976 KB Output is correct
3 Correct 2 ms 964 KB Output is correct
4 Correct 3 ms 748 KB Output is correct
5 Correct 2 ms 460 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 3 ms 464 KB Output is correct
8 Correct 2 ms 720 KB Output is correct
9 Correct 2 ms 972 KB Output is correct
10 Correct 2 ms 740 KB Output is correct

Subtask #2
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 724 KB Output is correct
2 Correct 3 ms 1232 KB Output is correct
3 Correct 2 ms 464 KB Output is correct
4 Correct 2 ms 724 KB Output is correct
5 Correct 3 ms 696 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 2 ms 712 KB Output is correct
8 Correct 3 ms 716 KB Output is correct
9 Correct 3 ms 968 KB Output is correct
10 Correct 3 ms 704 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 464 KB Output is correct
13 Correct 0 ms 440 KB Output is correct
14 Correct 4 ms 944 KB Output is correct
15 Correct 19 ms 1564 KB Output is correct
16 Correct 4 ms 492 KB Output is correct
17 Correct 22 ms 1524 KB Output is correct
18 Correct 1 ms 440 KB Output is correct
19 Correct 23 ms 2508 KB Output is correct
20 Correct 9 ms 1028 KB Output is correct
21 Correct 14 ms 1444 KB Output is correct
22 Correct 13 ms 1752 KB Output is correct
23 Correct 3 ms 752 KB Output is correct
24 Correct 2 ms 712 KB Output is correct
25 Correct 10 ms 1780 KB Output is correct
26 Correct 9 ms 1564 KB Output is correct
27 Correct 3 ms 716 KB Output is correct
28 Correct 1 ms 700 KB Output is correct
29 Correct 3 ms 692 KB Output is correct
30 Correct 1 ms 432 KB Output is correct
31 Correct 23 ms 2208 KB Output is correct
32 Correct 1 ms 440 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 14 ms 1472 KB Output is correct
35 Correct 2 ms 496 KB Output is correct
36 Correct 20 ms 852 KB Output is correct
37 Correct 2 ms 460 KB Output is correct
38 Correct 3 ms 492 KB Output is correct
39 Correct 16 ms 1612 KB Output is correct
40 Correct 0 ms 432 KB Output is correct
41 Correct 12 ms 1016 KB Output is correct
42 Correct 9 ms 1628 KB Output is correct
43 Correct 12 ms 1360 KB Output is correct
44 Correct 14 ms 1324 KB Output is correct
45 Correct 12 ms 1356 KB Output is correct
46 Correct 21 ms 2124 KB Output is correct
47 Correct 13 ms 1020 KB Output is correct
48 Correct 6 ms 1748 KB Output is correct
49 Correct 19 ms 1368 KB Output is correct
50 Correct 0 ms 440 KB Output is correct
51 Correct 13 ms 1244 KB Output is correct
52 Correct 25 ms 1624 KB Output is correct
53 Correct 3 ms 952 KB Output is correct
54 Correct 13 ms 952 KB Output is correct
55 Correct 26 ms 2420 KB Output is correct
56 Correct 1 ms 432 KB Output is correct
57 Correct 6 ms 1276 KB Output is correct
58 Correct 5 ms 792 KB Output is correct
59 Correct 10 ms 1588 KB Output is correct
60 Correct 14 ms 1556 KB Output is correct
61 Correct 2 ms 720 KB Output is correct
62 Correct 3 ms 752 KB Output is correct
63 Correct 2 ms 716 KB Output is correct
64 Correct 2 ms 492 KB Output is correct
65 Correct 1 ms 436 KB Output is correct
66 Correct 3 ms 716 KB Output is correct
67 Correct 1 ms 692 KB Output is correct
68 Correct 2 ms 460 KB Output is correct
69 Correct 2 ms 468 KB Output is correct
70 Correct 1 ms 436 KB Output is correct
71 Correct 22 ms 1632 KB Output is correct
72 Correct 2 ms 708 KB Output is correct
73 Correct 22 ms 1680 KB Output is correct
74 Correct 27 ms 2324 KB Output is correct
75 Correct 3 ms 748 KB Output is correct
76 Correct 22 ms 1556 KB Output is correct
77 Correct 21 ms 1200 KB Output is correct
78 Correct 2 ms 688 KB Output is correct
79 Correct 10 ms 1500 KB Output is correct
80 Correct 29 ms 1476 KB Output is correct
81 Correct 22 ms 1616 KB Output is correct
82 Correct 29 ms 1908 KB Output is correct
83 Correct 4 ms 696 KB Output is correct
84 Correct 16 ms 1460 KB Output is correct
85 Correct 21 ms 1400 KB Output is correct
86 Correct 2 ms 432 KB Output is correct
87 Correct 1 ms 436 KB Output is correct
88 Correct 2 ms 692 KB Output is correct
89 Correct 2 ms 692 KB Output is correct
90 Correct 2 ms 688 KB Output is correct
91 Correct 2 ms 464 KB Output is correct
92 Correct 3 ms 688 KB Output is correct
93 Correct 4 ms 728 KB Output is correct
94 Correct 4 ms 748 KB Output is correct
95 Correct 3 ms 1256 KB Output is correct
96 Correct 4 ms 460 KB Output is correct
97 Correct 2 ms 460 KB Output is correct