oj.uz

답안 #39904

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
39904 2018-01-24T08:36:06 Z 5ak0 KOVANICE (COI15_kovanice) C++14
50 / 100
 351 ms 15004 KB 
/*
ID: 5ak0
PROG:
LANG: C++11
*/

#include <bits/stdc++.h>
#define fr first
#define sc second
#define pb push_back
#define mpr make_pair

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9 + 7, MAXN = 3e5 + 10;

bool u[MAXN];
int mp[MAXN];
vector <int> g[MAXN];
int a, b;
char ch;
int n, m, v;

void dfs(int v){
    u[v] = 1;
    for (auto to : g[v]){
        if (u[to] == 0){
            mp[to] = mp[v];
            dfs(to);
        }
    }
}

int main(){
    cin >> n >> m >> v;
    for (int i = 1; i <= v; ++i){
        cin >> a >> ch >> b;
        if (ch == '<'){
            mp[a] = 1;
            mp[b] = 2;
        }
        else{
            g[a].pb(b);
            g[b].pb(a);
        }
    }
    for (int i = 1; i <= m; ++i)
        if (u[i] == 0 && mp[i] != 0)
            dfs(i);
    for (int i = 1; i <= m; ++i){
        if (mp[i] == 0)
            cout << "?\n";
        else{
            cout << "K" << mp[i] << "\n";
        }
    }
    return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 10516 KB Output is correct
2 Correct 0 ms 10516 KB Output is correct

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 128 ms 12628 KB Output is correct
2 Correct 140 ms 12364 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 59 ms 10648 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 351 ms 15004 KB Output isn't correct
2 Halted 0 ms 0 KB -