제출 #1284536

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1284536		dimitri.shengelia	선물 (IOI25_souvenirs)	C++20	25 / 100	13 ms	332 KiB

souvenirs

#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;

}

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