Submission #1250489

#	Time	Username	Problem	Language	Result	Execution time	Memory
1250489		fadyscube	선물 (IOI25_souvenirs)	C++20	21 / 100	12 ms	400 KiB

souvenirs

#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;
}

• Subtask 0: 0 / 0
• Subtask 1: 4 / 4
• Subtask 2: 3 / 3
• Subtask 3: 14 / 14
• Subtask 4: 0 / 18
• Subtask 5: 0 / 28
• Subtask 6: 0 / 33