제출 #1252914

#제출 시각아이디문제언어결과실행 시간메모리
1252914kkzyr선물 (IOI25_souvenirs)C++20
4 / 100
3 ms412 KiB
#include <iostream> #include <vector> #include <utility> using namespace std; std::pair<std::vector<int>, long long> transaction(long long M); void buy_souvenirs(int N, long long P0){ long long nxt = P0 - 1; int how_many_last = 0; for (int i = 1;i < N;i++){ pair<vector<int>, long long> result; result = transaction(nxt); if (result.first.size() == 2 or result.second == 0){ if (result.first.size() == 2){ how_many_last++; } nxt--; } if (i == N - 1){ for (int j = 1;j < (i - how_many_last);j++){ transaction(nxt); } } else{ for (int j = 1;j < i;j++){ transaction(nxt); } } nxt--; } }
#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...