제출 #1249901

#제출 시각아이디문제언어결과실행 시간메모리
1249901zzzzzzzzzzzzzzz선물 (IOI25_souvenirs)C++20
0 / 100
0 ms412 KiB
#include "souvenirs.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

void buy_souvenirs(int N, ll P0) {
    vector<ll> ansli(N);
    ansli[0]=P0;
    vector<ll> cnt(N);
    pair<vector<int>, ll> res = transaction(ansli[0]-1);
    auto v=res.first;
    if(v.size()==1){
        ansli[1]=ansli[0]-1-res.second;
        cnt[1]++;
        pair<vector<int>, ll> res2 = transaction(ansli[1]-1);
        ansli[2]=ansli[1]-1-res2.second;
        cnt[2]++;
    }
    if(v.size()==2){
        cnt[1]++;
        cnt[2]++;
        pair<vector<int>, ll> res2 = transaction((ansli[0]-1)/2);
        ansli[2]=(ansli[0]-1)/2-res2.second;
        cnt[2]++;
        ansli[1]=(ansli[0]-1)-res.second-ansli[2];
    }
    for(int i=1;i<N;i++){
        while(cnt[i]<i){
            transaction(ansli[i]);
            cnt[i]++;
        }
    }
    return;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...