Submission #1103939
Source Code Expand
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 { static readonly int INF = (int)1e9; public void Solve() { int N = Reader.Int(), A = Reader.Int(), B = Reader.Int(); var Items = Reader.IntTable(N); int asum = Items.Sum(i => i[0]), bsum = Items.Sum(i => i[1]); var dp = new int[asum + 1, bsum + 1]; Fill(dp, INF); dp[0, 0] = 0; asum = bsum = 0; foreach (var item in Items) { for (int a = asum; a >= 0; a--) for (int b = bsum; b >= 0; b--) CheckMin(ref dp[a + item[0], b + item[1]], dp[a, b] + item[2]); asum += item[0]; bsum += item[1]; } int ans = INF; for (int a = 1; a <= asum; a++) for (int b = 1; b <= bsum; b++) if (a * B == b * A) CheckMin(ref ans, dp[a, b]); Console.WriteLine(ans == INF ? -1 : ans); } bool CheckMin(ref int a, int b) { if (b < a) { a = b; return true; } return false; } void Fill<T>(T[,] A, T val) { for (int a = 0; a < A.GetLength(0); a++) for (int b = 0; b < A.GetLength(1); b++) A[a, b] = val; } } 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(); } public static T[] Range<T>(int N, Func<T> f) { var r = new T[N]; for (int i = 0; i < N; r[i++] = f()) ; return r; } 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; } }
Submission Info
Submission Time | |
---|---|
Task | D - Mixing Experiment |
User | eitaho |
Language | C# (Mono 4.6.2.0) |
Score | 400 |
Code Size | 3285 Byte |
Status | AC |
Exec Time | 30 ms |
Memory | 11424 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt |
All | sample_01.txt, sample_02.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 25 ms | 9300 KB |
sample_02.txt | AC | 25 ms | 11348 KB |
subtask_1_01.txt | AC | 24 ms | 9300 KB |
subtask_1_02.txt | AC | 25 ms | 11348 KB |
subtask_1_03.txt | AC | 24 ms | 9300 KB |
subtask_1_04.txt | AC | 25 ms | 11348 KB |
subtask_1_05.txt | AC | 25 ms | 9400 KB |
subtask_1_06.txt | AC | 26 ms | 11424 KB |
subtask_1_07.txt | AC | 26 ms | 11404 KB |
subtask_1_08.txt | AC | 25 ms | 9352 KB |
subtask_1_09.txt | AC | 26 ms | 11380 KB |
subtask_1_10.txt | AC | 27 ms | 11368 KB |
subtask_1_11.txt | AC | 28 ms | 11328 KB |
subtask_1_12.txt | AC | 30 ms | 11392 KB |
subtask_1_13.txt | AC | 30 ms | 9324 KB |
subtask_1_14.txt | AC | 29 ms | 9388 KB |
subtask_1_15.txt | AC | 29 ms | 9372 KB |
subtask_1_16.txt | AC | 30 ms | 9348 KB |
subtask_1_17.txt | AC | 30 ms | 11400 KB |
subtask_1_18.txt | AC | 29 ms | 9352 KB |