結果
問題 | No.184 たのしい排他的論理和(HARD) |
ユーザー | eitaho |
提出日時 | 2015-04-17 16:26:59 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 290 ms / 5,000 ms |
コード長 | 3,501 bytes |
コンパイル時間 | 2,493 ms |
コンパイル使用メモリ | 108,040 KB |
実行使用メモリ | 47,820 KB |
最終ジャッジ日時 | 2023-09-17 16:42:14 |
合計ジャッジ時間 | 10,433 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 68 ms
21,832 KB |
testcase_01 | AC | 67 ms
21,924 KB |
testcase_02 | AC | 69 ms
19,952 KB |
testcase_03 | AC | 68 ms
21,868 KB |
testcase_04 | AC | 69 ms
21,828 KB |
testcase_05 | AC | 68 ms
21,884 KB |
testcase_06 | AC | 67 ms
21,812 KB |
testcase_07 | AC | 69 ms
23,940 KB |
testcase_08 | AC | 230 ms
43,916 KB |
testcase_09 | AC | 106 ms
26,704 KB |
testcase_10 | AC | 185 ms
38,204 KB |
testcase_11 | AC | 154 ms
30,536 KB |
testcase_12 | AC | 255 ms
44,884 KB |
testcase_13 | AC | 268 ms
45,276 KB |
testcase_14 | AC | 180 ms
38,008 KB |
testcase_15 | AC | 284 ms
47,692 KB |
testcase_16 | AC | 253 ms
44,440 KB |
testcase_17 | AC | 261 ms
45,432 KB |
testcase_18 | AC | 68 ms
21,980 KB |
testcase_19 | AC | 67 ms
21,940 KB |
testcase_20 | AC | 108 ms
29,224 KB |
testcase_21 | AC | 289 ms
46,724 KB |
testcase_22 | AC | 289 ms
46,576 KB |
testcase_23 | AC | 67 ms
21,916 KB |
testcase_24 | AC | 68 ms
21,940 KB |
testcase_25 | AC | 68 ms
21,788 KB |
testcase_26 | AC | 67 ms
21,836 KB |
testcase_27 | AC | 68 ms
24,012 KB |
testcase_28 | AC | 197 ms
38,860 KB |
testcase_29 | AC | 257 ms
47,328 KB |
testcase_30 | AC | 236 ms
44,748 KB |
testcase_31 | AC | 211 ms
41,540 KB |
testcase_32 | AC | 248 ms
43,784 KB |
testcase_33 | AC | 283 ms
45,904 KB |
testcase_34 | AC | 282 ms
47,820 KB |
testcase_35 | AC | 290 ms
44,468 KB |
testcase_36 | AC | 288 ms
44,504 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.Linq; using System.Text; using System.Collections.Generic; using System.Diagnostics; using System.Numerics; using Enu = System.Linq.Enumerable; using System.Collections; class Program { public void Solve() { int N = Reader.Int(); var A = Enu.Range(0, N).Select(i => Reader.Long()).Distinct().ToArray(); N = A.Length; var M = new BinaryMatrix(N, 61); for (int i = 0; i < N; i++) for (int j = 0; j < 61; j++) M[i, j] = A[i] >> j & 1; int rank = M.GaussJordan(); long ans = 1L << rank; Console.WriteLine(ans); } class BinaryMatrix { private readonly long[][] M; public readonly int H, W; public BinaryMatrix(int h, int w) { H = h; W = w; M = new long[H][]; for (int i = 0; i < H; i++) M[i] = new long[(W + 63) / 64]; } public long this[int i, int j] { get { return M[i][j >> 6] >> (j & 63) & 1; } set { M[i][j >> 6] |= -1L & (value << (j & 63)); } } public int GaussJordan() { int H = M.Length; int rank = 0; for (int c = 0; c < W; c++) { int i = Array.FindIndex(M, rank, r => (r[c >> 6] >> (c & 63) & 1) == 1); if (i < 0) continue; var t = M[rank]; M[rank] = M[i]; M[i] = t; for (i = rank + 1; i < H; i++) if ((M[i][c >> 6] >> (c & 63) & 1) == 1) for (int j = 0; j < M[j].Length; j++) M[i][j] ^= M[rank][j]; rank++; } return rank; } } } class Entry { static void Main() { new Program().Solve(); } } class Reader { private static TextReader reader = Console.In; private static readonly char[] separator = { ' ' }; private static readonly StringSplitOptions op = StringSplitOptions.RemoveEmptyEntries; private static string[] A = new string[0]; private static int i; private static void Init() { A = new string[0]; } public static void Set(TextReader r) { reader = r; Init(); } public static void Set(string file) { reader = new StreamReader(file); Init(); } public static bool HasNext() { return CheckNext(); } public static string String() { return Next(); } public static int Int() { return int.Parse(Next()); } public static long Long() { return long.Parse(Next()); } public static double Double() { return double.Parse(Next()); } public static int[] IntLine() { return Array.ConvertAll(Split(Line()), int.Parse); } public static int[] IntArray(int N) { return Enu.Range(0, N).Select(i => Int()).ToArray(); } public static int[][] IntTable(int H) { return Enu.Range(0, H).Select(i => IntLine()).ToArray(); } public static string[] StringArray(int N) { return Enu.Range(0, N).Select(i => Line()).ToArray(); } public static string Line() { return reader.ReadLine().Trim(); } private static string[] Split(string s) { return s.Split(separator, op); } private static string Next() { CheckNext(); return A[i++]; } private static bool CheckNext() { if (i < A.Length) return true; string line = reader.ReadLine(); if (line == null) return false; if (line == "") return CheckNext(); A = Split(line); i = 0; return true; } }