oj.uz

답안 #1041485

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1041485 2024-08-02T04:43:19 Z Edu175 코알라 (APIO17_koala) C++17
67 / 100
 60 ms 852 KB 
#include "koala.h"
#include <bits/stdc++.h>
#define pb push_back
#define fst first
#define snd second
#define fore(i,a,b) for(ll i=a,mxcont=b;i<mxcont;i++)
#define SZ(x) ((int)x.size())
#define ALL(x) x.begin(),x.end()
#define mset(a,v) memset((a),(v),sizeof(a))
#define imp(v) {for(auto jfhg:v)cout<<jfhg<<" ";cout<<"\n";}
using namespace std;
typedef int ll;
typedef pair<ll,ll> ii;
random_device rd;
mt19937 rng(rd());

int minValue(int n, int w) {
    assert(w);
    int B[n],R[n];
    fore(i,0,n)B[i]=R[i]=0;
    B[0]=1;
    playRound(B,R);
    ll mn=-1;
    fore(i,0,n)if(B[i]>=R[i])mn=i;
    return mn;
}
ll fn(ll n){return n*(n+1)/2;}
ll n,w;
vector<ll> alice(vector<ll>&b){
	vector<vector<ll>>dp(n+1,vector<ll>(w+1));
	for(ll i=n-1;i>=0;i--)fore(u,0,w+1){
		ll &res=dp[i][u];
		res=dp[i+1][u];
		if(u+b[i]+1<=w)res=max(res,i+1+dp[i+1][u+b[i]+1]);
	}
	ll u=0;
	vector<ll>r(n);
	fore(i,0,n){
		ll q=0;
		if(u+b[i]+1<=w&&dp[i][u]==i+1+dp[i+1][u+b[i]+1])q=b[i]+1;
		r[i]=q;
		u+=q;
	}
	return r;
}
ll old=-1,val=-1;
void new_t(vector<ll>&t, vector<ll>B, vector<ll>R){
    vector<vector<ll>>h(n,vector<ll>(2));
    fore(i,0,n)h[t[i]][R[i]>B[i]]=1;
    ll cnt=0;
    fore(i,0,n)fore(j,0,2)if(h[i][j])h[i][j]=cnt++;
    fore(i,0,n)t[i]=h[t[i]][R[i]>B[i]];
}
vector<ll>b,t,best;
ll value(vector<ll>r){
    auto t_=t;
    new_t(t_,b,r);
    return *max_element(ALL(t_));
}
ll s;
// map<vector<ll>,vector<ll>>dp;
ll increasing=1;
void f(){
    // if(!SZ(b)&&dp.count(t)){best=dp[t];return;}
	if(SZ(b)==n){
		ll vali=value(alice(b));
		if(val==-1||vali>val)best=b,val=vali;//,dp[t]=best; // maximize value
		return;
	}
	ll i=SZ(b);
	auto go=[&](ll v){
        if(val>old)return;
		s+=v; b.pb(v);
		if(s<=w)f();
		s-=v; b.pop_back();
	};
	if(i&&t[i]==t[i-1])go(b.back());
	else fore(v,increasing&&SZ(b)?b.back():0,w-s+1)go(v);
}
ll i=0,j=1;
int greaterValue(int n, int w) {
    ll res=-1;
    auto qan=[&](ll x)->int{
        // cout<<"qan "<<x<<"\n";
        vector<ll>B(n),R(n);
        B[i]=B[j]=x;
        playRound(B.data(),R.data());
        // imp(B); imp(R);
        vector<ll>s(n);
        fore(i,0,n)s[i]=R[i]>B[i];
        // imp(s);
        if(s[i]!=s[j])res=s[i]<s[j];
        return s[i]+s[j];
    };
   vector<vector<ll>>magic={{1, 2, 4, 8},{51, 52, 54, 58}};
    ll sub=w==200;
    ll l=0,r=SZ(magic[sub])-1;
    while(l<=r){
        ll m=(l+r)/2;
        if(qan(magic[sub][m])==2)l=m+1;
        else r=m-1;
    }
    return res;
}
bool compare(ll i_, ll j_){
    i=i_,j=j_;
    ll ret=greaterValue(n,w);
    // cout<<"compare "<<i<<" "<<j<<": "<<P[i]<<" "<<P[j]<<": "<<ret<<"\n";
    
    return ret;
}
void msort(vector<ll>&a){
    if(SZ(a)<=1)return;
    ll n=SZ(a),m=n/2;
    vector<ll>l,r;
    fore(i,0,m)l.pb(a[i]);
    fore(i,m,n)r.pb(a[i]);
    msort(l); msort(r);
    a.clear();
    reverse(ALL(l)); reverse(ALL(r));
    while(SZ(l)||SZ(r)){
        ll ele=0;
        if(!SZ(l))ele=1;
        else if(!SZ(r))ele=0;
        else ele=!compare(l.back(),r.back());
        if(ele)a.pb(r.back()),r.pop_back();
        else a.pb(l.back()),l.pop_back();
    }
}
vector<ll>ty;
ll cnt=0;
void strat(){
	if(val==n)return;
	old=val;
    val=-1;
    if(cnt>=33){
        vector<ll>ans;
        // cout<<"strat "<<cnt<<": "; imp(t); imp(ty);
        fore(v,0,50){
            vector<ll>a;
            fore(i,0,n)if(ty[i]==v)a.pb(i);
            // cout<<"subarray "<<v<<": "; imp(a);
            msort(a);
            for(auto i:a)ans.pb(i);
            
        }
        fore(i,0,n)ty[ans[i]]=i;
        return;
    }
	f();
    vector<ll>ks(n);
    fore(i,0,n)ks[t[i]]=best[i];
    vector<ll>B(n),R(n);
    fore(i,0,n)B[i]=ks[ty[i]];
    playRound(B.data(),R.data());
    // for(auto i:b)cout<<i<<""
    // imp(B); imp(R);
    new_t(ty,B,R);
	auto r=alice(best);
    new_t(t,best,r);
    // imp(best) imp(r); cout<<"\n";
    cnt++;
    strat();
}

int maxValue(int N, int W) {
    n=N,w=W;
    /*t=ty=vector<ll>(n);
    strat();
    ll mx=0;
    fore(i,0,n)if(ty[i]>ty[mx])mx=i;
    return mx;*/
    return 0;
}

void allValues(int N, int W, int *P) {
    n=N,w=W;
    t=ty=vector<ll>(n);
    old=1,val=-1;
    strat();
    fore(i,0,n)P[i]=ty[i]+1;
    // if (W == 2*N) {
        
    // } else {
        
    // }
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 2 ms 344 KB Output is correct
3 Correct 3 ms 344 KB Output is correct
4 Correct 2 ms 344 KB Output is correct

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 464 KB Output is correct
2 Correct 53 ms 344 KB Output is correct
3 Correct 57 ms 344 KB Output is correct
4 Correct 56 ms 344 KB Output is correct
5 Correct 60 ms 344 KB Output is correct
6 Correct 56 ms 344 KB Output is correct
7 Correct 55 ms 344 KB Output is correct
8 Correct 58 ms 456 KB Output is correct
9 Correct 57 ms 344 KB Output is correct
10 Correct 55 ms 344 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 568 KB Output is correct
2 Correct 29 ms 600 KB Output is correct
3 Correct 29 ms 604 KB Output is correct
4 Correct 28 ms 600 KB Output is correct
5 Correct 30 ms 608 KB Output is correct
6 Correct 28 ms 600 KB Output is correct
7 Correct 27 ms 600 KB Output is correct
8 Correct 28 ms 600 KB Output is correct
9 Correct 29 ms 600 KB Output is correct
10 Correct 27 ms 600 KB Output is correct
11 Correct 27 ms 612 KB Output is correct
12 Correct 24 ms 600 KB Output is correct
13 Correct 28 ms 600 KB Output is correct
14 Correct 27 ms 600 KB Output is correct
15 Correct 28 ms 604 KB Output is correct
16 Correct 29 ms 852 KB Output is correct
17 Correct 27 ms 600 KB Output is correct
18 Correct 28 ms 600 KB Output is correct
19 Correct 32 ms 600 KB Output is correct
20 Correct 27 ms 600 KB Output is correct

Subtask #5
35.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 9 ms 344 KB Output is partially correct
2 Partially correct 13 ms 344 KB Output is partially correct
3 Partially correct 11 ms 344 KB Output is partially correct
4 Partially correct 10 ms 344 KB Output is partially correct
5 Partially correct 10 ms 344 KB Output is partially correct
6 Partially correct 10 ms 344 KB Output is partially correct
7 Partially correct 10 ms 568 KB Output is partially correct
8 Partially correct 11 ms 344 KB Output is partially correct
9 Partially correct 10 ms 512 KB Output is partially correct
10 Partially correct 11 ms 344 KB Output is partially correct
11 Partially correct 12 ms 344 KB Output is partially correct
12 Partially correct 8 ms 556 KB Output is partially correct
13 Partially correct 11 ms 568 KB Output is partially correct
14 Partially correct 10 ms 572 KB Output is partially correct
15 Partially correct 10 ms 568 KB Output is partially correct
16 Partially correct 11 ms 344 KB Output is partially correct
17 Partially correct 10 ms 568 KB Output is partially correct
18 Partially correct 10 ms 596 KB Output is partially correct
19 Partially correct 10 ms 344 KB Output is partially correct
20 Partially correct 11 ms 568 KB Output is partially correct
21 Partially correct 11 ms 344 KB Output is partially correct
22 Partially correct 10 ms 344 KB Output is partially correct
23 Partially correct 11 ms 572 KB Output is partially correct
24 Partially correct 11 ms 344 KB Output is partially correct
25 Partially correct 10 ms 568 KB Output is partially correct
26 Partially correct 12 ms 344 KB Output is partially correct
27 Partially correct 10 ms 344 KB Output is partially correct
28 Partially correct 10 ms 344 KB Output is partially correct
29 Partially correct 10 ms 596 KB Output is partially correct
30 Partially correct 10 ms 508 KB Output is partially correct
31 Partially correct 10 ms 344 KB Output is partially correct
32 Partially correct 10 ms 572 KB Output is partially correct
33 Partially correct 12 ms 572 KB Output is partially correct
34 Partially correct 10 ms 344 KB Output is partially correct
35 Partially correct 10 ms 344 KB Output is partially correct
36 Partially correct 10 ms 344 KB Output is partially correct
37 Partially correct 10 ms 344 KB Output is partially correct
38 Partially correct 10 ms 544 KB Output is partially correct
39 Partially correct 10 ms 344 KB Output is partially correct
40 Partially correct 10 ms 568 KB Output is partially correct