제출 #1256628

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

void buy_souvenirs(int N, long long P0) {
  pair<vector<int>, long long> res = transaction(N-1);
  ll cost=N-1-res.second;
  if(res.first.size()>1)
  transaction(cost/2);
  else
  transaction(cost-1);
  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...