제출 #28520

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
28520		흐훗흐흐훗핫 (#68)	Play Onwards (FXCUP2_onward)	C++98	0 / 1	0 ms	2032 KiB

onward

#include <iostream>
#include <string>

using namespace std;
string tmp[333];
int dp[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++)
	{
		if(dp[e]==0)
		{
			dp[e]=1;
		}
		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)
			{
				if(dp[e]==1)
				{
					if(dp[p]==1)
					{
						cout << "No";
						return 0;
					}
					else
					{
						dp[p]=2;
					}
				}
				if(dp[e]==2)
				{
					if(dp[p]==2)
					{
						cout << "No";
						return 0;
					}
					else
					{
						dp[p]=1;
					}
				}
			}
			else
			{
				if(dp[e]==1)
				{
					if(dp[p]==2)
					{
						cout << "No";
						return 0;
					}
					else
					{
						dp[p]=1;
					}
				}
				if(dp[e]==2)
				{
					if(dp[p]==1)
					{
						cout << "No";
						return 0;
					}
					else
					{
						dp[p]=2;
					}
				}
			}
		}
	}
	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";
}

컴파일 시 표준 에러 (stderr) 메시지

onward.cpp: In function 'int main()':
onward.cpp:21:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int q=0;q<tmp[e].size();q++)
                 ^
onward.cpp:23:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int r=0;r<tmp[p].size();r++)
                  ^
onward.cpp:29: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:29: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++)
                                          ^

• Subtask 1: 0 / 1