結果
| 問題 | No.142 単なる配列の操作に関する実装問題 |
| ユーザー |
 紙ぺーぱー
|
| 提出日時 | 2015-05-12 18:10:45 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 6,737 bytes |
| コンパイル時間 | 3,517 ms |
| コンパイル使用メモリ | 115,072 KB |
| 実行使用メモリ | 72,468 KB |
| 最終ジャッジ日時 | 2024-07-06 00:41:38 |
| 合計ジャッジ時間 | 17,051 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge1 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | WA | - |
| testcase_01 | WA | - |
| testcase_02 | WA | - |
| testcase_03 | WA | - |
| testcase_04 | WA | - |
コンパイルメッセージ
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 a = new ulong[n / 64 + 1];
{
var b = new long[n];
var s = sc.Long();
var p = sc.Long();
var q = sc.Long();
var r = sc.Long();
b[0] = s;
for (int i = 1; i < n; i++)
b[i] = (p * b[i - 1] + q) % r;
for (int i = 0; i < n; i++)
if ((b[i] & 1L) == 1) a[i / 64] |= 1ul << (i % 64);
}
{
var q = sc.Integer();
var mask = ulong.MaxValue;
for (int i = 0; i < q; i++)
{
var s = sc.Integer() - 1; var t = sc.Integer() - 1;
var u = sc.Integer() - 1; var v = sc.Integer() - 1;
var ffx = s / 64; var ffy = s % 64;
var ftx = t / 64; var fty = t % 64;
var tfx = u / 64; var tfy = u % 64;
var ttx = v / 64; var tty = v % 64;
var vec = new ulong[ftx - ffx + 1];
var ptr = 0;
if (ffx < ftx)
{
vec[ptr++] = a[ffx++] & (mask ^ ((1ul << ffy) - 1));
while (ffx < ftx)
vec[ptr++] = a[ffx++];
ffy = 0;
}
vec[ptr] = a[ftx] & ((((mask >> ffy) << ffy) << (63 - fty)) >> (63 - fty));
ptr = 0;
if (ffy < tfy)
{
var dy = tfy - ffy;
a[tfx] ^= vec[ptr++] << dy;
for (int x = tfx + 1; x < ttx; x++, ptr++)
{
var vector = vec[ptr] << dy;
vector |= vec[ptr - 1] >> (64 - dy);
a[x] ^= vector;
}
}
else
{
var dy = ffy - tfy;
a[tfx] ^= vec[ptr++] >> dy;
for (int x = tfx + 1; x < ttx; x++)
{
var vector = vec[ptr] >> dy;
vector |= vec[ptr++] << (64 - dy);
a[x] ^= vector;
}
}
}
var ans = new char[n];
for (int i = 0; i < a.Length; i++)
for (int j = 0; j < 64 && i * 64 + j < n; j++)
if ((a[i] >> j & 1) == 1) ans[i * 64 + j] = 'O';
else ans[i * 64 + j] = 'E';
IO.Printer.Out.WriteLine(ans.AsString());
}
}
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 Ex
namespace 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