結果
問題 | No.1293 2種類の道路 |
ユーザー |
![]() |
提出日時 | 2020-11-20 21:46:00 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 47 ms / 2,000 ms |
コード長 | 15,689 bytes |
コンパイル時間 | 1,542 ms |
コンパイル使用メモリ | 127,680 KB |
最終ジャッジ日時 | 2025-01-16 02:15:17 |
ジャッジサーバーID (参考情報) |
judge1 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 22 |
コンパイルメッセージ
main.cpp: In member function ‘void yosupo::Printer::flush()’: main.cpp:312:16: warning: ignoring return value of ‘ssize_t write(int, const void*, size_t)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 312 | ::write(fd, line, pos); | ~~~~~~~^~~~~~~~~~~~~~~
ソースコード
//#pragma GCC optimize("Ofast")//#pragma GCC target("avx")//#undef LOCAL#include <algorithm>#include <cassert>#include <vector>namespace atcoder {struct dsu {public:dsu() : _n(0) {}dsu(int n) : _n(n), parent_or_size(n, -1) {}int merge(int a, int b) {assert(0 <= a && a < _n);assert(0 <= b && b < _n);int x = leader(a), y = leader(b);if (x == y) return x;if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);parent_or_size[x] += parent_or_size[y];parent_or_size[y] = x;return x;}bool same(int a, int b) {assert(0 <= a && a < _n);assert(0 <= b && b < _n);return leader(a) == leader(b);}int leader(int a) {assert(0 <= a && a < _n);if (parent_or_size[a] < 0) return a;return parent_or_size[a] = leader(parent_or_size[a]);}int size(int a) {assert(0 <= a && a < _n);return -parent_or_size[leader(a)];}std::vector<std::vector<int>> groups() {std::vector<int> leader_buf(_n), group_size(_n);for (int i = 0; i < _n; i++) {leader_buf[i] = leader(i);group_size[leader_buf[i]]++;}std::vector<std::vector<int>> result(_n);for (int i = 0; i < _n; i++) {result[i].reserve(group_size[i]);}for (int i = 0; i < _n; i++) {result[leader_buf[i]].push_back(i);}result.erase(std::remove_if(result.begin(), result.end(),[&](const std::vector<int>& v) { return v.empty(); }),result.end());return result;}private:int _n;std::vector<int> parent_or_size;};} // namespace atcoder#include <unistd.h>#include <algorithm>#include <array>#include <cctype>#include <cstring>#include <string>#include <type_traits>#include <vector>namespace yosupo {namespace internal {int ceil_pow2(int n) {int x = 0;while ((1U << x) < (unsigned int)(n)) x++;return x;}} // namespace internalint bsf(unsigned int n) { return __builtin_ctz(n); }int bsf(unsigned long n) { return __builtin_ctzl(n); }int bsf(unsigned long long n) { return __builtin_ctzll(n); }int bsr(unsigned int n) {return 8 * (int)sizeof(unsigned int) - 1 - __builtin_clz(n);}int bsr(unsigned long n) {return 8 * (int)sizeof(unsigned long) - 1 - __builtin_clzl(n);}int bsr(unsigned long long n) {return 8 * (int)sizeof(unsigned long long) - 1 - __builtin_clzll(n);}} // namespace yosupo#include <cassert>#include <numeric>#include <type_traits>namespace yosupo {namespace internal {template <class T>using is_signed_int128 =typename std::conditional<std::is_same<T, __int128_t>::value ||std::is_same<T, __int128>::value,std::true_type,std::false_type>::type;template <class T>using is_unsigned_int128 =typename std::conditional<std::is_same<T, __uint128_t>::value ||std::is_same<T, unsigned __int128>::value,std::true_type,std::false_type>::type;template <class T>using make_unsigned_int128 =typename std::conditional<std::is_same<T, __int128_t>::value,__uint128_t,unsigned __int128>;template <class T>using is_integral =typename std::conditional<std::is_integral<T>::value ||internal::is_signed_int128<T>::value ||internal::is_unsigned_int128<T>::value,std::true_type,std::false_type>::type;template <class T>using is_signed_int = typename std::conditional<(is_integral<T>::value &&std::is_signed<T>::value) ||is_signed_int128<T>::value,std::true_type,std::false_type>::type;template <class T>using is_unsigned_int =typename std::conditional<(is_integral<T>::value &&std::is_unsigned<T>::value) ||is_unsigned_int128<T>::value,std::true_type,std::false_type>::type;template <class T>using to_unsigned = typename std::conditional<is_signed_int128<T>::value,make_unsigned_int128<T>,typename std::conditional<std::is_signed<T>::value,std::make_unsigned<T>,std::common_type<T>>::type>::type;template <class T>using is_integral_t = std::enable_if_t<is_integral<T>::value>;template <class T>using is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;template <class T>using is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;template <class T> using to_unsigned_t = typename to_unsigned<T>::type;} // namespace internal} // namespace yosuponamespace yosupo {struct Scanner {public:Scanner(FILE* fp) : fd(fileno(fp)) {}void read() {}template <class H, class... T> void read(H& h, T&... t) {bool f = read_single(h);assert(f);read(t...);}int read_unsafe() { return 0; }template <class H, class... T> int read_unsafe(H& h, T&... t) {bool f = read_single(h);if (!f) return 0;return 1 + read_unsafe(t...);}private:static constexpr size_t SIZE = 1 << 15;bool read_single(std::string& ref) {if (!skip_space()) return false;ref = "";while (true) {char c = top();if (c <= ' ') break;ref += c;st++;}return true;}bool read_single(double& ref) {std::string s;if (!read_single(s)) return false;ref = std::stod(s);return true;}template <class T, internal::is_signed_int_t<T>* = nullptr>bool read_single(T& sref) {using U = internal::to_unsigned_t<T>;if (!skip_space(50)) return false;bool neg = false;if (line[st] == '-') {neg = true;st++;}U ref = 0;do {ref = 10 * ref + (line[st++] & 0x0f);} while (line[st] >= '0');sref = neg ? -ref : ref;return true;}template <class U, internal::is_unsigned_int_t<U>* = nullptr>bool read_single(U& ref) {if (!skip_space(50)) return false;ref = 0;do {ref = 10 * ref + (line[st++] & 0x0f);} while (line[st] >= '0');return true;}int fd = -1;char line[SIZE];size_t st = 0, ed = 0;bool eof = false;bool reread() {if (ed - st >= 50) return true;if (st > SIZE / 2) {std::memmove(line, line + st, ed - st);ed -= st;st = 0;}if (eof) return false;auto u = ::read(fd, line + ed, SIZE - ed);if (u == 0) {eof = true;line[ed] = '\0';u = 1;}ed += u;return true;}char top() {if (st == ed) {bool f = reread();assert(f);}return line[st];}bool skip_space(unsigned int token_len = 0) {while (true) {while (st != ed && line[st] <= ' ') st++;if (ed - st > token_len) return true;for (auto i = st; i < ed; i++) {if (line[i] <= ' ') return true;}if (!reread()) return false;}}};struct Printer {public:template <bool F = false> void write() {}template <bool F = false, class H, class... T>void write(const H& h, const T&... t) {if (F) write_single(' ');write_single(h);write<true>(t...);}template <class... T> void writeln(const T&... t) {write(t...);write_single('\n');}Printer(FILE* _fp) : fd(fileno(_fp)) {}~Printer() { flush(); }void flush() {::write(fd, line, pos);pos = 0;}private:static std::array<std::array<char, 2>, 100> small;static std::array<unsigned long long, 20> tens;static int calc_len(unsigned long long x) {int i = (bsr(x) * 3 + 3) / 10;if (x < tens[i])return i;elsereturn i + 1;}static constexpr size_t SIZE = 1 << 15;int fd;char line[SIZE];size_t pos = 0;void write_single(const char& val) {if (pos == SIZE) flush();line[pos++] = val;}template <class T, internal::is_signed_int_t<T>* = nullptr>void write_single(const T& val) {using U = internal::to_unsigned_t<T>;if (val == 0) {write_single('0');return;}if (pos > SIZE - 50) flush();U uval = val;if (val < 0) {write_single('-');uval = -uval;}write_unsigned(uval);}template <class U, internal::is_unsigned_int_t<U>* = nullptr>void write_single(U uval) {if (uval == 0) {write_single('0');return;}if (pos > SIZE - 50) flush();write_unsigned(uval);}template <class U,internal::is_unsigned_int_t<U>* = nullptr,std::enable_if_t<sizeof(U) == 4>* = nullptr>void write_unsigned(U uval) {write_unsigned(uint64_t(uval));}template <class U,internal::is_unsigned_int_t<U>* = nullptr,std::enable_if_t<sizeof(U) == 8>* = nullptr>void write_unsigned(U uval) {size_t len = calc_len(uval);pos += len;char* ptr = line + pos;while (uval >= 100) {ptr -= 2;memcpy(ptr, small[uval % 100].data(), 2);uval /= 100;}if (uval >= 10) {memcpy(ptr - 2, small[uval].data(), 2);} else {*(ptr - 1) = char('0' + uval);}}void write_single(const std::string& s) {for (char c : s) write_single(c);}void write_single(const char* s) {size_t len = strlen(s);for (size_t i = 0; i < len; i++) write_single(s[i]);}template <class T> void write_single(const std::vector<T>& val) {auto n = val.size();for (size_t i = 0; i < n; i++) {if (i) write_single(' ');write_single(val[i]);}}};std::array<std::array<char, 2>, 100> Printer::small = [] {std::array<std::array<char, 2>, 100> table;for (int i = 0; i <= 99; i++) {table[i][1] = char('0' + (i % 10));table[i][0] = char('0' + (i / 10 % 10));}return table;}();std::array<unsigned long long, 20> Printer::tens = [] {std::array<unsigned long long, 20> table;for (int i = 0; i < 20; i++) {table[i] = 1;for (int j = 0; j < i; j++) {table[i] *= 10;}}return table;}();} // namespace yosupousing namespace yosupo;#include <algorithm>#include <array>#include <bitset>#include <cassert>#include <complex>#include <cstdio>#include <cstring>#include <iostream>#include <map>#include <numeric>#include <queue>#include <set>#include <string>#include <unordered_map>#include <unordered_set>#include <vector>using namespace std;using uint = unsigned int;using ll = long long;using ull = unsigned long long;constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }template <class T> using V = vector<T>;template <class T> using VV = V<V<T>>;#ifdef LOCALostream& operator<<(ostream& os, __int128_t x) {if (x < 0) {os << "-";x *= -1;}if (x == 0) {return os << "0";}string s;while (x) {s += char(x % 10 + '0');x /= 10;}reverse(s.begin(), s.end());return os << s;}ostream& operator<<(ostream& os, __uint128_t x) {if (x == 0) {return os << "0";}string s;while (x) {s += char(x % 10 + '0');x /= 10;}reverse(s.begin(), s.end());return os << s;}template <class T, class U>ostream& operator<<(ostream& os, const pair<T, U>& p);template <class T> ostream& operator<<(ostream& os, const V<T>& v);template <class T> ostream& operator<<(ostream& os, const deque<T>& v);template <class T, size_t N>ostream& operator<<(ostream& os, const array<T, N>& a);template <class T> ostream& operator<<(ostream& os, const set<T>& s);template <class T, class U>ostream& operator<<(ostream& os, const map<T, U>& m);template <class T, class U>ostream& operator<<(ostream& os, const pair<T, U>& p) {return os << "P(" << p.first << ", " << p.second << ")";}template <class T> ostream& operator<<(ostream& os, const V<T>& v) {os << "[";bool f = false;for (auto d : v) {if (f) os << ", ";f = true;os << d;}return os << "]";}template <class T> ostream& operator<<(ostream& os, const deque<T>& v) {os << "[";bool f = false;for (auto d : v) {if (f) os << ", ";f = true;os << d;}return os << "]";}template <class T, size_t N>ostream& operator<<(ostream& os, const array<T, N>& a) {os << "[";bool f = false;for (auto d : a) {if (f) os << ", ";f = true;os << d;}return os << "]";}template <class T> ostream& operator<<(ostream& os, const set<T>& s) {os << "{";bool f = false;for (auto d : s) {if (f) os << ", ";f = true;os << d;}return os << "}";}template <class T, class U>ostream& operator<<(ostream& os, const map<T, U>& s) {os << "{";bool f = false;for (auto p : s) {if (f) os << ", ";f = true;os << p.first << ": " << p.second;}return os << "}";}struct PrettyOS {ostream& os;bool first;template <class T> auto operator<<(T&& x) {if (!first) os << ", ";first = false;os << x;return *this;}};template <class... T> void dbg0(T&&... t) {(PrettyOS{cerr, true} << ... << t);}#define dbg(...) \do { \cerr << __LINE__ << " : " << #__VA_ARGS__ << " = "; \dbg0(__VA_ARGS__); \cerr << endl; \} while (false);#else#define dbg(...)#endifScanner sc = Scanner(stdin);Printer pr = Printer(stdout);int main() {int n, a, b;sc.read(n, a, b);atcoder::dsu d(2 * n);for (int i = 0; i < a; i++) {int x, y;sc.read(x, y);x--; y--;d.merge(x, y);}for (int i = 0; i < b; i++) {int x, y;sc.read(x, y);x--; y--;d.merge(x + n, y + n);}ll ans = 0;using P = pair<int, int>;set<P> st;for (int i = 0; i < n; i++) {int x = d.leader(i), y = d.leader(i + n);if (st.count({x, y})) continue;st.insert({x, y});ans += 1LL * d.size(i) * d.size(i + n);}pr.writeln(ans - n);return 0;}