結果

問題 No.1365 [Cherry 1st Tune] Whose Fault?
ユーザー kiyoshi0205kiyoshi0205
提出日時 2021-01-23 00:20:36
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
CE  
(最新)
AC  
(最初)
実行時間 -
コード長 5,817 bytes
コンパイル時間 2,312 ms
コンパイル使用メモリ 181,764 KB
最終ジャッジ日時 2025-01-30 01:06:07
合計ジャッジ時間 5,347 ms
ジャッジサーバーID
(参考情報)
judge1 / judge2
このコードへのチャレンジ
(要ログイン)
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。(リジャッジ後のコンパイルエラーは公開されます)
ただし、clay言語の場合は開発者のデバッグのため、公開されます。

コンパイルメッセージ
In file included from /usr/include/c++/13/string:43,
                 from /usr/include/c++/13/bitset:52,
                 from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:52,
                 from main.cpp:4:
/usr/include/c++/13/bits/allocator.h: In destructor ‘std::_Vector_base<long long int, std::allocator<long long int> >::_Vector_impl::~_Vector_impl()’:
/usr/include/c++/13/bits/allocator.h:184:7: error: inlining failed in call to ‘always_inline’ ‘std::allocator< <template-parameter-1-1> >::~allocator() noexcept [with _Tp = long long int]’: target specific option mismatch
  184 |       ~allocator() _GLIBCXX_NOTHROW { }
      |       ^
In file included from /usr/include/c++/13/vector:66,
                 from /usr/include/c++/13/queue:63,
                 from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:157:
/usr/include/c++/13/bits/stl_vector.h:133:14: note: called from here
  133 |       struct _Vector_impl
      |              ^~~~~~~~~~~~

ソースコード

diff #
プレゼンテーションモードにする

#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);
}
// }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0