제출 #125111

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
125111		MvC	Two Dishes (JOI19_dishes)	C++11	10 / 100	1913 ms	80956 KiB

dishes

#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include<bits/stdc++.h>
//#include "rail.h"
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<62);
const int inf=(1<<30);
const int nmax=2e3+50;
const int mod=1e9+7;
using namespace std;
int n,m,i,j;
ll f[nmax][nmax],a[nmax],s[nmax],pa[nmax],pb[nmax],b[nmax],t[nmax],v1[nmax],v2[nmax],ans;
int main()
{
	//freopen("sol.in","r",stdin);
	//freopen("sol.out","w",stdout);
	//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
	ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
	cin>>n>>m;
	for(i=1;i<=n;i++)
	{
		cin>>a[i]>>s[i]>>v1[i];
		pa[i]=a[i]+pa[i-1];
	}
	for(i=1;i<=m;i++)
	{
		cin>>b[i]>>t[i]>>v2[i];
		pb[i]=b[i]+pb[i-1];
	}
	for(i=0;i<=n;i++)
	{
		for(j=0;j<=m;j++)
		{
			if(i)f[i][j]=max(f[i][j],f[i-1][j]+(pa[i]+pb[j]<=s[i]));
			if(j)f[i][j]=max(f[i][j],f[i][j-1]+(pa[i]+pb[j]<=t[j]));
			ans=max(ans,f[i][j]);
		}
	}
	cout<<ans<<endl;
    return 0;
}

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

dishes.cpp:2:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("O3")
 
dishes.cpp:3:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("unroll-loops")

• 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