제출 #1264699

#제출 시각아이디문제언어결과실행 시간메모리
1264699martin_011선물 (IOI25_souvenirs)C++20
18 / 100
0 ms412 KiB
#include "souvenirs.h"
#include <utility>
#include <vector>
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<ll> vll;
typedef vector<int> vi;


void buy_souvenirs(int n, long long p0) {
  pair<vi, ll> x = transaction(p0-1);
  vi a = x.first;
  ll k = a.size();
  ll m = x.second;
  if (k==1) {
    transaction(p0 - m - 2);
    transaction(p0 - m - 2);
  } else {
    ll g = p0 - 1 - m;
    g -=1;
    g /= 2;
    transaction(g);
  }
}
#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...