【CSP-J 2021】网络连接

https://www.luogu.com.cn/problem/P7911?contestId=54994

#include <bits/stdc++.h>
using namespace std;  
#define LL long long
#define P pair<string,int>
string f,s;
P t[1010]; 
int n;
bool judge() //s
{
	int l=s.length(),n2=-1,ff=0,h1=0,h2=0;
	for(int i=0;i<l;i++)
	{
		if(s[i]>='0'&&s[i]<='9')
		{
			if(ff)return false;
			if(s[i]=='0')
			{
				if(n2==-1)ff=1;
			}
			if(n2==-1)n2=0;
			n2=n2*10+s[i]-'0';
			if(h2==0&&n2>255)return false;
			if(h2&&n2>65535)return false;
		}
		else if(s[i]=='.'||s[i]==':')
		{
			ff=0;
			if(s[i]=='.')h1++;		
			else 
			{
				if(h1!=3)return false;
				h2++;
			}
			if(n2<0||n2>255)return false;
			n2=-1;
		}
		else return false;
	}
	if(h1!=3||h2!=1)return false;
	if(n2<0||n2>65535)return false;
	return true;
}
int main()
{
	//freopen("network5.in","r",stdin);
	//freopen("output","w",stdout);
	scanf("%d",&n);
	char ss[100];
	int ll=1;
	for(int y=1;y<=n;y++)
	{
		scanf("%s",ss);f=ss;
		scanf("%s",ss);s=ss;
		if(!judge())printf("ERR\n");
		else //合法 存在a数组里 
		{
			if(f[0]=='C') //client
			{
				int flag=0,i=1;
				for(;i<ll;i++)
				{
					if(t[i].first==s)
					{
						flag=1;
						break;
					}
				}
				if(flag)printf("%d\n",t[i].second);
				else printf("FAIL\n");
			}
			else //server
			{
				int flag=1;
				for(int i=1;i<ll;i++)
				{
					if(t[i].first==s)
					{
						flag=0;
						break;
					}
				}
				if(flag)
				{
					t[ll].first=s;
					t[ll].second=y;
					ll++;
					printf("OK\n");
				}
				else printf("FAIL\n");
			}
		}
	}
	return 0;
}