Submission #1302188

#TimeUsernameProblemLanguageResultExecution timeMemory
1302188Valaki2Souvenirs (IOI25_souvenirs)C++20
3 / 100
13 ms332 KiB
#include "souvenirs.h" #include <bits/stdc++.h> using namespace std; #define int long long #define pb push_back #define mp make_pair #define pii pair<int, int> #define fi first #define se second #define typ pair<vector<signed>, int> void solve_2(int n, int p0) { transaction(p0 - 1); } void solve_3(int n, int p0) { typ q1 = transaction(p0 - 1); if(q1.fi.size() == 1) { int p1 = (p0 - 1) - q1.se; transaction(p1 - 1); transaction(p1 - 1); } else { int p1_plus_p2 = (p0 - 1) - q1.se; transaction(p1_plus_p2 / 2); } } void subtask_3(int n, int p0) { for(int i = 1; i <= n - 1; i++) { for(int j = 1; j <= i; j++) { transaction(n - i); } } } void buy_souvenirs(signed N, int P0) { /*if(N == 2) { solve_2(N, P0); return; } if(N == 3) { solve_3(N, P0); return; }*/ subtask_3(N, P0); return; //pair<vector<signed>, int> res = transaction(3); //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...