結果
| 問題 |
No.230 Splarraay ｽﾌﾟﾗﾚｪｰｲ
|
| コンテスト | |
| ユーザー |
 りあん
|
| 提出日時 | 2019-01-08 17:10:36 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
AC
|
| 実行時間 | 2,174 ms / 5,000 ms |
| コード長 | 9,238 bytes |
| コンパイル時間 | 1,625 ms |
| コンパイル使用メモリ | 119,012 KB |
| 実行使用メモリ | 77,056 KB |
| 最終ジャッジ日時 | 2024-11-24 00:43:45 |
| 合計ジャッジ時間 | 12,016 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 17 |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System;
using System.Collections.Generic;
using System.Linq;
using System.Linq.Expressions;
using System.IO;
using System.Text;
using static util;
using P = pair<int, int>;
using Binary = System.Func<System.Linq.Expressions.ParameterExpression, System.Linq.Expressions.ParameterExpression,
System.Linq.Expressions.BinaryExpression>;
using Unary = System.Func<System.Linq.Expressions.ParameterExpression, System.Linq.Expressions.UnaryExpression>;
class Program
{
static StreamWriter sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
static Scan sc = new Scan();
const int M = 1000000007;
const int M2 = 998244353;
const long LM = (long)1e18;
const double eps = 1e-11;
static readonly int[] dd = { 0, 1, 0, -1, 0 };
const string dstring = "RDLU";
static void Main()
{
int n = sc.Int;
int q = sc.Int;
Func<P, P, P> agg = (x, y) => new P(x.v1 + y.v1, x.v2 + y.v2);
Func<P, int, P> upd = (x, y) => new P(y * x.v2, x.v2);
Func<int, int, int> cmp = (x, y) => y;
var sga = new LazySegtree<P, int>(n, agg, upd, cmp, new P(0, 0), -M, new P(0, 1));
var sgb = new LazySegtree<P, int>(n, agg, upd, cmp, new P(0, 0), -M, new P(0, 1));
long suma = 0, sumb = 0;
for (int i = 0; i < q; i++)
{
int x, l, r;
sc.Multi(out x, out l, out r);
++r;
if (x == 0) {
int sa = sga.run(l, r).v1, sb = sgb.run(l, r).v1;
if (sa > sb) suma += sa;
if (sa < sb) sumb += sb;
}
else if (x == 1) {
sga.update(l, r, 1);
sgb.update(l, r, 0);
}
else {
sga.update(l, r, 0);
sgb.update(l, r, 1);
}
}
Prt(suma + sga.run(0, n).v1, sumb + sgb.run(0, n).v1);
sw.Flush();
}
static void DBG(string a) => Console.WriteLine(a);
static void DBG<T>(IEnumerable<T> a) => DBG(string.Join(" ", a));
static void DBG(params object[] a) => DBG(string.Join(" ", a));
static void Prt(string a) => sw.WriteLine(a);
static void Prt<T>(IEnumerable<T> a) => Prt(string.Join(" ", a));
static void Prt(params object[] a) => Prt(string.Join(" ", a));
}
class pair<T, U> : IComparable<pair<T, U>>
{
public T v1;
public U v2;
public pair(T v1, U v2) {
this.v1 = v1;
this.v2 = v2;
}
public int CompareTo(pair<T, U> a) {
int c = Comparer<T>.Default.Compare(v1, a.v1);
return c != 0 ? c : Comparer<U>.Default.Compare(v2, a.v2);
}
public override string ToString() => v1 + " " + v2;
public void Deconstruct(out T a, out U b) {
a = v1; b = v2;
}
}
static class util
{
public static pair<T, T> make_pair<T>(this IList<T> l) => make_pair(l[0], l[1]);
public static pair<T, U> make_pair<T, U>(T v1, U v2) => new pair<T, U>(v1, v2);
public static T sq<T>(T a) => Operator<T>.Multiply(a, a);
public static T Max<T>(params T[] a) => a.Max();
public static T Min<T>(params T[] a) => a.Min();
public static bool inside(int i, int j, int h, int w) => i >= 0 && i < h && j >= 0 && j < w;
public static void swap<T>(ref T a, ref T b) where T : struct { var t = a; a = b; b = t; }
public static void swap<T>(this IList<T> a, int i, int j) where T : struct { var t = a[i]; a[i] = a[j]; a[j] = t; }
public static T[] copy<T>(this IList<T> a) {
var ret = new T[a.Count];
for (int i = 0; i < a.Count; i++) ret[i] = a[i];
return ret;
}
}
static class Operator<T>
{
static readonly ParameterExpression x = Expression.Parameter(typeof(T), "x");
static readonly ParameterExpression y = Expression.Parameter(typeof(T), "y");
public static readonly Func<T, T, T> Add = Lambda(Expression.Add);
public static readonly Func<T, T, T> Subtract = Lambda(Expression.Subtract);
public static readonly Func<T, T, T> Multiply = Lambda(Expression.Multiply);
public static readonly Func<T, T, T> Divide = Lambda(Expression.Divide);
public static readonly Func<T, T> Plus = Lambda(Expression.UnaryPlus);
public static readonly Func<T, T> Negate = Lambda(Expression.Negate);
public static Func<T, T, T> Lambda(Binary op) => Expression.Lambda<Func<T, T, T>>(op(x, y), x, y).Compile();
public static Func<T, T> Lambda(Unary op) => Expression.Lambda<Func<T, T>>(op(x), x).Compile();
}
class Scan
{
public int Int => int.Parse(Str);
public long Long => long.Parse(Str);
public double Double => double.Parse(Str);
public string Str => Console.ReadLine().Trim();
public pair<T, U> Pair<T, U>() where T : IComparable<T> where U : IComparable<U> {
T a; U b;
Multi(out a, out b);
return new pair<T, U>(a, b);
}
public P P {
get {
int a, b;
Multi(out a, out b);
return new P(a, b);
}
}
public int[] IntArr => StrArr.Select(int.Parse).ToArray();
public long[] LongArr => StrArr.Select(long.Parse).ToArray();
public double[] DoubleArr => StrArr.Select(double.Parse).ToArray();
public string[] StrArr => Str.Split(new[]{' '}, StringSplitOptions.RemoveEmptyEntries);
bool eq<T, U>() => typeof(T).Equals(typeof(U));
T ct<T, U>(U a) => (T)Convert.ChangeType(a, typeof(T));
T cv<T>(string s) => eq<T, int>() ? ct<T, int>(int.Parse(s))
: eq<T, long>() ? ct<T, long>(long.Parse(s))
: eq<T, double>() ? ct<T, double>(double.Parse(s))
: eq<T, char>() ? ct<T, char>(s[0])
: ct<T, string>(s);
public void Multi<T>(out T a) => a = cv<T>(Str);
public void Multi<T, U>(out T a, out U b)
{ var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); }
public void Multi<T, U, V>(out T a, out U b, out V c)
{ var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); }
public void Multi<T, U, V, W>(out T a, out U b, out V c, out W d)
{ var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); }
public void Multi<T, U, V, W, X>(out T a, out U b, out V c, out W d, out X e)
{ var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); e = cv<X>(ar[4]); }
public void Multi<T, U, V, W, X, Y>(out T a, out U b, out V c, out W d, out X e, out Y f)
{ var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); e = cv<X>(ar[4]); f = cv<Y>(ar[5]); }
}
class LazySegtree<T, U> {
int n;
T[] data;
U[] lazy;
Func<T, T, T> Aggregate;
Func<T, U, T> Update;
Func<U, U, U> Compose;
T ex_data;
U ex_lazy;
public LazySegtree(int m, Func<T, T, T> Aggregate, Func<T, U, T> Update, Func<U, U, U> Compose, T ex_data, U ex_lazy) {
this.Aggregate = Aggregate;
this.Update = Update;
this.Compose = Compose;
this.ex_data = ex_data;
this.ex_lazy = ex_lazy;
n = 1;
while (n < m) n <<= 1;
data = new T[n * 2 - 1];
lazy = new U[n * 2 - 1];
for (int i = 0; i < data.Length; i++) {
data[i] = ex_data;
lazy[i] = ex_lazy;
}
}
public LazySegtree(int m, Func<T, T, T> Aggregate, Func<T, U, T> Update, Func<U, U, U> Compose, T ex_data, U ex_lazy, T ini) : this(m, Aggregate, Update, Compose, ex_data, ex_lazy) {
for (int i = 0; i < m; i++) data[i + n - 1] = ini;
for (int i = n - 2; i >= 0; i--) data[i] = Aggregate(data[i * 2 + 1], data[i * 2 + 2]);
}
public LazySegtree(int m, Func<T, T, T> Aggregate, Func<T, U, T> Update, Func<U, U, U> Compose, T ex_data, U ex_lazy, IList<T> ini) : this(m, Aggregate, Update, Compose, ex_data, ex_lazy) {
for (int i = 0; i < m; i++) data[i + n - 1] = ini[i];
for (int i = n - 2; i >= 0; i--) data[i] = Aggregate(data[i * 2 + 1], data[i * 2 + 2]);
}
T eval(int k){
if (lazy[k].Equals(ex_lazy)) return data[k];
if (k * 2 + 2 < lazy.Length){
lazy[k * 2 + 1] = Compose(lazy[k * 2 + 1], lazy[k]);
lazy[k * 2 + 2] = Compose(lazy[k * 2 + 2], lazy[k]);
}
data[k] = Update(data[k], lazy[k]);
lazy[k] = ex_lazy;
return data[k];
}
T update(int s, int t, U x, int k, int l, int r) {
eval(k);
if (r <= s || t <= l) return data[k];
if (s <= l && r <= t) {
lazy[k] = Compose(lazy[k], x);
return eval(k);
}
return data[k] = Aggregate(update(s, t, x, k * 2 + 1, l, (l + r) / 2),
update(s, t, x, k * 2 + 2, (l + r) / 2, r));
}
T run(int s, int t, int k, int l, int r) {
eval(k);
if (r <= s || t <= l) return ex_data;
if (s <= l && r <= t) return data[k];
return Aggregate(run(s, t, k * 2 + 1, l, (l + r) / 2),
run(s, t, k * 2 + 2, (l + r) / 2, r));
}
// [s, t)
public void update(int s, int t, U x) => update(s, t, x, 0, 0, n);
// [s, t)
public T run(int s, int t) => run(s, t, 0, 0, n);
}