제출 #1287197

#제출 시각아이디문제언어결과실행 시간메모리
1287197lopkusSouvenirs (IOI25_souvenirs)C++20
18 / 100
2 ms400 KiB
#include <bits/stdc++.h>

#include "souvenirs.h"

void buy_souvenirs(int n, long long p0) {
  assert(n == 3);
  //std::pair<std::vector<int>, long long> res = transaction(3);
  std::pair<std::vector<int>, long long> ask1 = transaction(p0 - 1);
  if((ask1.first).size() == 1) {
    long long x = p0 - 1;
    x -= ask1.second;
    transaction(x - 1);
    transaction(x - 1);
  }
  else {
    long long s = p0 - 1 - ask1.second;
    transaction(s / 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...