結果
問題 | No.288 貯金箱の仕事 |
ユーザー | 紙ぺーぱー |
提出日時 | 2015-10-09 23:55:32 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 5,316 bytes |
コンパイル時間 | 1,231 ms |
コンパイル使用メモリ | 112,000 KB |
実行使用メモリ | 20,736 KB |
最終ジャッジ日時 | 2024-07-20 04:49:44 |
合計ジャッジ時間 | 22,073 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 51 ms
20,480 KB |
testcase_01 | AC | 44 ms
20,608 KB |
testcase_02 | AC | 46 ms
20,352 KB |
testcase_03 | AC | 42 ms
20,480 KB |
testcase_04 | AC | 45 ms
20,736 KB |
testcase_05 | AC | 22 ms
17,280 KB |
testcase_06 | AC | 22 ms
17,408 KB |
testcase_07 | AC | 136 ms
20,480 KB |
testcase_08 | WA | - |
testcase_09 | AC | 115 ms
20,608 KB |
testcase_10 | AC | 121 ms
20,480 KB |
testcase_11 | AC | 75 ms
20,608 KB |
testcase_12 | AC | 112 ms
20,352 KB |
testcase_13 | WA | - |
testcase_14 | AC | 110 ms
20,736 KB |
testcase_15 | AC | 129 ms
20,736 KB |
testcase_16 | AC | 117 ms
20,608 KB |
testcase_17 | AC | 95 ms
20,480 KB |
testcase_18 | AC | 79 ms
20,608 KB |
testcase_19 | WA | - |
testcase_20 | AC | 70 ms
20,608 KB |
testcase_21 | AC | 76 ms
20,608 KB |
testcase_22 | AC | 115 ms
20,736 KB |
testcase_23 | AC | 986 ms
20,736 KB |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | AC | 283 ms
20,608 KB |
testcase_31 | AC | 280 ms
20,736 KB |
testcase_32 | AC | 517 ms
20,480 KB |
testcase_33 | AC | 519 ms
20,736 KB |
testcase_34 | AC | 754 ms
20,608 KB |
testcase_35 | AC | 749 ms
20,608 KB |
testcase_36 | AC | 986 ms
20,608 KB |
testcase_37 | AC | 308 ms
20,480 KB |
testcase_38 | AC | 696 ms
20,736 KB |
testcase_39 | WA | - |
testcase_40 | AC | 363 ms
20,608 KB |
testcase_41 | AC | 950 ms
20,608 KB |
testcase_42 | AC | 829 ms
20,736 KB |
testcase_43 | AC | 592 ms
20,480 KB |
testcase_44 | AC | 428 ms
20,736 KB |
testcase_45 | AC | 770 ms
20,480 KB |
testcase_46 | AC | 841 ms
20,480 KB |
testcase_47 | WA | - |
testcase_48 | AC | 618 ms
20,608 KB |
testcase_49 | AC | 388 ms
20,480 KB |
testcase_50 | AC | 497 ms
20,608 KB |
testcase_51 | AC | 367 ms
20,480 KB |
testcase_52 | AC | 508 ms
20,480 KB |
testcase_53 | AC | 653 ms
20,608 KB |
testcase_54 | AC | 462 ms
20,736 KB |
testcase_55 | AC | 46 ms
20,352 KB |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System; using System.Linq; using System.Diagnostics; 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 m = sc.Long(); var a = sc.Long(n); var k = sc.Long(n); var v = m; for (int i = 0; i < n; i++) { v -= a[i] * k[i]; } if (v > 0) { IO.Printer.Out.WriteLine(-1); return; } v = -v; if (v != 0 && v < a[0]) { IO.Printer.Out.WriteLine(-1); return; } var dp = Enumerate(500050, x => 1L << 56); dp[0] = 0; foreach (var x in a) { for (int j = 0; j + x < 500050; j++) dp[j + x] = Math.Min(dp[j + x], dp[j] + 1); } var min = 1L << 56; for (int i = 1; i < 500050; i++) { var otaku = v / i; min = Math.Min(min, dp[i] * otaku + dp[v % i]); } if (min >= 1L << 56) min = -1; IO.Printer.Out.WriteLine(min); } public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput()); 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; } static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; } } } #region main 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 Ex namespace Program.IO { using System.IO; using System.Text; using System.Globalization; 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 CultureInfo.InvariantCulture; } } public Printer(System.IO.Stream stream) : base(stream, new UTF8Encoding(false, true)) { } public Printer(System.IO.Stream stream, Encoding encoding) : base(stream, encoding) { } public void Write<T>(string format, T[] source) { base.Write(format, source.OfType<object>().ToArray()); } public void WriteLine<T>(string format, T[] source) { base.WriteLine(format, source.OfType<object>().ToArray()); } } public class StreamScanner { public StreamScanner(Stream stream) { str = stream; } public 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) && !isEof); return (char)b; } 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 string ScanLine() { var sb = new StringBuilder(); for (var b = Char(); b != '\n'; b = (char)read()) if (b == 0) break; else if (b != '\r') 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(), 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 char[] Char(int n) { return enumerate(n, Char); } 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); } } } #endregion