結果
| 問題 | No.2338 Range AtCoder Query |
| ユーザー |
 yupiteru_kun
|
| 提出日時 | 2023-06-02 22:09:24 |
| 言語 | C# (.NET 8.0.203) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 18,667 bytes |
| コンパイル時間 | 14,431 ms |
| コンパイル使用メモリ | 167,688 KB |
| 実行使用メモリ | 87,588 KB |
| 最終ジャッジ日時 | 2024-06-08 23:22:04 |
| 合計ジャッジ時間 | 40,539 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge5 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 57 ms
28,376 KB |
| testcase_01 | AC | 59 ms
30,848 KB |
| testcase_02 | AC | 61 ms
25,216 KB |
| testcase_03 | AC | 59 ms
25,088 KB |
| testcase_04 | AC | 58 ms
25,344 KB |
| testcase_05 | AC | 57 ms
25,088 KB |
| testcase_06 | AC | 67 ms
26,880 KB |
| testcase_07 | AC | 66 ms
27,136 KB |
| testcase_08 | AC | 67 ms
25,708 KB |
| testcase_09 | AC | 67 ms
26,880 KB |
| testcase_10 | AC | 68 ms
26,880 KB |
| testcase_11 | TLE | - |
| testcase_12 | TLE | - |
| testcase_13 | TLE | - |
| testcase_14 | TLE | - |
| testcase_15 | TLE | - |
| testcase_16 | TLE | - |
| testcase_17 | -- | - |
| testcase_18 | -- | - |
| testcase_19 | -- | - |
| testcase_20 | -- | - |
| testcase_21 | -- | - |
| testcase_22 | -- | - |
| testcase_23 | -- | - |
| testcase_24 | -- | - |
| testcase_25 | -- | - |
| testcase_26 | -- | - |
| testcase_27 | -- | - |
| testcase_28 | -- | - |
| testcase_29 | -- | - |
| testcase_30 | -- | - |
| testcase_31 | -- | - |
| testcase_32 | -- | - |
| testcase_33 | -- | - |
| testcase_34 | -- | - |
コンパイルメッセージ
復元対象のプロジェクトを決定しています... /home/judge/data/code/main.csproj を復元しました (100 ms)。 MSBuild のバージョン 17.9.6+a4ecab324 (.NET) main -> /home/judge/data/code/bin/Release/net8.0/main.dll main -> /home/judge/data/code/bin/Release/net8.0/publish/
ソースコード
using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using static System.Math;
using System.Text;
using System.Threading;
using System.Globalization;
using System.Runtime.CompilerServices;
using System.Runtime.InteropServices;
using Library;
namespace Program
{
public static class ProblemB
{
static bool SAIKI = false;
static public int numberOfRandomCases = 0;
static public void MakeTestCase(List<string> _input, List<string> _output, ref Func<string[], bool> _outputChecker)
{
}
static public void Solve()
{
var N = NN;
var M = NN;
var Q = NN;
var PS = Repeat(0, N).Select(_ => new { P = NN - 1, S = NS }).ToArray();
var LR = Repeat(0, Q).Select(_ => new { L = NN, R = NN }).ToArray();
var penaTmpCount = new int[M];
var penaCountList = Repeat(0, M).Select(_ => new LIB_Deque<int>()).ToArray();
var acCount = 0;
var penaCount = 0;
var mo = new LIB_MoAlgorithm();
mo.SetRightAddMethod(idx =>
{
if (PS[idx].S == "AC")
{
penaCountList[PS[idx].P].PushBack(penaTmpCount[PS[idx].P]);
if (penaCountList[PS[idx].P].Count == 1)
{
penaCount += penaCountList[PS[idx].P].Front;
++acCount;
}
penaTmpCount[PS[idx].P] = 0;
}
else
{
++penaTmpCount[PS[idx].P];
}
}).SetRightDeleteMethod(idx =>
{
if (PS[idx].S == "AC")
{
if (penaCountList[PS[idx].P].Count == 1)
{
penaCount -= penaCountList[PS[idx].P].Front;
--acCount;
}
penaTmpCount[PS[idx].P] = penaCountList[PS[idx].P].PopBack();
}
else
{
--penaTmpCount[PS[idx].P];
}
}).SetLeftAddMethod(idx =>
{
if (PS[idx].S == "AC")
{
if (penaCountList[PS[idx].P].Count >= 1) penaCount -= penaCountList[PS[idx].P].Front;
else
{
++acCount;
}
penaCountList[PS[idx].P].PushFront(0);
}
else
{
if (penaCountList[PS[idx].P].Count >= 1)
{
penaCountList[PS[idx].P].PushFront(penaCountList[PS[idx].P].PopFront() + 1);
++penaCount;
}
else
{
++penaTmpCount[PS[idx].P];
}
}
}).SetLeftDeleteMethod(idx =>
{
if (PS[idx].S == "AC")
{
penaCountList[PS[idx].P].PopFront();
if (penaCountList[PS[idx].P].Count >= 1) penaCount += penaCountList[PS[idx].P].Front;
else
{
--acCount;
}
}
else
{
if (penaCountList[PS[idx].P].Count >= 1)
{
penaCountList[PS[idx].P].PushFront(penaCountList[PS[idx].P].PopFront() - 1);
--penaCount;
}
else
{
--penaTmpCount[PS[idx].P];
}
}
});
var answer = new string[Q];
mo.SetChecker(idx =>
{
answer[idx] = $"{acCount} {penaCount}";
});
foreach (var item in LR)
{
mo.AddQuery(item.L - 1, item.R);
}
mo.Build();
foreach (var item in answer)
{
Console.WriteLine(item);
}
}
class Printer : StreamWriter
{
public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
public Printer(Stream stream) : base(stream, new UTF8Encoding(false, true)) { base.AutoFlush = false; }
public Printer(Stream stream, Encoding encoding) : base(stream, encoding) { base.AutoFlush = false; }
}
static LIB_FastIO fastio = new LIB_FastIODebug();
static string[] args;
static public void Main(string[] args_t) { args = args_t; if (args_t.Length == 0) { fastio = new LIB_FastIO(); Console.SetOut(new Printer(Console.OpenStandardOutput())); } if (SAIKI) { var t = new Thread(Solve, 134217728); t.Start(); t.Join(); } else Solve(); Console.Out.Flush(); }
static long NN => fastio.Long();
static double ND => fastio.Double();
static string NS => fastio.Scan();
static long[] NNList(long N) => Repeat(0, N).Select(_ => NN).ToArray();
static double[] NDList(long N) => Repeat(0, N).Select(_ => ND).ToArray();
static string[] NSList(long N) => Repeat(0, N).Select(_ => NS).ToArray();
static long Count<T>(this IEnumerable<T> x, Func<T, bool> pred) => Enumerable.Count(x, pred);
static IEnumerable<T> Repeat<T>(T v, long n) => Enumerable.Repeat<T>(v, (int)n);
static IEnumerable<int> Range(long s, long c) => Enumerable.Range((int)s, (int)c);
static IOrderedEnumerable<T> OrderByRand<T>(this IEnumerable<T> x) => Enumerable.OrderBy(x, _ => xorshift);
static IOrderedEnumerable<T> OrderBy<T>(this IEnumerable<T> x) => Enumerable.OrderBy(x.OrderByRand(), e => e);
static IOrderedEnumerable<T1> OrderBy<T1, T2>(this IEnumerable<T1> x, Func<T1, T2> selector) => Enumerable.OrderBy(x.OrderByRand(), selector);
static IOrderedEnumerable<T> OrderByDescending<T>(this IEnumerable<T> x) => Enumerable.OrderByDescending(x.OrderByRand(), e => e);
static IOrderedEnumerable<T1> OrderByDescending<T1, T2>(this IEnumerable<T1> x, Func<T1, T2> selector) => Enumerable.OrderByDescending(x.OrderByRand(), selector);
static IOrderedEnumerable<string> OrderBy(this IEnumerable<string> x) => x.OrderByRand().OrderBy(e => e, StringComparer.OrdinalIgnoreCase);
static IOrderedEnumerable<T> OrderBy<T>(this IEnumerable<T> x, Func<T, string> selector) => x.OrderByRand().OrderBy(selector, StringComparer.OrdinalIgnoreCase);
static IOrderedEnumerable<string> OrderByDescending(this IEnumerable<string> x) => x.OrderByRand().OrderByDescending(e => e, StringComparer.OrdinalIgnoreCase);
static IOrderedEnumerable<T> OrderByDescending<T>(this IEnumerable<T> x, Func<T, string> selector) => x.OrderByRand().OrderByDescending(selector, StringComparer.OrdinalIgnoreCase);
static string Join<T>(this IEnumerable<T> x, string separator = "") => string.Join(separator, x);
static uint xorshift { get { _xsi.MoveNext(); return _xsi.Current; } }
static IEnumerator<uint> _xsi = _xsc();
static IEnumerator<uint> _xsc() { uint x = 123456789, y = 362436069, z = 521288629, w = (uint)(DateTime.Now.Ticks & 0xffffffff); while (true) { var t = x ^ (x << 11); x = y; y = z; z = w; w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)); yield return w; } }
static bool Chmax<T>(this ref T lhs, T rhs) where T : struct, IComparable<T> { if (lhs.CompareTo(rhs) < 0) { lhs = rhs; return true; } return false; }
static bool Chmin<T>(this ref T lhs, T rhs) where T : struct, IComparable<T> { if (lhs.CompareTo(rhs) > 0) { lhs = rhs; return true; } return false; }
static void Fill<T>(this T[] array, T value) => array.AsSpan().Fill(value);
static void Fill<T>(this T[,] array, T value) => MemoryMarshal.CreateSpan(ref array[0, 0], array.Length).Fill(value);
static void Fill<T>(this T[,,] array, T value) => MemoryMarshal.CreateSpan(ref array[0, 0, 0], array.Length).Fill(value);
static void Fill<T>(this T[,,,] array, T value) => MemoryMarshal.CreateSpan(ref array[0, 0, 0, 0], array.Length).Fill(value);
}
}
namespace Library {
class LIB_FastIO
{
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public LIB_FastIO() { str = Console.OpenStandardInput(); }
readonly Stream str;
readonly byte[] buf = new byte[2048];
int len, ptr;
[MethodImpl(MethodImplOptions.AggressiveInlining)]
byte read()
{
if (ptr >= len)
{
ptr = 0;
if ((len = str.Read(buf, 0, 2048)) <= 0)
{
return 0;
}
}
return buf[ptr++];
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
char Char()
{
byte b = 0;
do b = read();
while (b < 33 || 126 < b);
return (char)b;
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
virtual public string Scan()
{
var sb = new StringBuilder();
for (var b = Char(); b >= 33 && b <= 126; b = (char)read())
sb.Append(b);
return sb.ToString();
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
virtual public long Long()
{
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 << 3) + (ret << 1) + b - '0';
}
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
virtual public double Double() { return double.Parse(Scan(), CultureInfo.InvariantCulture); }
}
class LIB_FastIODebug : LIB_FastIO
{
Queue<string> param = new Queue<string>();
[MethodImpl(MethodImplOptions.AggressiveInlining)]
string NextString() { if (param.Count == 0) foreach (var item in Console.ReadLine().Split(' ')) param.Enqueue(item); return param.Dequeue(); }
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public LIB_FastIODebug() { }
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public override string Scan() => NextString();
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public override long Long() => long.Parse(NextString());
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public override double Double() => double.Parse(NextString());
}
class LIB_Deque<T>
{
T[] array;
int front, cap;
public int Count;
public T this[long i]
{
[MethodImpl(MethodImplOptions.AggressiveInlining)]
get { return array[GetIndex((int)i)]; }
[MethodImpl(MethodImplOptions.AggressiveInlining)]
set { array[GetIndex((int)i)] = value; }
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public LIB_Deque(long cap = 16)
{
array = new T[this.cap = (int)cap];
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
int GetIndex(int i)
{
if (i >= cap) throw new Exception();
var r = front + i;
return r >= cap ? r - cap : r;
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public void PushFront(T x)
{
if (Count == cap) Extend();
if (--front < 0) front += array.Length;
array[front] = x;
++Count;
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public T PopFront()
{
if (Count-- == 0) throw new Exception();
var r = array[front++];
if (front >= cap) front -= cap;
return r;
}
public T Front => array[front];
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public void PushBack(T x)
{
if (Count == cap) Extend();
var i = front + Count++;
array[i >= cap ? i - cap : i] = x;
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public T PopBack()
{
if (Count == 0) throw new Exception();
return array[GetIndex(--Count)];
}
public T Back => array[GetIndex(Count - 1)];
[MethodImpl(MethodImplOptions.AggressiveInlining)]
void Extend()
{
T[] nb = new T[cap << 1];
if (front > cap - Count)
{
var l = array.Length - front; Array.Copy(array, front, nb, 0, l);
Array.Copy(array, 0, nb, l, Count - l);
}
else Array.Copy(array, front, nb, 0, Count);
array = nb; front = 0; cap <<= 1;
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public void Insert(long i, T x)
{
if (i > Count) throw new Exception();
this.PushFront(x);
for (int j = 0; j < i; j++) this[j] = this[j + 1];
this[i] = x;
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public T RemoveAt(long i)
{
if (i < 0 || i >= Count) throw new Exception();
var r = this[i];
for (var j = i; j > 0; j--) this[j] = this[j - 1];
this.PopFront();
return r;
}
}
class LIB_MoAlgorithm
{
readonly struct Query
{
public readonly int idx;
public readonly int l;
public readonly int r;
public Query(int idx, int l, int r) { this.idx = idx; this.l = l; this.r = r; }
}
int maxL;
int maxR;
int minL;
int minR;
int queryNum;
List<Query> queries;
Action<int> rightAdd;
Action<int> leftAdd;
Action<int> rightDelete;
Action<int> leftDelete;
Action<int> checker;
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public LIB_MoAlgorithm()
{
maxL = maxR = int.MinValue;
minL = minR = int.MaxValue;
queries = new List<Query>();
rightAdd = e => { };
leftAdd = e => { };
rightDelete = e => { };
leftDelete = e => { };
checker = e => { };
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public int AddQuery(long L, long R)
{
var l = (int)L;
var r = (int)R;
if (maxL < l) maxL = l;
if (minL > l) minL = l;
if (maxR < r) maxR = r;
if (minR > r) minR = r;
queries.Add(new Query(queryNum, l, r));
++queryNum;
return queryNum - 1;
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
/// <summary>
/// 指定した 範囲index を区間に追加するメソッドを設定
/// </summary>
public LIB_MoAlgorithm SetAddMethod(Action<int> act)
{
leftAdd = rightAdd = act;
return this;
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
/// <summary>
/// 指定した 範囲index を区間の右に追加するメソッドを設定
/// </summary>
public LIB_MoAlgorithm SetRightAddMethod(Action<int> act)
{
rightAdd = act;
return this;
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
/// <summary>
/// 指定した 範囲index を区間の左に追加するメソッドを設定
/// </summary>
public LIB_MoAlgorithm SetLeftAddMethod(Action<int> act)
{
leftAdd = act;
return this;
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
/// <summary>
/// 指定した 範囲index を区間から削除するメソッドを設定
/// </summary>
public LIB_MoAlgorithm SetDeleteMethod(Action<int> act)
{
leftDelete = rightDelete = act;
return this;
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
/// <summary>
/// 指定した 範囲index を区間の右から削除するメソッドを設定
/// </summary>
public LIB_MoAlgorithm SetRightDeleteMethod(Action<int> act)
{
rightDelete = act;
return this;
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
/// <summary>
/// 指定した 範囲index を区間の左から削除するメソッドを設定
/// </summary>
public LIB_MoAlgorithm SetLeftDeleteMethod(Action<int> act)
{
leftDelete = act;
return this;
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
/// <summary>
/// 指定した クエリindex の答えを処理するメソッドを設定
/// </summary>
public LIB_MoAlgorithm SetChecker(Action<int> act)
{
checker = act;
return this;
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public void Build()
{
Query[] sorted;
if (maxL - minL > maxR - minR)
{
var blockSize = Max(1, (int)(1.7320508 * (maxR - minR + 1) / Sqrt(2 * queryNum)));
sorted = queries.OrderBy(e => (e.r - minR + 1) / blockSize).ThenBy(e => (((e.r - minR + 1) / blockSize & 1) == 1) ? -e.l : e.l).ToArray();
}
else
{
var blockSize = Max(1, (int)(1.7320508 * (maxL - minL + 1) / Sqrt(2 * queryNum)));
sorted = queries.OrderBy(e => (e.l - minL + 1) / blockSize).ThenBy(e => (((e.l - minL + 1) / blockSize & 1) == 1) ? -e.r : e.r).ToArray();
}
var lidx = 0;
var ridx = 0;
foreach (var item in sorted)
{
while (item.l < lidx) leftAdd(--lidx);
while (ridx < item.r) rightAdd(ridx++);
while (lidx < item.l) leftDelete(lidx++);
while (item.r < ridx) rightDelete(--ridx);
checker(item.idx);
}
}
}
}