工具函数

15 届蓝桥杯 14 天省赛冲刺营 1 期 - CLZ银行问题 - 蓝桥云课 (lanqiao.cn)

#include <bits/stdc++.h>
using namespace std;
#define cx first
#define cy second
const int N=20;
typedef pair<int,int> PII;
int cnt=0;
int m;
int a[N]; 
queue<string>v;
queue<string>n;
void solve(){ 
    cin>>m;
    while(m--){
    string s;cin>>s;
    if(s=="IN"){
    	string name;
    	char ch;cin>>name;
    	cin>>ch;
    	if(ch=='N'){
    		n.push(name);
		}
		else v.push(name);
	}else{
		char ch;cin>>ch;
		if(ch=='N'){
			n.pop();
		}else v.pop();
	}
}
	while(v.size()){
		cout<<v.front()<<'\n';
		v.pop();
	}
	while(n.size()){
		cout<<n.front()<<'\n';
		n.pop();
	}
}
int main(){
  int t=1;
  while(t--)solve(); 
  return 0;
}

 15 届蓝桥杯 14 天省赛冲刺营 1 期 - 费里的语言 - 蓝桥云课 (lanqiao.cn)

#include <bits/stdc++.h>
using namespace std;
#define cx first
#define cy second
const int N=20;
typedef pair<int,int> PII;
int cnt=0;
int n;
vector<string>v;
void solve(){ //注意先判断再放进去
    cin>>n;
    for(int i=1;i<=n;i++){
    	string s;cin>>s;
    	if(find(v.begin(),v.end(),s)!=v.end()){
    		cout<<s; 
    		return ;
		}
    	v.push_back(s);
	}
	cout<<"NO";
}
int main(){
  int t=1;
  while(t--)solve(); 
  return 0;
}

15 届蓝桥杯 14 天省赛冲刺营 1 期 - 快递分拣 - 蓝桥云课 (lanqiao.cn) 

#include <bits/stdc++.h>
using namespace std;
#define cx first
#define cy second
const int N=20;
typedef pair<int,int> PII;
int cnt=0;
int n;
map<string,vector<string> > mp;
vector<string>c;//用于存城市的名字 
void solve(){ 
    cin>>n;
    for(int i=1;i<=n;i++){
    	string d,city;cin>>d>>city;
    	if(find(c.begin(),c.end(),city)==c.end()){
    		c.push_back(city);
		}
		mp[city].push_back(d);
	}
	vector<string>::iterator it=c.begin();
	for(;it!=c.end();it++){
		cout<<*it<<" "<<mp[*it].size()<<'\n';
		vector<string>::iterator i=mp[*it].begin();
		for(;i!=mp[*it].end();i++){
			cout<<*i<<'\n';
		}
	}
}
int main(){
  int t=1;
  while(t--)solve(); 
  return 0;
}