Submission #1251451

#TimeUsernameProblemLanguageResultExecution timeMemory
1251451cbnk32_tuandungSouvenirs (IOI25_souvenirs)C++20
7 / 100
12 ms412 KiB
#include "souvenirs.h"
#include <utility>
#include <vector>
#include <bits/stdc++.h>
using namespace std;

namespace sub1 {
	void solve(long long P0) {
		std::pair<std::vector<int>, long long> res = transaction(P0 - 1);
//		return 0;
	}
}

namespace sub2 {
	void solve(int N) {
//		int prev = P0;
		for (int i = 1; i < N; ++i) {
			for (int j = 1; j <= i; ++j) pair<vector<int>, long long> res = transaction(N - i);
		}
//		return 0;
	}
}

void buy_souvenirs(int N, long long P0) {
	
	if (N == 2) {
		sub1::solve(P0);
		return;
	}
	if (P0 == N) {
		sub2::solve(N);
		return;
	}
	
	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...