제출 #1321058

#제출 시각아이디문제언어결과실행 시간메모리
1321058sadix선물 (IOI25_souvenirs)C++17
0 / 100
13 ms388 KiB
#include "souvenirs.h" #include <utility> #include <vector> #include <stdint.h> #include <algorithm> void buy_souvenirs(int N, long long P0) { std::vector<long long> M_for_type(N, -1); for (long long M = 1; M < P0; M++) { auto res = transaction(M); for (int t : res.first) { if (M_for_type[t] == -1) { M_for_type[t] = M; } } } for (int type = 1; type < N; type++) { for (int cnt = 0; cnt < type; cnt++) { transaction(M_for_type[type]); } } }
#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...