Submission #1255082

#	Time	Username	Problem	Language	Result	Execution time	Memory
1255082		otarius	축제 (IOI25_festival)	C++20	0 / 100	65 ms	7604 KiB

festival

#include "festival.h"
#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace __gnu_pbds;
using namespace std;

// #pragma GCC optimize("Ofast")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#define ff first
#define sc second
#define pb push_back
#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define ull unsigned long long
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rngl(chrono::steady_clock::now().time_since_epoch().count());

// #define int long long
// #define int unsigned long long

// #define ordered_set(T) tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>
// #define ordered_multiset(T) tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>

// const ll mod = 1e9 + 7;
// const ll mod = 998244353;

const ll inf = 1e9;
const ll biginf = 1e18;
// const int maxN;

bool comp(array<int, 3> a, array<int, 3> b) {
    return a[0] * a[1] * b[1] + b[0] * b[1] > a[0] * a[1] * b[1] + a[0] * a[1];
}
vector<int> max_coupons(int a, vector<int> p, vector<int> t) {
    vector<array<int, 3>> v;
    for (int i = 0; i < p.size(); i++)
        v.pb({p[i], t[i], i});
    sort(all(v), comp);
    vector<int> ans;
    for (auto i : v) ans.pb(i[2]);
    return ans;
}
// int main() {
//   int N, A;
//   assert(2 == scanf("%d %d", &N, &A));
//   std::vector<int> P(N), T(N);
//   for (int i = 0; i < N; i++)
//     assert(2 == scanf("%d %d", &P[i], &T[i]));
//   fclose(stdin);

//   std::vector<int> R = max_coupons(A, P, T);

//   int S = R.size();
//   printf("%d\n", S);
//   for (int i = 0; i < S; i++)
//     printf("%s%d", (i == 0 ? "" : " "), R[i]);
//   printf("\n");
//   fclose(stdout);

//   return 0;
// }

• 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