Submission #1255727

#	Time	Username	Problem	Language	Result	Execution time	Memory
1255727		madamadam3	선물 (IOI25_souvenirs)	C++20	18 / 100	0 ms	412 KiB

souvenirs

#include "souvenirs.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using pi = pair<int, int>;

#define FOR(i, a, b) for (int i = a; i < b; i++)
#define ROF(i, a, b) for (int i = a; i >= b; i--)
#define each(a, x) for (auto &a : x)
#define all(x) (x).begin(), (x).end()
#define bg(x) (x).begin()
#define en(x) (x).end()
#define rev(x) reverse(all(x))
#define sz(x) int((x).size())
#define srt(x) sort(all(x))
#define cnt(a, x) count(all(x), a)
#define trace(x) each(a, (x)) cout << a << " "
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound

struct DSU {
  int n; vi par, siz;

  DSU() {};
  DSU(int N) {
    n = N; par.resize(n); siz.assign(n, 1);
    iota(all(par), 0);
  }

  int find(int v) {
    if (par[v] == v) return v;
    return par[v] = find(par[v]);
  }

  void unite(int a, int b) {
    a = find(a); b = find(b);
    if (a != b) {
      if (siz[a] < siz[b]) swap(a, b);
      par[b] = a;
      siz[a] += siz[b];
    }
  }
};

using R = pair<vi, ll>;

int n;
vi bought; vl price;

R transact(ll money) {
  auto res = transaction(money);
  for (auto &el : res.first) {
    bought[el]++;
  }
  
  return res;
}

void buy_souvenirs(int N, ll P0) {
  n = N;
  bought.assign(n, 0); price.assign(n, -1);
  price[0] = P0;

  // FOR(i, 1, n) {
  //   ll p = price[i-1] - 1;
  //   auto r = transact(p);

  //   if (r.first.size() == 1) price[i] = p - r.second;
  //   else price[i] = p - 1;

  //   while (bought[i] < i) {
  //     transact(price[i]);
  //   }
  // }

  auto r = transact(P0 - 1);
  if (sz(r.first) == 1) {
    price[1] = P0 - 1 - r.second;
    transact(price[1] - 1);
    transact(price[1] - 1);
  } else {
    ll paid = (P0 - 1) - r.second;
    ll P2 = ((paid + 1) / 2) - 1;
    transact(P2);
  }
  return;
}

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