Submission #1347726

#	Time	Username	Problem	Language	Result	Execution time	Memory
1347726		fahmid_rng	Souvenirs (IOI25_souvenirs)	C++20	21 / 100	8 ms	404 KiB

souvenirs

#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#include "souvenirs.h"
#include <utility>

void buy_souvenirs(int n, long long prev) {
	//p[i]=p[i+1]+1 or p[i+1]+2
	int cnt=0;
	for(int i=1; i<n-1; ++i){
		pair<vector<int>,int> p=transaction(prev-1);
		prev-=2;
		if(!p.second){
			if(p.first.size()==1) ++prev;
			else ++cnt;
		}
		for(int j=1;j<i;++j) transaction(prev);
	}
	for(int i=cnt+1; i<n; ++i) transaction(prev-1);
}

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