結果
問題 | No.1293 2種類の道路 |
ユーザー |
![]() |
提出日時 | 2020-11-27 20:21:45 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 67 ms / 2,000 ms |
コード長 | 2,241 bytes |
コンパイル時間 | 2,368 ms |
コンパイル使用メモリ | 205,628 KB |
最終ジャッジ日時 | 2025-01-16 06:14:18 |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 22 |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:75:10: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 75 | scanf("%d%d%d", &n, &d, &w); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~ main.cpp:79:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 79 | scanf("%d%d", &a, &b); | ~~~~~^~~~~~~~~~~~~~~~ main.cpp:86:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 86 | scanf("%d%d", &a, &b); | ~~~~~^~~~~~~~~~~~~~~~
ソースコード
#include <bits/stdc++.h>//#include <atcoder/all>#define For(i, a, b) for (int(i) = (int)(a); (i) < (int)(b); ++(i))#define rFor(i, a, b) for (int(i) = (int)(a)-1; (i) >= (int)(b); --(i))#define rep(i, n) For((i), 0, (n))#define rrep(i, n) rFor((i), (n), 0)#define fi first#define se secondusing namespace std;typedef long long lint;typedef unsigned long long ulint;typedef pair<int, int> pii;typedef pair<lint, lint> pll;template <class T>bool chmax(T &a, const T &b) {if (a < b) {a = b;return true;}return false;}template <class T>bool chmin(T &a, const T &b) {if (a > b) {a = b;return true;}return false;}template <class T>T div_floor(T a, T b) {if (b < 0) a *= -1, b *= -1;return a >= 0 ? a / b : (a + 1) / b - 1;}template <class T>T div_ceil(T a, T b) {if (b < 0) a *= -1, b *= -1;return a > 0 ? (a - 1) / b + 1 : a / b;}constexpr lint mod = 1000000007;constexpr lint INF = mod * mod;constexpr int MAX = 100010;typedef struct UnionFindTree {vector<int> par;UnionFindTree(int n) { par.resize(n, -1); }bool is_root(int x) { return par[x] < 0; }int find(int x) {if (is_root(x)) return x;return par[x] = find(par[x]);}int size(int x) { return -par[find(x)]; }bool unite(int x, int y) {x = find(x);y = find(y);if (x == y) return false;if (size(x) < size(y)) swap(x, y);par[x] += par[y];par[y] = x;return true;}bool same(int x, int y) { return find(x) == find(y); }} UF;int main() {int n, d, w;scanf("%d%d%d", &n, &d, &w);UF ufd(n), ufw(n);rep(i, d) {int a, b;scanf("%d%d", &a, &b);--a;--b;ufd.unite(a, b);}rep(i, w) {int a, b;scanf("%d%d", &a, &b);--a;--b;ufw.unite(a, b);}set<pii> used;lint ans = 0;rep(i, n) {int a = ufd.find(i), b = ufw.find(i);if (used.find({a, b}) == used.end()) {ans += 1LL * ufd.size(i) * ufw.size(i);used.insert({a, b});}--ans;}printf("%lld\n", ans);}