제출 #1250239

#제출 시각아이디문제언어결과실행 시간메모리
1250239faustaadp선물 (IOI25_souvenirs)C++20
18 / 100
0 ms412 KiB
#include "souvenirs.h"
#include "bits/stdc++.h"
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define fi first
#define se second

void buy_souvenirs(int N, long long P0) {
  long long X = P0 - 1;
  pair<vector<int>, long long> res = transaction(X);
  ll Y = res.second;
  // cout << X << " " << Y << "\n";
  if((res.first).size() == 1) {
    transaction(X - Y - 1);
    transaction(X - Y - 1);
  } else {
    transaction((X - Y) / 2);
  }
  return;
}
#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...