NEUQ-ACM预备队必做题09

 判断奇偶，断环成链。只要离出发点最近的边权为0的边（从1开始编号），易得x%2==0时输。

#include<bits/stdc++.h>
#define ll long long
#define lowbit(x) (x)&(-x)
#define f(i,a,b) for(int (i)=(a);(i)<=(b);++i)
#define Ma(x,y) make_pair((x),(y))
#define mem0(x) memset((x),0,sizeof(x)) 
using namespace std;
const int N=21;
int n;

int main()
{
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	cin>>n;
	int mmax=0,mmin=n;
	f(i,1,n){
		int x;
		cin>>x;
		if(x==0){
			mmax=max(mmax,i);
			mmin=min(mmin,i); 
		}
	}
	if(!((n+1-mmax)%2) || !(mmin%2)){
		cout<<"YES";
		return 0;
	}	
	cout<<"NO";
	return 0;
}

P2197 【模板】Nim 游戏

xor

#include<bits/stdc++.h>
#define ll long long
#define lowbit(x) (x)&(-x)
#define f(i,a,b) for(int (i)=(a);(i)<=(b);++i)
#define Ma(x,y) make_pair((x),(y))
#define mem0(x) memset((x),0,sizeof(x)) 
using namespace std;
const int N=10001;
int n;

int main()
{
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int T;
	cin>>T;
	while(T--) 
	{
		cin>>n;
		int x,t=0;
		//cout<<t<<" ";
		f(i,1,n){
			cin>>x;
			t ^= x;
			//cout<<t<<" ";
		}
		if(!t){
			cout<<"No\n";
			continue;
		}	
		cout<<"Yes\n";
	}
	return 0;
}

P1113 杂务

记忆化dfs

不过输入良好，可以边输入边运算

#include<bits/stdc++.h>
#define ll long long
#define lowbit(x) (x)&(-x)
#define f(i,a,b) for(int (i)=(a);(i)<=(b);++i)
#define Ma(x,y) make_pair((x),(y))
#define mem0(x) memset((x),0,sizeof(x)) 
using namespace std;
const int N=10001;
struct stuff{
	int time,pre[101],len;
}a[N];
ll n,fi[N];
ll ans=0;
ll dfs(const int x)
{
	ll mmax=0;
	f(i,1,a[x].len){
		if(!fi[a[x].pre[i]]) fi[a[x].pre[i]]=dfs(a[x].pre[i]);
		
		//fi[a[x].pre[i]]+=a[a[x].pre[i]].time;
		mmax=max(mmax,fi[a[x].pre[i]]);
	}
	return mmax+a[x].time;
}
int main()
{
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	cin>>n;
	f(i,1,n){
		int x,y,cnt=0;
		cin>>x>>y;
		a[x].time=y;
		while(cin>>y && y){
			++cnt;
			a[x].pre[cnt]=y;
		}
		a[x].len=cnt;
	
		ans=max(ans,dfs(x));
	}
	cout<<ans;
	return 0;
}

P1002 [NOIP2002 普及组] 过河卒

dp

#include<bits/stdc++.h>
#define ll long long
#define lowbit(x) (x)&(-x)
#define f(i,a,b) for(int (i)=(a);(i)<=(b);++i)
#define Ma(x,y) make_pair((x),(y))
#define mem0(x) memset((x),0,sizeof(x)) 
using namespace std;
const int N=21;
struct coordinate{
	int x,y;
}ho,en; 
int a[N][N],ans=0;
int vis[N][N];
ll dp[N][N];
int oph[8][2]={ -1,-2,
				-1,2,
				1,-2,
				1,2,
				-2,-1,
				-2,1,
				2,-1,
				2,1
				};			  

int main()
{
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	cin>>en.x>>en.y>>ho.x>>ho.y;
	vis[ho.x][ho.y]=1;
	f(i,0,7){
		int x=ho.x+oph[i][0],y=ho.y+oph[i][1];
		if(x>=0&&x<=en.x && y>=0&&y<=en.y)
			vis[x][y]=1;
	}
	//f(i,0,max(en.x,en.y)) dp[i][0]=dp[0][i]=1;
	dp[0][0]=1;
	f(i,0,en.x){
	  f(j,0,en.y){ 
	  	if(!vis[i][j]){
	  		if(i!=0)  dp[i][j]+=dp[i-1][j];
			if(j!=0)	dp[i][j]+=dp[i][j-1];   
		  }
	//	cout<<dp[i][j]<<" ";  
	  }
	  //cout<<'\n';	   
	  }
	cout<<dp[en.x][en.y];
	return 0;
}