Submission #1252678

#	Time	Username	Problem	Language	Result	Execution time	Memory
1252678		thelegendary08	선물 (IOI25_souvenirs)	C++17	100 / 100	12 ms	432 KiB

souvenirs

#include "souvenirs.h"
#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define vi vector<int>
#define vs vector<signed>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define pout(a) cout<<a.first<<' '<<a.second<<'\n'
#define vout(v) for(auto u : v){cout<<u<<' ';} cout<<endl
#define dout(a) cout<<a<<' '<<#a<<endl
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<endl
#define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
using namespace std;
const int mxn = 105;
vi cnt(mxn), val(mxn), ct(mxn), sum(mxn); int N;
vector<vb> taken(mxn, vb(mxn));
/*
void dfs(int x, int pr){
	if(val[x] != -1)return;
	// dout(pr);
	dout2(x,pr);
	pair<vs,int>res = transaction(pr); //will only take after x
	for(auto u : res.first){
		cnt[u]++;
	}
	if(res.first.size() == 1){
		// val[res.first[0]] = pr - res.second;
	}
	else{
		int nx = (pr - res.second) / res.first.size();
		dfs(res.first[0], (pr - res.second) / res.first.size());
		
	}
	if(res.first[0] != N-1 && val[res.first[0] + 1] == -1){
		dfs(res.first[0] + 1, val[res.first[0]] - 1);
	}
	int cost = pr - res.second;
	FOR(i, 1, res.first.size()){
		cost -= val[res.first[i]];
	}
	val[res.first[0]] = cost;
	dout(x);
	vout(val);
}
*/
int buy(int q){
	pair<vs, int>res = transaction(q);
	int dex = res.first[0];
	sum[dex] = q - res.second;
	for(auto u : res.first){
		taken[dex][u] = 1; 
		cnt[u]++;
	}
	ct[dex] = res.first.size();
	return dex;
}

void solve(int i){
	for(int j = N - 1; j > i; j--){
		if(taken[i][j]){
			if(val[j] == -1){
				solve(buy(sum[i]/ct[i]));
			}
			ct[i]--; sum[i] -= val[j];
		}
	}
	val[i] = sum[i];
	if(i != N-1 && val[i+1] == -1){
		solve(buy(val[i]-1));
	}
}


void buy_souvenirs(signed N, long long P0) {
  	::N=N;
	f0r(i, N){
		cnt[i] = 0; val[i] = -1; //reset
	}
	// dfs(0, P0-1);
	solve(buy(P0-1));
	// vout(cnt); 
	// vout(val);
	f0r(i, N){
		while(cnt[i] < i){
			// dout(val[i]);
			transaction(val[i]);
			cnt[i]++;
		}
	}
}

• Subtask 0: 0 / 0
• Subtask 1: 4 / 4
• Subtask 2: 3 / 3
• Subtask 3: 14 / 14
• Subtask 4: 18 / 18
• Subtask 5: 28 / 28
• Subtask 6: 33 / 33