제출 #1249638

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1249638		NekoRolly	Souvenirs (IOI25_souvenirs)	C++20	25 / 100	12 ms	412 KiB

souvenirs

#include "souvenirs.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

void my_transaction(ll m,vector<int> &vec,ll &res){
    auto x = transaction(m);
    vec = x.first;
    res = x.second;
}

void buy_souvenirs(int n,ll p0) {
    vector<int> vec;
    ll res;
    ll p[n] = {0};
    p[0] = p0;

    if (n == 2)
        transaction(p0-1);
    else if (n == 3){
        my_transaction(p0-1, vec, res);

        if (vec.size() == 1){
            p[1] = p0-1 - res;
            transaction(p[1]-1);
            transaction(p[1]-1);
        }
        else{
            ll mx = (p0-1-res-1)/2;
            transaction(mx);
        }
    }
    else{
        int freq[n] = {0};
        for (int i=1; i<n; i++){
            if (p[i] == 0){
                my_transaction(p[i-1]-1, vec, res);

                if (vec.size() == 2){
                    p[i] = p[i-1]-2, p[i+1] = 1;
                    freq[i]++, freq[i+1]++;

                    while (freq[i+1] < i+1){
                        transaction(p[i+1]);
                        freq[i+1]++;
                    }
                }
                else if (res == 1){
                    p[i] = p[i-1]-2;
                    freq[i]++;
                }
                else{
                    p[i] = p[i-1]-1;
                    freq[i]++;
                }
            }

            while (freq[i] < i){
                transaction(p[i]);
                freq[i]++;
            }
        }
    }
    return;
}

• 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