제출 #1250489

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

using namespace std;

void buy_souvenirs(int N, long long P0) {
  long long x = P0;
  vector<int> lim(N);
  for (int i = 0; i < N; i++)
    lim[i] = i;
  for (int i = 1; i < N; i++) {
    x--;
    pair<vector<int>, long long> t = transaction(x);
    lim[i]--;
    if (t.first.size() == 2) {
      lim[N-1]--;
    }
    if (t.second == 1 || t.first.size() == 2) {
      x--;
    }
    for (int j = 0; j < i-1; j++) {
      if (lim[i] == 0) break;
      transaction(x);
      lim[i]--;
    }
  }
  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...