Submission #1250760

#TimeUsernameProblemLanguageResultExecution timeMemory
1250760discontinuousSouvenirs (IOI25_souvenirs)C++20
7 / 100
11 ms412 KiB
// Author: Anikait Prasar

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

typedef long long ll;
#define pb push_back

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

void buy_souvenirs(int n, ll p0) {
    if(n==2) {
        transaction(p0-1);
        return;
    }

    else if(n==3) {
        auto h = transaction(p0-1);
        int d = h.first.size();
        ll c = h.second;

        ll sum = p0-1-c;
        // if(d==1) {
        //     // Here, sum is the value of
        //     // 2nd element
        //     transaction(sum-1);
        // } 
        if(d==2){
            transaction(sum/2);
        }

        return;
    }

    int k = 1;
    for(ll i = n-1; i>0; i--) {
        for(ll j = 0; j<k; j++) transaction(i);
        k++;
    }
}

#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...