제출 #1277574

#제출 시각아이디문제언어결과실행 시간메모리
1277574thomas123선물 (IOI25_souvenirs)C++20
3 / 100
12 ms400 KiB
#include <bits/stdc++.h>
#include "souvenirs.h"
using namespace std;
int cnt[105], p[105];
void buy_souvenirs(int n, long long P0){
    p[0] = P0;
    for (int i = 1; i <= n - 1; i++) { 
        auto [v, r] = transaction(p[i - 1] - 1); 
        if (r == 1 || v.size() == 2) { 
            if (v.size() == 2) cnt[n - 1]++; 
            p[i] = p[i - 1] - 2; 
        } else { p[i] = p[i - 1] - 1; } 
        cnt[i]++; 
    } for (int i = 1; i <= n - 1; i++) for (int j = cnt[i] + 1; j <= i; j++) 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...