Submission #3040159
Source Code Expand
using System; using System.Text; using System.Collections.Generic; using System.Linq; class Solve{ public Solve(){} StringBuilder sb; ReadData re; public static int Main(){ new Solve().Run(); return 0; } void Run(){ sb = new StringBuilder(); re = new ReadData(); Calc(); Console.Write(sb.ToString()); } void Calc(){ int N = re.i(); int K = re.i(); bool[] OK = new bool[131072]; long count = 1; OK[0] = true; for(int i=0;i<N;i++){ int x = re.i(); if(OK[x]){ count = count * 2 % Define.mod; } else{ for(int j=0;j<131072;j++){ if(OK[j]){ OK[j^x] = true; } } } } if(OK[K]){ sb.Append(count+"\n"); } else{ sb.Append("0\n"); } } } class ReadData{ string[] str; int counter; public ReadData(){ counter = 0; } public string s(){ if(counter == 0){ str = Console.ReadLine().Split(' '); counter = str.Length; } counter--; return str[str.Length-counter-1]; } public int i(){ return int.Parse(s()); } public long l(){ return long.Parse(s()); } public double d(){ return double.Parse(s()); } public int[] ia(int N){ int[] ans = new int[N]; for(int j=0;j<N;j++){ ans[j] = i(); } return ans; } public int[] ia(){ str = Console.ReadLine().Split(' '); counter = 0; int[] ans = new int[str.Length]; for(int j=0;j<str.Length;j++){ ans[j] = int.Parse(str[j]); } return ans; } public long[] la(int N){ long[] ans = new long[N]; for(int j=0;j<N;j++){ ans[j] = l(); } return ans; } public long[] la(){ str = Console.ReadLine().Split(' '); counter = 0; long[] ans = new long[str.Length]; for(int j=0;j<str.Length;j++){ ans[j] = long.Parse(str[j]); } return ans; } public double[] da(int N){ double[] ans = new double[N]; for(int j=0;j<N;j++){ ans[j] = d(); } return ans; } public double[] da(){ str = Console.ReadLine().Split(' '); counter = 0; double[] ans = new double[str.Length]; for(int j=0;j<str.Length;j++){ ans[j] = double.Parse(str[j]); } return ans; } public List<int>[] g(int N,int[] f,int[] t){ List<int>[] ans = new List<int>[N]; for(int j=0;j<N;j++){ ans[j] = new List<int>(); } for(int j=0;j<f.Length;j++){ ans[f[j]].Add(t[j]); ans[t[j]].Add(f[j]); } return ans; } public List<int>[] g(int N,int M){ List<int>[] ans = new List<int>[N]; for(int j=0;j<N;j++){ ans[j] = new List<int>(); } for(int j=0;j<M;j++){ int f = i()-1; int t = i()-1; ans[f].Add(t); ans[t].Add(f); } return ans; } public List<int>[] g(){ int N = i(); int M = i(); List<int>[] ans = new List<int>[N]; for(int j=0;j<N;j++){ ans[j] = new List<int>(); } for(int j=0;j<M;j++){ int f = i()-1; int t = i()-1; ans[f].Add(t); ans[t].Add(f); } return ans; } } public static class Define{ public const long mod = 1000000007; } public static class Debug{ public static void Print(double[,,] k){ for(int i=0;i<k.GetLength(0);i++){ for(int j=0;j<k.GetLength(1);j++){ for(int l=0;l<k.GetLength(2);l++){ Console.Write(k[i,j,l]+" "); } Console.WriteLine(); } Console.WriteLine(); } } public static void Print(double[,] k){ for(int i=0;i<k.GetLength(0);i++){ for(int j=0;j<k.GetLength(1);j++){ Console.Write(k[i,j]+" "); } Console.WriteLine(); } } public static void Print(double[] k){ for(int i=0;i<k.Length;i++){ Console.WriteLine(k[i]); } } public static void Print(long[,,] k){ for(int i=0;i<k.GetLength(0);i++){ for(int j=0;j<k.GetLength(1);j++){ for(int l=0;l<k.GetLength(2);l++){ Console.Write(k[i,j,l]+" "); } Console.WriteLine(); } Console.WriteLine(); } } public static void Print(long[,] k){ for(int i=0;i<k.GetLength(0);i++){ for(int j=0;j<k.GetLength(1);j++){ Console.Write(k[i,j]+" "); } Console.WriteLine(); } } public static void Print(long[] k){ for(int i=0;i<k.Length;i++){ Console.WriteLine(k[i]); } } public static void Print(int[,,] k){ for(int i=0;i<k.GetLength(0);i++){ for(int j=0;j<k.GetLength(1);j++){ for(int l=0;l<k.GetLength(2);l++){ Console.Write(k[i,j,l]+" "); } Console.WriteLine(); } Console.WriteLine(); } } public static void Print(int[,] k){ for(int i=0;i<k.GetLength(0);i++){ for(int j=0;j<k.GetLength(1);j++){ Console.Write(k[i,j]+" "); } Console.WriteLine(); } } public static void Print(int[] k){ for(int i=0;i<k.Length;i++){ Console.WriteLine(k[i]); } } }
Submission Info
Submission Time | |
---|---|
Task | F - Limited Xor Subset |
User | leign |
Language | C# (Mono 4.6.2.0) |
Score | 500 |
Code Size | 6200 Byte |
Status | AC |
Exec Time | 57 ms |
Memory | 17220 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 500 / 500 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_2.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_28.txt, subtask_1_29.txt, subtask_1_3.txt, subtask_1_30.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 21 ms | 9032 KB |
sample_02.txt | AC | 21 ms | 11080 KB |
sample_03.txt | AC | 21 ms | 11080 KB |
subtask_1_1.txt | AC | 21 ms | 11080 KB |
subtask_1_10.txt | AC | 22 ms | 11080 KB |
subtask_1_11.txt | AC | 21 ms | 9032 KB |
subtask_1_12.txt | AC | 22 ms | 11080 KB |
subtask_1_13.txt | AC | 22 ms | 9032 KB |
subtask_1_14.txt | AC | 22 ms | 11080 KB |
subtask_1_15.txt | AC | 22 ms | 9032 KB |
subtask_1_16.txt | AC | 21 ms | 11080 KB |
subtask_1_17.txt | AC | 20 ms | 9032 KB |
subtask_1_18.txt | AC | 46 ms | 13120 KB |
subtask_1_19.txt | AC | 33 ms | 13124 KB |
subtask_1_2.txt | AC | 21 ms | 9032 KB |
subtask_1_20.txt | AC | 22 ms | 11080 KB |
subtask_1_21.txt | AC | 22 ms | 11080 KB |
subtask_1_22.txt | AC | 20 ms | 11080 KB |
subtask_1_23.txt | AC | 20 ms | 9032 KB |
subtask_1_24.txt | AC | 20 ms | 9032 KB |
subtask_1_25.txt | AC | 57 ms | 13116 KB |
subtask_1_26.txt | AC | 20 ms | 9032 KB |
subtask_1_27.txt | AC | 20 ms | 9032 KB |
subtask_1_28.txt | AC | 21 ms | 11080 KB |
subtask_1_29.txt | AC | 20 ms | 9032 KB |
subtask_1_3.txt | AC | 22 ms | 11080 KB |
subtask_1_30.txt | AC | 21 ms | 11080 KB |
subtask_1_4.txt | AC | 21 ms | 11080 KB |
subtask_1_5.txt | AC | 21 ms | 9032 KB |
subtask_1_6.txt | AC | 36 ms | 17220 KB |
subtask_1_7.txt | AC | 26 ms | 11080 KB |
subtask_1_8.txt | AC | 22 ms | 9160 KB |
subtask_1_9.txt | AC | 22 ms | 11080 KB |