제출 #1285901

#제출 시각아이디문제언어결과실행 시간메모리
1285901nikakh선물 (IOI25_souvenirs)C++20
7 / 100
17 ms400 KiB
#include "souvenirs.h" #include <bits/stdc++.h> using namespace std; void buy_souvenirs(int N, long long P0){ pair<vector<int>, long long> res; if(N == 2){ transaction(P0 - 1); return; } if(P0 == N){ for(int i = 1; i < N; i++){ for(int j = 0; j < i; j++){ transaction(P0 - i); } } return; } if(N == 3){ res = transaction(P0 - 1); vector<int> f = res.first; long long s = res.second; if(f.size() == 2){ transaction(P0 - 1 - s - 1); transaction(P0 - 1 - s - 1); } else{ transaction(P0 - 1 - s - 1); } 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...