oj.uz

Submission #782126

# Submission time Handle Problem Language Result Execution time Memory
782126 2023-07-13T15:29:56 Z Khizri The Big Prize (IOI17_prize) C++17
97.22 / 100
 47 ms 3404 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 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]};
}
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};
}
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]);
	}
	int cnt=mx;
	int qw=cnt;
	int blk=90000;
	int x=0,y=blk-1;
	while(x<n){
        if(y>n) y=n;
        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{
                    l=m+1;
                }
            }
        }
        x+=blk;
        y+=blk;
	}
	
}

Compilation message

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

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1872 KB Output is correct
2 Correct 2 ms 1872 KB Output is correct
3 Correct 4 ms 1848 KB Output is correct
4 Correct 4 ms 1872 KB Output is correct
5 Correct 5 ms 1872 KB Output is correct
6 Correct 3 ms 1876 KB Output is correct
7 Correct 3 ms 1904 KB Output is correct
8 Correct 3 ms 1876 KB Output is correct
9 Correct 3 ms 1872 KB Output is correct
10 Correct 7 ms 1876 KB Output is correct

Subtask #2
77.22 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1872 KB Output is correct
2 Correct 5 ms 1872 KB Output is correct
3 Correct 4 ms 1844 KB Output is correct
4 Correct 5 ms 1872 KB Output is correct
5 Correct 4 ms 1872 KB Output is correct
6 Correct 4 ms 1872 KB Output is correct
7 Correct 3 ms 1904 KB Output is correct
8 Correct 6 ms 1840 KB Output is correct
9 Correct 5 ms 1876 KB Output is correct
10 Correct 10 ms 1872 KB Output is correct
11 Correct 5 ms 2080 KB Output is correct
12 Correct 4 ms 1852 KB Output is correct
13 Correct 5 ms 2276 KB Output is correct
14 Correct 5 ms 1872 KB Output is correct
15 Correct 5 ms 2052 KB Output is correct
16 Correct 26 ms 3112 KB Output is correct
17 Correct 6 ms 1864 KB Output is correct
18 Correct 29 ms 3376 KB Output is correct
19 Correct 2 ms 1876 KB Output is correct
20 Correct 6 ms 2180 KB Output is correct
21 Correct 18 ms 2384 KB Output is correct
22 Correct 4 ms 1920 KB Output is correct
23 Correct 3 ms 1864 KB Output is correct
24 Correct 5 ms 1844 KB Output is correct
25 Correct 10 ms 2688 KB Output is correct
26 Correct 10 ms 2660 KB Output is correct
27 Correct 4 ms 1872 KB Output is correct
28 Correct 17 ms 3196 KB Output is correct
29 Correct 20 ms 2992 KB Output is correct
30 Correct 30 ms 3336 KB Output is correct
31 Correct 5 ms 1868 KB Output is correct
32 Correct 4 ms 2208 KB Output is correct
33 Correct 2 ms 1872 KB Output is correct
34 Correct 14 ms 2252 KB Output is correct
35 Correct 3 ms 1980 KB Output is correct
36 Correct 13 ms 2108 KB Output is correct
37 Correct 5 ms 1964 KB Output is correct
38 Correct 3 ms 1880 KB Output is correct
39 Correct 21 ms 2456 KB Output is correct
40 Correct 22 ms 3368 KB Output is correct
41 Correct 11 ms 2676 KB Output is correct
42 Correct 16 ms 2732 KB Output is correct
43 Correct 21 ms 2568 KB Output is correct
44 Correct 8 ms 2364 KB Output is correct
45 Correct 7 ms 2272 KB Output is correct
46 Correct 3 ms 1872 KB Output is correct
47 Correct 13 ms 2376 KB Output is correct
48 Correct 15 ms 2880 KB Output is correct
49 Correct 9 ms 1872 KB Output is correct
50 Correct 46 ms 3356 KB Output is correct
51 Correct 14 ms 2436 KB Output is correct
52 Correct 3 ms 1876 KB Output is correct
53 Correct 3 ms 1956 KB Output is correct
54 Correct 11 ms 2484 KB Output is correct
55 Correct 5 ms 1844 KB Output is correct
56 Correct 39 ms 3296 KB Output is correct
57 Correct 28 ms 2872 KB Output is correct
58 Correct 19 ms 2872 KB Output is correct
59 Correct 26 ms 2728 KB Output is correct
60 Correct 18 ms 2628 KB Output is correct
61 Correct 10 ms 1896 KB Output is correct
62 Correct 3 ms 1844 KB Output is correct
63 Correct 3 ms 1972 KB Output is correct
64 Correct 3 ms 1952 KB Output is correct
65 Correct 5 ms 1840 KB Output is correct
66 Correct 5 ms 1896 KB Output is correct
67 Correct 6 ms 1840 KB Output is correct
68 Correct 4 ms 1904 KB Output is correct
69 Correct 7 ms 1960 KB Output is correct
70 Correct 4 ms 1904 KB Output is correct
71 Partially correct 38 ms 3344 KB Partially correct - number of queries: 5278
72 Correct 7 ms 2256 KB Output is correct
73 Partially correct 46 ms 3388 KB Partially correct - number of queries: 5212
74 Partially correct 45 ms 3400 KB Partially correct - number of queries: 5243
75 Correct 7 ms 1872 KB Output is correct
76 Correct 37 ms 3372 KB Output is correct
77 Correct 38 ms 3308 KB Output is correct
78 Correct 9 ms 2288 KB Output is correct
79 Correct 15 ms 3268 KB Output is correct
80 Correct 31 ms 3304 KB Output is correct
81 Correct 42 ms 3404 KB Output is correct
82 Correct 34 ms 3356 KB Output is correct
83 Correct 5 ms 1872 KB Output is correct
84 Correct 37 ms 3292 KB Output is correct
85 Correct 47 ms 3400 KB Output is correct
86 Correct 18 ms 3040 KB Output is correct
87 Correct 6 ms 2228 KB Output is correct
88 Correct 34 ms 3260 KB Output is correct
89 Correct 19 ms 2752 KB Output is correct
90 Correct 4 ms 1876 KB Output is correct
91 Correct 4 ms 1872 KB Output is correct
92 Correct 12 ms 2680 KB Output is correct
93 Correct 33 ms 3208 KB Output is correct
94 Correct 24 ms 3328 KB Output is correct
95 Correct 24 ms 3172 KB Output is correct
96 Correct 45 ms 3272 KB Output is correct
97 Correct 22 ms 3184 KB Output is correct