結果

問題 No.2869 yuusaan's Knapsacks
ユーザー KumaTachiRenKumaTachiRen
提出日時 2024-08-30 22:13:53
言語 C#
(.NET 8.0.203)
結果
AC  
実行時間 2,328 ms / 4,500 ms
コード長 7,299 bytes
コンパイル時間 7,609 ms
コンパイル使用メモリ 167,464 KB
実行使用メモリ 198,508 KB
最終ジャッジ日時 2024-08-30 22:14:36
合計ジャッジ時間 37,137 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 47 ms
28,136 KB
testcase_01 AC 42 ms
24,172 KB
testcase_02 AC 46 ms
27,904 KB
testcase_03 AC 686 ms
32,764 KB
testcase_04 AC 716 ms
32,892 KB
testcase_05 AC 47 ms
28,160 KB
testcase_06 AC 1,960 ms
38,708 KB
testcase_07 AC 741 ms
33,020 KB
testcase_08 AC 218 ms
30,592 KB
testcase_09 AC 196 ms
30,720 KB
testcase_10 AC 1,031 ms
34,844 KB
testcase_11 AC 495 ms
31,616 KB
testcase_12 AC 1,726 ms
37,424 KB
testcase_13 AC 494 ms
31,480 KB
testcase_14 AC 905 ms
33,532 KB
testcase_15 AC 813 ms
33,272 KB
testcase_16 AC 976 ms
34,072 KB
testcase_17 AC 2,328 ms
38,956 KB
testcase_18 AC 1,683 ms
36,648 KB
testcase_19 AC 1,283 ms
35,352 KB
testcase_20 AC 198 ms
30,464 KB
testcase_21 AC 1,449 ms
35,996 KB
testcase_22 AC 1,627 ms
35,460 KB
testcase_23 AC 545 ms
32,128 KB
testcase_24 AC 1,925 ms
37,424 KB
testcase_25 AC 327 ms
30,976 KB
testcase_26 AC 1,806 ms
35,744 KB
testcase_27 AC 48 ms
27,888 KB
testcase_28 AC 1,916 ms
38,560 KB
testcase_29 AC 1,989 ms
198,508 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
  復元対象のプロジェクトを決定しています...
  /home/judge/data/code/main.csproj を復元しました (93 ms)。
MSBuild のバージョン 17.9.6+a4ecab324 (.NET)
  main -> /home/judge/data/code/bin/Release/net8.0/main.dll
  main -> /home/judge/data/code/bin/Release/net8.0/publish/

ソースコード

diff # 

using Lib;
using System;
using System.Collections.Generic;
using System.Diagnostics;
using System.IO;
using System.Linq;
using System.Runtime.CompilerServices;
using System.Text;
using static Lib.OutputLib;
public class Solver
{
    const bool MultiTestCase = false;
    void Solve()
    {
        int n = ri, m = ri;
        var es = new long[n];
        for (int i = 0; i < n; i++) es[i] = ri;
        Array.Reverse(es);

        var vw = new (int v, long w)[m];
        for (int i = 0; i < m; i++) vw[i] = (ri, ri);
        var svw = new (int v, long w)[1 << m];
        for (int bit = 0; bit < (1 << m); bit++)
        {
            int sv = 0; long sw = 0;
            for (int i = 0; i < m; i++)
                if (((bit >> i) & 1) == 1)
                {
                    sv += vw[i].v;
                    sw += vw[i].w;
                }
            svw[bit] = (sv, sw);
        }

        var dp = new int[n + 1, 1 << m];
        var prv = new int[n + 1, 1 << m];
        for (int i = 0; i < n; i++)
        {
            long e = es[i];
            for (int bit = (1 << m) - 1; bit >= 0; bit--)
            {
                dp[i + 1, bit] = dp[i, bit];
                prv[i + 1, bit] = 0;
                for (int sub = bit; sub > 0; sub = (sub - 1) & bit)
                {
                    var (sv, sw) = svw[sub];
                    int nv = sv + dp[i, bit ^ sub];
                    if (sw <= e && dp[i + 1, bit] < nv)
                    {
                        dp[i + 1, bit] = nv;
                        prv[i + 1, bit] = sub;
                    }
                }
            }
        }

        {
            int bit = (1 << m) - 1;
            Write(dp[n, bit]);
            for (int i = n; i > 0; i--)
            {
                int sub = prv[i, bit];
                var tmp = new List<int>();
                for (int j = 0; j < m; j++) if (((sub >> j) & 1) == 1) tmp.Add(j + 1);
                tmp.Insert(0, tmp.Count);
                WriteJoin(" ", tmp);
                bit ^= sub;
            }
        }
    }

#pragma warning disable CS0162
    public Solver() { if (!MultiTestCase) Solve(); else for (int t = ri; t > 0; t--) Solve(); }
#pragma warning restore CS0162

    const int IINF = 1 << 30;
    const long INF = 1L << 60;
    int ri { [MethodImpl(256)] get => (int)sc.Integer(); }
    long rl { [MethodImpl(256)] get => sc.Integer(); }
    uint rui { [MethodImpl(256)] get => (uint)sc.UInteger(); }
    ulong rul { [MethodImpl(256)] get => sc.UInteger(); }
    double rd { [MethodImpl(256)] get => sc.Double(); }
    string rs { [MethodImpl(256)] get => sc.Scan(); }
    string rline { [MethodImpl(256)] get => sc.Line(); }
    public StreamScanner sc = new StreamScanner(Console.OpenStandardInput());
    void ReadArray(out int[] a, int n) { a = new int[n]; for (int i = 0; i < a.Length; i++) a[i] = ri; }
    void ReadArray(out long[] a, int n) { a = new long[n]; for (int i = 0; i < a.Length; i++) a[i] = rl; }
    void ReadArray<T>(out T[] a, int n, Func<T> read) { a = new T[n]; for (int i = 0; i < a.Length; i++) a[i] = read(); }
    void ReadArray<T>(out T[] a, int n, Func<int, T> read) { a = new T[n]; for (int i = 0; i < a.Length; i++) a[i] = read(i); }
}

static class Program
{
    static public void Main(string[] args)
    {
        SourceExpander.Expander.Expand();
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver();
        Console.Out.Flush();
    }
}
#region Expanded by https://github.com/kzrnm/SourceExpander
namespace Lib{public partial class StreamScanner{public int[][]ReadUnweightedTree(int n,int origin=1){var gr=new List<int>[n];for(int i=0;i<n;i++)gr[i]=new List<int>();for(int i=0;i<n-1;i++){int u=(int)(Integer()-origin);int v=(int)(Integer()-origin);gr[u].Add(v);gr[v].Add(u);}var g=new int[n][];for(int i=0;i<n;i++)g[i]=gr[i].ToArray();return g;}}}
namespace Lib{public partial class StreamScanner{public StreamScanner(Stream stream){str=stream;}private readonly Stream str;private readonly byte[]buf=new byte[1024];private int len,ptr;public bool isEof=false;public bool IsEndOfStream{get{return isEof;}}[MethodImpl(256)]private byte Read(){if(isEof)throw new EndOfStreamException();if(ptr>=len){ptr=0;if((len=str.Read(buf,0,1024))<=0){isEof=true;return 0;}}return buf[ptr++];}[MethodImpl(256)]public char Char(){byte b=0;do b=Read();while(b<33||126<b);return(char)b;}[MethodImpl(256)]public string Line(){var sb=new StringBuilder();for(var b=Char();b!=10&&!isEof;b=(char)Read())sb.Append(b);return sb.ToString();}[MethodImpl(256)]public string Scan(){var sb=new StringBuilder();for(var b=Char();b>=33&&b<=126;b=(char)Read())sb.Append(b);return sb.ToString();}[MethodImpl(256)]public long Integer(){long ret=0;byte b=0;var ng=false;do b=Read();while(b!='-'&&(b<'0'||'9'<b));if(b=='-'){ng=true;b=Read();}for(;true;b=Read()){if(b<'0'||'9'<b)return ng?-ret:ret;else ret=ret*10+b-'0';}}[MethodImpl(256)]public ulong UInteger(){ulong ret=0;byte b=0;do b=Read();while(b<'0'||'9'<b);for(;true;b=Read()){if(b<'0'||'9'<b)return ret;else ret=ret*10+b-'0';}}[MethodImpl(256)]public double Double()=>double.Parse(Scan());}}
namespace Lib{public static class OutputLib{[MethodImpl(256)]public static void WriteJoin<T>(string s,IEnumerable<T>t)=>Console.WriteLine(string.Join(s,t));[MethodImpl(256)]public static void WriteMat<T>(T[,]a,string sep=" "){int sz1=a.GetLength(0),sz2=a.GetLength(1);var b=new T[sz2];for(int i=0;i<sz1;i++){for(int j=0;j<sz2;j++)b[j]=a[i,j];WriteJoin(sep,b);}}[MethodImpl(256)]public static void WriteMat<T>(T[][]a,string sep=" "){for(int i=0;i<a.Length;i++)WriteJoin(sep,a[i]);}[MethodImpl(256)]public static void WriteMat<T>(T[][]a,Func<T,string>map,string sep=" "){for(int i=0;i<a.Length;i++)WriteJoin(sep,a[i].Select(x=>map(x)));}[MethodImpl(256)]public static void Write(object t)=>Console.WriteLine(t.ToString());[MethodImpl(256)]public static void Write(params object[]arg)=>Console.WriteLine(string.Join(" ",arg.Select(x=>x.ToString())));[MethodImpl(256)]public static void Write(string str)=>Console.WriteLine(str);[MethodImpl(256)]public static void WriteFlush(object t){Console.WriteLine(t.ToString());Console.Out.Flush();}[MethodImpl(256)]public static void WriteError(object t)=>Console.Error.WriteLine(t.ToString());[MethodImpl(256)]public static void Flush()=>Console.Out.Flush();[MethodImpl(256)]public static void YN(bool t)=>Console.WriteLine(t?"YES":"NO");[MethodImpl(256)]public static void Yn(bool t)=>Console.WriteLine(t?"Yes":"No");[MethodImpl(256)]public static void yn(bool t)=>Console.WriteLine(t?"yes":"no");[MethodImpl(256)]public static void DeleteLine()=>Console.Write("\x1b[1A\x1b[2K");[MethodImpl(256)]public static void ProgressBar(long now,long total,int blocks=50){int x=(int)((2*now*blocks+1)/(2*total));Console.Write($"\x1b[G[\x1b[42m{string.Concat(Enumerable.Repeat("_",x))}\x1b[0m{string.Concat(Enumerable.Repeat("_",blocks-x))}] : {now} / {total}");}}}
namespace SourceExpander{public class Expander{[Conditional("EXP")]public static void Expand(string inputFilePath=null,string outputFilePath=null,bool ignoreAnyError=true){}public static string ExpandString(string inputFilePath=null,bool ignoreAnyError=true){return "";}}}
#endregion Expanded by https://github.com/kzrnm/SourceExpander
0