結果
問題 | No.318 学学学学学 |
ユーザー | eitaho |
提出日時 | 2016-01-08 01:34:52 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 322 ms / 2,000 ms |
コード長 | 4,319 bytes |
コンパイル時間 | 4,395 ms |
コンパイル使用メモリ | 110,268 KB |
実行使用メモリ | 47,944 KB |
最終ジャッジ日時 | 2023-09-04 18:25:59 |
合計ジャッジ時間 | 11,044 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 96 ms
26,128 KB |
testcase_01 | AC | 115 ms
29,160 KB |
testcase_02 | AC | 121 ms
28,900 KB |
testcase_03 | AC | 106 ms
25,756 KB |
testcase_04 | AC | 117 ms
28,668 KB |
testcase_05 | AC | 318 ms
47,916 KB |
testcase_06 | AC | 261 ms
44,360 KB |
testcase_07 | AC | 228 ms
43,168 KB |
testcase_08 | AC | 200 ms
43,872 KB |
testcase_09 | AC | 181 ms
41,196 KB |
testcase_10 | AC | 163 ms
42,600 KB |
testcase_11 | AC | 322 ms
47,944 KB |
testcase_12 | AC | 255 ms
42,344 KB |
testcase_13 | AC | 227 ms
45,020 KB |
testcase_14 | AC | 208 ms
43,860 KB |
testcase_15 | AC | 193 ms
43,372 KB |
testcase_16 | AC | 173 ms
41,988 KB |
testcase_17 | AC | 223 ms
43,196 KB |
testcase_18 | AC | 216 ms
43,728 KB |
testcase_19 | AC | 207 ms
43,084 KB |
testcase_20 | AC | 161 ms
39,096 KB |
testcase_21 | AC | 69 ms
23,772 KB |
testcase_22 | AC | 71 ms
23,736 KB |
testcase_23 | AC | 71 ms
23,988 KB |
testcase_24 | AC | 70 ms
21,824 KB |
testcase_25 | AC | 70 ms
21,764 KB |
testcase_26 | AC | 70 ms
21,736 KB |
testcase_27 | AC | 72 ms
21,768 KB |
testcase_28 | AC | 71 ms
21,772 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.IO; using System.Linq; using System.Text; using System.Collections.Generic; using System.Diagnostics; using System.Numerics; using Enu = System.Linq.Enumerable; class Program { public void Solve() { int N = Reader.Int(); var A = Reader.IntArray(N); var L = new Dictionary<int, int>(); var R = new Dictionary<int, int>(); for (int i = 0; i < N; i++) R[A[i]] = i; for (int i = N - 1; i >= 0; i--) L[A[i]] = i; var seg = new RangeUpdateSumSegTree(N); foreach (int val in A.Distinct().OrderBy(a => a)) seg.Update(L[val], R[val] + 1, val); var ans = Enu.Range(0, N).Select(i => seg.Sum(i, i + 1)); Console.WriteLine(string.Join(" ", ans)); } class RangeUpdateSumSegTree { public readonly int N; private readonly int[] V, S; private readonly bool[] Flag; public RangeUpdateSumSegTree(int n) { for (N = 4; N < n; ) N *= 2; V = new int[N * 2]; S = new int[N * 2]; Flag = new bool[N * 2]; } public int Sum(int L, int R) { return Sum(0, 0, N, L, R); } private int Sum(int i, int currL, int currR, int L, int R) { if (currL >= R || currR <= L) return 0; if (currL >= L && currR <= R) return S[i]; if (Flag[i]) return V[i] * (Math.Min(currR, R) - Math.Max(currL, L)); int mid = (currL + currR) / 2; int valL = Sum(i * 2 + 1, currL, mid, L, R); int valR = Sum(i * 2 + 2, mid, currR, L, R); return valL + valR; } public void Update(int L, int R, int val) { Update(0, val, 0, N, L, R); } private void Update(int i, int val, int currL, int currR, int L, int R) { if (currL >= R || currR <= L) return; if (currL >= L && currR <= R) { Flag[i] = true; V[i] = val; S[i] = val * (currR - currL); return; } if (Flag[i] && currR - currL > 1) { V[i * 2 + 1] = V[i * 2 + 2] = V[i]; S[i * 2 + 1] = S[i * 2 + 2] = (currR - currL) / 2 * V[i]; Flag[i * 2 + 1] = Flag[i * 2 + 2] = true; Flag[i] = false; } int mid = (currL + currR) / 2; Update(i * 2 + 1, val, currL, mid, L, R); Update(i * 2 + 2, val, mid, currR, L, R); S[i] = S[i * 2 + 1] + S[i * 2 + 2]; } } } class Entry { static void Main() { new Program().Solve(); } } class Reader { private static TextReader reader = Console.In; private static readonly char[] separator = { ' ' }; private static readonly StringSplitOptions op = StringSplitOptions.RemoveEmptyEntries; private static string[] A = new string[0]; private static int i; private static void Init() { A = new string[0]; } public static void Set(TextReader r) { reader = r; Init(); } public static void Set(string file) { reader = new StreamReader(file); Init(); } public static bool HasNext() { return CheckNext(); } public static string String() { return Next(); } public static int Int() { return int.Parse(Next()); } public static long Long() { return long.Parse(Next()); } public static double Double() { return double.Parse(Next()); } public static int[] IntLine() { return Array.ConvertAll(Split(Line()), int.Parse); } public static int[] IntArray(int N) { return Enu.Range(0, N).Select(i => Int()).ToArray(); } public static int[][] IntTable(int H) { return Enu.Range(0, H).Select(i => IntLine()).ToArray(); } public static string[] StringArray(int N) { return Enu.Range(0, N).Select(i => Next()).ToArray(); } public static string Line() { return reader.ReadLine().Trim(); } private static string[] Split(string s) { return s.Split(separator, op); } private static string Next() { CheckNext(); return A[i++]; } private static bool CheckNext() { if (i < A.Length) return true; string line = reader.ReadLine(); if (line == null) return false; if (line == "") return CheckNext(); A = Split(line); i = 0; return true; } }