Submission #1284536

#TimeUsernameProblemLanguageResultExecution timeMemory
1284536dimitri.shengeliaSouvenirs (IOI25_souvenirs)C++20
25 / 100
13 ms332 KiB
#include "souvenirs.h"
#include <bits/stdc++.h>
#include <utility>
#include <vector>

using namespace std;

pair <vector<int>, long long> transaction(long long M);

void buy_souvenirs(int N, long long P0) {

	pair <vector<int>, long long> res;

	//pair <int, bool> a[n];
	//fill ( a, a + n, { 0, false } );
	//a[0].first = P0;

	if ( N == 2 ) {

		transaction ( P0 - 1 );

	} else if ( N == 3 ) {

		res = transaction ( P0 - 1 );

		if ( res.first.size() == 1 ) {

			transaction ( P0 - 1 - res.second - 1 );
			transaction ( P0 - 1 - res.second - 1 );

		} else {

			transaction ( ( P0 - 1 - res.second ) / 2 );

		}

	} else {

		for ( int i = 1; i < N; i++ ) {

			for ( int j = 0; j < i; j++ ) {

				transaction ( N - i );

			}

		}

	}

	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...