結果

問題 No.1365 [Cherry 1st Tune] Whose Fault?
ユーザー yuto1115yuto1115
提出日時 2021-01-22 22:55:55
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,224 ms / 2,000 ms
コード長 5,252 bytes
コンパイル時間 2,168 ms
コンパイル使用メモリ 215,284 KB
実行使用メモリ 49,920 KB
最終ジャッジ日時 2024-06-09 07:01:28
合計ジャッジ時間 31,446 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 3 ms
5,376 KB
testcase_05 AC 3 ms
5,376 KB
testcase_06 AC 3 ms
5,376 KB
testcase_07 AC 4 ms
5,376 KB
testcase_08 AC 3 ms
5,376 KB
testcase_09 AC 2 ms
5,376 KB
testcase_10 AC 2 ms
5,376 KB
testcase_11 AC 2 ms
5,376 KB
testcase_12 AC 2 ms
5,376 KB
testcase_13 AC 101 ms
6,784 KB
testcase_14 AC 113 ms
7,936 KB
testcase_15 AC 39 ms
5,760 KB
testcase_16 AC 16 ms
7,908 KB
testcase_17 AC 70 ms
6,272 KB
testcase_18 AC 80 ms
7,168 KB
testcase_19 AC 111 ms
7,168 KB
testcase_20 AC 32 ms
5,376 KB
testcase_21 AC 89 ms
6,784 KB
testcase_22 AC 68 ms
5,888 KB
testcase_23 AC 514 ms
25,600 KB
testcase_24 AC 783 ms
32,256 KB
testcase_25 AC 956 ms
33,920 KB
testcase_26 AC 792 ms
30,592 KB
testcase_27 AC 501 ms
16,896 KB
testcase_28 AC 227 ms
9,232 KB
testcase_29 AC 374 ms
16,000 KB
testcase_30 AC 1,099 ms
37,632 KB
testcase_31 AC 1,224 ms
44,800 KB
testcase_32 AC 996 ms
39,680 KB
testcase_33 AC 744 ms
24,960 KB
testcase_34 AC 627 ms
22,784 KB
testcase_35 AC 799 ms
33,408 KB
testcase_36 AC 1,156 ms
43,392 KB
testcase_37 AC 284 ms
13,952 KB
testcase_38 AC 570 ms
35,584 KB
testcase_39 AC 977 ms
32,768 KB
testcase_40 AC 949 ms
32,128 KB
testcase_41 AC 1,001 ms
37,888 KB
testcase_42 AC 460 ms
15,744 KB
testcase_43 AC 2 ms
5,376 KB
testcase_44 AC 129 ms
49,920 KB
testcase_45 AC 104 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

//@formatter:off
#include<bits/stdc++.h>
#define overload4(_1,_2,_3,_4,name,...) name
#define rep1(i,n) for (ll i = 0; i < ll(n); ++i)
#define rep2(i,s,n) for (ll i = ll(s); i < ll(n); ++i)
#define rep3(i,s,n,d) for(ll i = ll(s); i < ll(n); i+=d)
#define rep(...) overload4(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)
#define rrep(i,n) for (ll i = ll(n)-1; i >= 0; i--)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define pb push_back
#define eb emplace_back
#ifdef __LOCAL
#define debug(...) { cout << #__VA_ARGS__; cout << ": "; print(__VA_ARGS__); cout << flush; }
#else
#define debug(...) void(0)
#endif
#define INT(...) int __VA_ARGS__;scan(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;scan(__VA_ARGS__)
#define STR(...) string __VA_ARGS__;scan(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__;scan(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__;scan(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__;scan(__VA_ARGS__)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int,int>;
using LP = pair<ll,ll>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vd = vector<double>;
using vvd = vector<vector<double>>;
using vs = vector<string>;
using vc = vector<char>;
using vvc = vector<vector<char>>;
using vb = vector<bool>;
using vvb = vector<vector<bool>>;
using vp = vector<P>;
using vvp = vector<vector<P>>;
template<class S,class T> istream& operator>>(istream &is,pair<S,T> &p) { return is >> p.first >> p.second; }
template<class S,class T> ostream& operator<<(ostream &os,const pair<S,T> &p) { return os<<'{'<<p.first<<","<<p.second<<'}'; }
template<class T> istream& operator>>(istream &is,vector<T> &v) { for(T &t:v){is>>t;} return is; }
template<class T> ostream& operator<<(ostream &os,const vector<T> &v) { os<<'[';rep(i,v.size())os<<v[i]<<(i==int(v.size()-1)?"":","); return os<<']'; }
template<class T> bool chmin(T& a,T b) {if(a > b){a = b; return true;} return false;}
template<class T> bool chmax(T& a,T b) {if(a < b){a = b; return true;} return false;}
void scan(){}
template <class Head, class... Tail> void scan(Head& head, Tail&... tail){ cin >> head; scan(tail...); }
template<class T> void print(const T& t){ cout << t << '\n'; }
template <class Head, class... Tail> void print(const Head& head, const Tail&... tail){ cout<<head<<' '; print(tail...); }
template<class T> void fin(T a) { print(a); exit(0); }
const string yes[] = {"no","yes"};
const string Yes[] = {"No","Yes"};
const string YES[] = {"NO","YES"};
const int inf = 1001001001;
const ll linf = 1001001001001001001;
//@formatter:on

#define double ld

class unionfind {
    int n;
    vector<int> par, rank;
    vi sa, sb;
    vvi ps;
public:
    unionfind(int n) : n(n), par(n, -1), rank(n, 0), sa(n), sb(n), ps(n) {}
    
    void set(int i, int a, int b, int p) {
        sa[i] = a, sb[i] = b;
        ps[i].assign(101, 0);
        ps[i][p]++;
    }
    
    int root(int x) {
        if (par[x] < 0) return x;
        else return par[x] = root(par[x]);
    }
    
    bool same(int x, int y) { return root(x) == root(y); };
    
    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);
        if (rank[x] == rank[y]) rank[x]++;
        par[x] += par[y];
        par[y] = x;
        sa[x] += sa[y];
        sb[x] += sb[y];
        rep(i, 101) ps[x][i] += ps[y][i];
        return true;
    }
    
    int size(int x) { return -par[root(x)]; };
    
    bool connected() {
        rep(i, n - 1) if (!same(i, i + 1)) return false;
        return true;
    }
    
    P get(int x) {
        x = root(x);
        return {sa[x], sb[x]};
    }
    
    vi getP(int x) { return ps[root(x)]; }
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    INT(n);
    vi a(n), b(n), p(n);
    cin >> a >> b >> p;
    INT(q);
    unionfind uf(n);
    vd as(n);
    double ans = 0;
    cout << fixed << setprecision(15);
    rep(i, n) {
        uf.set(i, a[i], b[i], p[i]);
        as[i] = (a[i] - b[i]) * (a[i] - b[i]) * p[i];
        ans += as[i];
    }
    rep(i, q) {
        INT(x, y);
        x--;
        y--;
        if (uf.same(x, y)) {
            print(ans);
            continue;
        }
        ans -= as[uf.root(x)];
        ans -= as[uf.root(y)];
        uf.merge(x, y);
        auto[na, nb] = uf.get(x);
        vi np = uf.getP(x);
        int d = abs(na - nb);
        if (d == 0 or np[0] > 0) {
            as[uf.root(x)] = 0;
            print(ans);
            continue;
        }
        double ok = 1e12, ng = 0;
        auto f = [&](double x) -> bool {
            double now = 0;
            rep(j, 1, 101) {
                double l = x / j / 2;
                now += l * np[j];
            }
            return now >= d;
        };
        assert(f(ok));
        rep(_, 100) {
            double mid = (ng + ok) / 2;
            if (f(mid)) ok = mid;
            else ng = mid;
        }
        double now = 0;
        rep(j, 1, 101) {
            double l = ok / j / 2;
            now += l * l * j * np[j];
        }
        as[uf.root(x)] = now;
        ans += now;
        print(ans);
    }
}
0