제출 #1250841

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1250841		discontinuous	선물 (IOI25_souvenirs)	C++20	22 / 100	1 ms	412 KiB

souvenirs

// Author: Anikait Prasar

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define pb push_back

pair<vector<int>, ll> transaction(ll M);

void buy_souvenirs(int n, ll p0) {
    if(n==2) {
        transaction(p0-1);
        return;
    }

    else if(n==3) {
        auto h = transaction(p0-1);
        int d = h.first.size();
        ll c = h.second;

        ll sum = p0-1LL-c;
        if(d==1) {
            // Here, sum is the value of
            // 2nd element
            transaction(sum-1LL);
            transaction(sum-1LL);
        } 
        if(d==2){
            transaction(sum/2LL);
        }

        return;
    }

    ll prev = p0;
    ll last = 0;
    for(int j = 1; j<n-1; j++) {
        auto h = transaction(prev-1);    
        int d = h.first.size();
        ll c = h.second;

        if(d==2) {
            last++;
            prev -= 2;
        }
        else {
            if(c==0) {
                prev--;
            }
            else {
                prev -= 2;
            }
        }
    }

    while(last < n) {
        transaction(prev-1);
        last++;
    }
    
    // int k = 1;
    // for(ll i = n-1; i>0; i--) {
    //     for(ll j = 0; j<k; j++) transaction(i);
    //     k++;
    // }
}

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