WA30分求助
  • 板块P2264 情书
  • 楼主lizhixun
  • 当前回复0
  • 已保存回复0
  • 发布时间2024/9/19 21:23
  • 上次更新2024/9/20 06:54:11
查看原帖
WA30分求助
1030381
lizhixun楼主2024/9/19 21:23

rt

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

int n, ans;
string move_to[2005], send, wow, zw, s;
bool vis[2005];

signed main() {
	cin >> n;
	
	for (int i = 1; i <= n; i++) {
		cin >> s;
		wow = "";
		int len = s.size();
		
		for (int j = 0; j < len; j++) {
			if (isupper(s[j]) == 1) s[j] = tolower(s[j]);
			wow += s[j];
		}
		
		move_to[i] = wow;
	}
	
	getchar();
	getline(cin, zw);
	
	int len = zw.size();
	
	for (int i = 0; i < len; i++) {
		if (isupper(zw[i]) == 1) zw[i] = tolower(zw[i]);
	}
	
	for (int i = 0; i < len; i++) {
		if (zw[i] == '.') {
			for (int j = 1; j <= n; j++) {
				if (send == move_to[j] && !vis[j]) {
					vis[j] = 1;
					ans++;
					break;
				}
			}
			send = "";
			memset(vis, 0, sizeof(vis));
		}
		
		if (zw[i] == ',' || zw[i] == ' ') {
			for (int j = 1; j <= n; j++) {
				if (send == move_to[j] && !vis[j]) {
					vis[j] = 1;
					ans++;
					break;
				}
			}
			
			send = "";
			continue;
		}
		
		send += zw[i];
	}
	
	cout << ans;
	return 0;
}
2024/9/19 21:23
加载中...