Submission #1326339

#TimeUsernameProblemLanguageResultExecution timeMemory
1326339NAMIN선물 (IOI25_souvenirs)C++20
7 / 100
12 ms400 KiB
#include "souvenirs.h" #include <bits/stdc++.h> #define ll long long using namespace std; void buy_souvenirs(int N, long long P0) { ll k = P0-1; vector<int> fail(N,0); for(int i=1;i<N;i++){ pair<vector<int>, long long> res = transaction(k); if(res.first.size()!=1){ for(int p : res.first){ if(p!=i) fail[p]++; } k--; } for(int j=0;j<i-fail[i]-1;j++){ transaction(k); } k--; } 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...