結果

問題 No.74 貯金箱の退屈
ユーザー eitahoeitaho
提出日時 2015-04-17 21:19:26
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 27 ms / 5,000 ms
コード長 3,642 bytes
コンパイル時間 2,443 ms
コンパイル使用メモリ 110,592 KB
実行使用メモリ 19,328 KB
最終ジャッジ日時 2024-07-04 15:43:58
合計ジャッジ時間 4,241 ms
ジャッジサーバーID
(参考情報)
judge3 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 30
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff #
プレゼンテーションモードにする

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 = Reader.IntArray(N);
var W = Reader.IntArray(N);
var M = new BinaryMatrix(N, N + 1);
for (int i = 0; i < N; i++)
{
int L = ((i - A[i]) % N + N) % N;
int R = (i + A[i]) % N;
M[L, i] = 1;
M[R, i] = 1;
M[i, N] = 1 - W[i];
}
int rank = M.GaussJordan();
bool ok = Enu.Range(rank, N - rank).All(i => M[i, N] == 0);
string ans = ok ? "Yes" : "No";
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 rank = 0;
for (int c = 0; c < Math.Min(H, 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 = 0; i < H; i++)
if (i != rank && (M[i][c >> 6] >> (c & 63) & 1) == 1)
for (int j = 0; j < M[i].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;
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0