#609264 (C++17) No.1365 [Cherry 1st Tune] Whose Fault?

提出ソース

結果

問題	No.1365 [Cherry 1st Tune] Whose Fault?
ユーザー	rniya
提出日時	2021-01-22 23:57:20
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	5,671 bytes
コンパイル時間	2,289 ms
コンパイル使用メモリ	206,972 KB
実行使用メモリ	6,948 KB
最終ジャッジ日時	2024-06-09 07:16:15
合計ジャッジ時間	15,937 ms
ジャッジサーバーID （参考情報）	judge3 / judge5

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,812 KB
testcase_01	AC	2 ms 6,944 KB
testcase_02	AC	1 ms 6,940 KB
testcase_03	WA	-
testcase_04	WA	-
testcase_05	WA	-
testcase_06	WA	-
testcase_07	WA	-
testcase_08	WA	-
testcase_09	WA	-
testcase_10	WA	-
testcase_11	WA	-
testcase_12	WA	-
testcase_13	WA	-
testcase_14	AC	16 ms 6,940 KB
testcase_15	AC	5 ms 6,940 KB
testcase_16	AC	4 ms 6,944 KB
testcase_17	AC	15 ms 6,944 KB
testcase_18	AC	9 ms 6,940 KB
testcase_19	WA	-
testcase_20	WA	-
testcase_21	AC	20 ms 6,940 KB
testcase_22	AC	17 ms 6,940 KB
testcase_23	AC	49 ms 6,944 KB
testcase_24	AC	104 ms 6,940 KB
testcase_25	AC	206 ms 6,940 KB
testcase_26	AC	142 ms 6,944 KB
testcase_27	WA	-
testcase_28	WA	-
testcase_29	AC	60 ms 6,944 KB
testcase_30	WA	-
testcase_31	AC	227 ms 6,944 KB
testcase_32	AC	128 ms 6,944 KB
testcase_33	WA	-
testcase_34	AC	162 ms 6,944 KB
testcase_35	AC	95 ms 6,940 KB
testcase_36	AC	186 ms 6,944 KB
testcase_37	AC	42 ms 6,944 KB
testcase_38	AC	52 ms 6,940 KB
testcase_39	WA	-
testcase_40	AC	232 ms 6,940 KB
testcase_41	AC	182 ms 6,940 KB
testcase_42	WA	-
testcase_43	AC	1 ms 6,940 KB
testcase_44	AC	74 ms 6,944 KB
testcase_45	AC	92 ms 6,940 KB

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

ソースコード

raw source code

#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];
        ans -= val(x);
        ans -= val(y);
        if (!UF.merge(x, y)) return ans;
        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;
}

yukicoder

結果

テストケース

ソースコード