Submission #1173204

---

Source Code Expand

using System;
using System.Collections;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Text;
using System.Globalization;
using System.Diagnostics;



class Myon
{
    public Myon() { }
    public static int Main()
    {
        new Myon().calc();
        return 0;
    }

    Scanner cin;

    int D;
    int T;
    int[] C;
    int[] A;

    const int MaxTurn = 1000;
    const int MaxBox = 8;

    //A問題
    public void calc()
    {
        cin = new Scanner();
        for (int i = 0; i < MaxTurn; i++)
        {
            D = cin.nextInt();
            T = cin.nextInt();
            C = new int[MaxBox];
            A = new int[MaxBox];
            for (int j = 0; j < MaxBox; j++)
            {
                C[j] = cin.nextInt();
            }
            for (int j = 0; j < MaxBox; j++)
            {
                A[j] = cin.nextInt();
            }

            
            int[] sell = sellcheck();
            if(sell.Length > 0)
            {
                Console.WriteLine("sell {0} {1}", sell.Length, string.Join(" ", sell));
                continue;
            }

            bool cflag = false;
            for (int j = 0; j < MaxBox; j++)
            {
                if(A[j] == 0)
                {
                    Console.WriteLine("fill {0}", j + 1);
                    cflag = true;
                    break;
                }
            }
            if (cflag) continue;

            Console.WriteLine("pass");

        }
    }

    int[] pre;
    const int M = 100;

    int[] sellcheck()
    {
        pre = new int[M];
        for (int i = 0; i < M; i++)
        {
            pre[i] = -1;
        }
        pre[0] = 0;
        for (int i = 0; i < MaxBox; i++)
        {
            if (A[i] == 0) continue;
            for (int j = M - 1; j >= 0; j--)
            {
                if (pre[j] != -1 && pre[j+A[i]] == -1) pre[j + A[i]] = i;
            }
        }
        if(pre[D] == -1)
        {
            return new int[0];
        }
        List<int> ans = new List<int>();
        int now = D;
        while(now != 0)
        {
            ans.Add(pre[now] + 1);
            now -= A[pre[now]];
        }
        return ans.ToArray();
    }
}



class Scanner
{
    string[] s;
    int i;

    char[] cs = new char[] { ' ' };

    public Scanner()
    {
        s = new string[0];
        i = 0;
    }

    public string next()
    {
        if (i < s.Length) return s[i++];
        string st = Console.ReadLine();
        while (st == "") st = Console.ReadLine();
        s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
        i = 0;
        return s[i++];
    }

    public int nextInt()
    {
        return int.Parse(next());
    }

    public long nextLong()
    {
        return long.Parse(next());
    }

    public double nextDouble()
    {
        return double.Parse(next());
    }

}

Submission Info

Judge Result