제출 #1252742

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

#define F first
#define S second

void buy_souvenirs(int N, long long P0){
    pair<vector<int>, long long> a;
    int cnt = 0;
    if(N == 2){
        a = transaction(P0 - 1);
        return;
    }
    for(int i = 1; i < N; i++){
        if(i == N - 1 and cnt > 0){
            for(int j = cnt; j < N - 1; j++){
                a = transaction(1);
            }
        }
        a = transaction(P0 - 1);
        if(a.S == 1) P0 -= 2;
        else{
            if(a.F.size() == 1){
                P0--;
            }
            else{
                cnt++;
                P0 -= 2;
            }
        }
        for(int j = 1; j < i; j++){
            a = transaction(P0);
        }
    }
}
#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...