結果

問題 No.1365 [Cherry 1st Tune] Whose Fault?
ユーザー 👑 hitonanodehitonanode
提出日時 2021-01-22 22:04:54
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 396 ms / 2,000 ms
コード長 5,766 bytes
コンパイル時間 3,001 ms
コンパイル使用メモリ 207,404 KB
実行使用メモリ 5,624 KB
最終ジャッジ日時 2023-08-28 11:25:16
合計ジャッジ時間 26,424 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,376 KB
testcase_01 AC 2 ms
4,376 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 2 ms
4,384 KB
testcase_04 AC 2 ms
4,376 KB
testcase_05 AC 2 ms
4,380 KB
testcase_06 AC 1 ms
4,380 KB
testcase_07 AC 2 ms
4,376 KB
testcase_08 AC 2 ms
4,376 KB
testcase_09 AC 1 ms
4,376 KB
testcase_10 AC 2 ms
4,380 KB
testcase_11 AC 1 ms
4,376 KB
testcase_12 AC 2 ms
4,380 KB
testcase_13 AC 35 ms
4,380 KB
testcase_14 AC 23 ms
4,384 KB
testcase_15 AC 7 ms
4,376 KB
testcase_16 AC 5 ms
4,380 KB
testcase_17 AC 20 ms
4,376 KB
testcase_18 AC 12 ms
4,376 KB
testcase_19 AC 34 ms
4,376 KB
testcase_20 AC 21 ms
4,376 KB
testcase_21 AC 31 ms
4,380 KB
testcase_22 AC 26 ms
4,380 KB
testcase_23 AC 73 ms
4,516 KB
testcase_24 AC 156 ms
4,936 KB
testcase_25 AC 318 ms
4,988 KB
testcase_26 AC 216 ms
4,616 KB
testcase_27 AC 269 ms
4,380 KB
testcase_28 AC 112 ms
4,384 KB
testcase_29 AC 90 ms
4,384 KB
testcase_30 AC 396 ms
5,144 KB
testcase_31 AC 346 ms
5,352 KB
testcase_32 AC 193 ms
5,104 KB
testcase_33 AC 314 ms
4,424 KB
testcase_34 AC 246 ms
4,384 KB
testcase_35 AC 140 ms
4,812 KB
testcase_36 AC 288 ms
5,352 KB
testcase_37 AC 61 ms
4,508 KB
testcase_38 AC 74 ms
4,840 KB
testcase_39 AC 372 ms
4,828 KB
testcase_40 AC 368 ms
4,680 KB
testcase_41 AC 277 ms
5,172 KB
testcase_42 AC 257 ms
4,380 KB
testcase_43 AC 1 ms
4,380 KB
testcase_44 AC 94 ms
5,624 KB
testcase_45 AC 137 ms
4,384 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
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) { if (m < q) {m = q; return true;} else return false; }
template <typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return 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> 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) { 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
#else
#define dbg(x) (x)
#endif

// UnionFind Tree (0-indexed), based on size of each disjoint set
struct UnionFind {
    std::vector<int> par;
    vector<pair<double, lint>> cou;
    UnionFind(int N = 0) : par(N), cou(N) { 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].second += cou[y].second;
        cou[x].first = cou[x].first * cou[y].first > 0.0 ? cou[x].first * cou[y].first / (cou[x].first + cou[y].first) : 0;
        return true;
    }
    auto count(int x) { return cou[find(x)]; }
    bool same(int x, int y) { return find(x) == find(y); }
};

int main() {
    int N;
    cin >> N;
    vector<int> A(N);
    REP(i, N) {
        int a;
        cin >> a;
        A[i] += a;
    }
    REP(i, N) {
        int a;
        cin >> a;
        A[i] -= a;
    }
    vector<int> P(N);
    cin >> P;
    int Q;
    cin >> Q;
    UnionFind uf(N);
    double ret = 0;
    REP(i, N) {
        ret += A[i] * A[i] * P[i];
        uf.cou[i] = make_pair(P[i], A[i]);
    }
    while (Q--) {
        int x, y;
        cin >> x >> y;
        x--, y--;
        if (!uf.same(x, y)) {
            REP(_, 2) {
                ret -= uf.count(x).first * uf.count(x).second * uf.count(x).second;
                swap(x, y);
            }
            uf.unite(x, y);
            ret += uf.count(x).first * uf.count(x).second * uf.count(x).second;
        }
        cout << ret << '\n';
    }
}
0