oj.uz

답안 #786215

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
786215 2023-07-18T05:22:15 Z Khizri 커다란 상품 (IOI17_prize) C++17
20 / 100
 1000 ms 3380 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=256;
	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

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 1844 KB Output is correct
2 Correct 13 ms 1856 KB Output is correct
3 Correct 11 ms 1856 KB Output is correct
4 Correct 18 ms 1840 KB Output is correct
5 Correct 14 ms 1868 KB Output is correct
6 Correct 5 ms 1868 KB Output is correct
7 Correct 10 ms 1840 KB Output is correct
8 Correct 11 ms 1872 KB Output is correct
9 Correct 11 ms 1872 KB Output is correct
10 Correct 12 ms 1744 KB Output is correct

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 1876 KB Output is correct
2 Correct 15 ms 1872 KB Output is correct
3 Correct 13 ms 1860 KB Output is correct
4 Correct 15 ms 1836 KB Output is correct
5 Correct 9 ms 1864 KB Output is correct
6 Correct 4 ms 1876 KB Output is correct
7 Correct 9 ms 1876 KB Output is correct
8 Correct 12 ms 1872 KB Output is correct
9 Correct 8 ms 1860 KB Output is correct
10 Correct 16 ms 1872 KB Output is correct
11 Correct 11 ms 2044 KB Output is correct
12 Correct 5 ms 1880 KB Output is correct
13 Correct 20 ms 2196 KB Output is correct
14 Correct 7 ms 1876 KB Output is correct
15 Correct 10 ms 2076 KB Output is correct
16 Correct 39 ms 3080 KB Output is correct
17 Correct 6 ms 1828 KB Output is correct
18 Correct 45 ms 3372 KB Output is correct
19 Correct 5 ms 1872 KB Output is correct
20 Correct 12 ms 2148 KB Output is correct
21 Correct 22 ms 2312 KB Output is correct
22 Correct 9 ms 1996 KB Output is correct
23 Correct 7 ms 1844 KB Output is correct
24 Correct 5 ms 1864 KB Output is correct
25 Correct 27 ms 2656 KB Output is correct
26 Correct 26 ms 2572 KB Output is correct
27 Correct 9 ms 1856 KB Output is correct
28 Correct 42 ms 3244 KB Output is correct
29 Correct 28 ms 2992 KB Output is correct
30 Correct 45 ms 3380 KB Output is correct
31 Correct 4 ms 1848 KB Output is correct
32 Correct 17 ms 2148 KB Output is correct
33 Correct 2 ms 1872 KB Output is correct
34 Correct 18 ms 2272 KB Output is correct
35 Correct 9 ms 1980 KB Output is correct
36 Correct 12 ms 2124 KB Output is correct
37 Correct 6 ms 1872 KB Output is correct
38 Correct 4 ms 1840 KB Output is correct
39 Correct 21 ms 2500 KB Output is correct
40 Correct 40 ms 3368 KB Output is correct
41 Correct 22 ms 2748 KB Output is correct
42 Correct 29 ms 2640 KB Output is correct
43 Correct 28 ms 2664 KB Output is correct
44 Correct 21 ms 2508 KB Output is correct
45 Correct 23 ms 2220 KB Output is correct
46 Correct 4 ms 1840 KB Output is correct
47 Correct 24 ms 2380 KB Output is correct
48 Correct 28 ms 2856 KB Output is correct
49 Correct 7 ms 1876 KB Output is correct
50 Correct 43 ms 3328 KB Output is correct
51 Correct 29 ms 2348 KB Output is correct
52 Correct 3 ms 1872 KB Output is correct
53 Correct 17 ms 1988 KB Output is correct
54 Correct 22 ms 2492 KB Output is correct
55 Correct 4 ms 1840 KB Output is correct
56 Correct 54 ms 3380 KB Output is correct
57 Correct 28 ms 2860 KB Output is correct
58 Correct 34 ms 2984 KB Output is correct
59 Correct 30 ms 2736 KB Output is correct
60 Correct 31 ms 2588 KB Output is correct
61 Correct 15 ms 1924 KB Output is correct
62 Correct 6 ms 1836 KB Output is correct
63 Correct 11 ms 1964 KB Output is correct
64 Correct 11 ms 1864 KB Output is correct
65 Correct 18 ms 1836 KB Output is correct
66 Correct 32 ms 1872 KB Output is correct
67 Correct 30 ms 1856 KB Output is correct
68 Execution timed out 3044 ms 1876 KB Time limit exceeded
69 Halted 0 ms 0 KB -