제출 #1250763

#제출 시각아이디문제언어결과실행 시간메모리
1250763alex0152선물 (IOI25_souvenirs)C++20
22 / 100
3 ms412 KiB
#include <bits/stdc++.h>
using namespace std;

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


void buy_souvenirs(int n, long long P0)
{
    long long x;
    pair<vector<int>, long long> p;
    if(n==2)
    {
        p=transaction(P0-1LL);
        return;
    }
    if(n==3)
    {
        p=transaction(P0-1LL);
        if(p.first.size()==1)
        {
            x=p.second;
            p=transaction(P0-2LL-x);
            p=transaction(P0-2LL-x);
            return;
        }
        x=P0-p.second-1LL;
        p=transaction(x/2LL);
        return ;
    }
    x=P0-2;
    for(int i=1;i<n;++i)
    {
        for(int j=1;j<=i;++j)
            p=transaction(x);
        x-=2;
    }
    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...