oj.uz

Submission #786157

# Submission time Handle Problem Language Result Execution time Memory
786157 2023-07-18T05:00:12 Z Khizri The Big Prize (IOI17_prize) C++17
20 / 100
 39 ms 3304 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=500;
	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;
                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 1908 KB Output is correct
2 Correct 3 ms 1880 KB Output is correct
3 Correct 3 ms 1876 KB Output is correct
4 Correct 12 ms 1860 KB Output is correct
5 Correct 3 ms 1876 KB Output is correct
6 Correct 1 ms 1872 KB Output is correct
7 Correct 4 ms 1884 KB Output is correct
8 Correct 6 ms 1872 KB Output is correct
9 Correct 6 ms 1872 KB Output is correct
10 Correct 8 ms 1872 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1840 KB Output is correct
2 Correct 3 ms 1880 KB Output is correct
3 Correct 5 ms 1876 KB Output is correct
4 Correct 5 ms 1880 KB Output is correct
5 Correct 3 ms 1880 KB Output is correct
6 Correct 1 ms 1872 KB Output is correct
7 Correct 5 ms 1840 KB Output is correct
8 Correct 6 ms 1872 KB Output is correct
9 Correct 3 ms 1884 KB Output is correct
10 Correct 10 ms 1872 KB Output is correct
11 Correct 3 ms 2056 KB Output is correct
12 Correct 1 ms 1868 KB Output is correct
13 Correct 13 ms 2252 KB Output is correct
14 Correct 3 ms 1908 KB Output is correct
15 Correct 6 ms 1988 KB Output is correct
16 Correct 18 ms 3084 KB Output is correct
17 Correct 1 ms 1872 KB Output is correct
18 Correct 39 ms 3296 KB Output is correct
19 Correct 1 ms 1840 KB Output is correct
20 Correct 10 ms 2136 KB Output is correct
21 Correct 14 ms 2504 KB Output is correct
22 Correct 5 ms 2000 KB Output is correct
23 Correct 2 ms 1908 KB Output is correct
24 Correct 1 ms 1880 KB Output is correct
25 Correct 24 ms 2604 KB Output is correct
26 Correct 11 ms 2704 KB Output is correct
27 Correct 3 ms 1872 KB Output is correct
28 Correct 35 ms 3244 KB Output is correct
29 Correct 25 ms 2992 KB Output is correct
30 Correct 20 ms 3304 KB Output is correct
31 Correct 1 ms 1848 KB Output is correct
32 Correct 5 ms 2184 KB Output is correct
33 Incorrect 1 ms 1872 KB Integer 100 violates the range [0, 99]
34 Halted 0 ms 0 KB -