Submission #1103742


Source Code Expand

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define CHMIN(a,b) a=min((a),(b))
#define CHMAX(a,b) a=max((a),(b))

// mod
const ll MOD = 1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD

// floating
typedef double Real;
const Real EPS = 1e-11;
#define EQ0(x) (abs(x)<EPS)
#define EQ(a,b) (abs(a-b)<EPS)
typedef complex<Real> P;

int n;
int ma,mb;
int dp[425][425];
const int INF = 1252183025;

int main(){
  scanf("%d%d%d",&n,&ma,&mb);
  REP(i,425)REP(j,425)dp[i][j]=INF;
  dp[0][0] = 0;
  REP(i,n){
    int a,b,c;
    scanf("%d%d%d",&a,&b,&c);
    FORR(i,0,425)FORR(j,0,425){
      if(i+a>=425)continue;
      if(j+b>=425)continue;
      CHMIN(dp[i+a][j+b],dp[i][j]+c);
    }
  }
  int ans = INF;
  int ca = ma;
  int cb = mb;
  while(ca<425&&cb<425){
    CHMIN(ans,dp[ca][cb]);
    ca+=ma;
    cb+=mb;
  }
  if(ans==INF)ans=-1;
  printf("%d\n",ans);
  return 0;
}

Submission Info

Submission Time
Task D - Mixing Experiment
User rickytheta
Language C++14 (GCC 5.4.1)
Score 400
Code Size 1436 Byte
Status AC
Exec Time 12 ms
Memory 896 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:40:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d",&n,&ma,&mb);
                             ^
./Main.cpp:45:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d",&a,&b,&c);
                             ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 2
AC × 20
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 3 ms 896 KB
subtask_1_02.txt AC 2 ms 896 KB
subtask_1_03.txt AC 3 ms 896 KB
subtask_1_04.txt AC 4 ms 896 KB
subtask_1_05.txt AC 5 ms 896 KB
subtask_1_06.txt AC 6 ms 896 KB
subtask_1_07.txt AC 7 ms 896 KB
subtask_1_08.txt AC 7 ms 896 KB
subtask_1_09.txt AC 8 ms 896 KB
subtask_1_10.txt AC 10 ms 896 KB
subtask_1_11.txt AC 11 ms 896 KB
subtask_1_12.txt AC 12 ms 896 KB
subtask_1_13.txt AC 11 ms 896 KB
subtask_1_14.txt AC 11 ms 896 KB
subtask_1_15.txt AC 11 ms 896 KB
subtask_1_16.txt AC 12 ms 896 KB
subtask_1_17.txt AC 11 ms 896 KB
subtask_1_18.txt AC 12 ms 896 KB