結果

問題 No.1365 [Cherry 1st Tune] Whose Fault?
ユーザー rniyarniya
提出日時 2021-01-23 00:02:11
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 297 ms / 2,000 ms
コード長 5,671 bytes
コンパイル時間 3,309 ms
コンパイル使用メモリ 204,184 KB
実行使用メモリ 6,408 KB
最終ジャッジ日時 2023-08-28 11:51:32
合計ジャッジ時間 16,086 ms
ジャッジサーバーID
(参考情報)
judge11 / judge13
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 1 ms
4,376 KB
testcase_03 AC 2 ms
4,376 KB
testcase_04 AC 2 ms
4,376 KB
testcase_05 AC 2 ms
4,376 KB
testcase_06 AC 2 ms
4,376 KB
testcase_07 AC 2 ms
4,380 KB
testcase_08 AC 2 ms
4,380 KB
testcase_09 AC 2 ms
4,376 KB
testcase_10 AC 2 ms
4,376 KB
testcase_11 AC 2 ms
4,380 KB
testcase_12 AC 2 ms
4,380 KB
testcase_13 AC 27 ms
4,376 KB
testcase_14 AC 18 ms
4,376 KB
testcase_15 AC 6 ms
4,380 KB
testcase_16 AC 5 ms
4,380 KB
testcase_17 AC 16 ms
4,380 KB
testcase_18 AC 9 ms
4,380 KB
testcase_19 AC 26 ms
4,380 KB
testcase_20 AC 17 ms
4,380 KB
testcase_21 AC 23 ms
4,376 KB
testcase_22 AC 20 ms
4,380 KB
testcase_23 AC 56 ms
5,168 KB
testcase_24 AC 123 ms
5,136 KB
testcase_25 AC 243 ms
5,364 KB
testcase_26 AC 166 ms
5,144 KB
testcase_27 AC 198 ms
4,376 KB
testcase_28 AC 83 ms
4,376 KB
testcase_29 AC 69 ms
4,380 KB
testcase_30 AC 297 ms
5,748 KB
testcase_31 AC 265 ms
6,208 KB
testcase_32 AC 148 ms
5,668 KB
testcase_33 AC 235 ms
4,776 KB
testcase_34 AC 185 ms
4,576 KB
testcase_35 AC 107 ms
5,468 KB
testcase_36 AC 221 ms
6,408 KB
testcase_37 AC 47 ms
4,384 KB
testcase_38 AC 60 ms
5,368 KB
testcase_39 AC 280 ms
5,524 KB
testcase_40 AC 275 ms
5,156 KB
testcase_41 AC 210 ms
5,620 KB
testcase_42 AC 195 ms
4,384 KB
testcase_43 AC 2 ms
4,384 KB
testcase_44 AC 83 ms
6,404 KB
testcase_45 AC 113 ms
4,384 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#define LOCAL
#include <bits/stdc++.h>
using namespace std;
#pragma region Macros
typedef long long ll;
typedef __int128_t i128;
typedef unsigned int uint;
typedef unsigned long long ull;
#define ALL(x) (x).begin(), (x).end()

template <typename T> istream& operator>>(istream& is, vector<T>& v) {
    for (T& x : v) is >> x;
    return is;
}
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <typename T, typename U, typename V> ostream& operator<<(ostream& os, const tuple<T, U, V>& t) {
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')';
    return os;
}
template <typename T, typename U, typename V, typename W> ostream& operator<<(ostream& os, const tuple<T, U, V, W>& t) {
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const deque<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}

void debug_out() { cerr << '\n'; }
template <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {
    cerr << head;
    if (sizeof...(Tail) > 0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...)                                                                   \
    cerr << " ";                                                                     \
    cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n'; \
    cerr << " ";                                                                     \
    debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }
template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }

template <class T1, class T2> inline bool chmin(T1& a, T2 b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T1, class T2> inline bool chmax(T1& a, T2 b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
#pragma endregion

const int INF = 1e9;
const long long IINF = 1e18;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const char dir[4] = {'D', 'R', 'U', 'L'};
const long long MOD = 1000000007;
// const long long MOD = 998244353;

/**
 * @brief UnionFind
 * @docs docs/datastructure/UnionFind.md
 */
struct UnionFind {
    int num;
    vector<int> par, rank;
    UnionFind(int n) : num(n), par(n), rank(n, 1) { iota(par.begin(), par.end(), 0); }
    int root(int x) { return (par[x] == x ? x : par[x] = root(par[x])); }
    bool merge(int x, int y) {
        x = root(x);
        y = root(y);
        if (x == y) return false;
        if (rank[x] < rank[y]) swap(x, y);
        par[y] = x;
        rank[x] += rank[y];
        num--;
        return true;
    }
    bool same(int x, int y) { return root(x) == root(y); }
    int size(int x) { return rank[root(x)]; }
    int count() { return num; }
    int operator[](int x) { return root(x); }
};

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    int N;
    cin >> N;
    vector<int> A(N), B(N), P(N);
    cin >> A >> B >> P;

    UnionFind UF(N);
    vector<double> ab(N, 0), inv(N, 0);
    auto val = [&](int x) { return ab[x] * ab[x] / inv[x]; };
    double ans = 0;
    for (int i = 0; i < N; i++) {
        ab[i] = A[i] - B[i];
        inv[i] = (P[i] == 0 ? IINF : double(1) / P[i]);
        ans += val(i);
    }
    auto merge = [&](int x, int y) {
        x = UF[x], y = UF[y];
        if (!UF.merge(x, y)) return ans;
        ans -= val(x);
        ans -= val(y);
        if (UF[x] != x) swap(x, y);
        ab[x] += ab[y];
        ab[y] = 0;
        inv[x] += inv[y];
        inv[y] = 0;
        ans += val(x);
        return ans;
    };

    int Q;
    cin >> Q;
    for (; Q--;) {
        int X, Y;
        cin >> X >> Y;
        cout << merge(--X, --Y) << '\n';
        // debug(ab, inv);
    }
    return 0;
}
0