Submission #1326335

#TimeUsernameProblemLanguageResultExecution timeMemory
1326335NAMINSouvenirs (IOI25_souvenirs)C++20
0 / 100
12 ms332 KiB
#include "souvenirs.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;

void buy_souvenirs(int N, long long P0) {
	
	ll k = P0-1;
	vector<int> fail(N,0);
	for(int i=0;i<N;i++){
		pair<vector<int>, long long> res = transaction(k);
		bool isfail=false;
		if(res.first.size()!=1){
			isfail=true;
			for(int p : res.first){
				fail[p]++;
			}
			k--;
		}
		
		for(int j=0;j<i-isfail-fail[i];j++){
			transaction(k);
		}

		k--;
	}
	return;
}
#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...