제출 #120134

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
120134		KLPP	Two Dishes (JOI19_dishes)	C++14	10 / 100	650 ms	151800 KiB

dishes

#include<bits/stdc++.h>

using namespace std;
typedef long long int lld;
typedef pair<lld,lld> pii;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define trav(a,v) for(auto a:v)
#define INF 10000000000000000
lld n,m;
lld a[1000000];
lld b[1000000];
lld sa[1000000];
lld sb[1000000];
lld DP[2001][2001];
lld s[1000000];
lld t[1000000];
lld p[1000000];
lld q[1000000];
lld calc(int i, int j){
  if(DP[i][j]!=-1)return DP[i][j];
  DP[i][j]=-INF;
  if(i>0){
    if(sa[i]+sb[j]<=s[i-1])DP[i][j]=max(DP[i][j],calc(i-1,j)+p[i-1]);
    else DP[i][j]=max(DP[i][j],calc(i-1,j));
  }
  if(j>0){
    if(sa[i]+sb[j]<=t[j-1])DP[i][j]=max(DP[i][j],calc(i,j-1)+q[j-1]);
    else DP[i][j]=max(DP[i][j],calc(i,j-1));
  }
  return DP[i][j];
}
int main(){
  scanf("%lld %lld",&n,&m);
  rep(i,0,n)scanf("%lld %lld %lld",&a[i],&s[i],&p[i]);
  rep(i,0,m)scanf("%lld %lld %lld",&b[i],&t[i],&q[i]);
  sa[0]=0;
  sb[0]=0;
  rep(i,1,n+1){
    sa[i]=sa[i-1]+a[i-1];
  }
  rep(i,1,m+1){
    sb[i]=sb[i-1]+b[i-1];
  }
  
  rep(i,0,n+1){
    rep(j,0,m+1)DP[i][j]=-1;
  }
  DP[0][0]=0;
  printf("%lld\n",calc(n,m));
  return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

dishes.cpp: In function 'int main()':
dishes.cpp:33:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld %lld",&n,&m);
   ~~~~~^~~~~~~~~~~~~~~~~~~
dishes.cpp:34:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   rep(i,0,n)scanf("%lld %lld %lld",&a[i],&s[i],&p[i]);
             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dishes.cpp:35:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   rep(i,0,m)scanf("%lld %lld %lld",&b[i],&t[i],&q[i]);
             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 5
• Subtask 2: 3 / 3
• Subtask 3: 7 / 7
• Subtask 4: 0 / 39
• Subtask 5: 0 / 11
• Subtask 6: 0 / 9
• Subtask 7: 0 / 17
• Subtask 8: 0 / 9