제출 #246405

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
246405		NONAME	Ronald (COCI17_ronald)	C++14	120 / 120	48 ms	608 KiB

ronald

#include  <bits/stdc++.h>
#define dbg(x) cerr << #x << " = " << x << "\n"
#define fast_io ios_base::sync_with_stdio(0); cin.tie(0); cout.tie()
using namespace std;
using ll = long long;
using ld = long double;

const int N = 1e4;

int pr[N], cnt[N], e[N];

int f(int x) { return (x == pr[x]) ? x : pr[x] = f(pr[x]); }

int main() {
    fast_io;

    int n, m;
    cin >> n >> m;

    for (int i = 0; i < n; ++i)
        pr[i] = i, cnt[i] = 1, e[i] = 0;

    for (int i = 0; i < m; ++i) {
        int v, u;
        cin >> v >> u;
        --v, --u;

        if (f(v) == f(u)) ++e[f(v)];
            else {
                cnt[f(v)] += cnt[f(u)];
                e[f(v)] += e[f(u)] + 1;
            }

        pr[f(u)] = f(v);
    }

    set <int> s;
    for (int i = 0; i < n; ++i)
        s.insert(f(i));

    if (int(s.size()) > 2)
        return void(cout << "NE\n"), 0;

    for (int i = 0; i < n; ++i)
        if ((cnt[f(i)] * (cnt[f(i)] - 1) / 2) != e[f(i)])
            return void(cout << "NE\n"), 0;
    cout << "DA\n";
}

• Subtask 1: 15 / 15
• Subtask 2: 15 / 15
• Subtask 3: 15 / 15
• Subtask 4: 15 / 15
• Subtask 5: 15 / 15
• Subtask 6: 15 / 15
• Subtask 7: 15 / 15
• Subtask 8: 15 / 15