結果

問題 No.1347 HS Railway
ユーザー りあんりあん
提出日時 2021-01-16 14:27:42
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 290 ms / 2,000 ms
コード長 9,307 bytes
コンパイル時間 4,801 ms
コンパイル使用メモリ 123,236 KB
実行使用メモリ 50,620 KB
最終ジャッジ日時 2024-11-27 16:01:30
合計ジャッジ時間 14,948 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 31 ms
27,416 KB
testcase_01 AC 33 ms
27,488 KB
testcase_02 AC 36 ms
25,908 KB
testcase_03 AC 37 ms
23,604 KB
testcase_04 AC 33 ms
25,452 KB
testcase_05 AC 38 ms
27,664 KB
testcase_06 AC 38 ms
27,552 KB
testcase_07 AC 38 ms
25,772 KB
testcase_08 AC 34 ms
25,568 KB
testcase_09 AC 32 ms
27,756 KB
testcase_10 AC 37 ms
25,712 KB
testcase_11 AC 36 ms
25,620 KB
testcase_12 AC 114 ms
38,644 KB
testcase_13 AC 99 ms
32,700 KB
testcase_14 AC 65 ms
31,832 KB
testcase_15 AC 71 ms
39,280 KB
testcase_16 AC 128 ms
38,884 KB
testcase_17 AC 54 ms
29,844 KB
testcase_18 AC 188 ms
42,260 KB
testcase_19 AC 186 ms
38,300 KB
testcase_20 AC 150 ms
48,176 KB
testcase_21 AC 75 ms
42,620 KB
testcase_22 AC 190 ms
45,160 KB
testcase_23 AC 181 ms
39,796 KB
testcase_24 AC 90 ms
36,380 KB
testcase_25 AC 145 ms
37,432 KB
testcase_26 AC 186 ms
43,356 KB
testcase_27 AC 130 ms
37,700 KB
testcase_28 AC 179 ms
49,180 KB
testcase_29 AC 195 ms
45,280 KB
testcase_30 AC 172 ms
43,908 KB
testcase_31 AC 157 ms
44,408 KB
testcase_32 AC 228 ms
44,712 KB
testcase_33 AC 232 ms
48,424 KB
testcase_34 AC 232 ms
47,556 KB
testcase_35 AC 218 ms
47,640 KB
testcase_36 AC 233 ms
45,636 KB
testcase_37 AC 251 ms
45,828 KB
testcase_38 AC 270 ms
46,068 KB
testcase_39 AC 279 ms
47,340 KB
testcase_40 AC 210 ms
46,716 KB
testcase_41 AC 216 ms
44,404 KB
testcase_42 AC 274 ms
45,488 KB
testcase_43 AC 215 ms
44,588 KB
testcase_44 AC 239 ms
44,132 KB
testcase_45 AC 231 ms
43,268 KB
testcase_46 AC 246 ms
47,740 KB
testcase_47 AC 267 ms
47,392 KB
testcase_48 AC 290 ms
50,620 KB
testcase_49 AC 243 ms
45,544 KB
testcase_50 AC 269 ms
48,632 KB
testcase_51 AC 245 ms
47,360 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.Text.RegularExpressions;
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 << 28); // 256 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 = sc.Int;
        var l = new int[5];
        var r = new int[5];
        var a = new long[5][];
        for (int i = 0; i < 5; i++)
        {
            var t = sc.IntArr;
            l[i] = t[0];
            r[i] = t[1];
            t = t.Skip(2).ToArray();
            a[i] = new long[n + 1];
            for (int j = l[i]; j < r[i]; j++)
            {
                a[i][j + 1] = a[i][j] + t[j - l[i]];
            }
        }
        int m = sc.Int;
        var lis = new List<long>[5];
        for (int i = 0; i < 5; i++)
        {
            lis[i] = new List<long>();
        }
        for (int i = 0; i < m; i++)
        {
            int b, s;
            sc.Multi(out b, out s);
            --b;
            lis[b].Add(s);
        }
        for (int i = 0; i < 5; i++)
        {
            lis[i].Sort();
        }
        long ans = 0;
        for (int i = 0; i < 5; i++)
        {
            foreach (var item in lis[i])
            {
                for (int j = i + 1; j < 5; j++)
                {
                    int ll = Math.Max(l[i], l[j]);
                    int rr = Math.Min(r[i], r[j]);
                    if (ll > rr) continue;
                    long s = item + a[i][ll] - a[i][l[i]];
                    long g = s + a[i][rr] - a[i][ll];
                    long lll = g + a[j][l[j]] - a[j][rr];
                    long rrr = s + a[j][l[j]] - a[j][ll];
                    Assert(lll <= rrr);
                    ans += lis[j].UpperBound(rrr) - lis[j].LowerBound(lll);
                }
            }
        }
        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(params bool[] conds) {
        if (conds.Any(x => !x)) 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;
    public static readonly int[] dd = { 0, 1, 0, -1 };
    // static readonly string dstring = "RDLU";
    public static IEnumerable<P> adjacents(int i, int j) {
        for (int k = 0; k < 4; k++) yield return new P(i + dd[k], j + dd[k ^ 1]);
    }
    public static IEnumerable<P> adjacents(int i, int j, int h, int w)
        => adjacents(i, j).Where(p => inside(p.v1, p.v2, h, w));
    public static IEnumerable<P> adjacents(this P p) => adjacents(p.v1, p.v2);
    public static IEnumerable<P> adjacents(this P p, int h, int w) => adjacents(p.v1, p.v2, h, w);
    public static IEnumerable<int> all_subset(this int p) {
        for (int i = 0; ; i = i - p & p) {
            yield return i;
            if (i == p) break;
        }
    }
    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.SelectMany(x => x));
    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 => ReadLine.Trim();
    public string ReadLine => sr.ReadLine();
    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]);
    }
    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]);
    }
}

static class Search {
    // x より大きいの項の index のうち最小のものを返す
    // x 以下の項の index のうち最大のもの + 1 を返す
    // そこに挿入
    public static int UpperBound<T>(this IList<T> a, T x) where T : IComparable<T> {
        int le = -1, u = a.Count;
        while (le < u - 1) {
            int m = (le + u) >> 1;
            if (a[m].CompareTo(x) > 0) u = m;
            else le = m;
        }
        return le + 1;
    }
    public static int UpperBound<T>(this IList<T> a, T x, Func<T, T, int> compare) {
        int le = -1, u = a.Count;
        while (le < u - 1) {
            int m = (le + u) >> 1;
            if (compare(a[m], x) > 0) u = m;
            else le = m;
        }
        return le + 1;
    }

    // n 未満の項の index のうち最大のもの + 1 を返す
    // n 以上の項の index のうち最小のものを返す
    // そこに挿入
    public static int LowerBound<T>(this IList<T> a, T x) where T : IComparable<T> {
        int l = -1, ue = a.Count;
        while (l < ue - 1) {
            int m = (l + ue) >> 1;
            if (a[m].CompareTo(x) < 0) l = m;
            else ue = m;
        }
        return ue;
    }
    public static int LowerBound<T>(this IList<T> a, T x, Func<T, T, int> compare) {
        int l = -1, ue = a.Count;
        while (l < ue - 1) {
            int m = (l + ue) >> 1;
            if (compare(a[m], x) < 0) l = m;
            else ue = m;
        }
        return ue;
    }
}
0