oj.uz

답안 #786153

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
786153 2023-07-18T04:58:56 Z Khizri 커다란 상품 (IOI17_prize) C++17
20 / 100
 104 ms 3740 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-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

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1876 KB Output is correct
2 Correct 6 ms 1860 KB Output is correct
3 Correct 4 ms 1840 KB Output is correct
4 Correct 15 ms 1864 KB Output is correct
5 Correct 9 ms 1852 KB Output is correct
6 Correct 2 ms 1828 KB Output is correct
7 Correct 4 ms 1860 KB Output is correct
8 Correct 7 ms 1852 KB Output is correct
9 Correct 6 ms 1860 KB Output is correct
10 Correct 10 ms 1872 KB Output is correct

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1840 KB Output is correct
2 Correct 5 ms 1844 KB Output is correct
3 Correct 7 ms 1856 KB Output is correct
4 Correct 12 ms 1856 KB Output is correct
5 Correct 4 ms 1848 KB Output is correct
6 Correct 1 ms 1848 KB Output is correct
7 Correct 7 ms 1864 KB Output is correct
8 Correct 3 ms 1840 KB Output is correct
9 Correct 7 ms 1872 KB Output is correct
10 Correct 7 ms 1876 KB Output is correct
11 Correct 4 ms 2020 KB Output is correct
12 Correct 1 ms 1872 KB Output is correct
13 Correct 10 ms 2216 KB Output is correct
14 Correct 4 ms 1872 KB Output is correct
15 Correct 5 ms 2068 KB Output is correct
16 Correct 17 ms 3164 KB Output is correct
17 Correct 1 ms 1852 KB Output is correct
18 Correct 42 ms 3388 KB Output is correct
19 Correct 1 ms 1836 KB Output is correct
20 Correct 7 ms 2156 KB Output is correct
21 Correct 16 ms 2384 KB Output is correct
22 Correct 2 ms 1968 KB Output is correct
23 Correct 1 ms 1844 KB Output is correct
24 Correct 1 ms 1872 KB Output is correct
25 Correct 11 ms 2624 KB Output is correct
26 Correct 13 ms 2652 KB Output is correct
27 Correct 3 ms 1872 KB Output is correct
28 Correct 18 ms 3236 KB Output is correct
29 Correct 15 ms 3044 KB Output is correct
30 Correct 38 ms 3320 KB Output is correct
31 Correct 1 ms 1872 KB Output is correct
32 Correct 10 ms 2136 KB Output is correct
33 Correct 1 ms 1792 KB Output is correct
34 Correct 14 ms 2236 KB Output is correct
35 Correct 8 ms 2000 KB Output is correct
36 Correct 8 ms 2104 KB Output is correct
37 Correct 3 ms 1976 KB Output is correct
38 Correct 2 ms 1872 KB Output is correct
39 Correct 15 ms 2468 KB Output is correct
40 Correct 28 ms 3388 KB Output is correct
41 Correct 15 ms 2684 KB Output is correct
42 Correct 25 ms 2692 KB Output is correct
43 Correct 25 ms 2632 KB Output is correct
44 Correct 9 ms 2376 KB Output is correct
45 Correct 7 ms 2256 KB Output is correct
46 Correct 1 ms 1872 KB Output is correct
47 Correct 13 ms 2480 KB Output is correct
48 Correct 29 ms 2996 KB Output is correct
49 Correct 3 ms 1972 KB Output is correct
50 Correct 40 ms 3336 KB Output is correct
51 Correct 17 ms 2364 KB Output is correct
52 Correct 1 ms 1868 KB Output is correct
53 Correct 5 ms 2004 KB Output is correct
54 Correct 21 ms 2408 KB Output is correct
55 Correct 1 ms 1840 KB Output is correct
56 Correct 29 ms 3340 KB Output is correct
57 Correct 17 ms 2968 KB Output is correct
58 Correct 25 ms 3000 KB Output is correct
59 Correct 13 ms 2724 KB Output is correct
60 Correct 22 ms 2632 KB Output is correct
61 Correct 11 ms 1924 KB Output is correct
62 Correct 2 ms 1880 KB Output is correct
63 Correct 5 ms 1992 KB Output is correct
64 Correct 7 ms 1872 KB Output is correct
65 Correct 8 ms 1916 KB Output is correct
66 Correct 14 ms 1860 KB Output is correct
67 Correct 16 ms 1844 KB Output is correct
68 Correct 4 ms 1840 KB Output is correct
69 Correct 20 ms 1852 KB Output is correct
70 Correct 11 ms 1744 KB Output is correct
71 Correct 39 ms 3504 KB Output is correct
72 Correct 15 ms 2124 KB Output is correct
73 Correct 45 ms 3336 KB Output is correct
74 Correct 42 ms 3388 KB Output is correct
75 Correct 7 ms 1920 KB Output is correct
76 Correct 51 ms 3368 KB Output is correct
77 Correct 40 ms 3400 KB Output is correct
78 Correct 9 ms 2008 KB Output is correct
79 Correct 25 ms 3400 KB Output is correct
80 Correct 27 ms 3416 KB Output is correct
81 Correct 34 ms 3352 KB Output is correct
82 Correct 45 ms 3340 KB Output is correct
83 Correct 11 ms 1916 KB Output is correct
84 Correct 35 ms 3328 KB Output is correct
85 Correct 31 ms 3376 KB Output is correct
86 Runtime error 104 ms 3740 KB Execution killed with signal 11
87 Halted 0 ms 0 KB -