제출 #1287813

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1287813		nikoloz-ch	선물 (IOI25_souvenirs)	C++20	25 / 100	13 ms	404 KiB

souvenirs

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

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

void buy_souvenirs(int N, long long P0){
    if(N == 2){
        auto pii = transaction(P0-1);
    } else if(N == 3){
        auto pii = transaction(P0-1);
        if(pii.first.size() == 2){
            auto p3 = transaction((P0-1-pii.second)/2);
            return;
        }
        auto p = transaction(P0-2-pii.second);
        auto p2 = transaction(P0-2-pii.second);
    } else{
        long long l1 = P0; map<int,int> mp;
        for(int i = 0; i < N; i++) mp[i] = 0;
        for(int i = 1; i < N; i++){
            bool tr = false;
            for(int j = 0; mp[i] < i; j++){
                if(mp[N-1] == N-1) return;
                if(mp[i] == i) break;
                auto pii = transaction(l1-1);
                mp[i]++;
                if(pii.first.size() == 2){
                    tr = true;
                    mp[i+1]++;
                }
                if(pii.second == 1ll){
                    tr = true;
                }
            }
            l1--;
            if(tr) l1--;
        }
    }
}

• 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