Submission #2242462
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#define local
//if you find any bug in my code, please tell me.
const int N=45,maxn=410,INF=0x3f3f3f3f;
int dp[N][maxn][maxn],a[N],b[N],c[N];
int main()
{
#ifdef local
freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
#endif
int n,ma,mb,i,j,k,ans=INF;
cin>>n>>ma>>mb;
for(i=0; i<n; i++) scanf("%d%d%d",&a[i],&b[i],&c[i]);
for(i=0; i<=n; i++)
for(j=0; j<=maxn; j++)
for(k=0; k<=maxn; k++)
dp[i][j][k]=INF;
dp[0][0][0]=0;
for(i=0; i<n; i++)
for(j=0; j<=maxn; j++)
for(k=0; k<=maxn; k++)
{
if(dp[i][j][k]==INF) continue;
dp[i+1][j][k]=min(dp[i+1][j][k],dp[i][j][k]);
dp[i+1][j+a[i]][k+b[i]]=min(dp[i+1][j+a[i]][k+b[i]],dp[i][j][k]+c[i]);
}
for(j=1; j<=maxn; j++)
for(k=1; k<=maxn; k++)
{
if(dp[n][j][k]==INF) continue;
else if(ma*k==mb*j) ans=min(ans,dp[n][j][k]);
}
if(ans==INF) cout<<-1<<endl;
else cout<<ans<<endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
D - Mixing Experiment |
User |
vjudge3 |
Language |
C++14 (GCC 5.4.1) |
Score |
400 |
Code Size |
1139 Byte |
Status |
AC |
Exec Time |
17 ms |
Memory |
28928 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:16:57: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
for(i=0; i<n; i++) scanf("%d%d%d",&a[i],&b[i],&c[i]);
^
./Main.cpp:33:26: warning: iteration 409u invokes undefined behavior [-Waggressive-loop-optimizations]
if(dp[n][j][k]==INF) continue;
^
./Main.cpp:31:19: note: containing loop
for(k=1; k<=maxn; k++)
^
./Main.cpp:26:30: warning: iteration 410u invokes undefined behavior [-Waggressive-loop-optimizations]
if(dp[i][j][k]==INF) continue;
^
./Main.cpp:24:23: note: containing loop
for(k=0; k<=maxn; k++)
^
./Main.cpp:20:32: warning: iteration 410u invokes undefined behavior [-Waggressive-loop-optimizations]
dp[i][j][k]=INF;
^
....
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 |
3 ms |
4352 KB |
sample_02.txt |
AC |
2 ms |
1536 KB |
subtask_1_01.txt |
AC |
4 ms |
4352 KB |
subtask_1_02.txt |
AC |
3 ms |
2176 KB |
subtask_1_03.txt |
AC |
4 ms |
4352 KB |
subtask_1_04.txt |
AC |
5 ms |
8448 KB |
subtask_1_05.txt |
AC |
6 ms |
10496 KB |
subtask_1_06.txt |
AC |
8 ms |
14592 KB |
subtask_1_07.txt |
AC |
9 ms |
16640 KB |
subtask_1_08.txt |
AC |
10 ms |
16640 KB |
subtask_1_09.txt |
AC |
11 ms |
20736 KB |
subtask_1_10.txt |
AC |
13 ms |
22784 KB |
subtask_1_11.txt |
AC |
16 ms |
27008 KB |
subtask_1_12.txt |
AC |
17 ms |
28928 KB |
subtask_1_13.txt |
AC |
16 ms |
28928 KB |
subtask_1_14.txt |
AC |
16 ms |
28928 KB |
subtask_1_15.txt |
AC |
17 ms |
28928 KB |
subtask_1_16.txt |
AC |
16 ms |
28928 KB |
subtask_1_17.txt |
AC |
17 ms |
28928 KB |
subtask_1_18.txt |
AC |
17 ms |
28928 KB |