| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1263199 | abdelhakim | Festival (IOI25_festival) | C++20 | 197 ms | 15656 KiB |
#include "festival.h"
#include <bits/stdc++.h>
#define ll long long
#define dbg(x) cerr<<#x<<' ' << x << endl;
using namespace std;
std::vector<int> max_coupons(int A, std::vector<int> P, std::vector<int> T) {
ll n=P.size();
vector<vector<ll>> pr(P.size());
for (int i=0;i<n;i++)
{
pr[i]={P[i],T[i],i};
}
auto comparator = [](vector<ll> a, vector<ll> b)
{
ll val1=a[0]*a[1]*b[1]+b[0]*b[1];
ll val2= b[0]*a[1]*b[1] + a[0]*a[1];
return val1 < val2;
};
sort(pr.begin(), pr.end(),comparator);
vector<int> ans;
for (auto &&e : pr)
{
ans.push_back(e.back());
}
return ans;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
