oj.uz

Submission #786160

# Submission time Handle Problem Language Result Execution time Memory
786160 2023-07-18T05:01:02 Z Khizri The Big Prize (IOI17_prize) C++17
20 / 100
 44 ms 4352 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>r) return 0;
    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=1;
	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=5000;
	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;
                pii pa=fnd(funk(x).S);
                pii pb=fnd(funk(y).F);
                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:84:21: warning: variable 'pa' set but not used [-Wunused-but-set-variable]
   84 |                 pii pa=fnd(funk(x).S);
      |                     ^~
prize.cpp:5:12: warning: variable 'push_back' set but not used [-Wunused-but-set-variable]
    5 | #define pb push_back
      |            ^~~~~~~~~
prize.cpp:85:21: note: in expansion of macro 'pb'
   85 |                 pii pb=fnd(funk(y).F);
      |                     ^~
prize.cpp:122:1: warning: control reaches end of non-void function [-Wreturn-type]
  122 | }
      | ^

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1904 KB Output is correct
2 Correct 2 ms 1876 KB Output is correct
3 Correct 1 ms 1908 KB Output is correct
4 Correct 2 ms 1876 KB Output is correct
5 Correct 2 ms 1872 KB Output is correct
6 Correct 1 ms 1848 KB Output is correct
7 Correct 1 ms 1908 KB Output is correct
8 Correct 1 ms 1908 KB Output is correct
9 Correct 1 ms 1880 KB Output is correct
10 Correct 2 ms 1872 KB Output is correct
11 Correct 3 ms 2000 KB Output is correct
12 Correct 1 ms 1880 KB Output is correct
13 Correct 4 ms 2256 KB Output is correct
14 Correct 2 ms 1872 KB Output is correct
15 Correct 3 ms 2080 KB Output is correct
16 Correct 21 ms 3116 KB Output is correct
17 Correct 1 ms 1872 KB Output is correct
18 Correct 39 ms 3400 KB Output is correct
19 Correct 1 ms 1872 KB Output is correct
20 Correct 5 ms 2172 KB Output is correct
21 Correct 14 ms 2312 KB Output is correct
22 Correct 3 ms 2000 KB Output is correct
23 Correct 1 ms 1872 KB Output is correct
24 Correct 1 ms 1808 KB Output is correct
25 Correct 10 ms 2584 KB Output is correct
26 Correct 21 ms 2656 KB Output is correct
27 Correct 2 ms 1844 KB Output is correct
28 Correct 23 ms 3196 KB Output is correct
29 Correct 12 ms 3076 KB Output is correct
30 Correct 37 ms 3336 KB Output is correct
31 Correct 1 ms 1880 KB Output is correct
32 Correct 3 ms 2096 KB Output is correct
33 Correct 1 ms 1872 KB Output is correct
34 Correct 15 ms 2336 KB Output is correct
35 Correct 3 ms 1932 KB Output is correct
36 Correct 7 ms 2204 KB Output is correct
37 Correct 2 ms 1872 KB Output is correct
38 Correct 1 ms 1868 KB Output is correct
39 Correct 15 ms 2540 KB Output is correct
40 Correct 33 ms 3340 KB Output is correct
41 Correct 20 ms 2696 KB Output is correct
42 Correct 22 ms 2632 KB Output is correct
43 Correct 21 ms 2616 KB Output is correct
44 Correct 19 ms 2344 KB Output is correct
45 Correct 12 ms 2316 KB Output is correct
46 Correct 1 ms 1840 KB Output is correct
47 Correct 17 ms 2444 KB Output is correct
48 Correct 20 ms 2976 KB Output is correct
49 Correct 3 ms 1976 KB Output is correct
50 Correct 35 ms 3308 KB Output is correct
51 Correct 14 ms 2444 KB Output is correct
52 Correct 1 ms 1876 KB Output is correct
53 Correct 3 ms 1972 KB Output is correct
54 Correct 8 ms 2536 KB Output is correct
55 Correct 1 ms 1872 KB Output is correct
56 Correct 29 ms 3288 KB Output is correct
57 Correct 30 ms 2852 KB Output is correct
58 Correct 23 ms 2924 KB Output is correct
59 Correct 24 ms 2848 KB Output is correct
60 Correct 17 ms 2628 KB Output is correct
61 Correct 3 ms 2004 KB Output is correct
62 Correct 1 ms 1836 KB Output is correct
63 Correct 2 ms 1968 KB Output is correct
64 Correct 2 ms 1844 KB Output is correct
65 Correct 2 ms 1896 KB Output is correct
66 Correct 7 ms 1872 KB Output is correct
67 Correct 4 ms 1856 KB Output is correct
68 Correct 3 ms 1872 KB Output is correct
69 Correct 8 ms 1872 KB Output is correct
70 Correct 5 ms 1872 KB Output is correct
71 Correct 34 ms 3324 KB Output is correct
72 Correct 8 ms 2288 KB Output is correct
73 Correct 44 ms 3368 KB Output is correct
74 Correct 43 ms 3312 KB Output is correct
75 Correct 3 ms 1872 KB Output is correct
76 Correct 37 ms 3416 KB Output is correct
77 Correct 32 ms 3300 KB Output is correct
78 Correct 5 ms 2220 KB Output is correct
79 Correct 16 ms 3232 KB Output is correct
80 Correct 30 ms 3340 KB Output is correct
81 Correct 37 ms 3372 KB Output is correct
82 Correct 31 ms 3304 KB Output is correct
83 Correct 3 ms 1976 KB Output is correct
84 Correct 31 ms 3316 KB Output is correct
85 Correct 17 ms 3392 KB Output is correct
86 Runtime error 7 ms 4352 KB Execution killed with signal 11
87 Halted 0 ms 0 KB -