Codeforces Round #615 (Div. 3)

怎么说呢，总之Div3还是蛮有意思的吧！
Collecting Coins

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    int T;cin>>T;
    while(T--)
    {
        int flag=1;
        ll a,c,b,n;
        cin>>a>>b>>c>>n;
        ll d=max(max(a,b),c);
        ll sum=d-a+d-b+d-c;
        if(sum>n)
            cout<<"NO"<<endl;
        else
        {
            if((n-sum)%3==0)
                cout<<"YES"<<endl;
            else
                cout<<"NO"<<endl;
        }
    }
    return 0;
 
}

Collecting Packages

#include<bits/stdc++.h>
using namespace std;
const int N = 1111;
 
struct node
{
	int x,y;
}eg[N];
 
bool cmp(node a,node b)
{
	if(a.x==b.x)
		return a.y<b.y;
	else 
		return a.x<b.x;
}
 
int main()
{
	ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
	int T;
	cin>>T;
	while(T--)
	{
		int n;	cin>>n;
		eg[0].x=0,eg[0].y=0;
		for(int i=1;i<=n;i++)
			cin>>eg[i].x>>eg[i].y;
				
		sort(eg+1,eg+n+1,cmp);
		int flag=0;
		for(int i=1;i<=n;i++)
		{
			if(eg[i].x-eg[i-1].x<0||eg[i].y-eg[i-1].y<0) 
			{
				flag=1;
				break;
			}
		}
		if(flag) 
		{
			cout<<"NO"<<endl;
			continue;
		}
		else
		{
			cout<<"YES"<<endl;
 
			for(int i=1;i<=n;i++)
			{
				int stemp1=eg[i].x-eg[i-1].x;
				int stemp2=eg[i].y-eg[i-1].y;
				for(int i=1;i<=stemp1;i++)
					cout<<"R";
				for(int i=1;i<=stemp2;i++)
					cout<<"U";
			}	
		}
 
		cout<<endl;
	}
	return 0;
}

Product of Three Numbers

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
 
 
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
	int T,n;
	cin>>T;
	while(T--)
	{
		cin>>n;
		set<ll> st;
		for(int i=2;i<=sqrt(n);i++)
        {
			if(n%i==0)
			{
				st.insert(i);
				int temp=n/i;
				for(int j=i+1;j<=sqrt(temp);j++)
				{
					if(temp%j==0)
					{
						st.insert(j);
						st.insert(temp/j);
						break;
					}
				}
				break;
			}
		}
		if(st.size()!=3)
		{
			cout<<"NO"<<endl;
		}
		else
		{
			cout<<"YES"<<endl;
			for(auto x:st)
				cout<<x<<" ";
			cout<<endl;
		}
	}
 
	return 0;
}

MEX maximizing

#include<bits/stdc++.h>
using namespace std;

int arr[400001];
int main(){


	int q,x,n,ans=0;
	cin>>q>>x;

	for(int i=0;i<q;i++)
	{
		cin>>n;
		arr[n%x]++;

		while(arr[ans%x]>0)
		{
			arr[ans%x]--;
			ans++;
		}
		cout<<ans<<endl;

	}


	return 0;
}

Obtain a Permutation

#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
int n,m,_a[1000005],*a[1000005],val[1000005];
int main()
{
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)
	{
		a[i]=_a+(i-1)*m;
		for(int j=1;j<=m;j++)scanf("%d",&a[i][j]);
	}
	int ans=0;
	for(int j=1;j<=m;j++)
	{
		for(int i=1;i<=n;i++)val[i]=i-1+n;
		for(int i=1;i<=n;i++)
		{
			if((a[i][j]-1)%m+1==j&&a[i][j]<=n*m)
			  val[(i+n-(a[i][j]-1)/m-1)%n+1]--;
		}
		int x=2147483647;
		for(int i=1;i<=n;i++)x=min(x,val[i]);
		ans+=x;
	}
	printf("%d\n",ans);
	return 0;
}
/*

Three Paths on a Tree

*#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
struct Edge
{
	int to;
	int nxt;
}e[400005];
int n,m,edgenum,head[200005],pa[200005],dep[200005];
bool flag[200005];
void add(int u,int v)
{
	e[++edgenum].to=v;
	e[edgenum].nxt=head[u];
	head[u]=edgenum;
}
void dfs(int node)
{
	if(flag[node])dep[node]=1;
	else dep[node]=dep[pa[node]]+1;
	for(int hd=head[node];hd;hd=e[hd].nxt)
	{
		int to=e[hd].to;
		if(to==pa[node])continue;
		pa[to]=node;
		dfs(to);
	}
}
int main()
{
	scanf("%d",&n);
	for(int i=1;i<n;i++)
	{
		int u,v;
		scanf("%d%d",&u,&v);
		add(u,v);
		add(v,u);
	}
	dfs(1);
	int a=0,b=0,c=0;
	for(int i=1;i<=n;i++)
		if(dep[a]<dep[i])a=i;
	pa[a]=0;
	dfs(a);
	for(int i=1;i<=n;i++)
		if(dep[b]<dep[i]&&a!=i)b=i;
	int x=b,ans=0;
	while(x)
	{
		flag[x]=1;
		x=pa[x];
		ans++;
	}
	dfs(a);
	for(int i=1;i<=n;i++)
		if(dep[c]<dep[i]&&a!=i&&b!=i)c=i;
	x=c;
	while(!flag[x])
	{
		flag[x]=1;
		x=pa[x];
		ans++;
	}
	printf("%d\n%d %d %d\n",ans-1,a,b,c);
	return 0;
}