제출 #1094018

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1094018		alexander707070	Cloud Computing (CEOI18_clo)	C++14	100 / 100	2234 ms	7260 KiB

clo

#include<bits/stdc++.h>
#define MAXN 2007
using namespace std;

struct item{
    int c,f,v;

    inline friend bool operator < (item fr,item sc){
        return fr.f<sc.f;
    }
}s[MAXN],t[MAXN];

int n,m;

long long dp[2][MAXN][107][2];

int main(){

    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>s[i].c>>s[i].f>>s[i].v;
    }
    sort(s+1,s+n+1);

    cin>>m;
    for(int i=1;i<=m;i++){
        cin>>t[i].c>>t[i].f>>t[i].v;
    }
    sort(t+1,t+m+1);

    for(int i=0;i<=n;i++){
        for(int f=0;f<=m;f++){
            for(int c=0;c<=100;c++){
                for(int e=0;e<2;e++){

                    dp[i%2][f][c][e]=0;
                
                    if(i==0 and f==0){
                        dp[i%2][f][c][e]=0; continue;
                    }

                    if(i>0)dp[i%2][f][c][e]=max(dp[i%2][f][c][e],dp[1-i%2][f][c][0]);
                    if(f>0)dp[i%2][f][c][e]=max(dp[i%2][f][c][e],dp[i%2][f-1][c][e]);

                    if(i>0 and c<50){
                        dp[i%2][f][c][e]=max(dp[i%2][f][c][e],dp[1-i%2][f][c+s[i].c][1]-s[i].v);
                    }

                    if(f>0 and c>=t[f].c and e==1 and t[f].f<=s[i+1].f){
                        dp[i%2][f][c][e]=max(dp[i%2][f][c][e],dp[i%2][f-1][c-t[f].c][e]+t[f].v);
                    }

                }
            }
        }
    }

    cout<<dp[n%2][m][0][0]<<"\n";

    return 0;
}

• Subtask 1: 18 / 18
• Subtask 2: 18 / 18
• Subtask 3: 18 / 18
• Subtask 4: 18 / 18
• Subtask 5: 18 / 18
• Subtask 6: 10 / 10