Submission #18075

#	Time	Username	Problem	Language	Result	Execution time	Memory
18075		comet	매트 (KOI15_mat)	C++98	0 / 100	1000 ms	80808 KiB

mat

#include <cstdio>
#include <algorithm>
#include <vector>
#include <cstring>

using namespace std;

struct mat{
	int l,r,h,k;
	bool operator<(const mat& r)const{
		return l<r.l;
	}
}a[2][3010];

int N,W;
int sz[2];

int dp[3010][3010];
int opt[3010][3010];
bool opti[3010][3010];

bool cross(int x,int y){
	if(a[0][x].r<=a[1][y].l)return 0;
	if(a[0][x].l>=a[1][y].r)return 0;
	if(a[0][x].h+a[1][y].h<=W)return 0;
	return 1;
}

int main(){

	scanf("%d%d",&N,&W);

	int p,l,r,h,k;
	for(int i=0;i<N;i++){
		scanf("%d%d%d%d%d",&p,&l,&r,&h,&k);
		a[p][sz[p]++]=mat{l,r,h,k};
	}

	for(int i=0;i<2;i++){
		sort(a[i],a[i]+sz[i]);
		a[i][sz[i]]=mat{1e9,1e9,0,0};
	}

	for(int i=0;i<=sz[0];i++){
		for(int j=0;j<=sz[1];j++){

			dp[i][j]=-1e9;
			if(cross(i,j))continue;

			dp[i][j]=a[0][i].k+a[0][j].k;

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

				if(cross(k,j))continue;

				if(a[opti[k][j]][opt[k][j]].r>a[0][i].l)continue;
				if(dp[i][j]<dp[k][j]+a[0][i].k){
					dp[i][j]=dp[k][j]+a[0][i].k;
					opt[i][j]=k;
					opti[i][j]=0;
				}
			}

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

				if(cross(i,k))continue;

				if(a[opti[k][j]][opt[k][j]].r>a[1][j].l)continue;
				if(dp[i][j]<dp[i][k]+a[1][j].k){
					dp[i][j]=dp[i][k]+a[1][j].k;
					opt[i][j]=k;
					opti[i][j]=1;
				}
			}

		}
	}

	printf("%d\n",dp[sz[0]][sz[1]]);
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 13
• Subtask 3: 0 / 25
• Subtask 4: 0 / 11
• Subtask 5: 0 / 43