제출 #1284519

#제출 시각아이디문제언어결과실행 시간메모리
1284519dimitri.shengelia선물 (IOI25_souvenirs)C++20
7 / 100
13 ms400 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) {

	if ( N == 2 ) {

		transaction ( P0 - 1 );

		return;

	} else if ( N == 3 ) {

		pair <vector<int>, long long> v = transaction ( P0 - 1 );

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

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

		} else {

			transaction ( ( P0 - 1 ) / 2 );

		}
		
		return;

	}

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

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