Submission #28554

#	Time	Username	Problem	Language	Result	Execution time	Memory
28554		흐훗흐흐훗핫 (#68)	Play Onwards (FXCUP2_onward)	C++98	1 / 1	123 ms	2308 KiB

onward

#include <iostream>
#include <string>
#include <vector>
#include <queue>
using namespace std;
string tmp[333];
int dp[333];
vector<int> arr[333];
int main(void)
{
	int n,m;
	cin >> n >> m;
	for(int e=0;e<n;e++) cin >> tmp[e];
	for(int e=0;e<n;e++)
	{
		for(int p=e+1;p<n;p++)
		{
			int mm=0,qq=0,rr=0;
			for(int q=0;q<tmp[e].size();q++)
			{
				for(int r=0;r<tmp[p].size();r++)
				{
					if(tmp[e][q]==tmp[p][r])
					{
						rr=0;
						qq=0;
						for(int ee=r;ee<tmp[p].size()&&q+qq<tmp[e].size();ee++,qq++)
						{
							if(tmp[e][q+qq]==tmp[p][ee])
							{
								rr++;
								mm=max(mm,rr);
							}
							else
							{
								break;
							}
						}
					}
				}
			}
			if(mm>=m)
			{
				arr[e].push_back(p);
				arr[p].push_back(e);
			}
		}
	}
	queue<int> q;
	for(int e=0;e<n;e++)
	{
		if(dp[e]==0)
		{
			dp[e]=1;
			q.push(e);
			while(!q.empty())
			{
				int now=q.front();q.pop();
				for(int p=0;p<arr[now].size();p++)
				{
					int next=arr[now][p];
					if(dp[next]==0)
					{
						if(dp[now]==1) dp[next]=2;
						else dp[next]=1;
						q.push(next);
					}
					else
					{
						if(dp[next]==dp[now])
						{
							cout << "No";
							return 0;
						}
					}
				}
				
			}
		}
	}
	for(int e=0;e<n;e++) if(dp[e]==0) dp[e]=1;
	int pp=0;
	for(int e=0;e<n;e++) if(dp[e]==1) pp++;
	if(pp==0) dp[0]=1;
	if(pp==n) dp[0]=2;
	cout << "Yes\n";
	for(int e=0;e<n;e++) cout << dp[e] << "\n";
}

Compilation message (stderr)

onward.cpp: In function 'int main()':
onward.cpp:19:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int q=0;q<tmp[e].size();q++)
                 ^
onward.cpp:21:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int r=0;r<tmp[p].size();r++)
                  ^
onward.cpp:27:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       for(int ee=r;ee<tmp[p].size()&&q+qq<tmp[e].size();ee++,qq++)
                      ^
onward.cpp:27:42: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       for(int ee=r;ee<tmp[p].size()&&q+qq<tmp[e].size();ee++,qq++)
                                          ^
onward.cpp:59:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int p=0;p<arr[now].size();p++)
                  ^

• Subtask 1: 1 / 1