結果
| 問題 | No.1560 majority x majority |
| ユーザー |
 fgwiebfaoish
|
| 提出日時 | 2021-06-30 19:11:30 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
AC
|
| 実行時間 | 51 ms / 2,000 ms |
| コード長 | 7,895 bytes |
| コンパイル時間 | 2,675 ms |
| コンパイル使用メモリ | 111,872 KB |
| 実行使用メモリ | 23,936 KB |
| 最終ジャッジ日時 | 2024-06-27 05:17:48 |
| 合計ジャッジ時間 | 4,080 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 5 |
| other | AC * 26 |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System;using System.Collections.Generic;using System.Collections;using System.Collections.Specialized;using System.Linq;using System.Text;using System.IO;using System.Reflection;using static System.Math;using System.Numerics;using System.Threading;using System.Runtime.CompilerServices;using System.Diagnostics;static class Program{const int mod=(int)1e9+7;static void Main(){Sc sc=new Sc();var (n,m)=sc.Tp2<int>();var g=new Bitset[m];for(int i = 0;i<m;i++) {g[i]=new Bitset(n);}for(int i = 0;i<n;i++) {var e=sc.Ia;for(int j = 0;j<m;j++) {g[j][i]=e[j];}}int o=1<<m;var dp=new int[o];var h=new int[o];var bs=new Bitset[o];bs[0]=new Bitset(n,true);h[0]=n;dp[0]=1;for(int i = 1,k=0;i<o;i++) {if((1<<(k+1))<=i){k++;}bs[i]=new Bitset(bs[i-(1<<k)])&g[k];h[i]=bs[i].cnt;for(int j = 0;j<m;j++) {int b=1<<j;if((b&i)!=0&&h[i-b]<=h[i]<<1){dp[i]+=dp[i-b];}}}Console.WriteLine(dp[o-1]);}}public class Bitset{public int n,l;public ulong[] he;public Bitset(int n){this.n=n;l=(n>>6)+1;he=new ulong[l];}public Bitset(int n,long a){this.n=n;l=(n>>6)+1;he=new ulong[l];he[0]=(ulong)a;}public Bitset(int n,bool b){this.n=n;l=(n>>6)+1;he=new ulong[l];int y=n%64;if(y==0){for(int i = 0;i<l;i++) {he[i]=ulong.MaxValue;}}else{for(int i = 0;i<l-1;i++) {he[i]=ulong.MaxValue;}he[l-1]=(1UL<<y)-1;}}public Bitset(Bitset b){n=b.n;l=b.l;he=new ulong[l];for(int i = 0;i<l;i++) {he[i]=b.he[i];}}public int this[int i]{[MethodImpl(MethodImplOptions.AggressiveInlining)]set{he[i>>6]=(he[i>>6]&(ulong.MaxValue^(1UL<<i)))|((ulong)value<<i);}get{return (int)((he[i>>6]>>i)&1);}}public static Bitset operator&(Bitset a,Bitset b){Bitset c=new Bitset(a.n);int d=Math.Min(a.l,b.l);for(int i=0;i<d;i++){c.he[i]=a.he[i]&b.he[i];}return c;}public static Bitset operator|(Bitset a,Bitset b){Bitset c;if(a.l<b.l){c=a;a=b;b=c;}c=new Bitset(a.n);int i=0;for(;i<b.l;i++){c.he[i]=a.he[i]|b.he[i];}for(;i<a.l;i++){c.he[i]=a.he[i];}return c;}public static Bitset operator^(Bitset a,Bitset b){Bitset c;if(a.l<b.l){c=a;a=b;b=c;}c=new Bitset(a.n);int i=0;for(;i<b.l;i++){c.he[i]=a.he[i]^b.he[i];}for(;i<a.l;i++){c.he[i]=a.he[i];}return c;}public static Bitset operator<<(Bitset a,int b){Bitset c=new Bitset(a.n);if(b>a.l<<6){return c;}int d=(b+63)>>6;if(b%64==0){for(int i=a.l-1;i>=d;i--){c.he[i]=a.he[i-d];}}else{for(int i=a.l-1;i>=d;i--){c.he[i]=(a.he[i-d+1]<<b)|(a.he[i-d]>>(64-b));}c.he[d-1]=a.he[0]<<b;}return c;}public static Bitset operator>>(Bitset a,int b){Bitset c=new Bitset(a.n);if(b>a.l<<6){return c;}int d=(b+63)>>6;if(b%64==0){for(int i=0;i+d<c.l;i++){c.he[i]=a.he[i+d];}}else{for(int i=0;i+d<c.l;i++){c.he[i]=(a.he[i+d-1]>>b)|(a.he[i+d]<<(64-b));}c.he[c.l-d]=a.he[c.l-1]>>b;}return c;}public static bool operator==(Bitset a,Bitset b){int mx=Max(a.l,b.l),mn=Min(a.l,b.l);for(int i=0;i<mn;i++){if(a.he[i]!=b.he[i]){return false;}}if(a.l>b.l){for(int i=mn;i<mx;i++){if(a.he[i]!=0){return false;}}}else{for(int i=mn;i<mx;i++){if(b.he[i]!=0){return false;}}}return true;}public static bool operator!=(Bitset a,Bitset b){int mx=Max(a.l,b.l),mn=Min(a.l,b.l);for(int i=0;i<mn;i++){if(a.he[i]!=b.he[i]){return true;}}if(a.l>b.l){for(int i=mn;i<mx;i++){if(a.he[i]!=0){return true;}}}else{for(int i=mn;i<mx;i++){if(b.he[i]!=0){return true;}}}return false;}public override bool Equals(object obj){return false;}public override int GetHashCode(){return 0;}public int cnt{get{int p=0;for(int i=0;i<l;i++){var bits=he[i];bits=(bits&0x5555555555555555)+(bits>>1&0x5555555555555555);bits=(bits&0x3333333333333333)+(bits>>2&0x3333333333333333);bits=(bits&0x0f0f0f0f0f0f0f0f)+(bits>>4&0x0f0f0f0f0f0f0f0f);bits=(bits&0x00ff00ff00ff00ff)+(bits>>8&0x00ff00ff00ff00ff);bits=(bits&0x0000ffff0000ffff)+(bits>>16&0x0000ffff0000ffff);p+=(int)((bits&0x00000000ffffffff)+(bits>>32&0x00000000ffffffff));}return p;}}public override string ToString(){string t="",s="";for(int i = 0;i<l-1;i++) {s=Convert.ToString((long)he[i],2);s=(64>s.Length?new string('0',64-s.Length):"")+s;t=s+t;}if(n%64!=0){s=Convert.ToString((long)he[l-1],2);s=((n%64)>s.Length?new string('0',(n%64)-s.Length):"")+s;return s+t;}return t;}public string Reverse{get{return string.Join("",ToString().Reverse());}}public void Ov0(int l,int r){if(l>>6==r>>6){he[r>>6]&=~((ulong.MaxValue<<(l-r-1))>>(63-r));}else{he[l>>6]&=~(ulong.MaxValue<<l);for(int i = (l>>6)+1;i<r>>6;i++) {he[i]=0;}he[r>>6]&=~(ulong.MaxValue>>(63-r));}}public void Ov1(int l,int r){if(l>>6==r>>6){he[r>>6]|=(ulong.MaxValue<<(l-r-1))>>(63-r);}else{he[l>>6]|=ulong.MaxValue<<l;for(int i = (l>>6)+1;i<r>>6;i++) {he[i]=ulong.MaxValue;}he[r>>6]|=ulong.MaxValue>>(63-r);}}public bool Fb(int l,int r){if(l>>6==r>>6){return (he[r>>6]&((ulong.MaxValue<<(l-r-1))>>(63-r)))!=0;}else{if((he[l>>6]&(ulong.MaxValue<<l))!=0){return true;}for(int i = (l>>6)+1;i<r>>6;i++) {if(he[i]!=0){return true;}}return (he[r>>6]&(ulong.MaxValue>>(63-r)))!=0;}}}public class Sc{public int I{get{return int.Parse(Console.ReadLine());}}public long L{get{return long.Parse(Console.ReadLine());}}public double D{get{return double.Parse(Console.ReadLine());}}public string S{get{return Console.ReadLine();}}public int[] Ia{get{return Array.ConvertAll(Console.ReadLine().Split(),int.Parse);}}public long[] La{get{return Array.ConvertAll(Console.ReadLine().Split(),long.Parse);}}public double[] Da{get{return Array.ConvertAll(Console.ReadLine().Split(),double.Parse);}}public string[] Sa{get{return Console.ReadLine().Split();}}public object[] Oa{get{return Console.ReadLine().Split();}}public int[] Ia2{get{return Array.ConvertAll(("0 "+Console.ReadLine()+" 0").Split(),int.Parse);}}public int[] Ia3(string a,string b){return Array.ConvertAll((a+Console.ReadLine()+b).Split(),int.Parse);}public int[] Ia3(int a){return Array.ConvertAll((Console.ReadLine()+" "+a.ToString()).Split(),int.Parse);}public long[] La2{get{return Array.ConvertAll(("0 "+Console.ReadLine()+" 0").Split(),long.Parse);}}public long[] La3(string a,string b){return Array.ConvertAll((a+Console.ReadLine()+b).Split(),long.Parse);}public long[] La3(int a){return Array.ConvertAll((Console.ReadLine()+" "+a.ToString()).Split(),long.Parse);}public double[] Da2{get{return Array.ConvertAll(("0 "+Console.ReadLine()+" 0").Split(),double.Parse);}}public double[] Da3(string a,string b){return Array.ConvertAll((a+Console.ReadLine()+b).Split(),double.Parse);}public T[] Arr<T>(int n,Func<T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f();}return a;}public T[] Arr<T>(int n,Func<int,T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f(i);}return a;}public T[] Arr<T>(int n,Func<string[],T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f(Console.ReadLine().Split());}return a;}public T[] Arr<T>(int n,Func<int,string[],T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f(i,Console.ReadLine().Split());}return a;}public (T,T) Tp2<T>(){var s=Console.ReadLine().Split();return (Ct<T>(s[0]),Ct<T>(s[1]));}public (T,T,T) Tp3<T>(){var s=Console.ReadLine().Split();return (Ct<T>(s[0]),Ct<T>(s[1]),Ct<T>(s[2]));}public (T,T,T,T) Tp4<T>(){var s=Console.ReadLine().Split();return (Ct<T>(s[0]),Ct<T>(s[1]),Ct<T>(s[2]),Ct<T>(s[3]));}public (T1,T2) Tp2<T1,T2>(){var s=Console.ReadLine().Split();return (Ct<T1>(s[0]),Ct<T2>(s[1]));}public (T1,T1,T2) Tp3<T1,T2>(){var s=Console.ReadLine().Split();return (Ct<T1>(s[0]),Ct<T1>(s[1]),Ct<T2>(s[2]));}private T Ct<T>(string s){return (T)Convert.ChangeType(s,typeof(T));}}