제출 #1302195

#제출 시각아이디문제언어결과실행 시간메모리
1302195Valaki2선물 (IOI25_souvenirs)C++20
22 / 100
1 ms336 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 buy_souvenirs(signed N, int P0) { if(N == 2) { solve_2(N, P0); return; } if(N == 3) { solve_3(N, P0); return; } 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...