結果
問題 | No.1365 [Cherry 1st Tune] Whose Fault? |
ユーザー |
|
提出日時 | 2021-01-23 00:06:29 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 345 ms / 2,000 ms |
コード長 | 2,598 bytes |
コンパイル時間 | 2,731 ms |
コンパイル使用メモリ | 200,776 KB |
最終ジャッジ日時 | 2025-01-18 06:46:42 |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 46 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define rep(i, n) for(int i = 0; i < n; i++)#define rep2(i, x, n) for(int i = x; i <= n; i++)#define rep3(i, x, n) for(int i = x; i >= n; i--)#define each(e, v) for(auto &e: v)#define pb push_back#define eb emplace_back#define all(x) x.begin(), x.end()#define rall(x) x.rbegin(), x.rend()#define sz(x) (int)x.size()using ll = long long;using pii = pair<int, int>;using pil = pair<int, ll>;using pli = pair<ll, int>;using pll = pair<ll, ll>;const int MOD = 1000000007;//const int MOD = 998244353;const int inf = (1<<30)-1;const ll INF = (1LL<<60)-1;template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};struct io_setup{io_setup(){ios_base::sync_with_stdio(false);cin.tie(NULL);cout << fixed << setprecision(15);}} io_setup;struct Union_Find_Tree{vector<int> data;const int n;Union_Find_Tree(int n) : n(n){data.assign(n, -1);}int root(int x){if(data[x] < 0) return x;return data[x] = root(data[x]);}int operator [] (int i) {return root(i);}bool unite(int x, int y){x = root(x), y = root(y);if(x == y) return false;if(data[x] > data[y]) swap(x, y);data[x] += data[y], data[y] = x;return true;}int size(int x) {return -data[root(x)];}bool same(int x, int y) {return root(x) == root(y);}void clear() {fill(all(data), -1);}};int main(){int N; cin >> N;vector<int> A(N), B(N), P(N);rep(i, N) cin >> A[i];rep(i, N) cin >> B[i];rep(i, N) cin >> P[i];Union_Find_Tree uf(N);vector<double> C(N), D(N), E(N), F(N);rep(i, N){C[i] = A[i]-B[i];D[i] = B[i];if(P[i] > 0) E[i] = 1.0/P[i];else E[i] = -1e9;F[i] = P[i]*(A[i]-B[i])*(A[i]-B[i]);}double ans = 0;rep(i, N) ans += F[i];int Q; cin >> Q;while(Q--){int u, v; cin >> u >> v; u--, v--;if(uf.same(u, v)){cout << ans << '\n';continue;}u = uf.root(u), v = uf.root(v);uf.unite(u, v);int w = uf.root(u);ans -= F[u]+F[v];C[w] = C[u]+C[v], D[w] = D[u]+D[v], E[w] = E[u]+E[v];if(E[w] < -1) F[w] = 0;else{double K = C[w]/E[w];F[w] = K*K*E[w];}ans += F[w];cout << ans << '\n';}}