結果
問題 | No.393 2本の竹 |
ユーザー |
![]() |
提出日時 | 2016-07-12 11:16:49 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 288 ms / 1,000 ms |
コード長 | 3,218 bytes |
コンパイル時間 | 2,495 ms |
コンパイル使用メモリ | 110,336 KB |
実行使用メモリ | 36,560 KB |
最終ジャッジ日時 | 2024-11-08 05:39:28 |
合計ジャッジ時間 | 5,291 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 28 |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System;using System.IO;using System.Linq;using System.Text;using System.Text.RegularExpressions;using System.Collections.Generic;using System.Diagnostics;using System.Numerics;using Enu = System.Linq.Enumerable;public class Program{public void Solve(){int T = Reader.Int();for (int t = 0; t < T; t++){int L1 = Reader.Int(), L2 = Reader.Int();int N = Reader.Int();var A = Reader.IntArray(N);Console.WriteLine(Calc(L1, L2, N, A));}}private int Calc(int L1, int L2, int N, int[] A){Array.Sort(A);var dp = new int[L1 + 1];for (int i = 1; i < dp.Length; i++) dp[i] = -1;dp[L1] = L2;for (int i = 0; i < N; i++){var nextdp = new int[dp.Length];for (int r = 0; r < nextdp.Length; r++) nextdp[r] = -1;bool any = false;for (int rem = 0; rem <= L1; rem++)if (dp[rem] >= 0){if (rem >= A[i])any |= CheckMax(ref nextdp[rem - A[i]], dp[rem]);if (dp[rem] >= A[i])any |= CheckMax(ref nextdp[rem], dp[rem] - A[i]);}if (!any) return i;dp = nextdp;}return N;}bool CheckMax(ref int a, int b) { if (b > a) { a = b; return true; } return false; }}class Entry { static void Main() { new Program().Solve(); } }class Reader{static TextReader reader = Console.In;static readonly char[] separator = { ' ' };static readonly StringSplitOptions op = StringSplitOptions.RemoveEmptyEntries;static string[] A = new string[0];static int i;static void Init() { A = new string[0]; }public static void Set(TextReader r) { reader = r; Init(); }public static void Set(string file) { reader = new StreamReader(file); Init(); }public static bool HasNext() { return CheckNext(); }public static string String() { return Next(); }public static int Int() { return int.Parse(Next()); }public static long Long() { return long.Parse(Next()); }public static double Double() { return double.Parse(Next()); }public static int[] IntLine() { return Array.ConvertAll(Split(Line()), int.Parse); }public static int[] IntArray(int N) { return Range(N, Int); }public static int[][] IntTable(int H) { return Range(H, IntLine); }public static string[] StringArray(int N) { return Range(N, Next); }public static string[][] StringTable(int N) { return Range(N, () => Split(Line())); }public static string Line() { return reader.ReadLine().Trim(); }static T[] Range<T>(int N, Func<T> f) { return Enu.Range(0, N).Select(i => f()).ToArray(); }static string[] Split(string s) { return s.Split(separator, op); }static string Next() { CheckNext(); return A[i++]; }static bool CheckNext(){if (i < A.Length) return true;string line = reader.ReadLine();if (line == null) return false;if (line == "") return CheckNext();A = Split(line);i = 0;return true;}}