2023/2/1

A

#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
typedef long long ll;
ll a[100005],s[100005];
void slove(){
	int n,q;
	cin>>n>>q;
	for(int i=1;i<=n;i++)cin>>a[i];
	sort(a+1,a+1+n);
	for(int i=1;i<=n;i++)s[i]=s[i-1]+a[i];
	while(q--){
		int k,x;
		cin>>k>>x;
		int i=upper_bound(a+1,a+1+n,x)-a-1;
		if(i>k)cout<<s[i]-s[i-k]<<endl;
		else cout<<s[i]<<endl;
	}
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
	int T=1;
//	cin>>T;
	while(T--){
		slove();
	}
	return 0;
}

B

#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
typedef long long ll;
void slove(){
	int n;
	cin>>n;
	if(n%2)cout<<"Yaya-win!";
	else cout<<"win-win!";
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
	int T=1;
//	cin>>T;
	while(T--){
		slove();
	}
	return 0;
}

C

#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
typedef long long ll;
void slove(){
	string a,b;
	cin>>a>>b;
	if(a==b){
		cout<<"=";
		return;
	}
	if(a.length()==b.length()){
		cout<<"!";
		return;
	}
	if(a.length()>b.length()){
		char st=a[0];
		int i=0;
		string aa="",bb="";
		for(i;i<a.length();i++)if(a[i]!=st)break;
		for(i;i<a.length();i++)aa+=a[i];
		i=0;
		for(i;i<b.length();i++)if(b[i]!=st)break;
		for(i;i<b.length();i++)bb+=b[i];
		if(aa.length()>bb.length()){
			cout<<">";
			return;
		}
		if(aa.length()<bb.length()){
			cout<<"!";
			return;
		}
		for(i=0;i<aa.length();i++){
			if(aa[i]==bb[i])continue;
			if(bb[i]==st)cout<<">";
			else cout<<"!";
			return;
		}
		cout<<"!";
	}
	else{
		swap(a,b);
		char st=a[0];
		int i=0;
		string aa="",bb="";
		for(i;i<a.length();i++)if(a[i]!=st)break;
		for(i;i<a.length();i++)aa+=a[i];
		i=0;
		for(i;i<b.length();i++)if(b[i]!=st)break;
		for(i;i<b.length();i++)bb+=b[i];
		if(aa.length()>bb.length()){
			cout<<"<";
			return;
		}
		if(aa.length()<bb.length()){
			cout<<"!";
			return;
		}
		for(i=0;i<aa.length();i++){
			if(aa[i]==bb[i])continue;
			if(bb[i]==st)cout<<"<";
			else cout<<"!";
			return;
		}
		cout<<"!";
	}
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
	int T=1;
//	cin>>T;
	while(T--){
		slove();
	}
	return 0;
}

D

#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define l first
#define r second
typedef long long ll;
const int N=1e5+5;
pair<int,int>a[N],b[N];
void slove(){
	int n;
	cin>>n;
	for(int i=1;i<=n;i++)cin>>a[i].l>>a[i].r;
	for(int i=1;i<=n;i++)cin>>b[i].l>>b[i].r;
	priority_queue<pair<int,int>>q,p;
	int s1=0,s2=0;
	for(int i=1;i<=n;i++){
		q.push({-a[i].l,a[i].r});
		p.push({-b[i].l,b[i].r});
		while(q.size()&&-q.top().l<=s1+1){
			s1=max(q.top().r,s1);
			q.pop();
		}
		while(p.size()&&-p.top().l<=s2+1){
			s2=max(p.top().r,s2);
			p.pop();
		}
		if(s1>s2)cout<<"sa_win!\n"<<s1-s2<<endl;
		else if(s2>s1)cout<<"ya_win!\n"<<s2-s1<<endl;
		else cout<<"win_win!\n0\n";
	}
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
	int T=1;
//	cin>>T;
	while(T--){
		slove();
	}
	return 0;
}

H

思路

二分答案

#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
typedef long long ll;
#define int long long
int x,y,k,n,t;
bool check(int m){
	ll s=0,xx=x,cnt=0,q=n;
	while(m--){
		s+=xx*q;
		cnt+=q;
		xx+=cnt/k*y;
		cnt%=k;
		q--;
		if(s>=t)return true;
	}
	return s>=t;
}
void slove(){
	cin>>x>>y>>k>>n>>t;
	if(!check(n)){
		cout<<"-1";
		return;
	}
	int l=1,r=n;
	while(l<r){
		int mid=l+r>>1;
		if(check(mid))r=mid;
		else l=mid+1;
	}
	cout<<r;
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
	int T=1;
	while(T--){
		slove();
	}
	return 0;
}

I

思路

根据给出的样例 2 3 6 而不是 2 2 7 可知题目要求的是尽可能每一步都能赚得多，而不是让某一步赚的尽可能多，即

字典序尽可能大

首先可以得出一个最小能赚的方案 1 1 2 4 8 …
然后每次判断是否有多于的m如果则尽可能让字典序小的分配给每一位

#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
typedef long long ll;
#define int long long
void slove(){
	int n,m;
	cin>>n>>m;
	vector<int>b(n),a(n),sum(n+1,0);
	int now=1,s=0;
	n--;
	for(int i=0;i<=n;i++){
		a[i]=now;
		s+=now;
		m-=now;
		now=s;
		if(m<0){
			cout<<"-1";
			return;
		}
		b[i]=a[i];
	}
	for(int i=n;i>=0;i--){
		sum[i]=sum[i+1]+a[n-i];
	}
	while(m){
		int t=n,cnt=0;
		for(int i=n;i>=0;i--){
			if(sum[i]>m)break;
			t=i;
		}
		int y=m/sum[t];
		m-=y*sum[t];
		for(int i=t;i<=n;i++){
			b[i]+=y*a[cnt++];
		}
	}
	for(auto x:b)cout<<x<<" ";
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
	int T=1;
	while(T--){
		slove();
	}
	return 0;
}
/*
1 1 2 4
4 2 1 1
1 2 3 6
*/

K

#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
typedef long long ll;
void slove(){
	ll n,ans=0;
	cin>>n;
	while(n>1){
		ll a=n/2;
		ll b=n-a;
		while(a<=b){
			a++;b--;
		}
		if(n==a)break;
		n=a;
		ans++;
	}
	cout<<ans<<endl;
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
	int T=1;
//	cin>>T;
	while(T--){
		slove();
	}
	return 0;
}

L

思路

因为数据范围较小 跑满也没办法超过 10000*500 所以可以使用最短路跑一遍从n到每个数的距离
也可以使用dp，转移方程为 dp[i-i%$x_j$]=min(dp[i-i%$x_j$],dp[i]+$b_j$)
dij

#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
typedef long long ll;
#define int long long
#define f first
#define s second
const int inf=1e18;
int ans[100005];
bool vis[100005];
pair<int,int>a[505];
void slove(){
	int n,m;
	cin>>n>>m;
	for(int i=1;i<=n;i++)ans[i]=inf;
	for(int i=1;i<=m;i++)cin>>a[i].s>>a[i].f;
	sort(a+1,a+1+m);
	priority_queue<pair<int,int>>q;
	q.push({0,n});
	ans[n]=0;
	int mx=n;
	while(q.size()){
		int x=q.top().s;
		q.pop();
		mx=min(x,mx);
		if(vis[x])continue;
		vis[x]=true;
		for(int i=1;i<=m;i++){
			if(a[i].f>=x)break;
			int y=x-x%a[i].f;
			if(ans[y]>ans[x]+a[i].s){
				ans[y]=ans[x]+a[i].s;
				q.push({-ans[y],y});
			}
		}
	}
	cout<<ans[mx]<<endl;
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
	int T=1;
	while(T--){
		slove();
	}
	return 0;
}

dp

#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
typedef long long ll;
#define int long long
#define f first
#define s second
const int inf=1e18;
int dp[100005];
pair<int,int>a[505];
void slove(){
	int n,m;
	cin>>n>>m;
	for(int i=1;i<=n;i++)dp[i]=inf;
	for(int i=1;i<=m;i++)cin>>a[i].s>>a[i].f;
	sort(a+1,a+1+m);
	dp[n]=0;
	for(int i=n;i>=3;i--){
		for(int j=1;a[j].f<=i&&j<=m;j++){
			int y=i-i%a[j].f;
			dp[y]=min(dp[y],dp[i]+a[j].s);
		}
	}
	for(int i=1;i<=n;i++){
		if(dp[i]==inf)continue;
		cout<<dp[i]<<endl;
		break;
	}
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
	int T=1;
	while(T--){
		slove();
	}
	return 0;
}