oj.uz

답안 #846401

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
846401 2023-09-07T14:23:41 Z vjudge1 KOVANICE (COI15_kovanice) C++17
40 / 100
 163 ms 53964 KB 
#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

const int MAXN = 3e5 + 5;

#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;
    }
};

vector <int> adj[MAXN];
vector <int> compos[MAXN];
DSU dsu(MAXN);
vector <pair <int, int>> que;
vector <int> dists(MAXN, -1);
vector <int> colors(MAXN, -1);
vector <int> ans(MAXN, -1);

void solve()
{
    int n, m, v; cin >> n >> m >> v;
    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);
    }

    for(auto &[a, b] : que)
    {
        adj[dsu.get(a)].emplace_back(dsu.get(b));
    }

    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);

    function <void(int, int)> dfsCol = [&](int node, int col) -> void
    {
        colors[node] = col;
        sort(adj[node].begin(), adj[node].end(), [&](int a, int b)
        {
            return dists[a] >= dists[b];
        });

        for(const int &child : adj[node])
        {
            if(colors[child] == -1) dfsCol(child, col +1);
        }
    };

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

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

    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
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 26 ms 48088 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 62 ms 31852 KB Output is correct
2 Correct 60 ms 31948 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 40 ms 53192 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 163 ms 53964 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -