結果
問題 | No.184 たのしい排他的論理和(HARD) |
ユーザー | EmKjp |
提出日時 | 2015-04-17 07:52:29 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 184 ms / 5,000 ms |
コード長 | 3,422 bytes |
コンパイル時間 | 2,295 ms |
コンパイル使用メモリ | 106,064 KB |
実行使用メモリ | 44,636 KB |
最終ジャッジ日時 | 2023-09-17 16:31:53 |
合計ジャッジ時間 | 8,329 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 59 ms
22,748 KB |
testcase_01 | AC | 59 ms
22,672 KB |
testcase_02 | AC | 59 ms
22,752 KB |
testcase_03 | AC | 59 ms
20,876 KB |
testcase_04 | AC | 59 ms
20,848 KB |
testcase_05 | AC | 60 ms
22,720 KB |
testcase_06 | AC | 59 ms
20,692 KB |
testcase_07 | AC | 60 ms
20,776 KB |
testcase_08 | AC | 154 ms
41,828 KB |
testcase_09 | AC | 84 ms
22,096 KB |
testcase_10 | AC | 126 ms
28,928 KB |
testcase_11 | AC | 112 ms
29,628 KB |
testcase_12 | AC | 165 ms
39,012 KB |
testcase_13 | AC | 172 ms
41,648 KB |
testcase_14 | AC | 123 ms
28,668 KB |
testcase_15 | AC | 180 ms
42,432 KB |
testcase_16 | AC | 163 ms
40,940 KB |
testcase_17 | AC | 171 ms
39,500 KB |
testcase_18 | AC | 61 ms
20,696 KB |
testcase_19 | AC | 59 ms
20,708 KB |
testcase_20 | AC | 111 ms
27,636 KB |
testcase_21 | AC | 184 ms
42,664 KB |
testcase_22 | AC | 184 ms
42,704 KB |
testcase_23 | AC | 60 ms
22,660 KB |
testcase_24 | AC | 60 ms
20,680 KB |
testcase_25 | AC | 60 ms
20,792 KB |
testcase_26 | AC | 60 ms
20,700 KB |
testcase_27 | AC | 61 ms
20,772 KB |
testcase_28 | AC | 132 ms
31,520 KB |
testcase_29 | AC | 168 ms
41,256 KB |
testcase_30 | AC | 156 ms
38,196 KB |
testcase_31 | AC | 143 ms
38,188 KB |
testcase_32 | AC | 160 ms
38,860 KB |
testcase_33 | AC | 181 ms
42,444 KB |
testcase_34 | AC | 179 ms
40,256 KB |
testcase_35 | AC | 183 ms
44,636 KB |
testcase_36 | AC | 182 ms
40,560 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.IO; using System.Collections.Generic; using System.Globalization; using System.Linq; using System.Text; partial class Solver { public static void Swap<T>(ref T lhs, ref T rhs) { T temp; temp = lhs; lhs = rhs; rhs = temp; } static int binaryRank(long[] A) { int n = A.Length; int rank = 0; for (int i = 0; i < 64; i++) { int t = -1; for (int j = rank; j < n; j++) { if (((1L << i) & A[j]) != 0) { t = j; break; } } if (t == -1) continue; Swap(ref A[rank], ref A[t]); for (int j = 0; j < n; j++) if (rank != j) { if ((A[j] & (1L << i)) != 0) A[j] ^= A[rank]; } rank++; } return rank; } public void Run() { var scanner = new Scanner(cin); var n = scanner.NextInt(); var A = scanner.NextLongArray(n); cout.WriteLine(1L << binaryRank(A)); } } // PREWRITEN CODE BEGINS FROM HERE partial class Solver : Scanner { public static void Main(string[] args) { new Solver(Console.In, Console.Out).Run(); } TextReader cin; TextWriter cout; public Solver(TextReader reader, TextWriter writer) : base(reader) { this.cin = reader; this.cout = writer; } public Solver(string input, TextWriter writer) : this(new StringReader(input), writer) { } public int ni() { return NextInt(); } public long nl() { return NextLong(); } public string ns() { return Next(); } } public class Scanner { private TextReader Reader; private Queue<String> TokenQueue = new Queue<string>(); private CultureInfo ci = CultureInfo.InvariantCulture; public Scanner() : this(Console.In) { } public Scanner(TextReader reader) { this.Reader = reader; } public int NextInt() { return Int32.Parse(Next(), ci); } public long NextLong() { return Int64.Parse(Next(), ci); } public double NextDouble() { return double.Parse(Next(), ci); } public string[] NextArray(int size) { var array = new string[size]; for (int i = 0; i < size; i++) array[i] = Next(); return array; } public int[] NextIntArray(int size) { var array = new int[size]; for (int i = 0; i < size; i++) array[i] = NextInt(); return array; } public long[] NextLongArray(int size) { var array = new long[size]; for (int i = 0; i < size; i++) array[i] = NextLong(); return array; } public String Next() { if (TokenQueue.Count == 0) { if (!StockTokens()) throw new InvalidOperationException(); } return TokenQueue.Dequeue(); } public bool HasNext() { if (TokenQueue.Count > 0) return true; return StockTokens(); } private bool StockTokens() { while (true) { var line = Reader.ReadLine(); if (line == null) return false; var tokens = line.Trim().Split(" ".ToCharArray(), StringSplitOptions.RemoveEmptyEntries); if (tokens.Length == 0) continue; foreach (var token in tokens) TokenQueue.Enqueue(token); return true; } } }