oj.uz

Submission #28771

# Submission time Handle Problem Language Result Execution time Memory
28771 2017-07-17T07:28:29 Z sgc109 Play Onwards (FXCUP2_onward) C++11
1 / 1
 36 ms 2484 KB 
#include <bits/stdc++.h>
#define fastio() ios_base::sync_with_stdio(false),cin.tie(NULL)
using namespace std;
typedef long long ll;
const int mod = 1e9+7;
const int INF = 0x3c3c3c3c;
const long long INFL = 0x3c3c3c3c3c3c3c3c;

int N,K;
vector<int> G[203];
string words[203];
int rev[203][203];
int dp[23][23];
int color[203];
int dfs(int cur, int col){
	color[cur] = col;
	for(int next : G[cur]){
		if(color[next] == col) return 0;
		if(color[next]) continue;
		int ret = dfs(next, 3 - col);
		if(!ret) return ret;
	}
	return 1;
}
int main() {
	fastio();
	cin >> N >> K;
	int cnt = 0;
	for(int i = 0 ; i < N; i++) cin >> words[i];
	for(int i = 0 ; i < N; i++){
		for(int j = i + 1; j < N; j++){
			int maxLen = 0;
			memset(dp,0,sizeof(dp));
			for(int a = 1; a <= (int)words[i].size(); a++){
				for(int b = 1; b <= (int)words[j].size(); b++){
					char c1 = words[i][a - 1];
					char c2 = words[j][b - 1];
					if(c1 == c2) dp[a][b] = dp[a - 1][b - 1] + 1;
					else dp[a][b] = 0;
					maxLen = max(maxLen, dp[a][b]);
				}
			}
			if(maxLen >= K) {
				cnt++;
				G[i].push_back(j);
				G[j].push_back(i);
			}
		}
	}
	
	for(int i = 0 ; i < N; i++){
		if(!color[i]) {
			int ret = dfs(i, 1);
			if(!ret) {
				cout << "No" << endl;
				return 0;
			}
		}
	}
	cout << "Yes" << endl;
	if(!cnt) color[0] = 3 - color[0];
	for(int i = 0 ; i < N; i++) cout << color[i] << endl;

	return 0;
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2352 KB Output is correct
2 Correct 0 ms 2352 KB Output is correct
3 Correct 0 ms 2352 KB Output is correct
4 Correct 0 ms 2352 KB Output is correct
5 Correct 16 ms 2484 KB Output is correct
6 Correct 6 ms 2484 KB Output is correct
7 Correct 13 ms 2352 KB Output is correct
8 Correct 9 ms 2352 KB Output is correct
9 Correct 9 ms 2352 KB Output is correct
10 Correct 6 ms 2352 KB Output is correct
11 Correct 36 ms 2352 KB Output is correct
12 Correct 16 ms 2352 KB Output is correct
13 Correct 16 ms 2352 KB Output is correct
14 Correct 23 ms 2352 KB Output is correct
15 Correct 0 ms 2352 KB Output is correct
16 Correct 0 ms 2352 KB Output is correct
17 Correct 0 ms 2352 KB Output is correct
18 Correct 6 ms 2352 KB Output is correct
19 Correct 6 ms 2352 KB Output is correct
20 Correct 9 ms 2352 KB Output is correct
21 Correct 9 ms 2352 KB Output is correct