제출 #1306931

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1306931		MunkhErdene	선물 (IOI25_souvenirs)	C++17	0 / 100	13 ms	332 KiB

souvenirs

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

void buy_souvenirs(int N, long long P0) {
    ll n = N;
    ll p0 = P0;
    vector<ll> tar(n), cnt(n, 0);
    iota(tar.begin(), tar.end(), 0);
    ll pre = 0;
    ll cur = p0 - 2;
    while(cur >= 0){
        if(pre == n - 1) break;
        auto res = transaction(cur);
        cnt[res.first[0]]++;
        if(res.first[0] == pre + 1) {
            for(;cnt[res.first[0]] < tar[res.first[0]]; cnt[res.first[0]]++) {
                transaction(cur);
            }
            pre = res.first[0];
            cur -= (pre == n - 2 ? 1 : 2);
            continue;
        }
        else{
            for(;cnt[res.first[0] - 1] < tar[res.first[0] - 1]; cnt[res.first[0] - 1]++) {
                transaction(cur + 1);
            }
            cur -= 1;
            pre++;
        }
    }
    return;
}

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