Submission #1282056

#TimeUsernameProblemLanguageResultExecution timeMemory
1282056nataliaaFestival (IOI25_festival)C++20
0 / 100
1096 ms15948 KiB
#include "festival.h"
#include<bits/stdc++.h>
using namespace std;
std::vector<int> max_coupons(int A, std::vector<int> P, std::vector<int> T) {
	int n = P.size();
	pair<int,int> p1[n], p[n];

	for(int i = 0; i <n; i++) {
		p[i].first = P[i];
		p[i].second = i;
		p1[i].first = i;
		p1[i].second = T[i];
	}
	sort(p, p+n);
	vector<int> v;
	map<int, bool> m;
	for(int i = 0; i < n ; i++) {
	    int mn = 1e9, ind =0;
		for(int j = 0; j<n; j++) {
			if(p[j].first<=A&&!m[p[j].second]) {
				int k = (A-p[j].first)*p1[p[j].second].second;
				if(k<mn) {
				    mn = k;
					ind  = j;
				}
			}
		}
		m[ind] = 1;
		v.push_back(ind);
	}
	return v;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...