제출 #1286457

#제출 시각아이디문제언어결과실행 시간메모리
1286457kaxi선물 (IOI25_souvenirs)C++20
4 / 100
2 ms400 KiB
#include "souvenirs.h" #include <utility> #include <vector> #include <iostream> using namespace std; pair<vector<int>, long long> transaction(long long M); void buy_souvenirs(int N, long long P0) {; if (N == 2) { transaction(P0 - 1); return; } else if (N == 3) { transaction(P0 - 1); transaction(P0 / 2); transaction(P0 / 2 - 1); return; } else if (P0 == N) { for (int i = 1; i <= N; i++) { for (int j = 1; j <= i; j++) { transaction(N - i); } return; } } else { } }
#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...