제출 #1283247

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1283247		LM1	축제 (IOI25_festival)	C++20	0 / 100	45 ms	7724 KiB

festival

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define ff first
#define ss second
#define pb push_back
#define vi vector<int>
#define fr(i,ii,iii) for(int i=ii;i<iii;i++)
const ll M=2e14;
bool srt(pair<pii,ll>a,pair<pii,ll>b){
	return(a.ff.ff*a.ff.ss-b.ff.ff*b.ff.ss<a.ff.ss*b.ff.ss*(a.ff.ff-b.ff.ff));
}
vector<int> max_coupons(int a,vector<int>v,vector<int>t){
	vi ans;
	vector<pair<pii,ll>>v1;
	fr(i,0,v.size()){
		v1.pb({{v[i],t[i]},i});
	}
	sort(v1.begin(),v1.end(),srt);
	for(auto i:v1){
		if((a-i.ff.ff)*i.ff.ss>=0){
			ans.pb((int)i.ss);
			if(a<M)a=(a-i.ff.ff)*i.ff.ss;
		}
		else break;
	}
	return ans;
}


//signed main() {
//  ll N, A;
//  assert(2 == scanf("%d %d", &N, &A));
//  std::vector<ll> P(N), T(N);
//  for (ll i = 0; i < N; i++)
//    assert(2 == scanf("%d %d", &P[i], &T[i]));
//  fclose(stdin);
//
//  std::vector<ll> R = max_coupons(A, P, T);
//
//  ll S = R.size();
//  prllf("%d\n", S);
//  for (ll i = 0; i < S; i++)
//    prllf("%s%d", (i == 0 ? "" : " "), R[i]);
//  prllf("\n");
//  fclose(stdout);
//
//  return 0;
//}

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