結果
問題 | No.2160 みたりのDominator |
ユーザー | snuke |
提出日時 | 2022-12-11 11:12:01 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 466 ms / 2,000 ms |
コード長 | 4,931 bytes |
コンパイル時間 | 2,630 ms |
コンパイル使用メモリ | 222,480 KB |
実行使用メモリ | 67,504 KB |
最終ジャッジ日時 | 2024-10-15 08:35:03 |
合計ジャッジ時間 | 16,881 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 117 ms
62,516 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 | AC | 2 ms
5,248 KB |
testcase_09 | AC | 2 ms
5,248 KB |
testcase_10 | AC | 2 ms
5,248 KB |
testcase_11 | AC | 2 ms
5,248 KB |
testcase_12 | AC | 2 ms
5,248 KB |
testcase_13 | AC | 2 ms
5,248 KB |
testcase_14 | AC | 2 ms
5,248 KB |
testcase_15 | AC | 2 ms
5,248 KB |
testcase_16 | AC | 2 ms
5,248 KB |
testcase_17 | AC | 2 ms
5,248 KB |
testcase_18 | AC | 3 ms
5,248 KB |
testcase_19 | AC | 2 ms
5,248 KB |
testcase_20 | AC | 2 ms
5,248 KB |
testcase_21 | AC | 2 ms
5,248 KB |
testcase_22 | AC | 2 ms
5,248 KB |
testcase_23 | AC | 2 ms
5,248 KB |
testcase_24 | AC | 2 ms
5,248 KB |
testcase_25 | AC | 2 ms
5,248 KB |
testcase_26 | AC | 2 ms
5,248 KB |
testcase_27 | AC | 3 ms
5,248 KB |
testcase_28 | AC | 2 ms
5,248 KB |
testcase_29 | AC | 2 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 | 133 ms
67,504 KB |
testcase_35 | AC | 2 ms
5,248 KB |
testcase_36 | AC | 2 ms
5,248 KB |
testcase_37 | AC | 2 ms
5,248 KB |
testcase_38 | AC | 2 ms
5,248 KB |
testcase_39 | AC | 2 ms
5,248 KB |
testcase_40 | AC | 166 ms
55,972 KB |
testcase_41 | AC | 154 ms
56,264 KB |
testcase_42 | AC | 93 ms
34,972 KB |
testcase_43 | AC | 126 ms
43,156 KB |
testcase_44 | AC | 162 ms
54,460 KB |
testcase_45 | AC | 163 ms
52,084 KB |
testcase_46 | AC | 144 ms
49,476 KB |
testcase_47 | AC | 78 ms
28,956 KB |
testcase_48 | AC | 110 ms
34,904 KB |
testcase_49 | AC | 132 ms
42,436 KB |
testcase_50 | AC | 127 ms
42,556 KB |
testcase_51 | AC | 105 ms
39,640 KB |
testcase_52 | AC | 144 ms
51,592 KB |
testcase_53 | AC | 161 ms
53,680 KB |
testcase_54 | AC | 94 ms
34,172 KB |
testcase_55 | AC | 388 ms
41,560 KB |
testcase_56 | AC | 279 ms
36,892 KB |
testcase_57 | AC | 326 ms
38,536 KB |
testcase_58 | AC | 407 ms
52,872 KB |
testcase_59 | AC | 371 ms
42,632 KB |
testcase_60 | AC | 213 ms
54,684 KB |
testcase_61 | AC | 398 ms
39,640 KB |
testcase_62 | AC | 466 ms
54,936 KB |
testcase_63 | AC | 417 ms
43,244 KB |
testcase_64 | AC | 166 ms
43,488 KB |
testcase_65 | AC | 199 ms
35,264 KB |
testcase_66 | AC | 230 ms
29,868 KB |
testcase_67 | AC | 228 ms
31,312 KB |
testcase_68 | AC | 459 ms
48,296 KB |
testcase_69 | AC | 315 ms
36,872 KB |
testcase_70 | AC | 454 ms
49,348 KB |
testcase_71 | AC | 148 ms
33,064 KB |
testcase_72 | AC | 310 ms
49,344 KB |
testcase_73 | AC | 432 ms
41,044 KB |
testcase_74 | AC | 405 ms
38,552 KB |
testcase_75 | AC | 53 ms
34,604 KB |
testcase_76 | AC | 45 ms
28,128 KB |
testcase_77 | AC | 238 ms
50,084 KB |
testcase_78 | AC | 296 ms
50,616 KB |
testcase_79 | AC | 34 ms
19,736 KB |
testcase_80 | AC | 40 ms
22,356 KB |
testcase_81 | AC | 72 ms
40,236 KB |
testcase_82 | AC | 85 ms
42,944 KB |
testcase_83 | AC | 115 ms
37,780 KB |
61_evil_bias_nocross_01.txt | AC | 164 ms
56,196 KB |
61_evil_bias_nocross_02.txt | AC | 151 ms
56,084 KB |
61_evil_bias_nocross_03.txt | AC | 90 ms
36,524 KB |
61_evil_bias_nocross_04.txt | AC | 121 ms
44,544 KB |
61_evil_bias_nocross_05.txt | AC | 163 ms
54,468 KB |
61_evil_bias_nocross_06.txt | AC | 160 ms
56,552 KB |
61_evil_bias_nocross_07.txt | AC | 103 ms
39,436 KB |
61_evil_bias_nocross_08.txt | AC | 145 ms
51,556 KB |
61_evil_bias_nocross_09.txt | AC | 151 ms
53,708 KB |
61_evil_bias_nocross_10.txt | AC | 92 ms
34,040 KB |
61_evil_bias_nocross_11.txt | AC | 123 ms
43,116 KB |
61_evil_bias_nocross_12.txt | AC | 144 ms
48,256 KB |
ソースコード
#include <bits/stdc++.h>#define rep(i,n) for(int i = 0; i < (n); ++i)#define rep1(i,n) for(int i = 1; i <= (n); ++i)#define drep(i,n) for(int i = (n)-1; i >= 0; --i)#define srep(i,s,t) for (int i = s; i < (t); ++i)#define rng(a) a.begin(),a.end()#define rrng(a) a.rbegin(),a.rend()#define fi first#define se second#define pb push_back#define eb emplace_back#define pob pop_back#define sz(x) (int)(x).size()#define pcnt __builtin_popcountll#define snuke srand((unsigned)clock()+(unsigned)time(NULL));#define newline puts("")using namespace std;template<typename T> using vc = vector<T>;template<typename T> using vv = vc<vc<T>>;template<typename T> using PQ = priority_queue<T,vc<T>,greater<T>>;using uint = unsigned; using ull = unsigned long long;using vi = vc<int>; using vvi = vv<int>; using vvvi = vv<vi>;using ll = long long; using vl = vc<ll>; using vvl = vv<ll>; using vvvl = vv<vl>;using P = pair<int,int>; using vp = vc<P>; using vvp = vv<P>;int geti(){int x;scanf("%d",&x);return x;}vi pm(int n, int s=0) { vi a(n); iota(rng(a),s); return a;}template<typename T>istream& operator>>(istream&i,vc<T>&v){rep(j,sz(v))i>>v[j];return i;}template<typename T>string join(const T&v,const string& d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}template<typename T>ostream& operator<<(ostream&o,const vc<T>&v){if(sz(v))o<<join(v," ");return o;}template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.fi>>v.se;}template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.fi<<","<<v.se;}template<typename T1,typename T2>void operator--(pair<T1,T2>&a,int){a.fi--;a.se--;}template<typename T>void operator--(vc<T>&a,int){for(T&x:a)x--;}template<typename T>void operator++(vc<T>&a,int){for(T&x:a)x++;}template<typename T>void operator+=(vc<T>&a,T b){for(T&x:a)x+=b;}template<typename T>void operator+=(vc<T>&a,const vc<T>&b){a.insert(a.end(),rng(b));}template<typename T1,typename T2>bool mins(T1& x,const T2&y){if(x>y){x=y;return true;}else return false;}template<typename T1,typename T2>bool maxs(T1& x,const T2&y){if(x<y){x=y;return true;}else return false;}template<typename Tx, typename Ty>Tx dup(Tx x, Ty y){return (x+y-1)/y;}template<typename T>ll suma(const vc<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}template<typename T>ll suma(const vv<T>&a){ll res(0);for(auto&&x:a)res+=suma(x);return res;}template<typename T>void uni(T& a){sort(rng(a)); a.erase(unique(rng(a)),a.end());}template<typename T>void prepend(vc<T>&a,const T&x){a.insert(a.begin(),x);}const double eps = 1e-10;const ll LINF = 1001002003004005006ll;const int INF = 1001001001;#define dame { puts("-1"); return;}#define yes { puts("Yes"); return;}#define no { puts("No"); return;}#define ret(x) { cout<<(x)<<endl; return;}#define yn {puts("Yes");}else{puts("No");}const int MX = 200005;// SCC// upstream is smaller idstruct scc {int n, k;vvi to, ot, d, gt; // to, rev_to, groups, group_tovi g, used, kv; // group, gomi, topo_ordscc(int n=0):n(n),to(n),ot(n){}int inc() { to.pb(vi()); ot.pb(vi()); return n++;}void add(int a, int b) { to[a].pb(b); ot[b].pb(a);}void dfs(int v) {if (used[v]) return;used[v] = 1;rep(i,sz(to[v])) dfs(to[v][i]);kv[--k] = v;}void rfs(int v) {if (g[v] != -1) return;g[v] = k; d[k].pb(v);rep(i,sz(ot[v])) rfs(ot[v][i]);}void init() {k = n;used = kv = vi(n);g = vi(n,-1);rep(i,n) dfs(i);rep(i,n) if (g[kv[i]] == -1) {d.pb(vi());rfs(kv[i]);k++;}}};//struct Solver {void solve() {vi n(3); int m;cin>>n>>m;int sv = suma(n), tv = sv+1;scc g(tv+1);{int v = 0;rep(i,3) {int p = sv;rep(j,n[i]) {g.add(p,v);p = v; v++;}g.add(p,tv);}}rep(i,m) {int a,b;scanf("%d%d",&a,&b);--a; --b;g.add(a,b);g.add(b,a);}g.init();vvi a(3);{int v = 0;rep(i,3) {a[i].pb(g.g[sv]);rep(j,n[i]) {a[i].pb(g.g[v]);v++;}a[i].pb(g.g[tv]);uni(a[i]);}}ll ans = 0;vl dp(8);dp[0] = 1;{vi as;rep(i,3) as += a[i];uni(as); as.pob();vi is(3);for (int na : as) {int x = 0;rep(i,3) if (a[i][is[i]] == na) {is[i]++; x |= 1<<i;}drep(s,8) {if (s&x) {if ((s&x) != x) dp[s] = 0;} else {for (int t = x; t; t = (t-1)&x) dp[s|t] += dp[s];}}}ans = dp[7];}cout<<ans<<endl;}};int main() {// cin.tie(nullptr); ios::sync_with_stdio(false);int ts = 1;// scanf("%d",&ts);rep1(ti,ts) {Solver solver;solver.solve();}return 0;}