結果
問題 | No.74 貯金箱の退屈 |
ユーザー |
![]() |
提出日時 | 2015-05-22 20:15:41 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 22 ms / 5,000 ms |
コード長 | 6,195 bytes |
コンパイル時間 | 893 ms |
コンパイル使用メモリ | 121,032 KB |
実行使用メモリ | 17,152 KB |
最終ジャッジ日時 | 2024-07-06 04:46:06 |
合計ジャッジ時間 | 2,579 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
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.
ソースコード
using System;using System.Linq;using System.Collections.Generic;using Debug = System.Diagnostics.Debug;using StringBuilder = System.Text.StringBuilder;using System.Numerics;namespace Program{public class Solver{public void Solve(){var n = sc.Integer();var d = sc.Integer(n);var w = sc.Integer(n);var set = new DisjointSet(n);for (int i = 0; i < n; i++){set.positive[i] += w[i];var pos = (i + d[i]) % n;var neg = (i - d[i] + n * 1000000) % n;if (pos == neg) set.ok[pos] = true;}for (int i = 0; i < n; i++){var pos = (i + d[i]) % n;var neg = (i - d[i] + n * 1000000) % n;set.Unite(pos, neg);}for (int i = 0; i < n; i++){if (set[i] != i) continue;var cnt = set.Size(i);var pos = set.Count(i);if ((cnt - pos) % 2 == 0 || set.Ok(i))continue;IO.Printer.Out.WriteLine("No");return;}IO.Printer.Out.WriteLine("Yes");}public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());static T[] Enumerate<T>(int n, Func<int, T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; }static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }}}#region Exnamespace Program.IO{using System.IO;using System.Text;using System.Globalization;public class Printer : StreamWriter{static Printer() { Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false }; }public static Printer Out { get; set; }public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }public Printer(System.IO.Stream stream) : base(stream, new UTF8Encoding(false, true)) { }public Printer(System.IO.Stream stream, Encoding encoding) : base(stream, encoding) { }public void Write<T>(string format, IEnumerable<T> source) { base.Write(format, source.OfType<object>().ToArray()); }public void WriteLine<T>(string format, IEnumerable<T> source) { base.WriteLine(format, source.OfType<object>().ToArray()); }}public class StreamScanner{public StreamScanner(Stream stream) { str = stream; }public readonly Stream str;private readonly byte[] buf = new byte[1024];private int len, ptr;public bool isEof = false;public bool IsEndOfStream { get { return isEof; } }private byte read(){if (isEof) return 0;if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } }return buf[ptr++];}public char Char() { byte b = 0; do b = read(); while ((b < 33 || 126 < b) && !isEof); return (char)b; }public string Scan(){var sb = new StringBuilder();for (var b = Char(); b >= 33 && b <= 126; b = (char)read())sb.Append(b);return sb.ToString();}public long Long(){if (isEof) return long.MinValue;long ret = 0; byte b = 0; var ng = false;do b = read();while (b != '-' && (b < '0' || '9' < b));if (b == '-') { ng = true; b = read(); }for (; true; b = read()){if (b < '0' || '9' < b)return ng ? -ret : ret;else ret = ret * 10 + b - '0';}}public int Integer() { return (isEof) ? int.MinValue : (int)Long(); }public double Double() { return double.Parse(Scan(), CultureInfo.InvariantCulture); }private T[] enumerate<T>(int n, Func<T> f){var a = new T[n];for (int i = 0; i < n; ++i) a[i] = f();return a;}public char[] Char(int n) { return enumerate(n, Char); }public string[] Scan(int n) { return enumerate(n, Scan); }public double[] Double(int n) { return enumerate(n, Double); }public int[] Integer(int n) { return enumerate(n, Integer); }public long[] Long(int n) { return enumerate(n, Long); }}}static class Ex{static public string AsString(this IEnumerable<char> ie) { return new string(System.Linq.Enumerable.ToArray(ie)); }static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") { return string.Join(st, ie); }static public void Main(){var solver = new Program.Solver();solver.Solve();Program.IO.Printer.Out.Flush();}}#endregion#region DisjointSetpublic class DisjointSet{public int[] par, ranks, count, positive;public bool[] ok;public DisjointSet(int n){par = new int[n];count = new int[n];ok = new bool[n];positive = new int[n];for (int i = 0; i < n; i++){par[i] = i;count[i] = 1;}ranks = new int[n];}public int this[int id] { get { return (par[id] == id) ? id : this[par[id]]; } }public bool Unite(int x, int y){x = this[x]; y = this[y];if (x == y) return false;if (ranks[x] < ranks[y]){par[x] = y;ok[y] |= ok[x];count[y] += count[x];positive[y] += positive[x];}else{par[y] = x;positive[x] += positive[y];count[x] += count[y];ok[x] |= ok[y];if (ranks[x] == ranks[y])ranks[x]++;}return true;}public int Size(int x) { return count[this[x]]; }public int Count(int x) { return positive[this[x]]; }public bool Ok(int x) { return ok[this[x]]; }public bool IsUnited(int x, int y) { return this[x] == this[y]; }}#endregion