Codeforces Round #835 (Div. 4) - F. Quests

最新推荐文章于 2024-10-10 22:59:02 发布

wobushihaorenF

最新推荐文章于 2024-10-10 22:59:02 发布

阅读量178

点赞数

分类专栏：二分文章标签：算法 c++ 开发语言

本文链接：https://blog.csdn.net/aaa7888210/article/details/128018912

版权

二分专栏收录该内容

6 篇文章 0 订阅

订阅专栏

F. Quests

二分答案。

#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i = a;i<n;i++)
#define per(i,a,n) for(int i = n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
#define yes cout<<"YES"<<endl;
#define no cout<<"NO"<<endl;
#define endl '\n'
typedef vector<int> VI;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}());
const ll mod=1000000007;
int rnd(int x) {return mrand()%x;}
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(int a,int b){return a*b/gcd(a,b);}

const int N=2e5+10;
int a[N];
int n,T;
ll c,d;
int ans;

bool check(int k){
	ll res=0;
	rep(i,0,min(k,n)){
		res+=1LL*a[i]*(d/k);
		if(d%k>i) res+=1LL*a[i];
	}
	return res>=c;
}

void solve(){
	cin>>n>>c>>d;
	rep(i,0,n) cin>>a[i];
	sort(a,a+n);
	reverse(a,a+n);
	if(1LL*a[0]*d<c){
		cout<<"Impossible"<<endl;
		return;
	}
	int l=0,r=d+1;
	while(l<r){
		int m=l+r+1>>1;
		if(check(m+1)) l=m;
		else r=m-1;
	}
	if(l>d) cout<<"Infinity"<<endl;
	else cout<<l<<endl;             
}

int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>T;
	while(T--) solve();
	return 0;
}