#178670 (C#(csc)) No.527 ナップサック容量問題

• 問題: No.527 ナップサック容量問題
• ユーザー: claw88
• 提出日時: 2017-06-09 22:38:05
• 言語: C#(csc) (csc 3.9.0)
• 結果: AC
• 実行時間: 92 ms / 2,000 ms
• コード長: 2,595 bytes
• コンパイル時間: 2,903 ms
• コンパイル使用メモリ: 114,824 KB
• 実行使用メモリ: 28,144 KB
• 最終ジャッジ日時: 2024-09-22 15:29:34
• 合計ジャッジ時間: 5,463 ms
• ジャッジサーバーID （参考情報）: judge1 / judge5

ファイルパターン	結果
sample	AC * 3
other	AC * 37

コンパイルメッセージ

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

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Globalization;
using System.Diagnostics;
using static System.Console;
using Pair = System.Collections.Generic.KeyValuePair<int, int>;
//using System.Numerics;
class Program
{
    static void Main()
    {
        //SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false });
        new Program().Solve();
        Out.Flush();
    }
    Scanner cin = new Scanner();
    Random rnd = new Random();
    Stopwatch sw = new Stopwatch();
    readonly int[] dd = { 0, 1, 0, -1, 0 };
    readonly int mod = 1000000007;
    readonly string alfa = "abcdefghijklmnopqrstuvwxyz";
    int MAX = 100000;
    void Solve()
    {
        int N = cin.Nextint;
        var V = new int[N];
        var W = new int[N];
        for (int i = 0; i < N; i++)
        {
            V[i] = cin.Nextint;
            W[i] = cin.Nextint;
        }
        int M = cin.Nextint;
        var dp = new int[MAX + 1];
        for (int i = 0; i < N; i++)
        {
            for (int j = MAX; j >= 0; j--)
            {
                if (j - W[i] < 0) continue;
                dp[j] = Math.Max(dp[j], dp[j - W[i]] + V[i]);
            }
        }
        int min=-1, max=-1;
     
        for (int i = 1; i <= MAX; i++)
        {
            if(min == -1 && dp[i] == M)
            {
                min = i;
            }
            else if (min != -1 && dp[i] != M)
            {
                max = i - 1;
                break;
            }                  
        }
        WriteLine(min);
        if (max == -1) WriteLine("inf");
        else WriteLine(max);
    }
}
class Scanner
{
    string[] s; int i;
    char[] cs = new char[] { ' ' };
    public Scanner() { s = new string[0]; i = 0; }
    public string[] Scan { get { return ReadLine().Split(); } }
    public int[] Scanint { get { return Array.ConvertAll(Scan, int.Parse); } }
    public long[] Scanlong { get { return Array.ConvertAll(Scan, long.Parse); } }
    public double[] Scandouble { get { return Array.ConvertAll(Scan, double.Parse); } }
    public string Next
    {
        get
        {
            if (i < s.Length) return s[i++];
            string st = ReadLine();
            while (st == "") st = ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            i = 0;
            return Next;
        }
    }
    public int Nextint { get { return int.Parse(Next); } }
    public long Nextlong { get { return long.Parse(Next); } }
    public double Nextdouble { get { return double.Parse(Next); } }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX