# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
444839 | 2021-07-15T14:35:18 Z | ics0503 | Making Friends on Joitter is Fun (JOI20_joitter2) | C++17 | 5000 ms | 624432 KB |
#include<stdio.h> #include<vector> #include<set> using namespace std; multiset<int>edge[121212],redge[121212]; long long par[121212], sz[121212]; int find(int x) { if (par[x] == x)return x; return par[x] = find(par[x]); } int main() { freopen("input.txt", "r", stdin); int n, m; scanf("%d%d", &n, &m); int i, j; for (i = 1; i <= n; i++)par[i] = i, sz[i] = 1; long long ans = 0; for (i = 0; i < m; i++) { int s, e; scanf("%d%d", &s, &e); int ps = find(s), pe = find(e); if (ps == pe)continue; if (redge[ps].find(pe) != redge[ps].end()) { ans -= sz[ps] * (sz[ps] - 1); ans -= sz[pe] * (sz[pe] - 1); if (edge[ps].size() + redge[ps].size() < edge[pe].size() + redge[pe].size()) { swap(ps, pe); } for (auto v : redge[pe]) { if (v == ps) { ans -= sz[pe]; continue; } edge[v].erase(edge[v].find(pe)); edge[v].insert(ps); if (redge[ps].find(v) == redge[ps].end()) { ans -= sz[pe]; ans += (sz[ps] + sz[pe]); redge[ps].insert(v); } } for (auto v : redge[ps]) { if (v == pe) { ans -= sz[ps]; continue; } if (redge[pe].find(v) == redge[pe].end()) { ans -= sz[ps]; ans += (sz[ps] + sz[pe]); } } for (auto v : edge[pe]) { if (v == ps)continue; if (edge[ps].find(v) == edge[ps].end()) { edge[ps].insert(v); redge[v].erase(redge[v].find(pe)); redge[v].insert(ps); } } edge[ps].erase(pe); sz[ps] += sz[pe]; par[pe] = ps; ans += sz[ps] * (sz[ps] - 1); } else { edge[ps].insert(pe); redge[pe].insert(ps); ans += sz[pe]; } printf("%lld\n", ans); } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 5072 ms | 624432 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 5072 ms | 624432 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 5072 ms | 624432 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |