Submission #1271689

#	Time	Username	Problem	Language	Result	Execution time	Memory
1271689		nxteru	축제 (IOI25_festival)	C++20	27 / 100	71 ms	9900 KiB

festival

#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;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 5
• Subtask 2: 0 / 7
• Subtask 3: 0 / 12
• Subtask 4: 0 / 15
• Subtask 5: 27 / 27
• Subtask 6: 0 / 16
• Subtask 7: 0 / 18