Timus/1080.cpp at main · Free-Denis/Timus · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
#include <iostream>
#include <queue>

using namespace std;

int country[100];
int fm[100];
bool vern = true;

struct edge {
    int st;
    int en;
};

edge map[10000];

int ennm = 0;

void bfs( int n) {
    queue<int> que;
    que.push(1);
    int cons;
    fm[1] = 1;

    while (!(que.empty()) and vern) {
        cons = que.front();
        que.pop();

        for (int i = 0; i < ennm; i++) {
            if (map[i].st == cons) {
                if (fm[map[i].en] == 0) {
                    que.push(map[i].en);
                    fm[map[i].en] = fm[map[i].st] + 1;
                }
                else
                    if (fm[map[i].en] == fm[map[i].st])
                        vern = false;
            }
            if (map[i].en == cons) {
                if (fm[map[i].st] == 0) {
                    que.push(map[i].st);
                    fm[map[i].st] = fm[map[i].en] + 1;
                }
                else
                    if (fm[map[i].en] == fm[map[i].st])
                        vern = false;
            }
        }

    }
}

int main() {
    int n, cur;
    cin >> n;

    for (int i = 1; i < n + 1;) {
        cin >> cur;
        if (cur == 0) i++;
        else {
            map[ennm++] = { i, cur };
        }
    }

    bfs( n);

    if (vern != 1) {
        cout << -1 << endl;
        return 0;
    }

    for (int i = 1; i < n + 1; i++) {
        cout << (fm[i] + 1) % 2;
    }

    cout << endl;

    return 0;
}