結果
問題 | No.183 たのしい排他的論理和(EASY) |
ユーザー | mnzn |
提出日時 | 2019-12-30 11:04:47 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 821 ms / 5,000 ms |
コード長 | 4,390 bytes |
コンパイル時間 | 2,320 ms |
コンパイル使用メモリ | 109,056 KB |
実行使用メモリ | 38,172 KB |
最終ジャッジ日時 | 2024-07-02 21:30:03 |
合計ジャッジ時間 | 8,940 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 28 ms
18,932 KB |
testcase_01 | AC | 28 ms
18,716 KB |
testcase_02 | AC | 29 ms
18,976 KB |
testcase_03 | AC | 28 ms
18,736 KB |
testcase_04 | AC | 28 ms
18,916 KB |
testcase_05 | AC | 30 ms
18,984 KB |
testcase_06 | AC | 29 ms
18,976 KB |
testcase_07 | AC | 821 ms
37,940 KB |
testcase_08 | AC | 672 ms
37,948 KB |
testcase_09 | AC | 459 ms
37,996 KB |
testcase_10 | AC | 547 ms
37,700 KB |
testcase_11 | AC | 709 ms
38,068 KB |
testcase_12 | AC | 29 ms
18,988 KB |
testcase_13 | AC | 28 ms
18,816 KB |
testcase_14 | AC | 601 ms
38,120 KB |
testcase_15 | AC | 734 ms
37,824 KB |
testcase_16 | AC | 29 ms
18,724 KB |
testcase_17 | AC | 188 ms
37,532 KB |
testcase_18 | AC | 718 ms
38,172 KB |
testcase_19 | AC | 108 ms
37,376 KB |
コンパイルメッセージ
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.Linq; using System.Text; class Program { static void Main(string[] args) { var N = sc.ReadInt(); var A = sc.ReadIntArray(N); var dp = new bool[(int)Math.Pow(2, 15)]; dp[0] = true; for (int i = 0; i < N; i++) { var nextDP = new bool[dp.Length]; for (int j = 0; j < dp.Length; j++) { if (dp[j]) { nextDP[j] = true; nextDP[j ^ A[i]] = true; } } dp = nextDP; } var ans = dp.Count(f => f); Console.WriteLine(ans); } static Scanner sc = new Scanner(); } class Scanner { string[] S = new string[0]; int Index = 0; char[] Separators = new char[] { ' ' }; public string Next() { if (this.Index < this.S.Length) return this.S[this.Index++]; var line = ""; while (line == "") line = Console.ReadLine(); this.S = line.Split(this.Separators, StringSplitOptions.RemoveEmptyEntries); if (this.S.Length == 0) return this.Next(); this.Index = 0; return this.S[this.Index++]; } public string ReadStr() { return this.Next(); } public char ReadChar() { return this.Next()[0]; } public int ReadInt() { return int.Parse(this.Next()); } public uint ReadUInt() { return uint.Parse(this.Next()); } public long ReadLong() { return long.Parse(this.Next()); } public double ReadDouble() { return double.Parse(this.Next()); } public Tuple<int, int> ReadTup(int add = 0) { return Tuple.Create(this.ReadInt() + add, this.ReadInt() + add); } public Tuple<long, long> ReadTupLong(int add = 0) { return Tuple.Create(this.ReadLong() + add, this.ReadLong() + add); } public Tuple<int, int, int> ReadTup3(int add = 0) { return Tuple.Create(this.ReadInt() + add, this.ReadInt() + add, this.ReadInt() + add); } public Tuple<int, int, int, int> ReadTup4(int add = 0) { return Tuple.Create(this.ReadInt() + add, this.ReadInt() + add, this.ReadInt() + add, this.ReadInt() + add); } public int[] ReadIntArray(int n) { var array = new int[n]; for (int i = 0; i < array.Length; i++) { array[i] = this.ReadInt(); } return array; } public long[] ReadLongArray(int n) { var array = new long[n]; for (int i = 0; i < array.Length; i++) { array[i] = this.ReadLong(); } return array; } public double[] ReadDoubleArray(int n) { var array = new double[n]; for (int i = 0; i < array.Length; i++) { array[i] = this.ReadDouble(); } return array; } public char[] ReadCharArray(int n) { var array = new char[n]; for (int i = 0; i < array.Length; i++) { array[i] = this.ReadChar(); } return array; } public string[] ReadStrArray(int n) { var array = new string[n]; for (int i = 0; i < array.Length; i++) { array[i] = this.ReadStr(); } return array; } public Tuple<long, long>[] ReadTupLongArray(int n, int add = 0) { var array = new Tuple<long, long>[n]; for (int i = 0; i < n; i++) { array[i] = this.ReadTupLong(add); } return array; } public Tuple<int, int>[] ReadTupArray(int n, int add = 0) { var array = new Tuple<int, int>[n]; for (int i = 0; i < n; i++) { array[i] = this.ReadTup(add); } return array; } public Tuple<int, int, int>[] ReadTup3Array(int n, int add = 0) { var array = new Tuple<int, int, int>[n]; for (int i = 0; i < n; i++) { array[i] = this.ReadTup3(add); } return array; } public Tuple<int, int, int, int>[] ReadTup4Array(int n, int add = 0) { var array = new Tuple<int, int, int, int>[n]; for (int i = 0; i < n; i++) { array[i] = this.ReadTup4(add); } return array; } }