結果
| 問題 | No.230 Splarraay ｽﾌﾟﾗﾚｪｰｲ |
| ユーザー |
 りあん
|
| 提出日時 | 2019-01-08 17:58:42 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
AC
|
| 実行時間 | 495 ms / 5,000 ms |
| コード長 | 9,122 bytes |
| コンパイル時間 | 1,222 ms |
| コンパイル使用メモリ | 120,740 KB |
| 実行使用メモリ | 25,728 KB |
| 最終ジャッジ日時 | 2024-11-24 00:44:55 |
| 合計ジャッジ時間 | 5,546 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge1 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 26 ms
18,304 KB |
| testcase_01 | AC | 27 ms
18,176 KB |
| testcase_02 | AC | 27 ms
18,176 KB |
| testcase_03 | AC | 26 ms
18,304 KB |
| testcase_04 | AC | 26 ms
18,176 KB |
| testcase_05 | AC | 29 ms
18,688 KB |
| testcase_06 | AC | 49 ms
20,480 KB |
| testcase_07 | AC | 28 ms
18,432 KB |
| testcase_08 | AC | 31 ms
19,200 KB |
| testcase_09 | AC | 238 ms
23,808 KB |
| testcase_10 | AC | 227 ms
22,016 KB |
| testcase_11 | AC | 150 ms
22,528 KB |
| testcase_12 | AC | 240 ms
23,936 KB |
| testcase_13 | AC | 59 ms
21,152 KB |
| testcase_14 | AC | 212 ms
24,064 KB |
| testcase_15 | AC | 367 ms
24,064 KB |
| testcase_16 | AC | 416 ms
24,960 KB |
| testcase_17 | AC | 495 ms
25,600 KB |
| testcase_18 | AC | 302 ms
25,728 KB |
| testcase_19 | AC | 305 ms
25,472 KB |
コンパイルメッセージ
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<int, int, int> agg = (x, y) => x + y;
Func<int, int, int, int> upd = (x, y, l) => y * l;
Func<int, int, int> cmp = (x, y) => y;
var sga = new LazySegtree<int, int>(n, agg, upd, cmp, 0);
var sgb = new LazySegtree<int, int>(n, agg, upd, cmp, 0);
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), sb = sgb.run(l, r);
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), sumb + sgb.run(0, n));
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;
bool[] is_lazy;
Func<T, T, T> calc;
Func<T, U, int, T> apply;
Func<U, U, U> merge;
T ex_data;
public LazySegtree(int m, Func<T, T, T> calc, Func<T, U, int, T> apply, Func<U, U, U> merge, T ex_data) {
this.calc = calc;
this.apply = apply;
this.merge = merge;
this.ex_data = ex_data;
n = 1;
while (n < m) n <<= 1;
data = new T[n * 2 - 1];
lazy = new U[n * 2 - 1];
is_lazy = new bool[n * 2 - 1];
for (int i = 0; i < data.Length; i++) {
data[i] = ex_data;
}
}
public LazySegtree(int m, Func<T, T, T> calc, Func<T, U, int, T> apply, Func<U, U, U> merge, T ex_data, T ini) : this(m, calc, apply, merge, ex_data) {
for (int i = 0; i < m; i++) data[i + n - 1] = ini;
for (int i = n - 2; i >= 0; i--) data[i] = calc(data[i * 2 + 1], data[i * 2 + 2]);
}
public LazySegtree(int m, Func<T, T, T> calc, Func<T, U, int, T> apply, Func<U, U, U> merge, T ex_data, IList<T> ini) : this(m, calc, apply, merge, ex_data) {
for (int i = 0; i < m; i++) data[i + n - 1] = ini[i];
for (int i = n - 2; i >= 0; i--) data[i] = calc(data[i * 2 + 1], data[i * 2 + 2]);
}
void eval(int k, int len){
if (!is_lazy[k]) return;
if (k * 2 + 2 < lazy.Length){
is_lazy[k * 2 + 1] = true;
is_lazy[k * 2 + 2] = true;
lazy[k * 2 + 1] = merge(lazy[k * 2 + 1], lazy[k]);
lazy[k * 2 + 2] = merge(lazy[k * 2 + 2], lazy[k]);
}
data[k] = apply(data[k], lazy[k], len);
is_lazy[k] = false;
}
T update(int s, int t, U x, int k, int l, int r) {
eval(k, r - l);
if (r <= s || t <= l) return data[k];
if (s <= l && r <= t) {
is_lazy[k] = true;
lazy[k] = merge(lazy[k], x);
return apply(data[k], lazy[k], r - l);
}
return data[k] = calc(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, r - l);
if (r <= s || t <= l) return ex_data;
if (s <= l && r <= t) return data[k];
return calc(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);
}