結果
| 問題 |
No.1074 増殖
|
| ユーザー |
 kakel-san
|
| 提出日時 | 2025-10-15 00:23:04 |
| 言語 | C# (.NET 8.0.404) |
| 結果 |
AC
|
| 実行時間 | 322 ms / 2,000 ms |
| コード長 | 12,474 bytes |
| コンパイル時間 | 8,760 ms |
| コンパイル使用メモリ | 167,900 KB |
| 実行使用メモリ | 229,196 KB |
| 最終ジャッジ日時 | 2025-10-15 00:23:17 |
| 合計ジャッジ時間 | 12,871 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 12 |
コンパイルメッセージ
復元対象のプロジェクトを決定しています... /home/judge/data/code/main.csproj を復元しました (116 ミリ秒)。 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();
static int[] NMi => ReadLine().Split().Select(c => int.Parse(c) - 1).ToArray();
static int[][] NMap(int n) => Enumerable.Repeat(0, n).Select(_ => NMi).ToArray();
static string[] SList(long n) => Enumerable.Repeat(0, (int)n).Select(_ => ReadLine()).ToArray();
static long[] LList(long n) => Enumerable.Repeat(0, (int)n).Select(_ => long.Parse(ReadLine())).ToArray();
public static void Main()
{
Solve();
}
static void Solve()
{
var n = NN;
var map = NArr(n);
var ans = new int[n];
var cmap = new int[n][];
for (var i = 0; i < n; ++i) cmap[i] = new int[] { map[i][2], map[i][3] };
Calc(n, cmap, ans);
for (var i = 0; i < n; ++i) cmap[i] = new int[] { -map[i][0], map[i][3] };
Calc(n, cmap, ans);
for (var i = 0; i < n; ++i) cmap[i] = new int[] { -map[i][0], -map[i][1] };
Calc(n, cmap, ans);
for (var i = 0; i < n; ++i) cmap[i] = new int[] { map[i][2], -map[i][1] };
Calc(n, cmap, ans);
WriteLine(string.Join("\n", ans));
}
static void Calc(int n, int[][] map, int[] ans)
{
var rtx = new AvlTree<InfoX>();
for (var i = 0; i < n; ++i)
{
var ins = new InfoX(map[i][0], map[i][1]);
var deleted = new List<InfoX>();
var npos = 0;
var next = rtx.LowerBound(ins, ref npos);
var flg = true;
while (true)
{
if (npos < rtx.GetCount())
{
if (next.Y >= ins.Y)
{
flg = false;
break;
}
else if (next.X == ins.X && next.Y < ins.Y)
{
rtx.Delete(next);
deleted.Add(next);
}
else break;
}
else break;
next = rtx.ElementAt(npos);
}
if (flg)
{
while (npos > 0)
{
var prev = rtx.ElementAt(npos - 1);
if (prev.Y <= ins.Y)
{
rtx.Delete(prev);
deleted.Add(prev);
--npos;
}
else break;
}
var basex = 0;
if (npos > 0) basex = rtx.ElementAt(npos - 1).X;
var basey = 0;
if (npos < rtx.GetCount()) basey = rtx.ElementAt(npos).Y;
var prevy = basey;
var darea = 0;
foreach (var di in deleted)
{
darea += (di.X - basex) * (di.Y - prevy);
prevy = di.Y;
}
ans[i] += (ins.X - basex) * (ins.Y - basey) - darea;
rtx.Insert(ins);
}
}
}
class InfoX : IComparable<InfoX>
{
public int X;
public int Y;
public InfoX(int x, int y)
{
X = x; Y = y;
}
public int CompareTo(InfoX other)
{
return X.CompareTo(other.X);
}
public override string ToString()
{
return $"({X}, {Y})";
}
}
public class AvlTree<T> where T: IComparable<T>
{
private class Node<U> where U: IComparable<U>
{
public U Value;
public Node<U> Lc = null;
public Node<U> Rc = null;
public int Height;
public int Count;
public int CCount;
public Node(int height, U value)
{
Height = height;
Count = 1;
CCount = 1;
Value = value;
}
}
private Node<T> root = null;
static int GetHeight(Node<T> t)
{
return t == null ? 0 : t.Height;
}
static int GetCount(Node<T> t)
{
return t == null ? 0 : t.Count;
}
static int GetBalance(Node<T> t)
{
return GetHeight(t.Lc) - GetHeight(t.Rc);
}
static void Recalc(Node<T> t)
{
if (t == null) return;
t.Height = 1 + Math.Max(GetHeight(t.Lc), GetHeight(t.Rc));
t.Count = t.CCount + GetCount(t.Lc) + GetCount(t.Rc);
}
static Node<T> RotateLeft(Node<T> t)
{
Node<T> u = t.Rc;
Node<T> t2 = u.Lc;
u.Lc = t;
t.Rc = t2;
Recalc(t);
Recalc(u);
return u;
}
static Node<T> RotateRight(Node<T> t)
{
Node<T> u = t.Lc;
Node<T> t2 = u.Rc;
u.Rc = t;
t.Lc = t2;
Recalc(t);
Recalc(u);
return u;
}
static Node<T> RotateLR(Node<T> t)
{
t.Lc = RotateLeft(t.Lc);
return RotateRight(t);
}
static Node<T> RotateRL(Node<T> t)
{
t.Rc = RotateRight(t.Rc);
return RotateLeft(t);
}
static Node<T> BalanceLeft(Node<T> t)
{
if (GetBalance(t) > 1)
{
if (GetBalance(t.Lc) < 0) t = RotateLR(t);
else t = RotateRight(t);
}
Recalc(t);
return t;
}
static Node<T> BalanceRight(Node<T> t)
{
if (GetBalance(t) < -1)
{
if (GetBalance(t.Rc) > 0) t = RotateRL(t);
else t = RotateLeft(t);
}
Recalc(t);
return t;
}
/// <summary>valueを挿入する</summary>
public void Insert(T value)
{
root = Insert(root, value);
}
Node<T> Insert(Node<T> cur, T value)
{
if (cur == null)
{
return new Node<T>(1, value);
}
var d = value.CompareTo(cur.Value);
if (d < 0)
{
cur.Lc = Insert(cur.Lc, value);
return BalanceLeft(cur);
}
else if (d > 0)
{
cur.Rc = Insert(cur.Rc, value);
return BalanceRight(cur);
}
else
{
++cur.CCount;
Recalc(cur);
return cur;
}
}
/// <summary>valueを削除する 存在しない場合はなにもしない</summary>
public void Delete(T value)
{
root = Delete(root, value);
}
Node<T> Delete(Node<T> cur, T value)
{
if (cur == null) return null;
var d = value.CompareTo(cur.Value);
if (d < 0)
{
cur.Lc = Delete(cur.Lc, value);
return BalanceRight(cur);
}
else if (d > 0)
{
cur.Rc = Delete(cur.Rc, value);
return BalanceLeft(cur);
}
else
{
--cur.CCount;
if (cur.CCount == 0)
{
if (cur.Lc != null)
{
Node<T> del = null;
var max = DeleteMax(cur.Lc, ref del);
cur.Lc = max;
cur.Value = del.Value;
cur.CCount = del.CCount;
return BalanceRight(cur);
}
else
{
return cur.Rc;
}
}
else
{
Recalc(cur);
return cur;
}
}
}
Node<T> DeleteMax(Node<T> t, ref Node<T> del)
{
if (t.Rc == null)
{
del = t;
return t.Lc;
}
else
{
var max = DeleteMax(t.Rc, ref del);
t.Rc = max;
return BalanceLeft(t);
}
}
/// <summary>小さいほうからpos番目の要素を取得する</summary>
public T ElementAt(int pos)
{
if (pos < 0 || pos >= GetCount(root)) return default;
var t = ElementAt(root, pos);
return t.Value;
}
/// <summary>小さいほうからpos番目の要素を取得する</summary>
public T ElementAt(int pos, T defaultValue)
{
if (pos < 0 || pos >= GetCount(root)) return defaultValue;
return ElementAt(pos);
}
Node<T> ElementAt(Node<T> cur, int pos)
{
if (pos < GetCount(cur.Lc)) return ElementAt(cur.Lc, pos);
if (pos < GetCount(cur.Lc) + cur.CCount) return cur;
if (pos < cur.Count) return ElementAt(cur.Rc, pos - GetCount(cur.Lc) - cur.CCount);
return null;
}
public void Debug()
{
if (root == null) return;
Console.WriteLine($"root val:{root.Value}, CCount:{root.CCount}, Count:{root.Count}");
Debug(root.Value, root.Lc);
Debug(root.Value, root.Rc);
}
void Debug(T pval, Node<T> cur)
{
if (cur == null) return;
Console.WriteLine($"{pval} -> val:{cur.Value}, CCount:{cur.CCount}, Count:{cur.Count}");
Debug(cur.Value, cur.Lc);
Debug(cur.Value, cur.Rc);
}
/// <summary>value以上でもっとも小さい値とその場所を返却する</summary>
public T LowerBound(T value, ref int index)
{
var cur = root;
T ans = default;
var add = 0;
index = GetCount(root);
while (cur != null)
{
if (value.CompareTo(cur.Value) <= 0)
{
ans = cur.Value;
index = add + GetCount(cur.Lc);
cur = cur.Lc;
}
else
{
add += GetCount(cur.Lc) + cur.CCount;
cur = cur.Rc;
}
}
return ans;
}
/// <summary>要素の個数を求める</summary>
public int GetCount()
{
return GetCount(root);
}
/// <summary>要素の一覧を返す</summary>
public List<T> GetValues()
{
var list = new List<T>();
if (root != null) GetValues(root, list);
return list;
}
static void GetValues(Node<T> cur, List<T> list)
{
if (cur.Lc != null) GetValues(cur.Lc, list);
list.Add(cur.Value);
if (cur.Rc != null) GetValues(cur.Rc, list);
}
/// <summary>指定された要素が存在するか求める</summary>
/// <param name="value"></param>
/// <returns></returns>
public bool Contains(T value)
{
if (root == null) return false;
return Contains(root, value);
}
static bool Contains(Node<T> cur, T value)
{
var d = cur.Value.CompareTo(value);
if (d == 0) return true;
if (d > 0)
{
if (cur.Lc == null) return false;
return Contains(cur.Lc, value);
}
else
{
if (cur.Rc == null) return false;
return Contains(cur.Rc, value);
}
}
}
}