제출 #1344643

#제출 시각아이디문제언어결과실행 시간메모리
1344643KasymK축제 (IOI25_festival)C++20
27 / 100
47 ms4660 KiB
#include "bits/stdc++.h"
// #include "grader.cpp"
#include "festival.h"
using namespace std;
#define ff first
#define ss second    
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i)
#define wr puts("----------------")
#define mm make_pair
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N = 2e5+5;
const ll INF = 1e15;

vector<int> max_coupons(int m, vector<int> p, vector<int> t){
    int n=(int)t.size();
    vector<int> ans;
    for(int i = 0; i < n; ++i)
        ans.pb(i);
    auto cmp=[&](int x, int y) -> bool {
        return p[x]*1ll*t[x]*(t[y]-1)<p[y]*1ll*t[y]*(t[x]-1);
    };
    sort(all(ans), cmp);
    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...