Submission #1103637
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------
int N,A,B;
int dp[404][404];
void solve() {
int i,j,k,l,r,x,y; string s;
cin>>N>>A>>B;
FOR(i,404) FOR(j,404) dp[i][j]=1<<30;
dp[0][0]=0;
FOR(i,N) {
int a,b,c;
cin>>a>>b>>c;
for(y=403;y>=0;y--) {
for(x=403;x>=0;x--) if(dp[x][y]<1<<30) {
dp[x+a][y+b]=min(dp[x+a][y+b],dp[x][y]+c);
}
}
}
int ret=1<<30;
FOR(x,404) FOR(y,404) if(dp[x][y]<ret && x) {
if(x*B==y*A) ret=dp[x][y];
}
if(ret==1<<30) ret=-1;
cout<<ret<<endl;
}
int main(int argc,char** argv){
string s;int i;
if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
FOR(i,argc-1) s+=argv[i+1],s+='\n';
FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
solve(); return 0;
}
Submission Info
Submission Time |
|
Task |
D - Mixing Experiment |
User |
kmjp |
Language |
C++14 (GCC 5.4.1) |
Score |
400 |
Code Size |
1174 Byte |
Status |
AC |
Exec Time |
7 ms |
Memory |
896 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 |
2 ms |
896 KB |
sample_02.txt |
AC |
2 ms |
896 KB |
subtask_1_01.txt |
AC |
2 ms |
896 KB |
subtask_1_02.txt |
AC |
2 ms |
896 KB |
subtask_1_03.txt |
AC |
2 ms |
896 KB |
subtask_1_04.txt |
AC |
3 ms |
896 KB |
subtask_1_05.txt |
AC |
3 ms |
896 KB |
subtask_1_06.txt |
AC |
4 ms |
896 KB |
subtask_1_07.txt |
AC |
4 ms |
896 KB |
subtask_1_08.txt |
AC |
5 ms |
896 KB |
subtask_1_09.txt |
AC |
5 ms |
896 KB |
subtask_1_10.txt |
AC |
6 ms |
896 KB |
subtask_1_11.txt |
AC |
7 ms |
896 KB |
subtask_1_12.txt |
AC |
7 ms |
896 KB |
subtask_1_13.txt |
AC |
7 ms |
896 KB |
subtask_1_14.txt |
AC |
7 ms |
896 KB |
subtask_1_15.txt |
AC |
7 ms |
896 KB |
subtask_1_16.txt |
AC |
7 ms |
896 KB |
subtask_1_17.txt |
AC |
7 ms |
896 KB |
subtask_1_18.txt |
AC |
7 ms |
896 KB |