oj.uz

답안 #994332

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
994332 2024-06-07T11:39:14 Z gmroh06 우호 조약 체결 (JOI14_friends) C++14
0 / 100
 38 ms 7476 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

inline void fastio() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);
}

ll n, m, ans;
ll parent[101010], cnt[101010];
bool vst[101010], pos[101010];
vector<ll> gr[101010];
queue<ll> q;

ll Find(ll x) {
    if (x == parent[x]) {
        return x;
    } else {
        return parent[x] = Find(parent[x]);
    }
}

void Union(ll x, ll y) {
    x = Find(x), y = Find(y);

    if (x != y) {
        parent[y] = x;
        pos[y] |= pos[x];
    }
}

int main() {
    fastio();

    cin >> n >> m;

    for (ll i = 0, a, b; i < m; i++) {
        cin >> a >> b;

        gr[a].emplace_back(b);
    }

    for (ll i = 1; i <= n; i++) {
        parent[i] = i;
    }

    for (ll i = 1; i <= n; i++) {
        if (vst[i] or gr[i].size() < 2) continue;

        q.emplace(i);
        ll tmp = gr[i].front();
        pos[tmp] = true;

        while (!q.empty()) {
            ll loc = q.front();
            q.pop();

            if (vst[loc]) continue;

            vst[loc] = true;

            for (auto& x : gr[loc]) {
                Union(tmp, x);
                q.emplace(x);
            }
        }
    }

    for (ll i = 1; i <= n; i++) {
        if (pos[Find(i)]) {
            cnt[Find(i)]++;
        } else {
            ans += gr[i].size();
        }
    }

    for (ll i = 1; i <= n; i++) {
        ans += cnt[i] * (cnt[i] - 1);
    }

    cout << ans;

    return 0;
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2908 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 1 ms 2652 KB Output is correct
13 Correct 1 ms 2652 KB Output is correct
14 Correct 1 ms 2652 KB Output is correct
15 Correct 1 ms 2652 KB Output is correct
16 Incorrect 1 ms 2652 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

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

Subtask #3
0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 6360 KB Output is correct
2 Incorrect 38 ms 7476 KB Output isn't correct
3 Halted 0 ms 0 KB -