제출 #635445

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
635445		_HDH	Naboj (COCI22_naboj)	C++11	0 / 110	183 ms	18744 KiB

naboj

#include <bits/stdc++.h>

using namespace std;

int const N = 2e5 + 1;

vector<int> g[N], h[N];

int main(){
    int n, m; cin >> n >> m;
    while (m--){
        int a, b; cin >> a >> b;
        g[a].push_back(b);
        h[b].push_back(a);
    }

    int sign[N] = {};
    memset(sign, -1, sizeof sign);

    for (int i = 1; i <= n; i++){
        if (g[i].size() > 0 && h[i].size() > 0){
            for (auto v: g[i]){
                if (sign[v] == 1){
                    cout << -1;
                    return 0;
                }
                sign[v] = 0;
            }
            for (auto v: h[i]){
                if (sign[v] == 0){
                    cout << -1;
                    return 0;
                }
                sign[v] = 1;
            }
        }
    }

    for (int i = 1; i <= n; i++) if (sign[i] == -1){
        if (g[i].size() > 0 && h[i].size() == 0){
            bool flag = 0;
            for (auto v: g[i]){
                if (sign[v] == 1){
                    cout << -1;
                    return 0;
                }
                if (sign[v] == 0)
                    flag = 1;
            }

            if (flag)
                for (auto v: g[i]){
                    sign[v] = 0;
                }
            else{
                sign[i] = 0;
            }
        }else if (g[i].size() == 0 && h[i].size() > 0){
            bool flag = 0;
            for (auto v: h[i]){
                if (sign[v] == 0){
                    cout << -1;
                    return 0;
                }
                if (sign[v] == 1)
                    flag = 1;
            }

            if (flag)
                for (auto v: h[i])
                    sign[v] = 1;
            else sign[i] = 1;
        }
    }

    int cnt = 0;
    for (int i = 1; i <= n; i++)
        if (sign[i] != -1) cnt++;
    cout << cnt << "\n";
    for (int i = 1; i <= n; i++)
        if (sign[i] != -1) cout << i << " " << sign[i] << "\n";
    return 0;
}

• Subtask 1: 0 / 15
• Subtask 2: 0 / 25
• Subtask 3: 0 / 70