結果

問題 No.1361 [Zelkova 4th Tune *] QUADRUPLE-SEQUENCEの詩
ユーザー りあんりあん
提出日時 2021-01-22 22:00:12
言語 C#(csc)
(csc 3.9.0)
結果
RE  
実行時間 -
コード長 11,283 bytes
コンパイル時間 4,395 ms
コンパイル使用メモリ 115,968 KB
実行使用メモリ 85,920 KB
最終ジャッジ日時 2024-06-08 14:50:19
合計ジャッジ時間 35,886 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 33 ms
19,584 KB
testcase_01 AC 34 ms
19,712 KB
testcase_02 AC 32 ms
19,840 KB
testcase_03 AC 34 ms
19,840 KB
testcase_04 AC 33 ms
19,456 KB
testcase_05 AC 35 ms
19,712 KB
testcase_06 AC 34 ms
19,584 KB
testcase_07 AC 34 ms
19,584 KB
testcase_08 AC 36 ms
21,248 KB
testcase_09 AC 34 ms
20,072 KB
testcase_10 AC 37 ms
21,964 KB
testcase_11 AC 37 ms
22,016 KB
testcase_12 AC 35 ms
20,608 KB
testcase_13 AC 39 ms
23,388 KB
testcase_14 AC 35 ms
20,352 KB
testcase_15 AC 41 ms
23,168 KB
testcase_16 AC 37 ms
21,028 KB
testcase_17 AC 40 ms
22,868 KB
testcase_18 AC 92 ms
27,648 KB
testcase_19 AC 56 ms
24,192 KB
testcase_20 AC 94 ms
27,776 KB
testcase_21 AC 61 ms
25,600 KB
testcase_22 AC 64 ms
25,472 KB
testcase_23 AC 83 ms
26,752 KB
testcase_24 AC 76 ms
26,752 KB
testcase_25 AC 78 ms
27,136 KB
testcase_26 AC 89 ms
27,648 KB
testcase_27 AC 67 ms
25,472 KB
testcase_28 RE -
testcase_29 AC 353 ms
43,520 KB
testcase_30 AC 328 ms
40,404 KB
testcase_31 AC 449 ms
55,364 KB
testcase_32 AC 423 ms
58,724 KB
testcase_33 AC 316 ms
43,136 KB
testcase_34 AC 466 ms
56,012 KB
testcase_35 AC 555 ms
54,280 KB
testcase_36 AC 786 ms
65,832 KB
testcase_37 AC 198 ms
38,144 KB
testcase_38 AC 440 ms
49,140 KB
testcase_39 AC 265 ms
40,832 KB
testcase_40 AC 330 ms
43,136 KB
testcase_41 AC 432 ms
50,460 KB
testcase_42 AC 756 ms
67,332 KB
testcase_43 AC 425 ms
48,796 KB
testcase_44 AC 581 ms
53,076 KB
testcase_45 AC 467 ms
50,836 KB
testcase_46 AC 503 ms
61,348 KB
testcase_47 AC 269 ms
41,088 KB
testcase_48 AC 957 ms
85,788 KB
testcase_49 AC 835 ms
85,920 KB
testcase_50 AC 953 ms
85,780 KB
testcase_51 AC 916 ms
85,780 KB
testcase_52 AC 883 ms
85,920 KB
testcase_53 AC 1,104 ms
85,728 KB
testcase_54 AC 1,077 ms
85,596 KB
testcase_55 AC 1,129 ms
85,836 KB
testcase_56 AC 1,088 ms
85,872 KB
testcase_57 AC 907 ms
85,584 KB
testcase_58 AC 584 ms
29,056 KB
testcase_59 AC 584 ms
29,056 KB
testcase_60 AC 586 ms
29,184 KB
testcase_61 AC 578 ms
29,184 KB
testcase_62 AC 587 ms
29,056 KB
testcase_63 RE -
testcase_64 RE -
testcase_65 RE -
testcase_66 RE -
testcase_67 RE -
testcase_68 RE -
testcase_69 RE -
testcase_70 AC 35 ms
19,712 KB
testcase_71 AC 35 ms
19,584 KB
testcase_72 AC 32 ms
19,840 KB
testcase_73 RE -
権限があれば一括ダウンロードができます
コンパイルメッセージ
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 k, l, m, n;
        long s;
        sc.Multi(out k, out l, out m, out n, out s);
        var a = sc.LongArr;
        var b = sc.LongArr;
        var c = sc.LongArr;
        var d = sc.LongArr;
        var ab = new long[k * l];
        var cd = new long[m * n];
        for (int i = 0; i < k; i++)
        {
            for (int j = 0; j < l; j++)
            {
                ab[i * l + j] = a[i] * b[j];
            }
        }
        for (int i = 0; i < m; i++)
        {
            for (int j = 0; j < n; j++)
            {
                cd[i * n + j] = c[i] * d[j];
            }
        }
        long x = solve(ab, cd, s);
        var ans = solve(a, b, c, d, x);
        Prt(x);
        Prt(ans);
    }
    long[] solve(long[] a, long[] b, long[] c, long[] d, long s) {
        var dic1 = new Dictionary<long, pair<long, long>>();
        foreach (var i in a)
        {
            foreach (var j in b)
            {
                dic1[i * j] = new pair<long, long>(i, j);
            }
        }
        var dic2 = new Dictionary<long, pair<long, long>>();
        foreach (var i in c)
        {
            foreach (var j in d)
            {
                dic2[i * j] = new pair<long, long>(i, j);
            }
        }
        foreach (var item in dic1)
        {
            if (s % item.Key == 0 && dic2.ContainsKey(s / item.Key)) {
                return new long[]{ item.Value.v1, item.Value.v2, dic2[s / item.Key].v1, dic2[s / item.Key].v2 };
            }
        }
        return null;
    }

    int sign(long a) {
        if (a > 0) return 1;
        else if (a == 0) return 0;
        else return -1;
    }

    long solve(long[] a, long[] b, long k) {
        Array.Sort(a);
        Array.Sort(b);
        long ng = -LM, ok = LM;
        while (ng < ok - 1) {
            long m = (ok + ng) / 2;
            long c = 0;
            int ps = -2;
            int j = -1;
            foreach (var item in a)
            {
                if (item == 0) {
                    if (m >= 0) c += b.Length;
                }
                else if (item > 0) {
                    if (ps == sign(item)) {
                        while (j > 0 && b[j - 1] * item > m) {
                            --j;
                        }
                        while (j < b.Length && b[j] * item <= m) {
                            ++j;
                        }
                    }
                    else {
                        j = b.MyBinarySearch(x => x * item <= m);
                    }
                    c += j;
                }
                else {
                    if (ps == sign(item)) {
                        while (j > 0 && b[j - 1] * item <= m) {
                            --j;
                        }
                        while (j < b.Length && b[j] * item > m) {
                            ++j;
                        }
                    }
                    else {
                        j = b.MyBinarySearch(x => x * item > m);
                    }
                    c += b.Length - j;
                }
                ps = sign(item);
            }
            if (c >= k) {
                ok = m;
            }
            else {
                ng = m;
            }
        }
        return ok;
    }
}

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 {
    public static int MyBinarySearch<T>(this IList<T> a, Func<T, bool> is_ok) {
        int ok = -1, ng = a.Count;
        while (ok < ng - 1) {
            int m = (ok + ng) >> 1;
            if (is_ok(a[m])) ok = m;
            else ng = m;
        }
        return ok + 1;
    }

    // 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