제출 #1253903

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1253903		chr34	축제 (IOI25_festival)	C++20	0 / 100	1096 ms	31844 KiB

festival

#include <bits/stdc++.h>

using namespace std;

//#define int long long
#define endl "\n"
#define dbg(x) cout << #x << " = " << (x) << endl;
//const int INF = 1e18;
const int MAXN = 1e6 + 10;
const int MOD = 1e9 + 7;

int cnt = 0;
vector<int> best_path;

void dfs(int a, vector<bool> &used, vector<int> p, vector<int> t, vector<int> &path){
	bool progressed = false;
	int n = p.size();
	for(int i = 0; i < n; ++i){
		if(!used[i] && a >= p[i]){
			int new_a = (a - p[i]) * t[i];
			used[i] = true;
			path.push_back(i);
			dfs(new_a, used, p, t, path);
			path.pop_back();
			used[i] = false;
			progressed = true;
		}
	}
	
	if(!progressed){
		if((int)path.size() > cnt){
			cnt = path.size();
			best_path = path;
		}
	}
	
}

vector<int> max_coupons(int a, vector<int> p, vector<int> t){
	int n = p.size();
	cnt = 0;
	best_path.clear();
	vector<int> path;
	vector<bool> used(n);
	dfs(a, used, p, t, path);
	return best_path;
}

/*int32_t main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	//freopen("input.in", "r", stdin);
	//freopen("input.out", "w", stdout);    
	vector<int> ans = max_coupons(13, {4, 500, 8, 14}, {1, 1, 1, 1});
	for(auto x : ans) cout<<x<<endl;	
    return 0;
}*/

• Subtask 0: 0 / 0
• Subtask 1: 0 / 5
• Subtask 2: 0 / 7
• Subtask 3: 0 / 12
• Subtask 4: 0 / 15
• Subtask 5: 0 / 27
• Subtask 6: 0 / 16
• Subtask 7: 0 / 18