제출 #1251108

#제출 시각아이디문제언어결과실행 시간메모리
1251108aryan12선물 (IOI25_souvenirs)C++20
21 / 100
11 ms400 KiB
#include "souvenirs.h"
#include <utility>
#include <vector>

void buy_souvenirs(int N, long long P0) {
  long long cur = P0, last_used = 0;
  for(int i = 1; i < N; i++) {
    if(i != N - 1) {
      std::pair<std::vector<int>, long long> res = transaction(cur - 1);
      if(res.first.size() == 2 || res.second == 1) {
        cur = cur - 2;
        if(res.first.size() == 2) {
          last_used += 1;
        }
      }
      else {
        cur = cur - 1;
      }
      for(int j = 0; j < i - 1; j++) {
        transaction(cur);
      }
    }
    else {
      for(int j = last_used; j < i; j++) {
        transaction(cur - 1);
      }
    }
  }
  // std::pair<std::vector<int>, long long> res = transaction(3);
  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...