제출 #1249680

#제출 시각아이디문제언어결과실행 시간메모리
1249680enerelt14선물 (IOI25_souvenirs)C++20
7 / 100
12 ms412 KiB
#include "souvenirs.h"
#include <utility>
#include <vector>
#include <bits/stdc++.h>
using namespace std;

void buy_souvenirs(int N, long long P0) {
    int num = 0;
    for(int i = 1; i < N - 1; i++) {
        pair<vector<int>, long long> res = transaction(P0 - 1);
        if(res.first.size() == 1 && !res.second)
            P0 -= 1;
        else if(res.first.size() == 1)
            P0 -= 2;
        else {
            P0 -= 1;
            num++;
        }
        for(int j = 0; j < i - 1; j++) {
            transaction(P0);
        }
    }
    for(int i = 0; i < N - 1 - num; i++)
        transaction(P0 - 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...