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

• 問題: No.1365 [Cherry 1st Tune] Whose Fault?
• ユーザー: kiyoshi0205
• 提出日時: 2021-01-23 15:46:03
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 342 ms / 2,000 ms
• コード長: 5,817 bytes
• コンパイル時間: 2,737 ms
• コンパイル使用メモリ: 193,660 KB
• 実行使用メモリ: 7,344 KB
• 最終ジャッジ日時: 2024-06-09 20:46:57
• 合計ジャッジ時間: 23,684 ms
• ジャッジサーバーID （参考情報）: judge4 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 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	2 ms; 5,376 KB
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	3 ms; 5,376 KB
testcase_07	AC	3 ms; 5,376 KB
testcase_08	AC	2 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	30 ms; 5,376 KB
testcase_14	AC	21 ms; 5,376 KB
testcase_15	AC	7 ms; 5,376 KB
testcase_16	AC	5 ms; 5,376 KB
testcase_17	AC	19 ms; 5,376 KB
testcase_18	AC	12 ms; 5,376 KB
testcase_19	AC	30 ms; 5,376 KB
testcase_20	AC	19 ms; 5,376 KB
testcase_21	AC	27 ms; 5,376 KB
testcase_22	AC	24 ms; 5,376 KB
testcase_23	AC	65 ms; 5,376 KB
testcase_24	AC	138 ms; 5,760 KB
testcase_25	AC	275 ms; 6,144 KB
testcase_26	AC	189 ms; 5,760 KB
testcase_27	AC	211 ms; 5,376 KB
testcase_28	AC	108 ms; 5,376 KB
testcase_29	AC	79 ms; 5,376 KB
testcase_30	AC	342 ms; 6,400 KB
testcase_31	AC	303 ms; 6,784 KB
testcase_32	AC	174 ms; 6,528 KB
testcase_33	AC	276 ms; 5,376 KB
testcase_34	AC	217 ms; 5,376 KB
testcase_35	AC	124 ms; 6,144 KB
testcase_36	AC	252 ms; 6,784 KB
testcase_37	AC	53 ms; 5,376 KB
testcase_38	AC	68 ms; 6,144 KB
testcase_39	AC	324 ms; 6,272 KB
testcase_40	AC	337 ms; 6,016 KB
testcase_41	AC	239 ms; 6,528 KB
testcase_42	AC	202 ms; 5,376 KB
testcase_43	AC	2 ms; 5,376 KB
testcase_44	AC	89 ms; 7,344 KB
testcase_45	AC	122 ms; 5,376 KB

ソースコード

#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
// #include<ext/pb_ds/tag_and_trait.hpp>
// using namespace __gnu_pbds;
// #include<boost/multiprecision/cpp_int.hpp>
// namespace multiprecisioninteger = boost::multiprecision;
// using cint=multiprecisioninteger::cpp_int;
using namespace std;
using ll=long long;
#define double long double
using datas=pair<ll,ll>;
using ddatas=pair<double,double>;
using tdata=pair<ll,datas>;
using vec=vector<ll>;
using mat=vector<vec>;
using pvec=vector<datas>;
using pmat=vector<pvec>;
// using llset=tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>;
#define For(i,a,b) for(i=a;i<(ll)b;++i)
#define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i)
#define rep(i,N) For(i,0,N)
#define rep1(i,N) For(i,1,N)
#define brep(i,N) bFor(i,N,0)
#define brep1(i,N) bFor(i,N,1)
#define all(v) (v).begin(),(v).end()
#define allr(v) (v).rbegin(),(v).rend()
#define vsort(v) sort(all(v))
#define vrsort(v) sort(allr(v))
#define uniq(v) vsort(v);(v).erase(unique(all(v)),(v).end())
#define endl "\n"
#define eb emplace_back
#define print(x) cout<<x<<endl
#define printyes print("Yes")
#define printno print("No")
#define printYES print("YES")
#define printNO print("NO")
#define output(v) do{bool f=0;for(auto outi:v){cout<<(f?" ":"")<<outi;f=1;}cout<<endl;}while(0)
#define matoutput(v) do{for(auto outimat:v)output(outimat);}while(0)
constexpr ll mod=1000000007;
// constexpr ll mod=998244353;
constexpr ll inf=1LL<<60;
constexpr double eps=1e-9;
const double PI=acos(-1);
template<class T,class E> ostream& operator<<(ostream& os,const pair<T,E>& p){return os<<"("<<p.first<<","<<p.second<<")";}
template<class T> ostream& operator<<(ostream& os,const vector<T>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T> ostream& operator<<(ostream& os,const set<T>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T> inline bool chmax(T& a,T b){bool x=a<b;if(x)a=b;return x;}
template<class T> inline bool chmin(T& a,T b){bool x=a>b;if(x)a=b;return x;}
#ifdef DEBUG
void debugg(){cout<<endl;}
template<class T,class... Args>void debugg(const T& x,const Args&... args){cout<<" "<<x;debugg(args...);}
#define debug(...) cout<<__LINE__<<" ["<<#__VA_ARGS__<<"]:",debugg(__VA_ARGS__)
#else
#define debug(...) (void(0))
#endif

void startupcpp(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout<<fixed<<setprecision(15);
}

double distance(ddatas x,ddatas y){
  double a=x.first-y.first,b=x.second-y.second;
  return sqrt(a*a+b*b);
}

ll modinv(ll a,ll m=mod) {
  ll b=m,u=1,v=0,t;
  while(b){
    t=a/b;
    a-=t*b; swap(a,b);
    u-=t*v; swap(u,v);
  }
  return (u+m)%m;
}

ll moddevide(ll a,ll b){return (a*modinv(b))%mod;}

vec modncrlistp,modncrlistm;

ll modncr(ll n,ll r){
  if(n<r)return 0;
  ll i,size=modncrlistp.size();
  if(size<=n){
    modncrlistp.resize(n+1);
    modncrlistm.resize(n+1);
    if(!size){
      modncrlistp[0]=modncrlistm[0]=1;
      size++;
    }
    For(i,size,n+1){
      modncrlistp[i]=modncrlistp[i-1]*i%mod;
      modncrlistm[i]=modinv(modncrlistp[i]);
    }
  }
  return modncrlistp[n]*modncrlistm[r]%mod*modncrlistm[n-r]%mod;
}

ll modpow(ll a,ll n,ll m=mod){
  ll res=1;
  while(n>0){
    if(n&1)res=res*a%m;
    a=a*a%m;
    n>>=1;
  }
  return res;
}

ll gcd(ll a,ll b){if(!b)return abs(a);return (a%b==0)?abs(b):gcd(b,a%b);}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}

ll countdigits(ll n,ll k=10){
  ll ans=0;
  while(n){n/=k;ans++;}
  return ans;
}

ll sumdigits(ll n,ll k=10){
  ll ans=0;
  while(n){ans+=n%k;n/=k;}
  return ans;
}
struct unionfind{
  private:
  int maxN;
  vector<int> par,treesize;
  public:unionfind(int N) :maxN(N),par(N),treesize(N,1){
    for(int i=0;i<maxN;++i)par[i]=i;
  }
  int root(int x){
    while(par[x]!=x){
      x=par[x]=par[par[x]];
    }
    return x;
  }
  bool unite(int x,int y){
    x=root(x);
    y=root(y);
    if(x==y)return false;
    if(treesize[x]>treesize[y])swap(x,y);
    par[x]=y;
    treesize[y]+=treesize[x];
    return true;
  }
  bool unite(pair<int,int> v){
    return unite(v.first,v.second);
  }
  bool parcheck(int x,int y){
    return root(x)==root(y);
  }
  bool parcheck(pair<int,int> v){
    return parcheck(v.first,v.second);
  }
  int size(int x){
    return treesize[root(x)];
  }
  void clear(){
    treesize.assign(maxN,1);
    for(int i=0;i<maxN;++i)par[i]=i;
  }
  vector<vector<int>> groups(){
    vector<vector<int>> res(maxN);
    for(int i=0;i<maxN;++i)res[root(i)].eb(i);
    // return res;
    vector<vector<int>> res2;
    for(vector<int> x:res){
      if(x.size())res2.eb(x);
    }
    return res2;
  }
};
ll N,M,K,H,W,A,B,C,D;
double ans;
int main(){
  startupcpp();
  // int codeforces;cin>>codeforces;while(codeforces--){
  ll i,j;
  cin>>N;
  vector<pair<ll,double>> v(N);
  rep(i,N)cin>>v[i].first;
  rep(i,N){
    cin>>j;
    v[i].first-=j;
  }
  rep(i,N){
    cin>>j;
    if(j){
      v[i].second=1.0/j;
    }else{
      v[i].second=0;
    }
    ans+=v[i].first*v[i].first*j;
  }
  cin>>M;
  unionfind tree(N);
  while(M--){
    cin>>A>>B;
    --A;--B;
    if(tree.parcheck(A,B)){
      print(ans);
      continue;
    }
    A=tree.root(A);
    B=tree.root(B);
    tree.unite(A,B);
    C=tree.root(A);
    if(B==C)swap(A,B);
    j=0;
    if(v[A].second>0)ans-=v[A].first*v[A].first/v[A].second;
    else j=1;
    if(v[B].second>0)ans-=v[B].first*v[B].first/v[B].second;
    else j=1;
    if(j){
      v[A].second=0;
    }else{
      v[A].first+=v[B].first;
      v[A].second+=v[B].second;
      ans+=v[A].first*v[A].first/v[A].second;
    }
    debug(v);
    print(ans);
  }
// }
}