제출 #1252771

#제출 시각아이디문제언어결과실행 시간메모리
1252771TIN선물 (IOI25_souvenirs)C++20
7 / 100
12 ms400 KiB
#include "souvenirs.h"
#include <utility>
#include <vector>

void buy_souvenirs(int N, long long P0) {
	// std::pair<std::vector<int>, long long> res = transaction(3);
	if (N == 2) {
		std::pair<std::vector<int>, long long> res = transaction(P0 - 1);
		return;
	}
	for (int i = N - 1; i >= 1; i--) for (int j = 1; j <= N - i; j++) std::pair<std::vector<int>, long long> res = transaction(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...