#418682 (C#(csc)) No.974 最後の日までに

提出ソース

結果

問題	No.974 最後の日までに
ユーザー	りあん
提出日時	2020-01-17 21:58:05
言語	C#(csc) (csc 3.9.0)
結果	AC
実行時間	965 ms / 2,000 ms
コード長	11,765 bytes
コンパイル時間	1,354 ms
コンパイル使用メモリ	121,344 KB
実行使用メモリ	48,124 KB
最終ジャッジ日時	2024-10-04 01:24:54
合計ジャッジ時間	36,191 ms
ジャッジサーバーID （参考情報）	judge4 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	809 ms 47,332 KB
testcase_01	AC	885 ms 48,024 KB
testcase_02	AC	885 ms 48,036 KB
testcase_03	AC	881 ms 47,944 KB
testcase_04	AC	880 ms 47,900 KB
testcase_05	AC	892 ms 47,832 KB
testcase_06	AC	888 ms 47,820 KB
testcase_07	AC	895 ms 47,828 KB
testcase_08	AC	881 ms 47,820 KB
testcase_09	AC	876 ms 47,828 KB
testcase_10	AC	873 ms 47,836 KB
testcase_11	AC	869 ms 47,828 KB
testcase_12	AC	865 ms 47,952 KB
testcase_13	AC	878 ms 48,124 KB
testcase_14	AC	875 ms 47,948 KB
testcase_15	AC	880 ms 48,124 KB
testcase_16	AC	862 ms 48,120 KB
testcase_17	AC	965 ms 47,852 KB
testcase_18	AC	965 ms 47,988 KB
testcase_19	AC	962 ms 47,844 KB
testcase_20	AC	965 ms 47,844 KB
testcase_21	AC	961 ms 47,716 KB
testcase_22	AC	957 ms 47,712 KB
testcase_23	AC	962 ms 47,744 KB
testcase_24	AC	947 ms 47,728 KB
testcase_25	AC	33 ms 19,456 KB
testcase_26	AC	33 ms 19,328 KB
testcase_27	AC	699 ms 42,880 KB
testcase_28	AC	898 ms 47,960 KB
testcase_29	AC	26 ms 18,944 KB
testcase_30	AC	961 ms 47,840 KB
testcase_31	AC	25 ms 19,072 KB
testcase_32	AC	26 ms 18,816 KB
testcase_33	AC	522 ms 42,880 KB
testcase_34	AC	893 ms 47,864 KB
testcase_35	AC	33 ms 19,200 KB
testcase_36	AC	33 ms 19,712 KB
testcase_37	AC	962 ms 46,572 KB
testcase_38	AC	27 ms 19,072 KB
testcase_39	AC	33 ms 19,584 KB
testcase_40	AC	702 ms 42,624 KB
testcase_41	AC	892 ms 47,584 KB
testcase_42	AC	951 ms 47,864 KB
testcase_43	AC	944 ms 47,736 KB
testcase_44	AC	742 ms 42,752 KB
testcase_45	AC	548 ms 42,880 KB
testcase_46	AC	33 ms 19,456 KB
testcase_47	AC	34 ms 19,456 KB
testcase_48	AC	32 ms 19,456 KB
testcase_49	AC	33 ms 19,456 KB
testcase_50	AC	32 ms 19,584 KB
testcase_51	AC	32 ms 19,200 KB

権限があれば一括ダウンロードができます

コンパイルメッセージ

Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

raw source code

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() {
        // var rnd = new Random();
        // int w = 52;
        int w = sc.Int;
        if (w <= 2) {
            Prt(0);
            return;
        }
        var a = new long[w][];
        for (int i = 0; i < w; i++)
        {
            // a[i] = new long[3];
            // for (int j = 0; j < 3; j++)
            // {
            //     a[i][j] = rnd.Next();
            // }
            a[i] = sc.LongArr;
        }
        long ans = 0;
        {
            int w1 = w / 2;
            int w2 = w - w1;
            var l1 = new List<pair<long, long>>();
            for (int i = 0; i < (1 << w1); i += 2)
            {
                if ((i & (i >> 1)) != 0) continue;
                long x = 0, y = 0;
                for (int j = 0; j < w1; j++)
                {
                    // if (j > 0 && ((i >> j) & 1) == 1 && ((i >> (j - 1)) & 1) == 1) {
                    //     goto A;
                    // }
                    if (((i >> j) & 1) == 1) {
                        x -= a[j][2];
                        y += a[j][1];
                    }
                    else if (j == w1 - 1 || ((i >> (j + 1)) & 1) == 0) {
                        x += a[j][0];
                    }
                }
                l1.Add(new pair<long, long>(x, y));
                // A: continue;
            }
            l1.Sort();
            l1.Reverse();
            var nl1 = new List<pair<long, long>>();
            foreach (var item in l1)
            {
                if (nl1.Count == 0 || nl1.Last().v2 < item.v2) {
                    nl1.Add(item);
                }
            }
            l1 = nl1;

            var l2 = new List<pair<long, long>>();
            for (int i = 0; i < (1 << w2); i += 2)
            {
                if ((i & (i >> 1)) != 0) continue;
                long x = 0, y = 0;
                for (int j = 0; j < w2; j++)
                {
                    // if (j > 0 && ((i >> j) & 1) == 1 && ((i >> (j - 1)) & 1) == 1) {
                    //     goto A;
                    // }
                    if (((i >> j) & 1) == 1) {
                        x -= a[w1 + j][2];
                        y += a[w1 + j][1];
                    }
                    else if (j == w2 - 1 || ((i >> (j + 1)) & 1) == 0) {
                        x += a[w1 + j][0];
                    }
                }
                l2.Add(new pair<long, long>(x, y));
                // A: continue;
            }
            l2.Sort();
            l2.Reverse();
            var nl2 = new List<pair<long, long>>();
            foreach (var item in l2)
            {
                if (nl2.Count == 0 || nl2.Last().v2 < item.v2) {
                    nl2.Add(item);
                }
            }
            l2 = nl2;

            {
                int j = l2.Count - 1;
                for (int i = 0; i < l1.Count; i++)
                {
                    while (j >= 0 && nl1[i].v1 + nl2[j].v1 < 0) {
                        --j;
                    }
                    if (j >= 0) {
                        ans = Math.Max(ans, nl1[i].v2 + nl2[j].v2);
                    }
                    else break;
                }
            }
        }
        {
            int w1 = (w - 2) / 2;
            int w2 = w - 2 - w1;
            var l1 = new List<pair<long, long>>();
            for (int i = 0; i < (1 << w1); i += 2)
            {
                if ((i & (i >> 1)) != 0) continue;
                long x = 0, y = 0;
                for (int j = 0; j < w1; j++)
                {
                    // if (j > 0 && ((i >> j) & 1) == 1 && ((i >> (j - 1)) & 1) == 1) {
                    //     goto A;
                    // }
                    if (((i >> j) & 1) == 1) {
                        x -= a[j][2];
                        y += a[j][1];
                    }
                    else if (j == w1 - 1 || ((i >> (j + 1)) & 1) == 0) {
                        x += a[j][0];
                    }
                }
                l1.Add(new pair<long, long>(x, y));
                // A: continue;
            }
            l1.Sort();
            l1.Reverse();
            var nl1 = new List<pair<long, long>>();
            foreach (var item in l1)
            {
                if (nl1.Count == 0 || nl1.Last().v2 < item.v2) {
                    nl1.Add(item);
                }
            }
            l1 = nl1;

            var l2 = new List<pair<long, long>>();
            for (int i = 0; i < (1 << w2); i += 2)
            {
                if ((i & (i >> 1)) != 0) continue;
                long x = 0, y = 0;
                for (int j = 0; j < w2; j++)
                {
                    // if (j > 0 && ((i >> j) & 1) == 1 && ((i >> (j - 1)) & 1) == 1) {
                    //     goto A;
                    // }
                    if (((i >> j) & 1) == 1) {
                        x -= a[w1 + 2 + j][2];
                        y += a[w1 + 2 + j][1];
                    }
                    else if (j == w2 - 1 || ((i >> (j + 1)) & 1) == 0) {
                        x += a[w1 + 2 + j][0];
                    }
                }
                l2.Add(new pair<long, long>(x, y));
                // A: continue;
            }
            l2.Sort();
            l2.Reverse();
            var nl2 = new List<pair<long, long>>();
            foreach (var item in l2)
            {
                if (nl2.Count == 0 || nl2.Last().v2 < item.v2) {
                    nl2.Add(item);
                }
            }
            l2 = nl2;

            int mid = w1 + 1;

            {
                int j = l2.Count - 1;
                for (int i = 0; i < l1.Count; i++)
                {
                    while (j >= 0 && nl1[i].v1 + nl2[j].v1 - a[mid][2] < 0) {
                        --j;
                    }
                    if (j >= 0) {
                        ans = Math.Max(ans, nl1[i].v2 + nl2[j].v2 + a[mid][1]);
                    }
                    else break;
                }
            }
        }
        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]); }
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード