結果

問題 No.15 カタログショッピング
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2015-01-17 15:32:42
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 71 ms / 5,000 ms
コード長 7,741 bytes
コンパイル時間 3,160 ms
コンパイル使用メモリ 119,888 KB
実行使用メモリ 32,628 KB
最終ジャッジ日時 2024-06-22 17:50:07
合計ジャッジ時間 4,707 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 24 ms
23,812 KB
testcase_01 AC 26 ms
24,040 KB
testcase_02 AC 25 ms
24,072 KB
testcase_03 AC 26 ms
25,872 KB
testcase_04 AC 25 ms
22,064 KB
testcase_05 AC 65 ms
28,276 KB
testcase_06 AC 66 ms
28,528 KB
testcase_07 AC 70 ms
32,628 KB
testcase_08 AC 71 ms
28,536 KB
testcase_09 AC 69 ms
28,404 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff # 

using System;
using System.Linq;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
//using System.Numerics;
namespace Program
{
    public class Solver
    {
        public void Solve()
        {
            var n = sc.Integer();
            var s = sc.Long();
            var m = n / 2;
            var k = n - m;
            var a = sc.Long(m);
            var b = sc.Long(k);
            var val = new long[1 << k];
            var id = new long[1 << k];
            for (int i = 0; i < 1 << k; i++)
            {
                for (int j = 0; j < k; j++)
                    if (((i >> j) & 1) == 1) val[i] += b[j];
                id[i] = i;
            }
            Array.Sort(val, id);
            var ans = new List<long>();
            for (int i = 0; i < 1 << m; i++)
            {
                long v = 0;
                for (int j = 0; j < m; j++)
                    if (((i >> j) & 1) == 1) v += a[j];
                if (v > s) continue;
                var p = val.LowerBound(s - v);
                var q = val.UpperBound(s - v);
                for (int j = p; j < q; j++)
                    ans.Add(i + (id[j] << m));
            }
            ans.Sort((l, r) =>
                {
                    for (int i = 0; i <= 32; i++)
                    {
                        if ((((l >> i)) & 1) == 0 && (((r >> i) & 1) == 1))
                            return 1;
                        if ((((l >> i) & 1) == 1) && (((r >> i) & 1) == 0))
                            return -1;
                    }
                    return 0;
                });
            foreach (var x in ans)
            {
                var buf = new List<int>();
                for (int i = 0; i <= 32; i++)
                    if (((x >> i) & 1) == 1) buf.Add(i + 1);
                IO.Printer.Out.WriteLine(buf.AsJoinedString());
            }
        }
        internal IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());
        static T[] Enumerate<T>(int n, Func<T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(); return a; }
        static T[] Enumerate<T>(int n, Func<int, T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; }
    }
}

#region Ex
namespace Program.IO
{
    using System.IO;
    using System.Linq;
    public class Printer : StreamWriter
    {
        static Printer()
        {
            Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false };
        }
        public static Printer Out { get; set; }
        public override IFormatProvider FormatProvider { get { return System.Globalization.CultureInfo.InvariantCulture; } }
        public Printer(System.IO.Stream stream) : base(stream, new System.Text.UTF8Encoding(false, true)) { }
        public void Write<T>(string format, IEnumerable<T> source) { base.Write(format, source.OfType<object>().ToArray()); }
        public void WriteLine<T>(string format, IEnumerable<T> source) { base.WriteLine(format, source.OfType<object>().ToArray()); }
    }
    public 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; } }
        private byte read()
        {
            if (isEof) return 0;
            if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } }
            return buf[ptr++];
        }
        public char Char() { byte b = 0; do b = read(); while (b < 33 || 126 < b); return (char)b; }
        public char[] Char(int n) { var a = new char[n]; for (int i = 0; i < n; i++) a[i] = Char(); return a; }
        public string Scan()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b >= 33 && b <= 126; b = (char)read())
                sb.Append(b);
            return sb.ToString();
        }
        public long Long()
        {
            if (isEof) return long.MinValue;
            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';
            }
        }
        public int Integer() { return (isEof) ? int.MinValue : (int)Long(); }
        public double Double() { return double.Parse(Scan(), System.Globalization.CultureInfo.InvariantCulture); }
        private T[] enumerate<T>(int n, Func<T> f)
        {
            var a = new T[n];
            for (int i = 0; i < n; ++i) a[i] = f();
            return a;
        }

        public string[] Scan(int n) { return enumerate(n, Scan); }
        public double[] Double(int n) { return enumerate(n, Double); }
        public int[] Integer(int n) { return enumerate(n, Integer); }
        public long[] Long(int n) { return enumerate(n, Long); }
        public void Flush() { str.Flush(); }

    }
}
static class Ex
{
    static public string AsString(this IEnumerable<char> ie) { return new string(System.Linq.Enumerable.ToArray(ie)); }
    static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") { return string.Join(st, ie); }
    static public void Main()
    {
        var solver = new Program.Solver();
        solver.Solve();
        Program.IO.Printer.Out.Flush();
    }
}
#endregion
#region BinarySearch for Array
static public partial class Algorithm
{

    static private int binarySearch<T>(this T[] a, int idx, int len, T v, Comparison<T> cmp, bool islb)
    {
        int l = idx;
        int h = idx + len - 1;
        while (l <= h)
        {
            int i = l + ((h - l) >> 1);
            int ord;
            if (a[i] == null || v == null) return -1;
            else ord = cmp(a[i], v);
            if (ord < 0) l = i + 1;
            else if (ord == 0)
            {
                if (!islb) l = i + 1;
                else h = i - 1;
            }
            else h = i - 1;
        }

        return l;
    }
    static public int UpperBound<T>(this T[] a, int idx, int len, T v, Comparison<T> cmp) { return binarySearch(a, idx, len, v, cmp, false); }
    static public int UpperBound<T>(this T[] a, int idx, int len, T v) where T : IComparable<T> { return UpperBound(a, idx, len, v, Comparer<T>.Default.Compare); }
    static public int UpperBound<T>(this T[] a, T v) where T : IComparable<T> { return UpperBound(a, 0, a.Length, v, Comparer<T>.Default.Compare); }
    static public int UpperBound<T>(this T[] a, T v, IComparer<T> cmp) { return UpperBound(a, 0, a.Length, v, cmp.Compare); }
    static public int UpperBound<T>(this T[] a, T v, Comparison<T> cmp) { return UpperBound(a, 0, a.Length, v, cmp); }

    static public int LowerBound<T>(this T[] a, int idx, int len, T value, Comparison<T> cmp) { return binarySearch(a, idx, len, value, cmp, true); }
    static public int LowerBound<T>(this T[] a, int idx, int len, T value) where T : IComparable<T> { return LowerBound(a, idx, len, value, Comparer<T>.Default.Compare); }
    static public int LowerBound<T>(this T[] a, T val) where T : IComparable<T> { return LowerBound(a, 0, a.Length, val, Comparer<T>.Default.Compare); }
    static public int LowerBound<T>(this T[] a, T val, IComparer<T> cmp) { return LowerBound(a, 0, a.Length, val, cmp.Compare); }
    static public int LowerBound<T>(this T[] a, T v, Comparison<T> cmp) { return LowerBound(a, 0, a.Length, v, cmp); }
}
#endregion
0