제출 #1271699

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1271699		martin_011	축제 (IOI25_festival)	C++20	0 / 100	59 ms	9408 KiB

festival

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

using namespace std;

typedef long long ll;
typedef vector<ll> vll;
typedef vector<int> vi;
#define F first
#define S second

bool comp(const pair<pair<ll, ll>, ll> &a, const pair<pair<ll, ll>, ll> &b) {
  if (a.F.F != b.F.F) return a.F.F > b.F.F;
  if (a.F.S != b.F.S) return a.F.S < b.F.S;
  return a.S < b.S;
}


std::vector<int> max_coupons(int a, std::vector<int> p, std::vector<int> t) {
  ll n = p.size();
  vector<pair<pair<ll, ll>, ll>> v(n, {{0, 0}, 0});
  for (int i=0; i<n; i++) {
    v[i] = {{t[i], p[i]}, i};
  }
  sort(v.begin(), v.end(), comp);
  vi res;
  for (auto x : v) res.push_back(x.S);
  return res;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 5
• Subtask 2: 0 / 7
• Subtask 3: 0 / 12
• Subtask 4: 0 / 15
• Subtask 5: 0 / 27
• Subtask 6: 0 / 16
• Subtask 7: 0 / 18