結果
問題 | No.914 Omiyage |
ユーザー |
![]() |
提出日時 | 2019-10-25 21:39:05 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 33 ms / 2,000 ms |
コード長 | 5,890 bytes |
コンパイル時間 | 1,062 ms |
コンパイル使用メモリ | 116,940 KB |
実行使用メモリ | 27,716 KB |
最終ジャッジ日時 | 2024-09-24 16:26:33 |
合計ジャッジ時間 | 2,263 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 18 |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System;using System.Collections.Generic;using System.Linq;using System.IO;using System.Runtime.CompilerServices;using System.Text;using static Template;namespace SolveSpace{using static System.Console;using static System.Convert;using static System.Math;using Pi = Pair<int, int>;using Number = System.Int64;class Solver{public void Solve(){int num, m, k;Input.Make(out num, out m, out k);var ars = Input.ar2D(num);var dp = new bool[k+1];dp[0] = true;foreach(var ar in ars){var newdp = new bool[k+1];for (var j = 0; j < m; j++)for (var p = 0; p <= k; p++)if (p - ar[j] >= 0)newdp[p] |= dp[p - ar[j]];dp = newdp;}for (var i = k; i >= 0; i--)if (dp[i])Fail(k - i);WriteLine(-1);}}}#region Templatepublic class Template{[MethodImpl(MethodImplOptions.AggressiveInlining)]public static bool chmin<T>(ref T num, T val) where T : IComparable<T>{ if (num.CompareTo(val) == 1) { num = val; return true; } return false; }[MethodImpl(MethodImplOptions.AggressiveInlining)]public static bool chmax<T>(ref T num, T val) where T : IComparable<T>{ if (num.CompareTo(val) == -1) { num = val; return true; } return false; }[MethodImpl(MethodImplOptions.AggressiveInlining)]public static void swap<T>(ref T v1, ref T v2){ var t = v2; v2 = v1; v1 = t; }[MethodImpl(MethodImplOptions.AggressiveInlining)]public static T[] Create<T>(int n, Func<T> f)=> Enumerable.Repeat(0, n).Select(_ => f()).ToArray();public static void Fail() => Fail("No");public static void Fail<T>(T s) { Console.WriteLine(s); Console.Out.Close(); Environment.Exit(0); }static void Main(string[] args){var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };Console.SetOut(sw);var p = new SolveSpace.Solver();for (var i = 1; i > 0; --i)p.Solve();Console.Out.Flush();}}public class Input{public static string read => Console.ReadLine().Trim();public static int[] ar => read.Split(' ').Select(int.Parse).ToArray();public static int num => Convert.ToInt32(read);public static long[] arL => read.Split(' ').Select(long.Parse).ToArray();public static long numL => Convert.ToInt64(read);public static char[][] grid(int h)=> Create(h, () => read.ToCharArray());public static int[] ar1D(int n)=> Create(n, () => num);public static long[] arL1D(int n)=> Create(n, () => numL);public static string[] strs(int n)=> Create(n, () => read);public static int[][] ar2D(int n)=> Create(n, () => ar);public static long[][] arL2D(int n)=> Create(n, () => arL);public static List<T>[] edge<T>(int n)=> Create(n, () => new List<T>());public static void Make<T1, T2>(out T1 v1, out T2 v2){v1 = Next<T1>();v2 = Next<T2>();}public static void Make<T1, T2, T3>(out T1 v1, out T2 v2, out T3 v3){Make(out v1, out v2);v3 = Next<T3>();}public static void Make<T1, T2, T3, T4>(out T1 v1, out T2 v2, out T3 v3, out T4 v4){Make(out v1, out v2, out v3);v4 = Next<T4>();}public static void Make<T1, T2, T3, T4, T5>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5){Make(out v1, out v2, out v3, out v4);v5 = Next<T5>();}public static void Make<T1, T2, T3, T4, T5, T6>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6){Make(out v1, out v2, out v3, out v4, out v5);v6 = Next<T6>();}static Input(){sc = new Queue<string>();dic = new Dictionary<Type, Func<string, object>>();dic[typeof(int)] = s => int.Parse(s);dic[typeof(long)] = s => long.Parse(s);dic[typeof(char)] = s => char.Parse(s);dic[typeof(double)] = s => double.Parse(s);dic[typeof(uint)] = s => uint.Parse(s);dic[typeof(ulong)] = s => ulong.Parse(s);dic[typeof(string)] = s => s;}private static Dictionary<Type, Func<string, object>> dic;private static Queue<string> sc;[MethodImpl(MethodImplOptions.AggressiveInlining)]public static T Next<T>() { if (sc.Count == 0) foreach (var item in read.Split(' ')) sc.Enqueue(item); return (T)dic[typeof(T)](sc.Dequeue()); }public const int MOD = 1000000007;}public class Pair<T1, T2> : IComparable<Pair<T1, T2>>{public T1 v1;public T2 v2;public Pair() { v1 = Input.Next<T1>(); v2 = Input.Next<T2>(); }public Pair(T1 v1, T2 v2){ this.v1 = v1; this.v2 = v2; }[MethodImpl(MethodImplOptions.AggressiveInlining)]public int CompareTo(Pair<T1, T2> p){var c = Comparer<T1>.Default.Compare(v1, p.v1);if (c == 0)c = Comparer<T2>.Default.Compare(v2, p.v2);return c;}public override string ToString()=> $"{v1.ToString()} {v2.ToString()}";}public class Pair<T1, T2, T3> : Pair<T1, T2>, IComparable<Pair<T1, T2, T3>>{public T3 v3;public Pair() : base() { v3 = Input.Next<T3>(); }public Pair(T1 v1, T2 v2, T3 v3) : base(v1, v2){ this.v3 = v3; }[MethodImpl(MethodImplOptions.AggressiveInlining)]public int CompareTo(Pair<T1, T2, T3> p){var c = base.CompareTo(p);if (c == 0)c = Comparer<T3>.Default.Compare(v3, p.v3);return c;}public override string ToString()=> $"{base.ToString()} {v3.ToString()}";}#endregion