杭电ACM-LCY算法进阶培训班-专题训练（1）

传送门

1001 {A} + {B}

#include <bits/stdc++.h>
#define inf 0x7fffffff
//#define ll long long
#define int long long
//#define double long double
#define eps 1e-8
//#define mod 1e9+7
using namespace std;
const int mod=1e9+7;
const int M=1e5;
const int N=1e7+5;//空间最大限制 4e8
int n,m;
signed main()
{
//	ios::sync_with_stdio(false);
	while(scanf("%lld%lld",&n,&m)!=EOF)
	{
		set < int > s;
		set < int > :: iterator it;
		for(int i=1;i<=n+m;i++)
		{
			int x;
			scanf("%lld",&x);
			s.insert(x);
		}
		it=s.begin();
		printf("%lld",*it);
		for(it++;it!=s.end();it++)  printf(" %lld",*it);
		puts("");
	}
    return 0;
}

1002 火车进站问题

#include <bits/stdc++.h>
#define inf 0x7fffffff
//#define ll long long
//#define int long long
//#define double long double
#define eps 1e-8
//#define mod 1e9+7
using namespace std;
const int mod=1e9+7;
const int M=1e5;
const int N=1e7+5;//空间最大限制 4e8
int n,m;
int a[N],b[N];
int in[N];
signed main()
{
//	ios::sync_with_stdio(false);
	while(scanf("%d",&n)!=EOF)
	{
		int top=0,cnt=1;	
		for(int i=1;i<=n;i++)  scanf("%1d",&a[i]);
		for(int i=1;i<=n;i++)  scanf("%1d",&b[i]);
		for(int i=1;i<=n;i++)
		{
			in[++top]=a[i];
			while(b[cnt]==in[top]&&top&&cnt<=n)  top--,cnt++;
		}
		if(top>0)
		{
			puts("No.\nFINISH");
			continue;
		}
		puts("Yes.");
		top=0,cnt=1;
		for(int i=1;i<=n;i++)
		{
			in[++top]=a[i];
			puts("in");
			while(b[cnt]==in[top]&&top&&cnt<=n)
			{
				puts("out");
				top--,cnt++;
			}
		}
		puts("FINISH");
	}
    return 0;
}

1003 统计书名

#include <bits/stdc++.h>
#define inf 0x7fffffff
//#define ll long long
//#define int long long
//#define double long double
#define eps 1e-8
//#define mod 1e9+7
using namespace std;
const int mod=1e9+7;
const int M=1e5;
const int N=1e7+5;//空间最大限制 4e8
map < string , int > mp;
int n,ans;
signed main()
{
//	ios::sync_with_stdio(false);
	while(cin>>n)
	{
		mp.clear();
		ans=0;
		while(n--)
		{
			string s;
			cin>>s;
			if(mp[s])  continue;
			mp[s]=1;
			ans++;
		}
		cout<<ans<<endl;
	}
    return 0;
}

1004 第M个数列

#include <bits/stdc++.h>
#define inf 0x7fffffff
//#define ll long long
//#define int long long
//#define double long double
#define eps 1e-8
//#define mod 1e9+7
using namespace std;
const int mod=1e9+7;
const int M=1e5;
const int N=1e7+5;//空间最大限制 4e8
int n,m,a[N];
signed main()
{
//	ios::sync_with_stdio(false);
	while(cin>>n>>m)
	{
		int ans=0;
		for(int i=1;i<=n;i++)  a[i]=i;
		do
		{
			ans++;
			if(ans==m)  break;
		}while(next_permutation(a+1,a+n+1));
		printf("%d",a[1]);
		for(int i=2;i<=n;i++)  printf(" %d",a[i]);
		puts("");
	}
    return 0;
}

1005 What Are You Talking About (格式错误了N发)

#include <bits/stdc++.h>
#define inf 0x7fffffff
//#define ll long long
//#define int long long
//#define double long double
#define eps 1e-8
//#define mod 1e9+7
using namespace std;
const int mod=1e9+7;
const int M=1e5;
const int N=1e7+5;//空间最大限制 4e8
int n,m,a[N];
string s1,s2;
char s[N];
int flag;
map < string , string >  mp;
map < string , int > mp2;
signed main()
{
//	ios::sync_with_stdio(false);
	while(cin>>s1)
	{
		if(s1=="START")  continue;
		if(s1=="END")  break;
		cin>>s2;
		mp2[s2]=1;
		mp[s2]=s1;
	}
	cin>>s1;
	getchar();
	while(1)
	{
		gets(s);
		if(strcmp(s,"END")==0)  break;
		int sz=strlen(s);
		s2="\0";
		for(int i=0;i<sz;i++)
		{
			if((s[i]<'a'||s[i]>'z')&&i<sz)
			{
				if(mp2[s2])  cout<<mp[s2];
				else  cout<<s2;
				s2="\0";
				cout<<s[i];
			}
			else  s2+=s[i];
		}
		cout<<endl;
	}
//	cout<<endl;
    return 0;
}

1006 Seinfeld

#include <bits/stdc++.h>
#define inf 0x7fffffff
//#define ll long long
//#define int long long
//#define double long double
#define eps 1e-8
//#define mod 1e9+7
using namespace std;
const int mod=1e9+7;
const int M=1e5;
const int N=1e7+5;//空间最大限制 4e8
string s;
int index;
signed main()
{
//	ios::sync_with_stdio(false);
	while(cin>>s&&s[0]!='-')
	{
		index++;
		int sz=s.size();
		int ans=0,cnt=0;
		for(int i=0;i<sz;i++)
			if(s[i]=='{')  cnt++;
			else
			{
				if(cnt>0)  cnt--;
				else  cnt++,ans++;
			}
		printf("%d. %d\n",index,ans+cnt/2);
	}
    return 0;
}