제출 #1286262

#제출 시각아이디문제언어결과실행 시간메모리
1286262aleksandre선물 (IOI25_souvenirs)C++20
0 / 100
1 ms332 KiB
#include "souvenirs.h" #include <utility> #include <vector> using namespace std; void buy_souvenirs(int N, long long P0) { int k = 0; pair <vector<int>, long long> m = transaction(P0-1); if (m.first.size() == 2) { k = 1; } long long i = 1; m = transaction(1); while (m.first.size() != 1) { i++; m = transaction(i); } if (k == 0) { transaction(i); } }
#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...