結果
| 問題 | No.1293 2種類の道路 |
| ユーザー |
 minato
|
| 提出日時 | 2020-11-20 21:42:03 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
CE
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 5,305 bytes |
| コンパイル時間 | 3,443 ms |
| コンパイル使用メモリ | 242,652 KB |
| 最終ジャッジ日時 | 2025-01-16 02:13:40 |
|
ジャッジサーバーID （参考情報） |
judge1 / judge2 |
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
In file included from /usr/include/c++/13/string:43,
from /usr/include/c++/13/bitset:52,
from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:52,
from main.cpp:6:
/usr/include/c++/13/bits/allocator.h: In destructor ‘std::__cxx11::basic_string<char>::_Alloc_hider::~_Alloc_hider()’:
/usr/include/c++/13/bits/allocator.h:184:7: error: inlining failed in call to ‘always_inline’ ‘std::allocator< <template-parameter-1-1> >::~allocator() noexcept [with _Tp = char]’: target specific option mismatch
184 | ~allocator() _GLIBCXX_NOTHROW { }
| ^
In file included from /usr/include/c++/13/string:54:
/usr/include/c++/13/bits/basic_string.h:181:14: note: called from here
181 | struct _Alloc_hider : allocator_type // TODO check __is_final
| ^~~~~~~~~~~~
ソースコード
#ifdef ONLINE_JUDGE
#pragma GCC target("avx2,avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using i128 = __int128_t;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define all(x) (x).begin(), (x).end()
constexpr char ln = '\n';
istream& operator>>(istream& is, __int128_t& x) {
x = 0;
string s;
is >> s;
int n = int(s.size()), it = 0;
if (s[0] == '-') it++;
for (; it < n; it++) x = (x * 10 + s[it] - '0');
if (s[0] == '-') x = -x;
return is;
}
ostream& operator<<(ostream& os, __int128_t x) {
if (x == 0) return os << 0;
if (x < 0) os << '-', x = -x;
deque<int> deq;
while (x) deq.emplace_front(x % 10), x /= 10;
for (int e : deq) os << e;
return os;
}
template<class T1, class T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& p) {
return os << "(" << p.first << ", " << p.second << ")";
}
template<class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
os << "{";
for (int i = 0; i < int(v.size()); i++) {
if (i) os << ", ";
os << v[i];
}
return os << "}";
}
template<class Container> inline int SZ(Container& v) { return int(v.size()); }
template<class T> inline void UNIQUE(vector<T>& v) { v.erase(unique(v.begin(), v.end()), v.end()); }
template<class T1, class T2> inline bool chmax(T1& a, T2 b) { if (a < b) {a = b; return true ;} return false ;}
template<class T1, class T2> inline bool chmin(T1& a, T2 b) { if (a > b) {a = b; return true ;} return false ;}
inline int topbit(int x) { return x == 0 ? -1 : 31 - __builtin_clz(x); }
inline int topbit(long long x) { return x == 0 ? -1 : 63 - __builtin_clzll(x); }
inline int botbit(int x) { return x == 0 ? 32 : __builtin_ctz(x); }
inline int botbit(long long x) { return x == 0 ? 64 : __builtin_ctzll(x); }
inline int popcount(int x) { return __builtin_popcount(x); }
inline int popcount(long long x) { return __builtin_popcountll(x); }
inline int kthbit(long long x, int k) { return (x>>k) & 1; }
inline constexpr long long TEN(int x) { return x == 0 ? 1 : TEN(x-1) * 10; }
inline void print() { cout << "\n"; }
template<class T>
inline void print(const vector<T>& v) {
for (int i = 0; i < int(v.size()); i++) {
if (i) cout << " ";
cout << v[i];
}
print();
}
template<class T, class... Args>
inline void print(const T& x, const Args& ... args) {
cout << x << " ";
print(args...);
}
#ifdef MINATO_LOCAL
inline void debug_out() { cerr << endl; }
template <class T, class... Args>
inline void debug_out(const T& x, const Args& ... args) {
cerr << " " << x;
debug_out(args...);
}
#define debug(...) cerr << __LINE__ << " : [" << #__VA_ARGS__ << "] =", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
struct fast_ios { fast_ios() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
#include <atcoder/all>
using namespace atcoder;
//using mint = modint998244353;
//using mint = modint1000000007;
//using mint = modint;
struct UndoUnionFind {
struct History {
int v,node,suc;
History() {}
History(int v, int node, int suc) : v(v), node(node), suc(suc) {}
};
vector<int> node;
vector<History> history;
int N;
UndoUnionFind() {}
UndoUnionFind(int N) : node(N,-1), N(N) {}
bool merge(int x, int y) {
x = root(x); y = root(y);
history.emplace_back(x,node[x],x!=y);
history.emplace_back(y,node[y],x!=y);
if (x==y) return false;
if (node[x] > node[y]) swap(x,y);
node[x] += node[y];
node[y] = x;
N--;
return true;
}
bool same(int x, int y) {return root(x) == root(y);}
int root(int x) {
if (node[x] < 0) return x;
return root(node[x]);
}
int size(int x) {return -node[root(x)];}
void undo() {
assert(!history.empty());
N += history.back().suc;
node[history.back().v] = history.back().node;
history.pop_back();
node[history.back().v] = history.back().node;
history.pop_back();
}
void snapshot() {
while(!history.empty()) history.pop_back();
}
void rollback() {
while(!history.empty()) undo();
}
int count() const {return N;}
};
int main() {
int N,D,W; cin >> N >> D >> W;
dsu uf1(N);
UndoUnionFind uf2(N);
rep(i,D) {
int a,b; cin >> a >> b;
a--; b--;
uf1.merge(a,b);
}
rep(i,W) {
int a,b; cin >> a >> b;
a--; b--;
uf2.merge(a,b);
}
auto g = uf1.groups();
int M = g.size();
ll ans = 0;
rep(i,M) {
rep(j,SZ(g[i])) {
uf2.merge(g[i][0],g[i][j]);
}
ans += (ll)(uf2.size(g[i][0])-1)*SZ(g[i]);
rep(j,SZ(g[i])) uf2.undo();
}
cout << ans << ln;
}