結果
問題 | No.1365 [Cherry 1st Tune] Whose Fault? |
ユーザー |
👑 ![]() |
提出日時 | 2021-02-06 17:08:31 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 231 ms / 2,000 ms |
コード長 | 571 bytes |
コンパイル時間 | 2,131 ms |
コンパイル使用メモリ | 197,176 KB |
最終ジャッジ日時 | 2025-01-18 13:37:12 |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 46 |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:4:19: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 4 | #define S(a) scanf("%d",&a); | ~~~~~^~~~~~~~~ main.cpp:12:1: note: in expansion of macro ‘S’ 12 | S(N)D G(N);R S(A[i]);R {S(u);A[i]-=u;}R {S(u);P[i]=1./u;ans+=f(i);}S(N) | ^ main.cpp:4:19: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 4 | #define S(a) scanf("%d",&a); | ~~~~~^~~~~~~~~ main.cpp:12:14: note: in expansion of macro ‘S’ 12 | S(N)D G(N);R S(A[i]);R {S(u);A[i]-=u;}R {S(u);P[i]=1./u;ans+=f(i);}S(N) | ^ main.cpp:4:19: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 4 | #define S(a) scanf("%d",&a); | ~~~~~^~~~~~~~~ main.cpp:12:25: note: in expansion of macro ‘S’ 12 | S(N)D G(N);R S(A[i]);R {S(u);A[i]-=u;}R {S(u);P[i]=1./u;ans+=f(i);}S(N) | ^ main.cpp:4:19: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 4 | #define S(a) scanf("%d",&a); | ~~~~~^~~~~~~~~ main.cpp:12:42: note: in expansion of macro ‘S’ 12 | S(N)D G(N);R S(A[i]);R {S(u);A[i]-=u;}R {S(u);P[i]=1./u;ans+=f(i);}S(N) | ^ main.cpp:4:19: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 4 | #define S(a) scanf("%d",&a); | ~~~~~^~~~~~~~~ main.cpp:12:68: note: in expansion of macro ‘S’ 12 | S(N)D G(N);R S(A[i]);R {S(u);A[i]-=u;}R {S(u);P[i]=1./u;ans+=f(i);}S(N) |
ソースコード
#include<bits/stdc++.h> using namespace std; #define I int #define S(a) scanf("%d",&a); #define R for(I i=0;i<(N);i++) struct D{vector<I> V;D(I n){V.assign(n,-1);}I r(I a){return(V[a]<0)?a:(V[a]=r(V[a]));}I u(I a,I b){a=r(a);b=r(b);return(a==b)?-1:(V[b]=a);}}; I N,A[100000],u,v,g; double P[100000],ans=0.0; double f(I i){return A[i]*A[i]/P[i];} I main(){ S(N)D G(N);R S(A[i]);R {S(u);A[i]-=u;}R {S(u);P[i]=1./u;ans+=f(i);}S(N) R{S(u)S(v)u=G.r(u-1);v=G.r(v-1);if(u!=v){g=G.u(u,v);ans-=f(u)+f(v);A[g]+=A[u+v-g];P[g]+=P[u+v-g];ans+=f(g);}printf("%.4f\n",ans);} return 0;}