제출 #1251501

#제출 시각아이디문제언어결과실행 시간메모리
1251501nguyn선물 (IOI25_souvenirs)C++20
21 / 100
11 ms412 KiB
#include "souvenirs.h" #include <bits/stdc++.h> using namespace std; void buy_souvenirs(int N, long long P0) { vector<int> v(N); vector<long long> p(N); p[0] = P0; for (int i = 1; i < N; i++) { vector<int> vec; long long rem; tie(vec, rem) = transaction(p[i - 1] - 1); for (int id : vec) v[id]++; if (vec.size() == 1) { p[i] = p[i - 1] - 1 - rem; } else { p[i] = p[i - 1] - 2; p[N - 1] = 1; } } for (int i = 1; i < N; i++) { for (int j = v[i]; j < i; j++) { transaction(p[i]); } } 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...