oj.uz

Submission #786200

# Submission time Handle Problem Language Result Execution time Memory
786200 2023-07-18T05:15:55 Z Khizri The Big Prize (IOI17_prize) C++17
99.95 / 100
 55 ms 3400 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=450;
	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=511;
	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 1872 KB Output is correct
2 Correct 7 ms 1872 KB Output is correct
3 Correct 8 ms 1872 KB Output is correct
4 Correct 15 ms 1860 KB Output is correct
5 Correct 6 ms 1876 KB Output is correct
6 Correct 4 ms 1872 KB Output is correct
7 Correct 5 ms 1836 KB Output is correct
8 Correct 7 ms 1840 KB Output is correct
9 Correct 5 ms 1840 KB Output is correct
10 Correct 8 ms 1872 KB Output is correct

Subtask #2
79.95 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1856 KB Output is correct
2 Correct 7 ms 1868 KB Output is correct
3 Correct 8 ms 1840 KB Output is correct
4 Correct 11 ms 1848 KB Output is correct
5 Correct 8 ms 1872 KB Output is correct
6 Correct 5 ms 1864 KB Output is correct
7 Correct 8 ms 1852 KB Output is correct
8 Correct 7 ms 1876 KB Output is correct
9 Correct 6 ms 1840 KB Output is correct
10 Correct 4 ms 1876 KB Output is correct
11 Correct 9 ms 1984 KB Output is correct
12 Correct 4 ms 1856 KB Output is correct
13 Correct 13 ms 2300 KB Output is correct
14 Correct 5 ms 1876 KB Output is correct
15 Correct 13 ms 2028 KB Output is correct
16 Correct 37 ms 3120 KB Output is correct
17 Correct 4 ms 1864 KB Output is correct
18 Correct 52 ms 3368 KB Output is correct
19 Correct 4 ms 1848 KB Output is correct
20 Correct 10 ms 2040 KB Output is correct
21 Correct 17 ms 2380 KB Output is correct
22 Correct 5 ms 1968 KB Output is correct
23 Correct 4 ms 1844 KB Output is correct
24 Correct 4 ms 1872 KB Output is correct
25 Correct 26 ms 2604 KB Output is correct
26 Correct 32 ms 2624 KB Output is correct
27 Correct 7 ms 1864 KB Output is correct
28 Correct 38 ms 3276 KB Output is correct
29 Correct 22 ms 2976 KB Output is correct
30 Correct 34 ms 3400 KB Output is correct
31 Correct 6 ms 1840 KB Output is correct
32 Correct 9 ms 2124 KB Output is correct
33 Correct 1 ms 1872 KB Output is correct
34 Correct 19 ms 2244 KB Output is correct
35 Correct 6 ms 1960 KB Output is correct
36 Correct 14 ms 2188 KB Output is correct
37 Correct 6 ms 1856 KB Output is correct
38 Correct 5 ms 1872 KB Output is correct
39 Correct 21 ms 2560 KB Output is correct
40 Correct 30 ms 3356 KB Output is correct
41 Correct 26 ms 2744 KB Output is correct
42 Correct 27 ms 2704 KB Output is correct
43 Correct 23 ms 2672 KB Output is correct
44 Correct 20 ms 2356 KB Output is correct
45 Correct 14 ms 2280 KB Output is correct
46 Correct 6 ms 1856 KB Output is correct
47 Correct 25 ms 2460 KB Output is correct
48 Correct 33 ms 2924 KB Output is correct
49 Correct 9 ms 1856 KB Output is correct
50 Correct 36 ms 3392 KB Output is correct
51 Correct 21 ms 2344 KB Output is correct
52 Correct 4 ms 1856 KB Output is correct
53 Correct 12 ms 1984 KB Output is correct
54 Correct 21 ms 2428 KB Output is correct
55 Correct 5 ms 1844 KB Output is correct
56 Correct 37 ms 3340 KB Output is correct
57 Correct 30 ms 2928 KB Output is correct
58 Correct 33 ms 2864 KB Output is correct
59 Correct 35 ms 2728 KB Output is correct
60 Correct 29 ms 2608 KB Output is correct
61 Correct 10 ms 2000 KB Output is correct
62 Correct 4 ms 1872 KB Output is correct
63 Correct 5 ms 1960 KB Output is correct
64 Correct 8 ms 1900 KB Output is correct
65 Correct 12 ms 1832 KB Output is correct
66 Correct 18 ms 1840 KB Output is correct
67 Correct 20 ms 1836 KB Output is correct
68 Correct 7 ms 1836 KB Output is correct
69 Correct 23 ms 1872 KB Output is correct
70 Correct 12 ms 1840 KB Output is correct
71 Partially correct 41 ms 3344 KB Partially correct - number of queries: 5005
72 Correct 12 ms 2248 KB Output is correct
73 Correct 55 ms 3324 KB Output is correct
74 Correct 38 ms 3400 KB Output is correct
75 Correct 9 ms 1972 KB Output is correct
76 Correct 30 ms 3384 KB Output is correct
77 Correct 34 ms 3352 KB Output is correct
78 Correct 14 ms 2212 KB Output is correct
79 Correct 15 ms 3164 KB Output is correct
80 Correct 50 ms 3328 KB Output is correct
81 Correct 29 ms 3364 KB Output is correct
82 Correct 26 ms 3364 KB Output is correct
83 Correct 9 ms 1928 KB Output is correct
84 Correct 36 ms 3400 KB Output is correct
85 Correct 33 ms 3384 KB Output is correct
86 Correct 36 ms 3272 KB Output is correct
87 Correct 12 ms 2112 KB Output is correct
88 Correct 32 ms 3228 KB Output is correct
89 Correct 17 ms 2328 KB Output is correct
90 Correct 5 ms 1872 KB Output is correct
91 Correct 19 ms 2796 KB Output is correct
92 Correct 40 ms 3144 KB Output is correct
93 Correct 39 ms 3200 KB Output is correct
94 Correct 23 ms 3328 KB Output is correct
95 Correct 37 ms 3240 KB Output is correct
96 Correct 34 ms 3200 KB Output is correct
97 Correct 33 ms 3164 KB Output is correct