#678955 (C++17) No.1605 Matrix Shape

提出ソース

結果

問題	No.1605 Matrix Shape
ユーザー	👑 hitonanode
提出日時	2021-07-16 22:20:45
言語	C++17 (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	76 ms / 2,000 ms
コード長	6,797 bytes
コンパイル時間	1,704 ms
コンパイル使用メモリ	154,092 KB
実行使用メモリ	12,244 KB
最終ジャッジ日時	2023-09-20 14:32:49
合計ジャッジ時間	4,723 ms
ジャッジサーバーID （参考情報）	judge13 / judge14

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	5 ms 6,156 KB
testcase_01	AC	4 ms 6,164 KB
testcase_02	AC	4 ms 6,528 KB
testcase_03	AC	4 ms 6,280 KB
testcase_04	AC	4 ms 6,636 KB
testcase_05	AC	4 ms 6,220 KB
testcase_06	AC	4 ms 6,280 KB
testcase_07	AC	5 ms 6,528 KB
testcase_08	AC	5 ms 6,236 KB
testcase_09	AC	4 ms 6,172 KB
testcase_10	AC	5 ms 6,212 KB
testcase_11	AC	4 ms 6,524 KB
testcase_12	AC	4 ms 6,152 KB
testcase_13	AC	5 ms 6,288 KB
testcase_14	AC	4 ms 6,164 KB
testcase_15	AC	5 ms 6,596 KB
testcase_16	AC	4 ms 6,540 KB
testcase_17	AC	4 ms 6,572 KB
testcase_18	AC	4 ms 6,532 KB
testcase_19	AC	75 ms 12,232 KB
testcase_20	AC	63 ms 10,980 KB
testcase_21	AC	63 ms 10,860 KB
testcase_22	AC	72 ms 10,852 KB
testcase_23	AC	73 ms 12,244 KB
testcase_24	AC	76 ms 12,176 KB
testcase_25	AC	45 ms 10,836 KB
testcase_26	AC	45 ms 10,968 KB
testcase_27	AC	44 ms 10,832 KB
testcase_28	AC	44 ms 10,836 KB
testcase_29	AC	44 ms 10,908 KB
testcase_30	AC	62 ms 10,952 KB
testcase_31	AC	62 ms 10,856 KB
testcase_32	AC	54 ms 10,944 KB
testcase_33	AC	53 ms 10,944 KB
testcase_34	AC	47 ms 10,860 KB
testcase_35	AC	60 ms 11,664 KB
testcase_36	AC	32 ms 8,620 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T, typename V>
void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }
template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }
template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template <typename T> vector<T> sort_unique(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <typename T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <typename T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T, size_t sz> ostream &operator<<(ostream &os, const array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
#if __cplusplus >= 201703L
template <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
#endif
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T, typename TH> ostream &operator<<(ostream &os, const unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <typename TK, typename TV, typename TH> ostream &operator<<(ostream &os, const unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl
#define dbgif(cond, x) ((cond) ? cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl : cerr)
#else
#define dbg(x) (x)
#define dbgif(cond, x) 0
#endif

// UnionFind Tree (0-indexed), based on size of each disjoint set
struct UnionFind {
    std::vector<int> par, cou;
    UnionFind(int N = 0) : par(N), cou(N, 1) { iota(par.begin(), par.end(), 0); }
    int find(int x) { return (par[x] == x) ? x : (par[x] = find(par[x])); }
    bool unite(int x, int y) {
        x = find(x), y = find(y);
        if (x == y) return false;
        if (cou[x] < cou[y]) std::swap(x, y);
        par[y] = x, cou[x] += cou[y];
        return true;
    }
    int count(int x) { return cou[find(x)]; }
    bool same(int x, int y) { return find(x) == find(y); }
};

void bad() {
    puts("0");
    exit(0);
}

int main() {
    int N;
    cin >> N;
    vector<int> U(200001);
    auto V = U;
    UnionFind uf(U.size());
    vector<int> S, T;
    REP(i, N) {
        int s, t;
        cin >> s >> t;
        S.push_back(s);
        T.push_back(t);
        U[s]++, V[t]++;
        uf.unite(s, t);
    }
    vector<int> roots;
    for (auto s : S) roots.push_back(uf.find(s));
    for (auto s : T) roots.push_back(uf.find(s));
    roots = sort_unique(roots);
    if (roots.size() > 1) bad();
    map<int, vector<int>> mp;
    vector<int> diffs;
    REP(i, U.size()) if (U[i] or V[i]) {
        auto d = U[i] - V[i];
        if (abs(d) > 1) bad();
        mp[d].push_back(i);
        diffs.push_back(d);
    }
    diffs = sort_unique(diffs);
    if (mp[1].size() > 1 or mp[-1].size() > 1) bad();
    if (mp[1].size() == 1 and mp[-1].size() == 1) {
        puts("1");
        return 0;
    }
    if (mp[1].size() or mp[-1].size()) bad();
    cout << mp[0].size() << '\n';
}

yukicoder

結果

テストケース

ソースコード