oj.uz

Submission #95356

# Submission time Handle Problem Language Result Execution time Memory
95356 2019-01-30T16:00:25 Z dalgerok KOVANICE (COI15_kovanice) C++14
100 / 100
 378 ms 44424 KB 
#include<bits/stdc++.h>
using namespace std;



const int N = 3e5 + 5;



int n, m, k, p[N], dp1[N], dp2[N], used[N], sz;
vector < int > g[N], gr[N], q[N];
vector < pair < int, int > > e;

void dfs(int v){
    used[v] = sz;
    for(int to : q[v]){
        if(!used[to]){
            dfs(to);
        }
    }
}

int dfs1(int v){
    if(dp1[v]){
        return dp1[v];
    }
    for(int to : g[v]){
        dp1[v] = max(dp1[v], dfs1(to));
    }
    dp1[v] += 1;
    return dp1[v];
}

int dfs2(int v){
    if(dp2[v]){
        return dp2[v];
    }
    for(int to : gr[v]){
        dp2[v] = max(dp2[v], dfs2(to));
    }
    dp2[v] += 1;
    return dp2[v];
}

int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n >> m >> k;
    for(int i = 1; i <= k; i++){
        int x, y;
        char c;
        cin >> x >> c >> y;
        if(c == '<'){
            e.push_back(make_pair(x, y));
        }
        else{
            q[x].push_back(y);
            q[y].push_back(x);
        }
    }
    for(int i = 1; i <= m; i++){
        if(!used[i]){
            sz += 1;
            dfs(i);
        }
    }
    for(auto it : e){
        g[used[it.second]].push_back(used[it.first]);
        gr[used[it.first]].push_back(used[it.second]);
    }
    for(int i = 1; i <= m; i++){
        dfs1(used[i]);
        dfs2(used[i]);
    }
    for(int i = 1; i <= m; i++){
        if(dp1[used[i]] + dp2[used[i]] - 1 == n){
            cout << "K" << dp1[used[i]] << "\n";
        }
        else{
            cout << "?\n";
        }
    }
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 21624 KB Output is correct
2 Correct 18 ms 21624 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 96 ms 30324 KB Output is correct
2 Correct 114 ms 30464 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 24216 KB Output is correct
2 Correct 39 ms 24360 KB Output is correct
3 Correct 37 ms 24244 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 285 ms 42904 KB Output is correct
2 Correct 301 ms 42344 KB Output is correct
3 Correct 358 ms 42264 KB Output is correct
4 Correct 340 ms 43656 KB Output is correct
5 Correct 378 ms 44424 KB Output is correct