#699481 (C++23) No.1669 パズル作成

提出ソース

結果

問題	No.1669 パズル作成
ユーザー	👑 hitonanode
提出日時	2021-09-14 00:04:30
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	188 ms / 2,000 ms
コード長	9,060 bytes
コンパイル時間	2,228 ms
コンパイル使用メモリ	180,920 KB
実行使用メモリ	4,384 KB
最終ジャッジ日時	2023-09-08 08:28:53
合計ジャッジ時間	5,468 ms
ジャッジサーバーID （参考情報）	judge14 / judge12

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 4,380 KB
testcase_01	AC	2 ms 4,380 KB
testcase_02	AC	1 ms 4,384 KB
testcase_03	AC	2 ms 4,384 KB
testcase_04	AC	2 ms 4,384 KB
testcase_05	AC	2 ms 4,384 KB
testcase_06	AC	14 ms 4,380 KB
testcase_07	AC	188 ms 4,380 KB
testcase_08	AC	17 ms 4,380 KB
testcase_09	AC	158 ms 4,380 KB
testcase_10	AC	66 ms 4,384 KB
testcase_11	AC	106 ms 4,380 KB
testcase_12	AC	17 ms 4,380 KB
testcase_13	AC	17 ms 4,384 KB
testcase_14	AC	17 ms 4,380 KB
testcase_15	AC	84 ms 4,380 KB
testcase_16	AC	152 ms 4,384 KB
testcase_17	AC	10 ms 4,384 KB
testcase_18	AC	165 ms 4,384 KB
testcase_19	AC	157 ms 4,380 KB
testcase_20	AC	131 ms 4,384 KB
testcase_21	AC	106 ms 4,384 KB
testcase_22	AC	84 ms 4,384 KB
testcase_23	AC	65 ms 4,380 KB
testcase_24	AC	48 ms 4,384 KB
testcase_25	AC	30 ms 4,380 KB
testcase_26	AC	9 ms 4,380 KB
testcase_27	AC	143 ms 4,380 KB
testcase_28	AC	118 ms 4,384 KB
testcase_29	AC	13 ms 4,384 KB
testcase_30	AC	9 ms 4,384 KB
testcase_31	AC	10 ms 4,380 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); }
};

// Rational number + {infinity(1 / 0), -infiity(-1 / 0)} （有理数）
struct Rational {
    using Int = long long int; // __int128
    Int num, den;
    static Int my_gcd(Int a, Int b) {
        return 1;
        // // return __gcd(a, b);
        // if (a < 0) a = -a;
        // if (b < 0) b = -b;
        // while (a and b) {
        //     if (a > b)
        //         a %= b;
        //     else
        //         b %= a;
        // }
        // return a + b;
    }
    Rational(Int num = 0, Int den = 1) : num(num), den(den) { normalize(); }
    void normalize() { // reduction and making denominator nonnegative
        Int g = my_gcd(num, den);
        num /= g, den /= g;
        if (den < 0) num = -num, den = -den;
    }
    Rational operator+(const Rational &r) const { return Rational(num * r.den + den * r.num, den * r.den); }
    Rational operator-(const Rational &r) const { return Rational(num * r.den - den * r.num, den * r.den); }
    Rational operator*(const Rational &r) const { return Rational(num * r.num, den * r.den); }
    Rational operator/(const Rational &r) const { return Rational(num * r.den, den * r.num); }
    Rational &operator+=(const Rational &r) { return *this = *this + r; }
    Rational &operator-=(const Rational &r) { return *this = *this - r; }
    Rational &operator*=(const Rational &r) { return *this = *this * r; }
    Rational &operator/=(const Rational &r) { return *this = *this / r; }
    Rational operator-() const { return Rational(-num, den); }
    Rational abs() const { return Rational(num > 0 ? num : -num, den); }
    bool operator==(const Rational &r) const { return num == r.num and den == r.den; }
    bool operator!=(const Rational &r) const { return num != r.num or den != r.den; }
    bool operator<(const Rational &r) const {
        if (den == 0 and r.den == 0)
            return num < r.num;
        else if (den == 0)
            return num < 0;
        else if (r.den == 0)
            return r.num > 0;
        else
            return num * r.den < den * r.num;
    }
    bool operator<=(const Rational &r) const { return (*this == r) or (*this < r); }
    bool operator>(const Rational &r) const { return r < *this; }
    bool operator>=(const Rational &r) const { return (r == *this) or (r < *this); }
    explicit operator double() const { return (double)num / (double)den; }
    explicit operator long double() const { return (long double)num / (long double)den; }
    friend std::ostream &operator<<(std::ostream &os, const Rational &x) { return os << x.num << '/' << x.den; }
};


int main() {
    int N, M;
    cin >> N >> M;
    UnionFind uf(N * 2);
    REP(e, M) {
        int r, c;
        cin >> r >> c;
        r--, c--;
        uf.unite(r, c + N);
    }
    map<int, pint> mp;
    REP(i, N) mp[uf.find(i)].first++;
    REP(i, N) mp[uf.find(i + N)].second++;
    int ret = N * N;
    vector<int> dp(mp.size() + 1, -1);
    dp[0] = 0;

    auto upd = [&](int x, int y) { chmin(ret, x * y + (N - x) * (N - y)); };
    upd(0, 0);

    for (auto [id, xy] : mp) {
        auto [x, y] = xy;
        IREP(i, dp.size() - x) {
            if (dp[i] < 0) continue;
            chmax(dp[i + x], dp[i] + y);
            upd(i + x, dp[i + x]);
        }
    }
    cout << ret - M << '\n';
}

yukicoder

結果

テストケース

ソースコード