Submission #1279230

#TimeUsernameProblemLanguageResultExecution timeMemory
1279230thegodbridgexdSouvenirs (IOI25_souvenirs)C++20
7 / 100
14 ms400 KiB
#include "souvenirs.h"
#include <utility>
#include <vector>
//pragma GCC optimize("Ohio")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define matrix vector<vector<ll>>
#define fi first
#define se second
#define BIG __int128
#define wtf array<int,3>
#define dcm pair<int,int>
#define db long double
//MAIN
void buy_souvenirs(int N, ll P0){
    if (N == 2){
        transaction(P0 - 1);
        return ;
    }
    for (int i = 1; i <= N - 3; i++){
        P0--;
        auto [v, c] = transaction(P0);
        P0 -= c;
        for (int j = 2; j <= i; j++) transaction(P0);
    }
    P0--;
    auto [v, c] = transaction(P0);
    if (v.size() == 1){
        P0 -= c;
        for (int j = 1; j <= N - 1; j++) transaction(P0 - 1);
    }
    else{
        P0--;
        for (int j = 2; j <= N - 1; j++) transaction(1);
    }
    for (int j = 2; j <= N - 2; j++) transaction(P0);
}
#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...