제출 #1269278

#제출 시각아이디문제언어결과실행 시간메모리
1269278sula2선물 (IOI25_souvenirs)C++20
4 / 100
12 ms408 KiB
#include <bits/stdc++.h> #include "souvenirs.h" using namespace std; void buy_souvenirs(int N, long long P0) { long long P[N] = {}, Q[N] = {}; P[0] = P0; for (int i = 1; i < N; i++) { auto [a,b] = transaction(P[i] == 0 ? P[i-1] - 1 : P[i]); if (P[i] == 0) { P[i] = P[i-1] - a.size(); } for (int j : a) Q[j]++; } for (int i = 1; i < N; i++) while (Q[i] < i) transaction(P[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...