結果
| 問題 |
No.3167 [Cherry 7th Tune C] Cut in Queue
|
| ユーザー |
 kakel-san
|
| 提出日時 | 2025-05-30 23:39:58 |
| 言語 | C# (.NET 8.0.404) |
| 結果 |
AC
|
| 実行時間 | 1,097 ms / 2,500 ms |
| コード長 | 10,109 bytes |
| コンパイル時間 | 8,824 ms |
| コンパイル使用メモリ | 168,380 KB |
| 実行使用メモリ | 269,612 KB |
| 最終ジャッジ日時 | 2025-05-30 23:40:38 |
| 合計ジャッジ時間 | 38,745 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 43 |
コンパイルメッセージ
復元対象のプロジェクトを決定しています... /home/judge/data/code/main.csproj を復元しました (104 ミリ秒)。 main -> /home/judge/data/code/bin/Release/net8.0/main.dll main -> /home/judge/data/code/bin/Release/net8.0/publish/
ソースコード
using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;
class Program
{
static int NN => int.Parse(ReadLine());
static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
public static void Main()
{
Solve();
}
static void Solve()
{
var n = NN;
var a = NList;
var q = NN;
var query = NArr(q);
WriteLine(string.Join("\n", Cut(n, a, q, query)));
}
static List<int> Cut(int n, int[] a, int q, int[][] query)
{
var one = query.Count(qi => qi[0] == 1);
var lists = new Deque<int>[n + one + 1];
for (var i = 0; i < lists.Length; ++i) lists[i] = new Deque<int>();
for (var i = 1; i < lists.Length; ++i) lists[i].PushBack(i);
var tmp = one;
for (var i = q - 1; i >= 0; --i)
{
if (query[i][0] != 1) continue;
var ins = n + tmp;
var to = query[i][1];
if (lists[ins].Count < lists[to].Count)
{
while (lists[ins].Count > 0) lists[to].PushBack(lists[ins].PopFront());
}
else
{
while (lists[to].Count > 0) lists[ins].PushFront(lists[to].PopBack());
lists[to] = lists[ins];
}
--tmp;
}
var list = new List<int>();
for (var i = 0; i < n; ++i) while (lists[a[i]].Count > 0) list.Add(lists[a[i]].PopBack());
for (var i = 0; i < q; ++i)
{
if (query[i][0] != 1) continue;
++tmp;
while (lists[n + tmp].Count > 0) list.Add(lists[n + tmp].PopBack());
}
var pos = new int[list.Count + 1];
for (var i = 0; i < list.Count; ++i) pos[list[i]] = i;
var init = new int[list.Count];
for (var i = 1; i <= n; ++i) ++init[pos[i]];
var seg = new SegmentTree<int>(init, new SegOp());
var ans = new List<int>();
var two = 0;
tmp = 0;
for (var i = 0; i < q; ++i)
{
if (query[i][0] == 1)
{
++tmp;
seg[pos[n + tmp]] = 1;
}
else if (query[i][0] == 2)
{
++two;
}
else
{
if (query[i][1] + two - 1 == 0 && seg[0] == 1)
{
ans.Add(list[0]);
}
else
{
var p = seg.MaxRight(0, v => v <= query[i][1] + two - 1);
ans.Add(list[p]);
}
}
}
return ans;
}
class Deque<T>
{
int _s = 0;
int _t = 0;
T[] _arr;
public Deque() : this(4)
{
}
public Deque(int size)
{
_arr = new T[size];
}
public Deque(IEnumerable<T> init)
{
var list = init.ToArray();
var size = 4;
while (size <= list.Length) size <<= 1;
_arr = new T[size];
for (var i = 0; i < list.Length; ++i) _arr[i] = list[i];
_t = _arr.Length;
}
public int Count
{
get { return (_t + _arr.Length - _s) % _arr.Length; }
}
/// <summary>キューの末尾に追加する</summary>
/// <param name="item">追加するアイテム</param>
public void PushBack(T item)
{
if (Count + 1 == _arr.Length) Expand();
if (_t == _arr.Length) _t = 0;
_arr[_t++] = item;
}
/// <summary>キューの先頭からアイテムを取り出す</summary>
/// <returns>取り出したアイテム</returns>
public T PopFront()
{
var ret = _arr[_s++];
if (_s == _arr.Length) _s = 0;
return ret;
}
/// <summary>キューの先頭に追加する</summary>
/// <param name="item">追加するアイテム</param>
public void PushFront(T item)
{
if (Count + 1 == _arr.Length) Expand();
if (_s == 0) _s = _arr.Length;
_arr[--_s] = item;
}
/// <summary>キューの末尾からアイテムを取り出す</summary>
/// <returns>取り出したアイテム</returns>
public T PopBack()
{
var ret = _arr[--_t];
if (_t == 0) _t = _arr.Length;
return ret;
}
/// <summary>キューの先頭にあるアイテムを取得する</summary>
/// <returns>キューの先頭にあるアイテム</returns>
/// <exception cref="InvalidOperationException">キューが空の場合</exception>
public T Peek()
{
if (Count == 0) throw new InvalidOperationException("deque is empty");
return _arr[_s];
}
/// <summary>キューの末尾にあるアイテムを取得する</summary>
/// <returns>キューの末尾にあるアイテム</returns>
/// <exception cref="InvalidOperationException">キューが空の場合</exception>
public T PeekBack()
{
if (Count == 0) throw new InvalidOperationException("deque is empty");
return _arr[_t - 1];
}
void Expand()
{
var count = Count;
var na = new T[_arr.Length * 2];
var cur = 0;
if (_s <= _t)
{
for (var i = _s; i < _t; ++i) na[cur++] = _arr[i];
}
else
{
for (var i = _s; i < _arr.Length; ++i) na[cur++] = _arr[i];
for (var i = 0; i < _t; ++i) na[cur++] = _arr[i];
}
_s = 0;
_t = count;
_arr = na;
}
}
struct SegOp : ISegmentTreeOperator<int>
{
public int Identity => 0;
public int Operate(int x, int y)
{
return x + y;
}
}
interface ISegmentTreeOperator<T>
{
T Identity { get; }
T Operate(T x, T y);
}
class SegmentTree<T>
{
int _n;
int size;
int log;
T[] d;
ISegmentTreeOperator<T> op;
void Update(int k)
{
d[k] = op.Operate(d[2 * k], d[2 * k + 1]);
}
public SegmentTree(int n, ISegmentTreeOperator<T> op)
{
this.op = op;
_n = n;
size = 1;
while (size < n) size <<= 1;
log = CountRZero(size);
d = new T[2 * size];
for (var i = 0; i < d.Length; ++i) d[i] = op.Identity;
}
public SegmentTree(T[] v, ISegmentTreeOperator<T> op)
{
this.op = op;
_n = v.Length;
size = 1;
while (size < v.Length) size <<= 1;
log = CountRZero(size);
d = new T[2 * size];
for (var i = 0; i < size; ++i) d[i] = op.Identity;
for (var i = 0; i < v.Length; ++i) d[size + i] = v[i];
for (var i = size - 1; i >= 1; --i) Update(i);
}
int CountRZero(int n)
{
var ans = 0;
while (n % 2 == 0)
{
++ans;
n >>= 1;
}
return ans;
}
public T this[int p]
{
get { return d[p + size]; }
set
{
p += size;
d[p] = value;
for (var i = 1; i <= log; ++i) Update(p >> i);
}
}
public T Prod(int l, int r)
{
var sml = op.Identity;
var smr = op.Identity;
l += size;
r += size;
while (l < r)
{
if ((l & 1) != 0) sml = op.Operate(sml, d[l++]);
if ((r & 1) != 0) smr = op.Operate(d[--r], smr);
l >>= 1;
r >>= 1;
}
return op.Operate(sml, smr);
}
T AllProd() => d[1];
int MinLeft(int r, Predicate<T> f)
{
if (r == 0) return 0;
r += size;
T sm = op.Identity;
do
{
r--;
while (r > 1 && (r % 2) != 0) r >>= 1;
if (!f(op.Operate(d[r], sm)))
{
while (r < size)
{
r = 2 * r + 1;
if (f(op.Operate(d[r], sm)))
{
sm = op.Operate(d[r], sm);
r--;
}
}
return r + 1 - size;
}
sm = op.Operate(d[r], sm);
}
while ((r & -r) != r);
return 0;
}
public int MaxRight(int l, Predicate<T> f)
{
if (l == _n) return _n;
l += size;
T sm = op.Identity;
do
{
while (l % 2 == 0) l >>= 1;
if (!f(op.Operate(sm, d[l])))
{
while (l < size)
{
l = 2 * l;
if (f(op.Operate(sm, d[l])))
{
sm = op.Operate(sm, d[l]);
++l;
}
}
return l - size;
}
sm = op.Operate(sm, d[l]);
++l;
} while ((l & -l) != l);
return _n;
}
}
}