제출 #846170

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
846170		vjudge1	KOVANICE (COI15_kovanice)	C++17	50 / 100	2075 ms	34188 KiB

kovanice

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
using namespace std;
#define int long long

#define ONLINE_JUDGE
#ifndef ONLINE_JUDGE
    #define OPEN freopen(".in", "r", stdin); \
                 freopen(".out", "w", stdout);
#else
    #define OPEN void(23);
#endif

struct DSU
{
    vector <int> par;
    DSU(int n)
    {
        par.resize(n);
        iota(par.begin(), par.end(), 0ll);
    }

    inline int get(int a)
    {
        return par[a] = (par[a] == a ? a : get(par[a]));
    }

    bool same(int u, int v)
    {
        return get(u) == get(v);
    }

    bool unite(int u, int v)
    {
        if(same(u, v)) return false;
        u = get(u), v = get(v);

        par[v] = u;
        return true;
    }
};

void solve()
{
    int n, m, v; cin >> n >> m >> v;
    vector <pair <int, int>> que;
    DSU dsu(m +1);
    for(int i = 1; i <= v; i++)
    {
        int u = 0, v = 0; char eq;
        cin >> u >> eq >> v;

        if(eq == '>') swap(u, v);
        if(eq == '=') dsu.unite(u, v);
        else que.emplace_back(u, v);
    }

    set <int> adj[m +1];
    for(auto &[a, b] : que)
    {
        adj[dsu.get(a)].emplace(dsu.get(b));
    }

    vector <int> dists(m +1, -1);
    function <int(int)> dfsDist = [&](int node) -> int
    {
        if(dists[node] != -1) return dists[node];
        dists[node] = 1;
        for(const int &child : adj[node])
        {
            dists[node] = max(dfsDist(child) +1, dists[node]);
        }

        return dists[node];
    };

    for(int i = 1; i <= m; i++) dfsDist(i);

    vector <int> colors(m +1, -1);
    function <void(int, int)> dfsCol = [&](int node, int col) -> void
    {
        colors[node] = col;
        for(const int &child : adj[node])
        {
            dfsCol(child, col +1);
        }
    };

    for(int i = 1; i <= m; i++)
    {
        if(dists[i] == n) dfsCol(i, 1);
    }

    vector <int> compos[m +1];
    for(int i = 1; i <= m; i++) compos[dsu.get(i)].emplace_back(i);

    vector <int> ans(m +1, -1);
    for(int i = 1; i <= m; i++) ans[i] = colors[i];

    for(int i = 1; i <= m; i++)
    {
        if(dsu.get(i) != i) continue;
        int col = colors[i];
        for(int &j : compos[i]) ans[j] = col;
    }

    for(int i = 1; i <= m; i++)
    {
        if(ans[i] == -1) cout << '?';
        else cout << 'K' << ans[i];
        cout << "\n";
    }

    return;
}

int32_t main()
{
    OPEN;

    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);

    int t = 1; //cin >> t;
    while(t--)
    {
        solve();
    }
}

• Subtask 1: 10 / 10
• Subtask 2: 40 / 40
• Subtask 3: 0 / 10
• Subtask 4: 0 / 40