제출 #132146

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

dishes

#include<bits/stdc++.h>
#define st first
#define nd second
#define pb push_back
#define ppb pop_back
#define ii pair<int,int>
#define ll long long
#define orta ((bas+son)>>1)
#define sz(x) ((int)x.size())
#define all(x) x.begin(),x.end()
#define umin(x,y) x=min(x,y)
#define umax(x,y) x=max(x,y)
#define inf 1000000000
#define N 200005
#define MOD 998244353
#define KOK 700		
using namespace std;

int n,m;
ll p[N],a[N],s[N],b[N],t[N],q[N];
ll p1[N],p2[N];

int main() {

	scanf("%d %d",&n,&m);

	for(int i=1;i<=n;i++) {

		scanf("%lld %lld %lld",a+i,s+i,p+i);

		p1[i]=p1[i-1]+a[i];

	}

	for(int i=1;i<=m;i++) {

		scanf("%lld %lld %lld",b+i,t+i,q+i);
		
		p2[i]=p2[i-1]+b[i];

	}

	if(n*m<=10000000) {

		vector<vector<ll>> dp;

		dp=vector<vector<ll>>(n+1,vector<ll>(m+1,0));

		for(int i=0;i<=n;i++) {

			for(int j=0;j<=m;j++) {

				if(i) umax(dp[i][j],dp[i-1][j]+((p1[i]+p2[j])<=s[i])*p[i]);
				if(j) umax(dp[i][j],dp[i][j-1]+((p1[i]+p2[j])<=t[j])*q[j]);

			}

		}

		printf("%lld\n",dp[n][m]);
	
		return 0;

	}
 
}

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

dishes.cpp: In function 'int main()':
dishes.cpp:25:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&n,&m);
  ~~~~~^~~~~~~~~~~~~~~
dishes.cpp:29:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld %lld %lld",a+i,s+i,p+i);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dishes.cpp:37:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   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