結果
問題 | No.2160 みたりのDominator |
ユーザー | hotman78 |
提出日時 | 2022-12-04 19:24:39 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,683 bytes |
コンパイル時間 | 3,077 ms |
コンパイル使用メモリ | 229,176 KB |
実行使用メモリ | 77,348 KB |
最終ジャッジ日時 | 2024-10-11 21:24:17 |
合計ジャッジ時間 | 18,624 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 2 ms
5,248 KB |
testcase_04 | AC | 2 ms
5,248 KB |
testcase_05 | AC | 2 ms
5,248 KB |
testcase_06 | AC | 2 ms
5,248 KB |
testcase_07 | AC | 2 ms
5,248 KB |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | AC | 2 ms
5,248 KB |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | AC | 3 ms
5,248 KB |
testcase_24 | AC | 2 ms
5,248 KB |
testcase_25 | AC | 3 ms
5,248 KB |
testcase_26 | AC | 2 ms
5,248 KB |
testcase_27 | AC | 2 ms
5,248 KB |
testcase_28 | AC | 2 ms
5,248 KB |
testcase_29 | AC | 3 ms
5,248 KB |
testcase_30 | AC | 2 ms
5,248 KB |
testcase_31 | AC | 2 ms
5,248 KB |
testcase_32 | AC | 2 ms
5,248 KB |
testcase_33 | AC | 2 ms
5,248 KB |
testcase_34 | AC | 2 ms
5,248 KB |
testcase_35 | AC | 2 ms
5,248 KB |
testcase_36 | AC | 2 ms
5,248 KB |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | WA | - |
testcase_41 | WA | - |
testcase_42 | WA | - |
testcase_43 | WA | - |
testcase_44 | WA | - |
testcase_45 | WA | - |
testcase_46 | WA | - |
testcase_47 | WA | - |
testcase_48 | WA | - |
testcase_49 | WA | - |
testcase_50 | WA | - |
testcase_51 | WA | - |
testcase_52 | WA | - |
testcase_53 | WA | - |
testcase_54 | WA | - |
testcase_55 | AC | 498 ms
46,480 KB |
testcase_56 | AC | 395 ms
28,920 KB |
testcase_57 | AC | 429 ms
33,588 KB |
testcase_58 | AC | 457 ms
38,960 KB |
testcase_59 | AC | 433 ms
33,948 KB |
testcase_60 | AC | 360 ms
24,100 KB |
testcase_61 | AC | 496 ms
44,812 KB |
testcase_62 | AC | 498 ms
51,312 KB |
testcase_63 | AC | 491 ms
46,768 KB |
testcase_64 | AC | 333 ms
25,560 KB |
testcase_65 | AC | 194 ms
40,976 KB |
testcase_66 | AC | 261 ms
44,192 KB |
testcase_67 | AC | 293 ms
45,696 KB |
testcase_68 | AC | 584 ms
76,728 KB |
testcase_69 | AC | 403 ms
57,512 KB |
testcase_70 | AC | 565 ms
77,348 KB |
testcase_71 | AC | 144 ms
31,860 KB |
testcase_72 | AC | 324 ms
58,728 KB |
testcase_73 | AC | 558 ms
70,404 KB |
testcase_74 | AC | 542 ms
66,760 KB |
testcase_75 | AC | 2 ms
5,248 KB |
testcase_76 | AC | 3 ms
5,248 KB |
testcase_77 | AC | 202 ms
45,272 KB |
testcase_78 | AC | 292 ms
55,768 KB |
testcase_79 | WA | - |
testcase_80 | WA | - |
testcase_81 | WA | - |
testcase_82 | WA | - |
testcase_83 | AC | 59 ms
14,816 KB |
61_evil_bias_nocross_01.txt | WA | - |
61_evil_bias_nocross_02.txt | WA | - |
61_evil_bias_nocross_03.txt | WA | - |
61_evil_bias_nocross_04.txt | WA | - |
61_evil_bias_nocross_05.txt | WA | - |
61_evil_bias_nocross_06.txt | WA | - |
61_evil_bias_nocross_07.txt | WA | - |
61_evil_bias_nocross_08.txt | WA | - |
61_evil_bias_nocross_09.txt | WA | - |
61_evil_bias_nocross_10.txt | WA | - |
61_evil_bias_nocross_11.txt | WA | - |
61_evil_bias_nocross_12.txt | WA | - |
ソースコード
#include<bits/stdc++.h> #include<atcoder/scc> using namespace std; using namespace atcoder; #define rep(i,n) for(int i=0;i<int(n);++i) using lint=long long; int main(){ array<int,3>n; int m,ns=0; rep(i,3)cin>>n[i]; rep(i,3)ns+=n[i]; cin>>m; vector<int>u(m),v(m),st; rep(i,m){ cin>>u[i]>>v[i]; u[i]--;v[i]--; st.emplace_back(u[i]); st.emplace_back(v[i]); } st.emplace_back(ns); st.emplace_back(ns+1); sort(st.begin(),st.end()); st.erase(unique(st.begin(),st.end()),st.end()); int n2=st.size(); vector<vector<pair<int,int>>> g(n2); scc_graph scc(n2); auto get=[&](int i){ return lower_bound(st.begin(),st.end(),i)-st.begin(); }; //cerr<<n2<<endl; { int now=0,pre=0; rep(i,3){ //cerr<<st[now]<<endl; if(st[now]>=pre+n[i]){ //cerr<<"a"<<n[i]<<endl; g[n2-2].emplace_back(n2-1,n[i]+1); pre+=n[i]; continue; } g[n2-2].emplace_back(now,st[now]+1-pre); while(1){ if(now+1>=n2-2||st[now+1]>=pre+n[i])break; //cerr<<"tmp"<<endl; g[now].emplace_back(now+1,st[now+1]-st[now]); now++; } //cerr<<"pre"<<pre<<" "<<pre+n[i]-st[now]<<endl; g[now].emplace_back(n2-1,pre+n[i]-st[now]); now++; pre+=n[i]; } } rep(i,m){ g[get(u[i])].emplace_back(get(v[i]),1); g[get(v[i])].emplace_back(get(u[i]),1); } rep(i,n2){ for(auto [e,c]:g[i]){ scc.add_edge(i,e); } } auto res=scc.scc(); int sz=res.size(); //cerr<<sz<<endl; vector<vector<int>>g2(sz); vector<int>id(n2+2); vector<lint>v1(sz),v2(sz),v3(sz,1),v4(sz); rep(i,sz){ for(auto s:res[i]){ //cerr<<i<<" "<<s<<endl; id[s]=i; } } rep(i,n2){ for(auto [e,c]:g[i]){ if(id[i]==id[e])continue; if(id[e]==id[i]+1){ //cerr<<"b"<<c<<endl; v3[id[i]]*=c; v4[id[i]]++; continue; } //cerr<<"c"<<c<<endl; v1[id[i]]+=c; v1[id[e]]-=c; v2[id[i]]+=c*c; v2[id[e]]-=c*c; } } lint ans=0,tmp=0,tmp2=0; rep(i,sz-1){ tmp+=v1[i]; tmp2+=v2[i]; //cerr<<tmp<<" "<<tmp2<<" "<<v3[i]<<" "<<v4[i]<<endl; if(v4[i]==1)ans+=(tmp*tmp-tmp2)*v3[i]; else if(v4[i]==2)ans+=tmp*v3[i]; else ans+=v3[i]; } cout<<ans<<endl; /**/}