結果

問題 No.318 学学学学学
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2015-12-11 00:47:47
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 196 ms / 2,000 ms
コード長 8,018 bytes
コンパイル時間 2,783 ms
コンパイル使用メモリ 121,092 KB
実行使用メモリ 40,608 KB
最終ジャッジ日時 2024-06-22 15:00:44
合計ジャッジ時間 8,323 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 39 ms
25,952 KB
testcase_01 AC 54 ms
29,468 KB
testcase_02 AC 59 ms
27,748 KB
testcase_03 AC 46 ms
26,340 KB
testcase_04 AC 53 ms
27,688 KB
testcase_05 AC 194 ms
40,608 KB
testcase_06 AC 193 ms
40,384 KB
testcase_07 AC 170 ms
36,088 KB
testcase_08 AC 151 ms
36,488 KB
testcase_09 AC 131 ms
35,700 KB
testcase_10 AC 114 ms
35,788 KB
testcase_11 AC 196 ms
39,892 KB
testcase_12 AC 163 ms
38,320 KB
testcase_13 AC 147 ms
37,292 KB
testcase_14 AC 132 ms
36,816 KB
testcase_15 AC 127 ms
35,836 KB
testcase_16 AC 117 ms
35,212 KB
testcase_17 AC 151 ms
36,192 KB
testcase_18 AC 141 ms
36,904 KB
testcase_19 AC 156 ms
34,420 KB
testcase_20 AC 106 ms
33,548 KB
testcase_21 AC 27 ms
24,960 KB
testcase_22 AC 27 ms
24,932 KB
testcase_23 AC 29 ms
26,972 KB
testcase_24 AC 28 ms
27,360 KB
testcase_25 AC 27 ms
25,060 KB
testcase_26 AC 27 ms
25,004 KB
testcase_27 AC 26 ms
27,144 KB
testcase_28 AC 26 ms
27,024 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff # 

using System;
using System.Linq;
using System.Diagnostics;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;

namespace Program
{

    public class Solver
    {
        public void Solve()
        {
            var n = sc.Integer();
            var a = sc.Integer(n);
            var xs = a.Distinct().ToList();
            xs.Sort();
            var s = Enumerate(xs.Count, x => new Pair<int, int>(100000000, -1));
            for (int i = 0; i < n; i++)
            {
                var p = xs.BinarySearch(a[i]);
                s[p].x = Math.Min(s[p].x, i);
                s[p].y = Math.Max(s[p].y, i);
            }
            var tree = new LazyEvaluateSetSumTree(n);
            for (int i = 0; i < xs.Count; i++)
            {
                var v = xs[i];
                var l = s[i].x;
                var r = s[i].y;
                tree.Set(l, r + 1, v);
            }
            var ans = new long[n];
            for (int i = 0; i < n; i++)
                ans[i] = tree.Query(i, i + 1);
            IO.Printer.Out.WriteLine(ans.AsJoinedString());


        }
        public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());
        static T[] Enumerate<T>(int n, Func<int, T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; }
        static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }
    }
}

#region main
static class Ex
{
    static public string AsString(this IEnumerable<char> ie) { return new string(System.Linq.Enumerable.ToArray(ie)); }
    static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") { return string.Join(st, ie); }
    static public void Main()
    {
        var solver = new Program.Solver();
        solver.Solve();
        Program.IO.Printer.Out.Flush();
    }
}
#endregion
#region Ex
namespace Program.IO
{
    using System.IO;
    using System.Text;
    using System.Globalization;
    public class Printer : StreamWriter
    {
        static Printer() { Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false }; }
        public static Printer Out { get; set; }
        public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
        public Printer(System.IO.Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
        public Printer(System.IO.Stream stream, Encoding encoding) : base(stream, encoding) { }
        public void Write<T>(string format, T[] source) { base.Write(format, source.OfType<object>().ToArray()); }
        public void WriteLine<T>(string format, T[] source) { base.WriteLine(format, source.OfType<object>().ToArray()); }
    }
    public class StreamScanner
    {
        public StreamScanner(Stream stream) { str = stream; }
        public readonly Stream str;
        private readonly byte[] buf = new byte[1024];
        private int len, ptr;
        public bool isEof = false;
        public bool IsEndOfStream { get { return isEof; } }
        private byte read()
        {
            if (isEof) return 0;
            if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } }
            return buf[ptr++];
        }
        public char Char() { byte b = 0; do b = read(); while ((b < 33 || 126 < b) && !isEof); return (char)b; }

        public string Scan()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b >= 33 && b <= 126; b = (char)read())
                sb.Append(b);
            return sb.ToString();
        }
        public string ScanLine()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b != '\n'; b = (char)read())
                if (b == 0) break;
                else if (b != '\r') sb.Append(b);
            return sb.ToString();
        }
        public long Long()
        {
            if (isEof) return long.MinValue;
            long ret = 0; byte b = 0; var ng = false;
            do b = read();
            while (b != 0 && b != '-' && (b < '0' || '9' < b));
            if (b == 0) return long.MinValue;
            if (b == '-') { ng = true; b = read(); }
            for (; true; b = read())
            {
                if (b < '0' || '9' < b)
                    return ng ? -ret : ret;
                else ret = ret * 10 + b - '0';
            }
        }
        public int Integer() { return (isEof) ? int.MinValue : (int)Long(); }
        public double Double() { var s = Scan(); return s != "" ? double.Parse(Scan(), CultureInfo.InvariantCulture) : double.NaN; }
        private T[] enumerate<T>(int n, Func<T> f)
        {
            var a = new T[n];
            for (int i = 0; i < n; ++i) a[i] = f();
            return a;
        }

        public char[] Char(int n) { return enumerate(n, Char); }
        public string[] Scan(int n) { return enumerate(n, Scan); }
        public double[] Double(int n) { return enumerate(n, Double); }
        public int[] Integer(int n) { return enumerate(n, Integer); }
        public long[] Long(int n) { return enumerate(n, Long); }
    }
}
#endregion

#region LazyEvalSetSum
public class LazyEvaluateSetSumTree
{
    int n;
    long[] data;
    long[] lazy;
    public LazyEvaluateSetSumTree(int size)
    {
        n = 1;
        while (n < size)
            n <<= 1;
        data = new long[n << 1];
        lazy = new long[n << 1];
        for (int i = 0; i < lazy.Length; i++)
            lazy[i] = -1;
    }
    private void lazyEval(int k, int a, int b)
    {
        if (lazy[k] == -1)
            return;
        Update(a, (a + b) >> 1, lazy[k], k << 1, a, (a + b) >> 1);
        Update((a + b) >> 1, b, lazy[k], (k << 1) + 1, (a + b) >> 1, b);
        lazy[k] = -1;
    }
    private void eval(int k)
    {
        int l = k << 1, r = (k << 1) + 1;
        data[k] = data[l] + data[r];
    }
    public void Set(int a, int b, int v)
    {
        Update(a, b, v, 1, 0, n);
    }
    private void Update(int a, int b, long v, int k, int l, int r)
    {
        if (r <= a || b <= l)
            return;
        else if (a <= l && r <= b)
        {
            lazy[k] = v;
            data[k] = v * (r - l);
        }
        else
        {
            lazyEval(k, l, r);
            Update(a, b, v, k << 1, l, (l + r) >> 1);
            Update(a, b, v, (k << 1) + 1, (l + r) >> 1, r);
            eval(k);
        }
    }
    public long Query(int a, int b) { return Query(a, b, 1, 0, n); }
    private long Query(int a, int b, int k, int l, int r)
    {
        if (r <= a || b <= l)
            return 0;
        if (a <= l && r <= b)
            return data[k];
        else
        {
            lazyEval(k, l, r);
            var vl = Query(a, b, k << 1, l, (l + r) >> 1);
            var vr = Query(a, b, (k << 1) + 1, (l + r) >> 1, r);
            eval(k);
            return vl + vr;
        }
    }

}
#endregion
#region Compair
static public class Pair
{
    static public Pair<FT, ST> Create<FT, ST>(FT f, ST s)
        where FT : IComparable<FT>
        where ST : IComparable<ST>
    { return new Pair<FT, ST>(f, s); }
    static public Pair<FT, ST> Min<FT, ST>(Pair<FT, ST> p, Pair<FT, ST> q)
        where FT : IComparable<FT>
        where ST : IComparable<ST>
    { return (p.CompareTo(q) <= 0) ? p : q; }
    static public Pair<FT, ST> Max<FT, ST>(Pair<FT, ST> p, Pair<FT, ST> q)
        where FT : IComparable<FT>
        where ST : IComparable<ST>
    { return (p.CompareTo(q) >= 0) ? p : q; }
}
public struct Pair<FT, ST> : IComparable<Pair<FT, ST>>
    where FT : IComparable<FT>
    where ST : IComparable<ST>
{
    public FT x;
    public ST y;
    public Pair(FT f, ST s) : this() { x = f; y = s; }

    public int CompareTo(Pair<FT, ST> other)
    {
        var cmp = x.CompareTo(other.x);
        return cmp != 0 ? cmp : y.CompareTo(other.y);
    }
    public override string ToString() { return string.Format("{0} {1}", x, y); }
}
#endregion
0