제출 #1252622

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1252622		Zbyszek99	Festival (IOI25_festival)	C++20	0 / 100	73 ms	7616 KiB

festival

#include "festival.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;

ll P[200001];
ll T[200001];

bool comp(int a, int b)
{
    ll val_a = -P[a]*T[a]*T[b]-P[b]*T[b];
    ll val_b = -P[b]*T[b]*T[a]-P[a]*T[b];
    return val_a > val_b;
}

vi max_coupons(int A2, vi P2, vi T2) 
{
    ll coins = A2;
    int n = siz(P2);
    rep(i,n)
    {
        P[i] = P2[i];
        T[i] = T2[i];
    }
    vi v;
    rep(i,n) v.pb(i);
    sort(all(v),comp);
    return v;
}

• 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