Submission #1271689

#TimeUsernameProblemLanguageResultExecution timeMemory
1271689nxteruFestival (IOI25_festival)C++20
27 / 100
71 ms9900 KiB
#include "festival.h"
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
struct Node {
  ll p,t,idx;
  bool operator<(const Node &b) const {
    return p*t*(b.t-1)<b.p*b.t*(t-1);
  }
};
vector<int> max_coupons(int A, vector<int> P, vector<int> T) {
  vector<Node> v;
  for(int i=0;i<P.size();i++) v.push_back({P[i],T[i],i} );
  sort(v.begin(),v.end());
  vector<int> ans;
  for(auto &x:v) ans.push_back(x.idx);
  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...