結果

問題 No.945 YKC饅頭
ユーザー りあんりあん
提出日時 2019-12-08 00:13:38
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 1,133 ms / 2,000 ms
コード長 7,744 bytes
コンパイル時間 5,293 ms
コンパイル使用メモリ 117,580 KB
実行使用メモリ 61,264 KB
最終ジャッジ日時 2023-08-27 07:07:32
合計ジャッジ時間 26,366 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 68 ms
20,768 KB
testcase_01 AC 69 ms
22,864 KB
testcase_02 AC 68 ms
20,820 KB
testcase_03 AC 72 ms
20,728 KB
testcase_04 AC 70 ms
20,856 KB
testcase_05 AC 69 ms
18,732 KB
testcase_06 AC 71 ms
20,780 KB
testcase_07 AC 70 ms
20,732 KB
testcase_08 AC 69 ms
20,868 KB
testcase_09 AC 68 ms
20,724 KB
testcase_10 AC 69 ms
20,700 KB
testcase_11 AC 69 ms
22,852 KB
testcase_12 AC 69 ms
22,936 KB
testcase_13 AC 70 ms
20,868 KB
testcase_14 AC 69 ms
20,820 KB
testcase_15 AC 69 ms
20,700 KB
testcase_16 AC 69 ms
20,900 KB
testcase_17 AC 71 ms
20,816 KB
testcase_18 AC 69 ms
20,876 KB
testcase_19 AC 69 ms
20,852 KB
testcase_20 AC 70 ms
20,748 KB
testcase_21 AC 70 ms
22,816 KB
testcase_22 AC 71 ms
20,916 KB
testcase_23 AC 72 ms
20,832 KB
testcase_24 AC 75 ms
22,800 KB
testcase_25 AC 70 ms
22,828 KB
testcase_26 AC 70 ms
20,856 KB
testcase_27 AC 66 ms
20,760 KB
testcase_28 AC 66 ms
20,804 KB
testcase_29 AC 65 ms
20,800 KB
testcase_30 AC 65 ms
20,832 KB
testcase_31 AC 103 ms
29,444 KB
testcase_32 AC 94 ms
33,220 KB
testcase_33 AC 215 ms
38,060 KB
testcase_34 AC 340 ms
41,004 KB
testcase_35 AC 927 ms
53,076 KB
testcase_36 AC 451 ms
44,916 KB
testcase_37 AC 368 ms
42,616 KB
testcase_38 AC 363 ms
41,160 KB
testcase_39 AC 172 ms
33,860 KB
testcase_40 AC 158 ms
36,112 KB
testcase_41 AC 106 ms
30,904 KB
testcase_42 AC 548 ms
45,192 KB
testcase_43 AC 361 ms
40,252 KB
testcase_44 AC 488 ms
48,496 KB
testcase_45 AC 531 ms
47,260 KB
testcase_46 AC 77 ms
23,032 KB
testcase_47 AC 361 ms
43,012 KB
testcase_48 AC 140 ms
25,976 KB
testcase_49 AC 254 ms
36,692 KB
testcase_50 AC 552 ms
51,028 KB
testcase_51 AC 967 ms
57,204 KB
testcase_52 AC 1,133 ms
55,092 KB
testcase_53 AC 779 ms
57,028 KB
testcase_54 AC 667 ms
55,008 KB
testcase_55 AC 1,125 ms
61,264 KB
testcase_56 AC 93 ms
33,020 KB
testcase_57 AC 90 ms
30,988 KB
testcase_58 AC 509 ms
48,204 KB
testcase_59 AC 635 ms
53,236 KB
testcase_60 AC 242 ms
42,124 KB
testcase_61 AC 557 ms
48,908 KB
testcase_62 AC 540 ms
46,844 KB
testcase_63 AC 103 ms
33,504 KB
testcase_64 AC 263 ms
41,032 KB
testcase_65 AC 222 ms
39,136 KB
testcase_66 AC 214 ms
39,184 KB
testcase_67 AC 404 ms
45,032 KB
testcase_68 AC 246 ms
40,068 KB
testcase_69 AC 142 ms
38,460 KB
testcase_70 AC 151 ms
36,420 KB
testcase_71 AC 152 ms
36,388 KB
testcase_72 AC 333 ms
47,024 KB
testcase_73 AC 597 ms
52,428 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.Collections.Generic;
using System.Linq;
using System.IO;
using System.Threading;
using System.Text;
using System.Diagnostics;
using static util;
using P = pair<int, int>;

class Program {
    static void Main(string[] args) {
        var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
        var solver = new Solver(sw);
        // var t = new Thread(solver.solve, 1 << 26); // 64 MB
        // t.Start();
        // t.Join();
        solver.solve();
        sw.Flush();
    }
}

class Solver {
    StreamWriter sw;
    Scan sc;
    void Prt(string a) => sw.WriteLine(a);
    void Prt<T>(IEnumerable<T> a) => Prt(string.Join(" ", a));
    void Prt(params object[] a) => Prt(string.Join(" ", a));
    public Solver(StreamWriter sw) {
        this.sw = sw;
        this.sc = new Scan();
    }

    public void solve() {
        int n, m;
        sc.Multi(out n, out m);
        var lis = new List<pair<int, P>>[n];
        for (int i = 0; i < n; i++)
        {
            lis[i] = new List<pair<int, P>>();
        }
        for (int i = 0; i < m; i++)
        {
            int l, r;
            char c;
            sc.Multi(out l, out r, out c);
            --l;
            int t = c == 'Y' ? 0 : c == 'K' ? 1 : 2;
            lis[l].Add(new pair<int, P>(i, new P(r, t)));
        }
        var ans = new int[3];
        var q = new PriorityQueue<pair<int, P>>(){ rev = true };
        for (int i = 0; i < n; i++)
        {
            foreach (var item in lis[i])
            {
                q.Push(item);
            }
            while (q.Count > 0 && q.Top.v2.v1 <= i) q.Pop();
            if (q.Count > 0) {
                ++ans[q.Top.v2.v2];
            }
        }
        Prt(ans);



    }
}

class pair<T, U> : IComparable<pair<T, U>> {
    public T v1;
    public U v2;
    public pair() : this(default(T), default(U)) {}
    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 readonly int M = 1000000007;
    // public static readonly int M = 998244353;
    public static readonly long LM = 1L << 60;
    public static readonly double eps = 1e-11;
    public static void DBG(string a) => Console.Error.WriteLine(a);
    public static void DBG<T>(IEnumerable<T> a) => DBG(string.Join(" ", a));
    public static void DBG(params object[] a) => DBG(string.Join(" ", a));
    public static void Assert(bool cond) { if (!cond) throw new Exception(); }
    public static pair<T, U> make_pair<T, U>(T v1, U v2) => new pair<T, U>(v1, v2);
    public static int CompareList<T>(IList<T> a, IList<T> b) where T : IComparable<T> {
        for (int i = 0; i < a.Count && i < b.Count; i++)
            if (a[i].CompareTo(b[i]) != 0) return a[i].CompareTo(b[i]);
        return a.Count.CompareTo(b.Count);
    }
    public static bool inside(int i, int j, int h, int w) => i >= 0 && i < h && j >= 0 && j < w;
    static readonly int[] dd = { 0, 1, 0, -1 };
    // static readonly string dstring = "RDLU";
    public static P[] adjacents(int i, int j)
        => Enumerable.Range(0, dd.Length).Select(k => new P(i + dd[k], j + dd[k ^ 1])).ToArray();
    public static P[] adjacents(int i, int j, int h, int w)
        => Enumerable.Range(0, dd.Length).Select(k => new P(i + dd[k], j + dd[k ^ 1]))
                                         .Where(p => inside(p.v1, p.v2, h, w)).ToArray();
    public static P[] adjacents(this P p) => adjacents(p.v1, p.v2);
    public static P[] adjacents(this P p, int h, int w) => adjacents(p.v1, p.v2, h, w);
    public static Dictionary<T, int> compress<T>(this IEnumerable<T> a)
        => a.Distinct().OrderBy(v => v).Select((v, i) => new { v, i }).ToDictionary(p => p.v, p => p.i);
    public static Dictionary<T, int> compress<T>(params IEnumerable<T>[] a) => compress(a.Aggregate(Enumerable.Union));
    public static T[] inv<T>(this Dictionary<T, int> dic) {
        var res = new T[dic.Count];
        foreach (var item in dic) res[item.Value] = item.Key;
        return res;
    }
    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;
    }
}

class Scan {
    StreamReader sr;
    public Scan() { sr = new StreamReader(Console.OpenStandardInput()); }
    public Scan(string path) { sr = new StreamReader(path); }
    public int Int => int.Parse(Str);
    public long Long => long.Parse(Str);
    public double Double => double.Parse(Str);
    public string Str => sr.ReadLine().Trim();
    public pair<T, U> Pair<T, U>() {
        T a; U b;
        Multi(out a, out b);
        return new pair<T, U>(a, b);
    }
    public P P => Pair<int, int>();
    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]); }
}

// the greatest element pops
class PriorityQueue<T> {
    List<T> buf;
    public bool rev = false;
    Func<int, int, int> cmp;
    public PriorityQueue() {
        buf = new List<T>();
        cmp = (i, j) => Comparer<T>.Default.Compare(buf[i], buf[j]) * (rev ? -1 : 1);
    }
    public PriorityQueue(Func<T, T, int> cmp) {
        buf = new List<T>();
        this.cmp = (i, j) => cmp(buf[i], buf[j]);
    }
    void swap(int i, int j) { var t = buf[i]; buf[i] = buf[j]; buf[j] = t; }
    public void Push(T elem) {
        int n = buf.Count;
        buf.Add(elem);
        while (n > 0) {
            int i = (n - 1) >> 1;
            if (cmp(n, i) <= 0) break;
            swap(i, n);
            n = i;
        }
    }
    public T Pop() {
        T ret = buf[0];
        int n = buf.Count - 1;
        buf[0] = buf[n];
        buf.RemoveAt(n);
        for (int i = 0, j; (j = (i << 1) | 1) < n; i = j) {
            if (j != n - 1 && cmp(j, j + 1) < 0) ++j;
            if (cmp(i, j) < 0) swap(i, j);
            else break;
        }
        return ret;
    }
    public T Top => buf[0];
    public int Count => buf.Count;
}
0