| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 28238 | 三( ε:) (#68) | Play Onwards (FXCUP2_onward) | C++14 | 43 ms | 2304 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
string str[205];
vector<int> graph[205];
int vis[205];
bool comp(const string &s1, const string &s2, int k)
{
    unordered_set<string> st;
    for (int i = 0; i <= s1.size() - k; i++)
    {
        st.insert(s1.substr(i, k));
    }
    for (int j = 0; j <= s2.size() - k; j++)
    {
        if (st.count(s2.substr(j, k))) return true;
    }
    return false;
}
bool dfs(int t, int c = 1)
{
    vis[t] = c;
    for (int nxt : graph[t])
    {
        if (vis[nxt] == 0)
        {
            if (dfs(nxt, c ^ 3) == false) return false;
        }
        else if (vis[nxt] == vis[t]) return false;
    }
    return true;
}
int main()
{
    int n, k;
    cin >> n >> k;
    for (int i = 0; i < n; i++)
    {
        cin >> str[i];
    }
    for (int i = 0; i < n; i++)
    {
        for (int j = i + 1; j < n; j++)
        {
            if (comp(str[i], str[j], k))
            {
                graph[i].push_back(j);
                graph[j].push_back(i);
            }
        }
    }
    for (int i = 0; i < n; i++)
    {
        if (vis[i] == 0 && dfs(i) == false)
        {
            printf("No\n");
            return 0;
        }
    }
    printf("Yes\n");
    for (int i = 0; i < n; i++) printf("%d\n", vis[i]);
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
