oj.uz

답안 #945078

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
945078 2024-03-13T11:32:52 Z Wansur 커다란 상품 (IOI17_prize) C++14
95.09 / 100
 28 ms 6748 KB 
#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>>1, cnt=0;
    for(int x=0;mid-x>=l || mid+x<=r;x++){
        if(mid+x<=r){
            auto a=Ask(mid+x);
            if(a[0]+a[1]==ma){
                int val=find(mid+x+1, r, a[1]-right, a[0], right);
                if(val!=-1)return val;
                val=find(l, mid - x - (x==0), a[0] - cnt - left, left, a[1] + cnt);
                return val;
            }
            if(a[0]+a[1]==0){
                return mid+x;
            }
            cnt++;
        }
        if(mid-x>=l){
            auto a=Ask(mid-x);
            if(a[0]+a[1]==ma){
                int val=find(l, mid-x-1, a[0]-left, left, a[1]);
                if(val!=-1)return val;
                val=find(mid+x+1, r, a[1] - cnt - right, a[0] + cnt, right);
                return val;
            }
            if(a[0]+a[1]==0){
                return mid-x;
            }
            cnt++;
        }
    }
    return -1;
}

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

Compilation message

prize.cpp: In function 'int find(int, int, int, int, int)':
prize.cpp:35:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   35 |     int mid=l+r>>1, cnt=0;
      |             ~^~
prize.cpp: In function 'int find_best(int)':
prize.cpp:68:9: warning: unused variable 'pos' [-Wunused-variable]
   68 |     int pos=0, c=0;
      |         ^~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5392 KB Output is correct
2 Correct 4 ms 5392 KB Output is correct
3 Correct 4 ms 5644 KB Output is correct
4 Correct 3 ms 5388 KB Output is correct
5 Correct 3 ms 5396 KB Output is correct
6 Correct 1 ms 4952 KB Output is correct
7 Correct 3 ms 5388 KB Output is correct
8 Correct 4 ms 5392 KB Output is correct
9 Correct 3 ms 5648 KB Output is correct
10 Correct 3 ms 5400 KB Output is correct

Subtask #2
75.09 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5400 KB Output is correct
2 Correct 4 ms 5388 KB Output is correct
3 Correct 3 ms 5392 KB Output is correct
4 Correct 4 ms 5396 KB Output is correct
5 Correct 3 ms 5392 KB Output is correct
6 Correct 1 ms 4952 KB Output is correct
7 Correct 3 ms 5400 KB Output is correct
8 Correct 4 ms 5396 KB Output is correct
9 Correct 4 ms 5648 KB Output is correct
10 Correct 4 ms 5144 KB Output is correct
11 Correct 5 ms 5660 KB Output is correct
12 Correct 5 ms 5664 KB Output is correct
13 Correct 4 ms 5144 KB Output is correct
14 Correct 6 ms 5652 KB Output is correct
15 Correct 26 ms 5752 KB Output is correct
16 Correct 6 ms 5916 KB Output is correct
17 Correct 3 ms 5396 KB Output is correct
18 Correct 5 ms 5384 KB Output is correct
19 Correct 3 ms 5396 KB Output is correct
20 Correct 11 ms 5472 KB Output is correct
21 Correct 21 ms 5952 KB Output is correct
22 Correct 22 ms 5460 KB Output is correct
23 Correct 4 ms 5396 KB Output is correct
24 Correct 5 ms 5664 KB Output is correct
25 Correct 12 ms 5672 KB Output is correct
26 Correct 14 ms 5684 KB Output is correct
27 Correct 3 ms 5396 KB Output is correct
28 Correct 4 ms 5156 KB Output is correct
29 Correct 5 ms 5656 KB Output is correct
30 Correct 3 ms 5396 KB Output is correct
31 Correct 3 ms 5392 KB Output is correct
32 Correct 4 ms 5404 KB Output is correct
33 Correct 1 ms 4952 KB Output is correct
34 Correct 19 ms 5880 KB Output is correct
35 Correct 5 ms 5904 KB Output is correct
36 Correct 20 ms 5720 KB Output is correct
37 Correct 4 ms 5408 KB Output is correct
38 Correct 4 ms 5152 KB Output is correct
39 Correct 14 ms 5956 KB Output is correct
40 Correct 3 ms 5396 KB Output is correct
41 Correct 15 ms 6200 KB Output is correct
42 Correct 15 ms 5664 KB Output is correct
43 Correct 12 ms 5440 KB Output is correct
44 Correct 17 ms 6184 KB Output is correct
45 Correct 18 ms 5928 KB Output is correct
46 Correct 4 ms 5140 KB Output is correct
47 Correct 14 ms 5404 KB Output is correct
48 Correct 10 ms 5400 KB Output is correct
49 Partially correct 22 ms 6508 KB Partially correct - number of queries: 5061
50 Correct 4 ms 5644 KB Output is correct
51 Correct 23 ms 5716 KB Output is correct
52 Partially correct 27 ms 5756 KB Partially correct - number of queries: 5384
53 Correct 5 ms 5144 KB Output is correct
54 Correct 24 ms 5648 KB Output is correct
55 Correct 3 ms 5144 KB Output is correct
56 Correct 4 ms 5396 KB Output is correct
57 Correct 9 ms 5932 KB Output is correct
58 Correct 9 ms 5920 KB Output is correct
59 Correct 14 ms 5944 KB Output is correct
60 Correct 18 ms 5668 KB Output is correct
61 Correct 3 ms 5148 KB Output is correct
62 Correct 4 ms 5396 KB Output is correct
63 Correct 4 ms 5648 KB Output is correct
64 Correct 3 ms 5144 KB Output is correct
65 Correct 4 ms 5388 KB Output is correct
66 Correct 5 ms 5136 KB Output is correct
67 Correct 4 ms 5140 KB Output is correct
68 Correct 3 ms 5396 KB Output is correct
69 Correct 5 ms 5660 KB Output is correct
70 Correct 4 ms 5904 KB Output is correct
71 Partially correct 24 ms 5688 KB Partially correct - number of queries: 5249
72 Correct 5 ms 5152 KB Output is correct
73 Partially correct 25 ms 5668 KB Partially correct - number of queries: 5186
74 Partially correct 23 ms 6000 KB Partially correct - number of queries: 5213
75 Correct 4 ms 5400 KB Output is correct
76 Correct 20 ms 6248 KB Output is correct
77 Partially correct 28 ms 6748 KB Partially correct - number of queries: 5480
78 Correct 5 ms 5904 KB Output is correct
79 Correct 19 ms 5908 KB Output is correct
80 Partially correct 25 ms 5700 KB Partially correct - number of queries: 5491
81 Partially correct 27 ms 5652 KB Partially correct - number of queries: 5489
82 Partially correct 22 ms 6412 KB Partially correct - number of queries: 5459
83 Correct 4 ms 5392 KB Output is correct
84 Correct 22 ms 5932 KB Output is correct
85 Partially correct 24 ms 5900 KB Partially correct - number of queries: 5471
86 Correct 3 ms 5396 KB Output is correct
87 Correct 3 ms 5140 KB Output is correct
88 Correct 6 ms 5396 KB Output is correct
89 Correct 4 ms 5644 KB Output is correct
90 Correct 3 ms 5392 KB Output is correct
91 Correct 4 ms 5392 KB Output is correct
92 Correct 4 ms 5648 KB Output is correct
93 Correct 4 ms 5656 KB Output is correct
94 Correct 5 ms 5652 KB Output is correct
95 Correct 4 ms 5656 KB Output is correct
96 Correct 5 ms 5152 KB Output is correct
97 Correct 3 ms 5904 KB Output is correct