# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
199422 | 2020-02-01T11:31:33 Z | arnold518 | 우호 조약 체결 (JOI14_friends) | C++14 | 70 ms | 5624 KB |
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; const int MAXN = 1e5; int N, M; ll ans; vector<int> adj[MAXN+10]; int par[MAXN+10], sz[MAXN+10]; int Find(int x) { return x==par[x] ? x : par[x]=Find(par[x]); } void Union(int x, int y) { x=Find(x); y=Find(y); sz[y]+=sz[x]; par[x]=y; } int main() { int i, j; scanf("%d%d", &N, &M); for(i=1; i<=N; i++) par[i]=i, sz[i]=1; for(i=1; i<=M; i++) { int u, v; scanf("%d%d", &u, &v); adj[u].push_back(v); } for(i=1; i<=N; i++) { for(j=1; j<adj[i].size(); j++) { if(Find(adj[i][0])==Find(adj[i][1])) continue; Union(adj[i][0], adj[i][j]); } } for(i=1; i<=N; i++) { for(auto it : adj[i]) { int u=i, v=it; if(Find(u)!=Find(v)) ans++; } } for(i=1; i<=N; i++) if(i==Find(i)) ans+=(ll)sz[i]*(sz[i]-1); printf("%lld", ans); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 7 ms | 2680 KB | Output is correct |
2 | Correct | 6 ms | 2680 KB | Output is correct |
3 | Correct | 7 ms | 2680 KB | Output is correct |
4 | Incorrect | 6 ms | 2680 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 9 ms | 2808 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 70 ms | 5624 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |