Submission #1252827

#	Time	Username	Problem	Language	Result	Execution time	Memory
1252827		nickolasarapidis	선물 (IOI25_souvenirs)	C++20	25 / 100	12 ms	412 KiB

souvenirs

#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;
    bool b = false;
    if(N == 2){
        a = transaction(P0 - 1);
        return;
    }
    if(N == 3){
        a = transaction(P0 - 1);
        if(a.F.size() == 1){
            long long x = P0 - 1 - a.S;
            a = transaction(x - 1);
            a = transaction(x - 1);
        }
        else{
            long long x = P0 - 1 - a.S;
            a = transaction(x/2);
        }
        return;
    }
    for(int i = 1; i < N; i++){
        if(i == N - 1 and b == true) continue;
        a = transaction(P0 - 1);
        if(a.S == 1) P0 -= 2;
        else{
            if(a.F.size() == 1){
                P0--;
            }
            else{
                b = true;
                P0 -= 2;
            }
        }
        for(int j = 1; j < i; j++){
            a = transaction(P0);
        }
    }
}

• Subtask 0: 0 / 0
• Subtask 1: 4 / 4
• Subtask 2: 3 / 3
• Subtask 3: 0 / 14
• Subtask 4: 18 / 18
• Subtask 5: 0 / 28
• Subtask 6: 0 / 33