oj.uz

Submission #637225

# Submission time Handle Problem Language Result Execution time Memory
637225 2022-09-01T00:32:03 Z MinaRagy06 KOVANICE (COI15_kovanice) C++17
60 / 100
 291 ms 82744 KB 
#include <bits/stdc++.h>
using namespace std;
#define lesgooo ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define endl    '\n'
#define int     long long
 
const int N = 5e5+5;
vector<int> adj[N], adj2[N], comp[N], path;
int idx[N], vis[N], cur, indeg[N], val[N], ans[N], dp[N], dp2[N];
void dfs(int i)
{
    comp[cur].push_back(i), idx[i] = cur, vis[i] =  1;
    for (auto nxt : adj[i]) if (!vis[nxt]) dfs(nxt);
}
int depth(int i)
{
    if (~dp[i]) return dp[i];
    dp[i] = 1, path.push_back(i);
    for (auto nxt : adj[i]) dp[i] = max(dp[i], 1+depth(nxt));
    return dp[i];
}
int assign(int i)
{
    if (~dp2[i]) return dp2[i];
    dp2[i] = 1;
    for (auto nxt : adj2[i]) dp2[i] = max(dp2[i], 1+assign(nxt));
    return dp2[i];
}
void check(int i)
{
    vis[i] = 1;
    int ok = adj[i].empty();
    for (auto nxt : adj[i])
    {
        if (!vis[nxt]) check(nxt);
        ok|= (dp2[i]+1 == dp2[nxt]);
    }
    if (!ok) dp2[i] = 1e18;
}
signed main()
{
    lesgooo;
    int n, m, v;
    cin >> n >> m >> v;
    pair<pair<int, char>, int> a[v];
    for (int i = 0; i < v; i++)
    {
        cin >> a[i].first.first >> a[i].first.second >> a[i].second;
        a[i].first.first--, a[i].second--;
        if (a[i].first.second == '=') adj[a[i].first.first].push_back(a[i].second), adj[a[i].second].push_back(a[i].first.first);
    }
    for (int i = 0; i < m; i++) if (!vis[i]) dfs(i), cur++;
    for (int i = 0; i < m; i++) adj[i].clear(), val[i] = -1;
    for (int i = 0; i < v; i++) if (a[i].first.second != '=') adj[idx[a[i].first.first]].push_back(idx[a[i].second]), adj2[idx[a[i].second]].push_back(idx[a[i].first.first]), indeg[idx[a[i].second]] = 1;
    memset(dp, -1, sizeof dp), memset(dp2, -1, sizeof dp2), memset(vis, 0, sizeof vis);
    for (int i = 0; i < cur; i++)
    {
        path.clear();
        if (!indeg[i] && depth(i) == n)
        {
            for (auto j : path) assign(j);
            check(i);
        }
    }
    for (int i = 0; i < m; i++) ans[i] = dp2[idx[i]];
    for (int i = 0; i < m; i++) cout << (ans[i] == -1 || ans[i] == 1e18? "?" : "K"+to_string(ans[i])) << endl;
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 47372 KB Output is correct
2 Correct 23 ms 47444 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 118 ms 65600 KB Output is correct
2 Correct 116 ms 65756 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 52024 KB Output is correct
2 Correct 41 ms 52172 KB Output is correct
3 Correct 42 ms 52172 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 291 ms 82744 KB Output isn't correct
2 Halted 0 ms 0 KB -