Codeforces Goodbye 2019

最新推荐文章于 2024-12-30 20:03:52 发布

原创最新推荐文章于 2024-12-30 20:03:52 发布 · 410 阅读

CC 4.0 BY-SA版权

本文深入探讨了使用C++进行编程竞赛的高级技巧，包括快速输入输出、常量定义、数组处理以及解决特定问题的算法策略。通过实例展示了如何优化代码效率，确保在有限时间内完成复杂任务。

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<long long,long long> pll;
template<class T>inline void rd(T &x){x=0;char o,f=1;while(o=getchar(),o<48)if(o==45)f=-f;do x=(x<<3)+(x<<1)+(o^48);while(o=getchar(),o>47);x*=f;}
const int inf=~0u>>2; //1073741823
const ll INF=~0ull>>2;//4611686018427387903
const int maxn=2e5+10;
ll n,k1,k2,flag,x;
void solve()
{
	flag=0;
	rd(n),rd(k1),rd(k2);
	for(int i=1;i<=k1;i++) {rd(x);if(x==n) flag=1;}
	for(int i=1;i<=k2;i++) rd(x);
	if(flag==1) puts("YES");else puts("NO");
}
int main()
{
	#ifndef ONLINE_JUDGE
	freopen("hzh.in","r",stdin);
	//freopen("hzh.out","w",stdout);
	#endif
	
	ll T;
    rd(T);
    while(T--)
	
	solve();
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<long long,long long> pll;
template<class T>inline void rd(T &x){x=0;char o,f=1;while(o=getchar(),o<48)if(o==45)f=-f;do x=(x<<3)+(x<<1)+(o^48);while(o=getchar(),o>47);x*=f;}
const int inf=~0u>>2; //1073741823
const ll INF=~0ull>>2;//4611686018427387903
const int maxn=2e5+10;
ll n,a[maxn];
void solve()
{
	rd(n);
	for(int i=1;i<=n;i++) rd(a[i]);
	for(int i=1;i<n;i++)
	{
		if(abs(a[i+1]-a[i])>1)
		{
			cout<<"YES"<<endl;
			cout<<i<<' '<<i+1<<endl;
			return;
		}
	}
	cout<<"NO"<<endl;
}
int main()
{
	#ifndef ONLINE_JUDGE
	freopen("hzh.in","r",stdin);
	//freopen("hzh.out","w",stdout);
	#endif
	
	ll T;
    rd(T);
    while(T--)
	
	solve();
    return 0;
}

C
异或的小规律，把右边先变成0，然后再加个数

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<long long,long long> pll;
template<class T>inline void rd(T &x){x=0;char o,f=1;while(o=getchar(),o<48)if(o==45)f=-f;do x=(x<<3)+(x<<1)+(o^48);while(o=getchar(),o>47);x*=f;}
const int inf=~0u>>2; //1073741823
const ll INF=~0ull>>2;//4611686018427387903
const int maxn=2e5+10;
ll n,a[maxn],suml,sumr;
void solve()
{
	rd(n);
	rd(a[1]);
	suml=sumr=a[1];
	for(int i=2;i<=n;i++) rd(a[i]),suml+=a[i],sumr^=a[i];
	cout<<2<<endl;
	cout<<sumr<<' '<<suml+sumr<<endl;
	cout<<endl;
}
int main()
{
	#ifndef ONLINE_JUDGE
	freopen("hzh.in","r",stdin);
	//freopen("hzh.out","w",stdout);
	#endif
	
	ll T;
    rd(T);
    while(T--)
	
	solve();
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<long long,long long> pll;
template<class T>inline void rd(T &x){x=0;char o,f=1;while(o=getchar(),o<48)if(o==45)f=-f;do x=(x<<3)+(x<<1)+(o^48);while(o=getchar(),o>47);x*=f;}
const int inf=~0u>>2; //1073741823
const ll INF=~0ull>>2;//4611686018427387903
const int maxn=500+10;
int x,y,n,k,maxx;
void solve()
{
	map<int,int>m;
	scanf("%d%d",&n,&k);
	for(int i=1;i<=k+1;i++)
	{
		printf("?");
		for(int j=1;j<=k+1;j++) if(i!=j) printf(" %d",j);
		puts("");
		fflush(stdout);
		scanf("%d%d",&x,&y);
		m[y]++;
		maxx=max(maxx,y);
	}
	printf("! %d\n",m[maxx]);
}
int main()
{
	solve();
    return 0;
}