oj.uz

Submission #786204

# Submission time Handle Problem Language Result Execution time Memory
786204 2023-07-18T05:16:58 Z Khizri The Big Prize (IOI17_prize) C++17
99.98 / 100
 47 ms 3612 KB 
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define F first
#define S second
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int mxn=2e5+5;
int n,l[mxn],r[mxn],color[mxn],tree[mxn],p[mxn];
void update(int idx,int val){
    while(idx<=n){
        tree[idx]+=val;
        idx+=(idx&(-idx));
    }
}
int query(int l,int r){
    if(l!=1){
        return query(1,r)-query(1,l-1);
    }
    int idx=r;
    int ans=0;
    while(idx>0){
        ans+=tree[idx];
        idx-=(idx&(-idx));
    }
    return ans;
}
pii funk(int idx){
    int l=idx,r=idx;
    while(l>0&&p[l]==1) l--;
    while(r<n&&p[r]==1) r++;
    return {l,r};
}
pii fnd(int idx){
    if(l[idx]!=-1){
        return {l[idx],r[idx]};
    }
    vector<int>res=ask(idx);
    l[idx]=res[0];
    r[idx]=res[1];
    return {res[0],res[1]};
}
int find_best(int N) {
    n=N;
	memset(l,-1,sizeof(l));
	memset(r,-1,sizeof(r));
	int qq=448;
	int mx=0;
	while(qq--){
        int idx=rng()%n;
        if(l[idx]!=-1){
            qq++;
            continue;
        }
        vector<int> res = ask(idx);
        l[idx]=res[0];
        r[idx]=res[1];
        if(l[idx]+r[idx]==0) return idx;
        mx=max(mx,l[idx]+r[idx]);
	}
	for(int i=0;i<n;i++){
        if(l[i]!=-1&&l[i]+r[i]<mx){
            //p[i]=1;
        }
	}
	int cnt=mx;
	int qw=cnt;
	int blk=512;
	int x=0,y=blk-1;
	while(x<n){
        if(y>=n) y=n-1;
        qw=cnt;
        while(cnt>0&&qw--){
            int l=x,r=y;
            while(l<=r){
                int m=(l+r)/2;
                pii ppp=funk(m);
                int a=ppp.F,b=ppp.S;
                if(a<l&&b>r) break;
                if(a>=l&&b<=r){
                    if(abs(a-m)<abs(b-m)){
                        m=a;
                    }
                    else{
                        m=b;
                    }
                }
                else if(a>=l){
                    m=a;
                }
                else{
                    m=b;
                }
                if(fnd(m).F+fnd(m).S<mx){
                    cnt--;
                    update(m+1,1);
                    if(fnd(m).F+fnd(m).S==0) return m;
                    p[m]=1;
                    break;
                }
                if(fnd(m).F-query(1,m)>0){
                    r=m-1;
                }
                else if(fnd(m).S-fnd(funk(y).F).S-query(m+1,funk(y).F+1)>0){
                    l=m+1;
                }
                else{
                    break;
                }
            }
        }
        x+=blk;
        y+=blk;
	}

}

Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:124:1: warning: control reaches end of non-void function [-Wreturn-type]
  124 | }
      | ^

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1868 KB Output is correct
2 Correct 6 ms 1792 KB Output is correct
3 Correct 4 ms 1856 KB Output is correct
4 Correct 8 ms 1860 KB Output is correct
5 Correct 4 ms 1872 KB Output is correct
6 Correct 4 ms 1876 KB Output is correct
7 Correct 4 ms 1864 KB Output is correct
8 Correct 8 ms 1860 KB Output is correct
9 Correct 7 ms 1872 KB Output is correct
10 Correct 10 ms 1888 KB Output is correct

Subtask #2
79.98 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1872 KB Output is correct
2 Correct 8 ms 1876 KB Output is correct
3 Correct 5 ms 1884 KB Output is correct
4 Correct 6 ms 1876 KB Output is correct
5 Correct 8 ms 1848 KB Output is correct
6 Correct 6 ms 1964 KB Output is correct
7 Correct 8 ms 1872 KB Output is correct
8 Correct 6 ms 1844 KB Output is correct
9 Correct 9 ms 1872 KB Output is correct
10 Correct 8 ms 1872 KB Output is correct
11 Correct 9 ms 1964 KB Output is correct
12 Correct 6 ms 1872 KB Output is correct
13 Correct 13 ms 2208 KB Output is correct
14 Correct 6 ms 1872 KB Output is correct
15 Correct 5 ms 1976 KB Output is correct
16 Correct 29 ms 3128 KB Output is correct
17 Correct 3 ms 1872 KB Output is correct
18 Correct 44 ms 3308 KB Output is correct
19 Correct 5 ms 1832 KB Output is correct
20 Correct 14 ms 2088 KB Output is correct
21 Correct 14 ms 2424 KB Output is correct
22 Correct 5 ms 2000 KB Output is correct
23 Correct 5 ms 1856 KB Output is correct
24 Correct 3 ms 1884 KB Output is correct
25 Correct 12 ms 2676 KB Output is correct
26 Correct 12 ms 2676 KB Output is correct
27 Correct 7 ms 1884 KB Output is correct
28 Correct 28 ms 3212 KB Output is correct
29 Correct 16 ms 3000 KB Output is correct
30 Correct 19 ms 3384 KB Output is correct
31 Correct 4 ms 1844 KB Output is correct
32 Correct 5 ms 2148 KB Output is correct
33 Correct 1 ms 1744 KB Output is correct
34 Correct 16 ms 2248 KB Output is correct
35 Correct 10 ms 1964 KB Output is correct
36 Correct 13 ms 2124 KB Output is correct
37 Correct 6 ms 1872 KB Output is correct
38 Correct 5 ms 1848 KB Output is correct
39 Correct 14 ms 2476 KB Output is correct
40 Correct 23 ms 3312 KB Output is correct
41 Correct 28 ms 2712 KB Output is correct
42 Correct 13 ms 2628 KB Output is correct
43 Correct 13 ms 2660 KB Output is correct
44 Correct 12 ms 2372 KB Output is correct
45 Correct 8 ms 2340 KB Output is correct
46 Correct 4 ms 1872 KB Output is correct
47 Correct 23 ms 2440 KB Output is correct
48 Correct 30 ms 2968 KB Output is correct
49 Correct 5 ms 1924 KB Output is correct
50 Correct 42 ms 3404 KB Output is correct
51 Correct 11 ms 2376 KB Output is correct
52 Correct 5 ms 1872 KB Output is correct
53 Correct 7 ms 1996 KB Output is correct
54 Correct 10 ms 2516 KB Output is correct
55 Correct 5 ms 1848 KB Output is correct
56 Correct 32 ms 3368 KB Output is correct
57 Correct 19 ms 2912 KB Output is correct
58 Correct 34 ms 2948 KB Output is correct
59 Correct 28 ms 2636 KB Output is correct
60 Correct 12 ms 2680 KB Output is correct
61 Correct 11 ms 1960 KB Output is correct
62 Correct 5 ms 1872 KB Output is correct
63 Correct 11 ms 1880 KB Output is correct
64 Correct 5 ms 1872 KB Output is correct
65 Correct 11 ms 1876 KB Output is correct
66 Correct 14 ms 1840 KB Output is correct
67 Correct 16 ms 1832 KB Output is correct
68 Correct 6 ms 1844 KB Output is correct
69 Correct 12 ms 1876 KB Output is correct
70 Correct 13 ms 1872 KB Output is correct
71 Partially correct 43 ms 3612 KB Partially correct - number of queries: 5002
72 Correct 14 ms 2292 KB Output is correct
73 Correct 44 ms 3380 KB Output is correct
74 Correct 47 ms 3400 KB Output is correct
75 Correct 14 ms 1988 KB Output is correct
76 Correct 24 ms 3304 KB Output is correct
77 Correct 36 ms 3404 KB Output is correct
78 Correct 11 ms 2228 KB Output is correct
79 Correct 23 ms 3216 KB Output is correct
80 Correct 41 ms 3292 KB Output is correct
81 Correct 42 ms 3400 KB Output is correct
82 Correct 41 ms 3412 KB Output is correct
83 Correct 7 ms 2032 KB Output is correct
84 Correct 36 ms 3324 KB Output is correct
85 Correct 30 ms 3380 KB Output is correct
86 Correct 36 ms 3244 KB Output is correct
87 Correct 6 ms 2000 KB Output is correct
88 Correct 17 ms 2860 KB Output is correct
89 Correct 24 ms 2864 KB Output is correct
90 Correct 6 ms 1924 KB Output is correct
91 Correct 15 ms 2920 KB Output is correct
92 Correct 29 ms 2916 KB Output is correct
93 Correct 25 ms 3144 KB Output is correct
94 Correct 41 ms 3276 KB Output is correct
95 Correct 24 ms 3272 KB Output is correct
96 Correct 39 ms 3236 KB Output is correct
97 Correct 26 ms 3304 KB Output is correct