제출 #245085

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
245085		LittleFlowers__	커다란 상품 (IOI17_prize)	C++17	20 / 100	109 ms	5400 KiB

prize

#include <bits/stdc++.h>
using namespace std;
#define in ({int x=0;int c=getchar(),n=0;for(;!isdigit(c);c=getchar()) n=(c=='-');for(;isdigit(c);c=getchar()) x=x*10+c-'0';n?-x:x;})
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//mt19937 rng(1012);
int rnd(int l,int r){return l+rng()%(r-l+1);}
#define fasty ios_base::sync_with_stdio(0),cin.tie(0);
#define forinc(a,b,c) for(int a=b,_c=c;a<=_c;++a)
#define fordec(a,b,c) for(int a=b,_c=c;a>=_c;--a)
#define forv(a,b) for(auto&a:b)
#define fi first
#define se second
#define pb push_back
#define ii pair<int,int>
#define mt make_tuple
#define all(a) a.begin(),a.end()
#define reset(f, x) memset(f, x, sizeof(f))
#define gg exit(0);

#ifndef UNX
#include "prize.h"
#endif // UNX

const int N=200010;

int n;
vector<int> dd[N];
vector<int> st[10];
int mp[N];

#ifdef UNX
int arr[N];
int asked;
vector<int> ask(int p){
    if(p<0) cerr<<"A";
    asked++;
    int x=0, y=0;
    forinc(i,1,p)   x+=arr[i]<arr[p+1];
    forinc(i,p+2,n) y+=arr[i]<arr[p+1];
    return {x,y};
}
#endif // UNX

vector<int> qry(int i){
    return dd[i].size() ? dd[i] : dd[i]=ask(i-1);
}

int small(int i,int j){
    auto x=qry(i), y=qry(j);
    return x[0]+x[1]<=y[0]+y[1];
}

int dem(int i,int x,int y){
    y=lower_bound(all(st[y]),i)-st[y].begin();
    x=lower_bound(all(st[x]),i)-st[x].begin();
    return y-x;
}

int cnt(int i,int j){
    if(i>j) swap(i,j);
    auto x=qry(i), y=qry(j);
    int u=mp[x[0]+x[1]], v=mp[y[0]+y[1]];
    if(u>v) swap(u,v);
    return y[0]-x[0]-(x[0]+x[1]>y[0]+y[1] ? dem(j,u,v) : dem(i,u,v));
}

vector<int> solve(int l){
    vector<int> val;
    int i=l;
    while(i<n){
        fordec(j,log2(n-i+1),0){
            int t=i+(1<<j);
            if(t>n) continue;
            if(small(l,t) && cnt(l,t)==val.size()){
                i=t;
            }
        }
        if(i==n) break;
        val.pb(++i);
    }
    i=l; int piv=val.size();
    //forv(i,val) cerr<<arr[i]<<" ";
    while(i>1){
        fordec(j,log2(i),0){
            int t=i-(1<<j);
            if(t<1) continue;
            //cerr<<small(l,t);
            if(small(l,t) && cnt(l,t)==val.size()-piv) i=t;
        }
        if(i==1) break;
        val.pb(--i);
    }
    return val;
}

int find_best(int nn){
    auto a=qry(1); n=nn;
    if(a[0]+a[1]==0) return 0;
    if(a[0]+a[1]==1){
        int le=0,mi,ri=n-1;
        while(le<=ri){
            mi=(le+ri)/2;
            a=qry(mi+1);
            if(a[0]+a[1]==0) return mi;
            if(a[0]) ri=mi-1; else le=mi+1;
        }
    }
    int x,tmp=-1;
    forinc(t,1,10){
        int i; do i=rnd(1,n); while(dd[i].size());
        auto a=qry(i);
        if(tmp<a[0]+a[1]){
            tmp=a[0]+a[1];
            x=i;
        }
    }

    mp[tmp]=1;
    forinc(lay,1,10){
        auto val=solve(x);
        //gg
        tmp=n+n;
        vector<int> nxt;
        forv(i,val){
            auto a=qry(i);
            if(tmp>a[0]+a[1]){
                tmp=a[0]+a[1];
                nxt.clear();
            }
            if(tmp==a[0]+a[1])
                nxt.pb(i);
        }

        if(nxt[0]<1) cerr<<"W";
        return nxt[0]-1;
        if(nxt.size()==1) return nxt[0]-1;
        auto a=qry(nxt[0]);
        mp[a[0]+a[1]]=lay+1;

        st[lay+1]=st[lay];
        forv(i,nxt) st[lay+1].pb(i);
        sort(all(st[lay+1]));
        x=nxt[0];
        gg
    }
}

#ifdef UNX
main(){
    #define task "TASK"
    if(fopen(task".inp","r")){
        freopen(task".inp","r",stdin);
        //freopen(task".out","w",stdout);
    }

    n=in;
    forinc(i,1,n) arr[i]=in;

    cout<<find_best(n)<<"\n";
    cerr<<asked;


}
#endif // UNX

컴파일 시 표준 에러 (stderr) 메시지

prize.cpp: In function 'std::vector<int> solve(int)':
prize.cpp:74:38: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if(small(l,t) && cnt(l,t)==val.size()){
                              ~~~~~~~~^~~~~~~~~~~~
prize.cpp:88:38: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if(small(l,t) && cnt(l,t)==val.size()-piv) i=t;
                              ~~~~~~~~^~~~~~~~~~~~~~~~
prize.cpp: In function 'int find_best(int)':
prize.cpp:146:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
prize.cpp:120:25: warning: 'x' may be used uninitialized in this function [-Wmaybe-uninitialized]
         auto val=solve(x);
                         ^

• Subtask 1: 20 / 20
• Subtask 2: 0 / 80