Submission #1288721

#	Time	Username	Problem	Language	Result	Execution time	Memory
1288721		torment	Hotel (CEOI11_hot)	C++20	40 / 100	102 ms	230368 KiB

hot

#include<bits/stdc++.h>
using namespace std;
const int N = 305;
long long dp[N][N][N];
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    for(int i = 0;i < N;++i){
        for(int j = 0;j < N;++j){
            for(int k = 0;k < N;++k){
                dp[i][j][k] = -1e18;
            }
        }
    }
    int n, m, o;
    cin >> n >> m >> o;
    vector<array<int, 2>>v(n + m);
    for(int i = 0;i < N;++i){
        dp[n + m][0][i] = 0;
    }
    for(int i = 0;i < n;++i){
        int c, d;
        cin >> c >> d;
        v[i] = {d, c};
    }
    for(int i = n;i < n + m;++i){
        int c, d;
        cin >> c >> d;
        v[i] = {d, -c};
    }
    sort(v.begin(), v.end());
    // for(int i = 0;i < n + m;++i){
    //     cout << v[i][0] << " " << v[i][1] << '\n';
    // }
    for(int i = n + m - 1;i >= 0;--i){
        for(int j = 0;j <= o;++j){
            for(int k = 0;k <= o;++k){
                dp[i][j][k] = dp[i + 1][j][k];
                if(v[i][1] < 0){
                    dp[i][j][k] = max(dp[i][j][k], dp[i + 1][j + 1][k + 1] - v[i][1]);
                }
                else if(j){
                    dp[i][j][k] = max(dp[i][j][k], dp[i + 1][j - 1][k] - v[i][1]);
                }
            }
        }
    }
    
    cout << dp[0][0][0] << '\n';
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10