Submission #1252559

#TimeUsernameProblemLanguageResultExecution timeMemory
1252559comgaTramAnh축제 (IOI25_festival)C++20
27 / 100
62 ms4668 KiB
#include <bits/stdc++.h> 
#include "festival.h"

using namespace std;
std::vector <int> max_coupons(int A, std::vector <int> P, std::vector <int> T) {
  auto compare = [&](int i, int j) {
    std::pair <int, int> a = std::make_pair(P[i], T[i]); 
    std::pair <int, int> b = std::make_pair(P[j], T[j]); 
    return (1LL * a.first * a.second * b.second + 1LL * b.first * b.second < 1LL * b.first * a.second * b.second + 1LL * a.first * a.second);
  };
  std::vector <int> ret; 
  for (int i = 0; i < (int) T.size(); i++) {
    ret.push_back(i); 
  }
  std::sort(ret.begin(), ret.end(), compare); 
  return ret;         
}
#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...