Submission #1278422

#TimeUsernameProblemLanguageResultExecution timeMemory
1278422dang_minh_ducSouvenirs (IOI25_souvenirs)C++20
0 / 100
2 ms400 KiB
#include <bits/stdc++.h>
#include "souvenirs.h"
#define ll long long
#define fi first
#define se second
#define data pair<vector<int>, int>
using namespace std;
vector<ll>p(3, 0);
void buy_souvenirs(int n, ll P0) {
    data t=transaction(P0-1);
    if (t.fi.size()==1) {
        p[1]=P0-1-t.se;
        transaction(p[1]-1);
        transaction(p[1]-1);
    }
    else {
        ll mid=(P0-1-t.se)>>1;
        transaction(mid);
    }
}
#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...