oj.uz

답안 #1057280

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1057280 2024-08-13T16:17:12 Z shenfe1 커다란 상품 (IOI17_prize) C++17
20 / 100
 64 ms 2456 KB 
#include <bits/stdc++.h>
#include "prize.h"

using namespace std;

#define pb push_back
#define pii pair<int,int>
#define sz(s) (int)s.size()
#define F first
#define S second
#define all(v) v.begin(),v.end()

const int MAX=2e5+10;

bool use[MAX];
pii res[MAX];
int cq;

pii cnt(int pos){
    if(use[pos])return res[pos];
    use[pos]=1;
    cq++;
    vector<int> v=ask(pos);
    return res[pos]={v[0],v[1]};
}

int sum(int pos){
    pii c=cnt(pos);
    return c.F+c.S;
}

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int rnd(int l,int r){
    return rng()%(r-l+1)+l;
}

int cntMx;

int find_best(int n){
    int init=cq;
    cntMx=0;
    for(int j=0;j<min(n,450);j++){
        cntMx=max(cntMx,sum(j));
        if(sum(j)==0)return j;
    }
    int pref=0;
    for(int j=0;j<min(n,450);j++){
        if(sum(j)!=cntMx)pref++;
    }
    queue<pair<pii,pii>>  q;
    q.push({{450,n-1},{cntMx,pref}});
    while(!q.empty()){
        int l=q.front().F.F,r=q.front().F.S,c=q.front().S.F,pl=q.front().S.S;
        q.pop();
        if(c==0)continue;
        if(c==r-l+1){
            for(int i=l;i<=r;i++){
                if(sum(i)==0)return i;
            }
            continue;
        }
        int tl=(l+r)/2,tr=(l+r)/2;
        while(tl>=l&&sum(tl)!=cntMx){
            if(sum(tl)==0)return tl;
            tl--;
        }
        while(tr<=r&&sum(tr)!=cntMx){
            if(sum(tr)==0)return tr;
            tr++;
        }
        int L=cnt(tl).F-pl;
        int R=c-L-max(0,tr-tl-1);
        // if(L+R!=c){
        //     cout<<l<<" "<<r<<" "<<L<<" "<<R<<"\n";
        // }
        if(l<=tl-1)q.push({{l,tl-1},{L,pl}});
        if(tr+1<=r)q.push({{tr+1,r},{R,cnt(tr).F}});
    }
    return -1;
}

Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:41:9: warning: unused variable 'init' [-Wunused-variable]
   41 |     int init=cq;
      |         ^~~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 3 ms 436 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 600 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 3 ms 344 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 2 ms 680 KB Output is correct
10 Correct 2 ms 344 KB Output is correct

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 344 KB Output is correct
2 Correct 3 ms 344 KB Output is correct
3 Correct 3 ms 456 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 2 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 2 ms 440 KB Output is correct
9 Correct 2 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 6 ms 1112 KB Output is correct
12 Correct 3 ms 1112 KB Output is correct
13 Correct 5 ms 1112 KB Output is correct
14 Correct 7 ms 600 KB Output is correct
15 Correct 6 ms 2276 KB Output is correct
16 Correct 25 ms 2136 KB Output is correct
17 Correct 2 ms 344 KB Output is correct
18 Partially correct 19 ms 2136 KB Partially correct - number of queries: 5046
19 Correct 17 ms 2136 KB Output is correct
20 Correct 13 ms 1112 KB Output is correct
21 Correct 13 ms 2136 KB Output is correct
22 Correct 8 ms 2136 KB Output is correct
23 Correct 2 ms 600 KB Output is correct
24 Correct 5 ms 960 KB Output is correct
25 Correct 12 ms 1948 KB Output is correct
26 Correct 17 ms 2136 KB Output is correct
27 Correct 2 ms 600 KB Output is correct
28 Correct 18 ms 1880 KB Output is correct
29 Correct 23 ms 2136 KB Output is correct
30 Partially correct 20 ms 2136 KB Partially correct - number of queries: 5028
31 Correct 2 ms 344 KB Output is correct
32 Correct 4 ms 1112 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 16 ms 1988 KB Output is correct
35 Correct 2 ms 856 KB Output is correct
36 Correct 17 ms 2136 KB Output is correct
37 Correct 4 ms 856 KB Output is correct
38 Correct 3 ms 600 KB Output is correct
39 Correct 15 ms 2136 KB Output is correct
40 Correct 19 ms 2136 KB Output is correct
41 Correct 25 ms 2136 KB Output is correct
42 Correct 19 ms 2136 KB Output is correct
43 Correct 16 ms 2136 KB Output is correct
44 Correct 19 ms 2136 KB Output is correct
45 Correct 16 ms 1880 KB Output is correct
46 Correct 1 ms 344 KB Output is correct
47 Correct 22 ms 1880 KB Output is correct
48 Correct 18 ms 2456 KB Output is correct
49 Correct 28 ms 1992 KB Output is correct
50 Correct 24 ms 2132 KB Output is correct
51 Correct 13 ms 2136 KB Output is correct
52 Correct 17 ms 2216 KB Output is correct
53 Correct 3 ms 600 KB Output is correct
54 Correct 19 ms 2136 KB Output is correct
55 Correct 2 ms 344 KB Output is correct
56 Correct 17 ms 2136 KB Output is correct
57 Correct 15 ms 2136 KB Output is correct
58 Correct 17 ms 2136 KB Output is correct
59 Correct 17 ms 2136 KB Output is correct
60 Correct 17 ms 2136 KB Output is correct
61 Correct 3 ms 600 KB Output is correct
62 Correct 3 ms 600 KB Output is correct
63 Correct 2 ms 696 KB Output is correct
64 Correct 3 ms 600 KB Output is correct
65 Correct 2 ms 344 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 2 ms 344 KB Output is correct
70 Correct 3 ms 596 KB Output is correct
71 Partially correct 17 ms 2136 KB Partially correct - number of queries: 5209
72 Correct 3 ms 1112 KB Output is correct
73 Partially correct 23 ms 2136 KB Partially correct - number of queries: 5146
74 Partially correct 17 ms 2136 KB Partially correct - number of queries: 5173
75 Correct 4 ms 600 KB Output is correct
76 Correct 12 ms 2136 KB Output is correct
77 Partially correct 19 ms 2136 KB Partially correct - number of queries: 5152
78 Correct 4 ms 1112 KB Output is correct
79 Correct 12 ms 2180 KB Output is correct
80 Partially correct 17 ms 2136 KB Partially correct - number of queries: 5112
81 Partially correct 25 ms 2136 KB Partially correct - number of queries: 5028
82 Partially correct 19 ms 2136 KB Partially correct - number of queries: 5080
83 Correct 2 ms 708 KB Output is correct
84 Correct 12 ms 2136 KB Output is correct
85 Partially correct 22 ms 2136 KB Partially correct - number of queries: 5098
86 Incorrect 64 ms 600 KB Incorrect
87 Halted 0 ms 0 KB -