Submission #1260345

#	Time	Username	Problem	Language	Result	Execution time	Memory
1260345		robijoy	Souvenirs (IOI25_souvenirs)	C++20	0 / 100	11 ms	400 KiB

souvenirs

/*
 *   Starting with the name of almighty ALLAH
 */
#include "souvenirs.h"
// #include <bits/stdc++.h>

using namespace std;

// #define int long long 

void buy_souvenirs(int N, long long P0) {
    vector<int> left(N);
    for (int i = 0; i < N; ++i) left[i] = i;
    int LowerPN = max(1LL,P0 - (2*N)); // the least limit of the last sou..
    int PN = -1;
    for (int i = LowerPN; i < P0; ++i)
    {
         pair<vector<int>, long long> res = transaction(i);
         if(res.first.size() == 1) {
            PN = i;
            left[PN] --;
            break;
         }
    }

    // we got P0 and the last price too.

    for (int i = PN+1; i < P0; ++i)
    {
        pair<vector<int>, long long> res = transaction(i);
        vector<int> robi = res.first;
        for(auto it:robi) left[it]--;
    }

    for (int i = 0; i < N; ++i)
    {
        int cur = i;
        for(int j = 0; j < left[i]; j++) {
              transaction(cur);
        }
    }

}

• 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