Submission #1287842

#TimeUsernameProblemLanguageResultExecution timeMemory
1287842nikoloz-chSouvenirs (IOI25_souvenirs)C++20
25 / 100
13 ms400 KiB
#include <bits/stdc++.h>
using namespace std;

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

void buy_souvenirs(int N, long long P0){
    if(N == 2){
        auto pii = transaction(P0-1);
    } else if(N == 3){
        auto pii = transaction(P0-1);
        if(pii.first.size() == 2){
            auto p3 = transaction((P0-1-pii.second)/2);
            return;
        }
        auto p = transaction(P0-2-pii.second);
        auto p2 = transaction(P0-2-pii.second);
    } else{
        long long l1 = P0; map<int,int> mp;
        for(int i = 1; i < N; i++){
            bool tr = false;
            for(int j = 0; j < i; j++){
                if(mp[N-1] >= N-1) return;
                if(mp[99] >= 99) break;
                auto pii = transaction(l1-1);
                mp[i]++;
                if(pii.first.size() == 2){
                    tr = true;
                    mp[i+1]++;
                }
                if(pii.second == 1ll){
                    tr = true;
                }
                if(mp[N-1] >= N-1) return;
            }
            l1--;
            if(tr) l1--;
        }
    }
}
#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...