Submission #1250820

#TimeUsernameProblemLanguageResultExecution timeMemory
1250820lukameladzeSouvenirs (IOI25_souvenirs)C++20
18 / 100
0 ms412 KiB
#include "souvenirs.h" #include <utility> #include <vector> #include <iostream> #include <cstdio> #include <cstdlib> #include <cassert> #include <algorithm> #include <string> using namespace std; #define pii pair <int, int> #define sth pair<vector<int>, long long> void buy_souvenirs(int N, long long P0) { long long x = P0 - 1; sth result = transaction(x); vector<int> souvenirs = result.first; long long remaining = result.second; if (souvenirs.size() == 1) { long long P1 = P0 - 1 - remaining; transaction(P1 - 1); transaction(P1 - 1); } else { long long P12 = P0 - 1 - remaining; long long mid = (P12 - 1) / 2; transaction(mid); } 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...