제출 #1311011

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

souvenirs

#include "souvenirs.h"
#include<bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ll long long
#define sm pair<vector<int>, long long>
using namespace std;
const int inf = 1e9;
int n;
int idx;
int e;
vector<int> dp, cnt;
int slv(ll val){
    auto T = transaction(val);
    vector<int> I = T.ff;
    for(auto tt : I){
        cnt[tt]++;
    }
    ll cst = val - T.ss;
    while(I[0] < e){
        while(e <= I.back()){
            cst =- dp[I.back()];
            I.pop_back();
        }
        int e = slv(cst / I.size());
    }
    dp[I[0]] = cst;
    return I[0];
}
void buy_souvenirs(int N, ll P0){
    n = N;
    e = n;
    dp.resize(n);
    cnt.resize(n);
    slv(P0 - 1);
    for(int i = 0; i < n; i++){
        while(cnt[i] < i){
            transaction(dp[i]);
        }
    }
    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