oj.uz

Submission #1041216

# Submission time Handle Problem Language Result Execution time Memory
1041216 2024-08-01T17:54:43 Z Edu175 Koala Game (APIO17_koala) C++17
19 / 100
 254 ms 492 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) {
    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(dp[i][u]!=dp[i+1][u])q=b[i]+1;
		r[i]=q;
		u+=q;
	}
	return r;
}
vector<ll>b,t,best;
ll val=-1;
ll value(vector<ll>r){
	ll c=0;
	fore(i,0,n){
		c+=t[i]==t.back()&&r[i]>b[i];
	}
	if(!c)return n+5;
	return c;
}
ll s;
void f(){
	if(SZ(b)==n){
		ll vali=value(alice(b));
		if(val==-1||vali<val)best=b,val=vali; // minimize value
		return;
	}
	ll i=SZ(b);
	auto go=[&](ll v){
		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,0,w-s+1)go(v);
}
vector<ll>ty;
void max_value(){
	if(t.back()!=t.end()[-2])return;
	f();
    vector<ll>ks;
    fore(i,0,n)if(!i||t[i]!=t[i-1])ks.pb(best[i]);
    int B[n],R[n];
    fore(i,0,n)B[i]=ks[ty[i]];
    playRound(B,R);
	auto r=alice(best);
	fore(i,0,n)if(ty[i]==t.back()&&R[i]>B[i])ty[i]=t.back()+1;
	fore(i,0,n)if(t[i]==t.back()&&r[i]>best[i])t[i]=t.back()+1;
	val=-1;
    max_value();
}

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

int greaterValue(int N, int W) {
    // TODO: Implement Subtask 3 solution here.
    // You may leave this function unmodified if you are not attempting this
    // subtask.
    return 0;
}

void allValues(int N, int W, int *P) {
    if (W == 2*N) {
        // TODO: Implement Subtask 4 solution here.
        // You may leave this block unmodified if you are not attempting this
        // subtask.
    } else {
        // TODO: Implement Subtask 5 solution here.
        // You may leave this block unmodified if you are not attempting this
        // subtask.
    }
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 344 KB Output is correct
2 Correct 2 ms 344 KB Output is correct
3 Correct 2 ms 344 KB Output is correct
4 Correct 2 ms 344 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 239 ms 492 KB Output is correct
2 Correct 244 ms 344 KB Output is correct
3 Correct 254 ms 492 KB Output is correct
4 Correct 238 ms 344 KB Output is correct

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 53.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -