oj.uz

답안 #983446

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
983446 2024-05-15T12:52:37 Z Peter2017 Cloud Computing (CEOI18_clo) C++14
0 / 100
 14 ms 16520 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pill pair<int,ll>
#define mem(a, b) memset(a, b, sizeof(a))
#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)
#define name "test"

using namespace std;

const int N = 1e3 + 5;
const int mod = 1e9 + 7;
const ll oo = 1e18;

template <typename T1, typename T2> bool maxi(T1 &a, T2 b){if (a < b){a = b; return 1;} return 0;}
template <typename T1, typename T2> bool mini(T1 &a, T2 b){if (a > b){a = b; return 1;} return 0;}

struct item{
    int c, f, v;
    bool operator<(const item &other) const {
        return f > other.f;
    }
};

int n;
int m;
item a[N];
item b[N];

void load(){
    cin.tie(0)->sync_with_stdio(0);
    if (fopen(name".inp", "r")){
        freopen(name".inp", "r", stdin);
        freopen(name".out", "w", stdout);
    }
}

void input(){
    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> a[i].c >> a[i].f >> a[i].v;
    cin >> m;
    for (int i = 1; i <= m; i++)
        cin >> b[i].c >> b[i].f >> b[i].v;
}

namespace subtask3{
    ll f[2][N][N];
    void solve(){
        ll ans = 0;
        sort(a + 1, a + n + 1);
        sort(b + 1, b + m + 1);
        int sum = 0;
        mem(f, -0x3f);
        f[0][0][0] = 0;
        for (int i = 1; i <= n; i++){
            bool cur = i & 1;
            bool pre = cur ^ 1;
            for (int j = 0; j <= m; j++){
                for (int k = 0; k <= sum; k++){
                    maxi(f[cur][j][k], f[pre][j][k]);
                    maxi(f[cur][j][k + a[i].c], f[pre][j][k] - a[i].v);
                    if (j > 0) maxi(f[cur][j][k], f[cur][j - 1][k]);
                    maxi(ans, f[cur][j][k]);
                }
            }
            sum += a[i].c;
            for (int j = 1; j <= m; j++){
                if (b[j].f > a[i].f) continue;
                for (int k = 0; k <= sum; k++){
                    if (k + b[j].c <= sum){
                        maxi(f[cur][j][k], f[cur][j - 1][k + b[j].c] + b[j].v);
                    }
                    maxi(ans, f[cur][j][k]);
                }
            }
//            if (i == 4){
//                cout << f[cur][m - 1][1] << '\n';
//            }
        }
        cout << ans;
    }
}

int main(){
    load();
    input();
    if (max(n, m) <= 250)
        subtask3::solve();
}

Compilation message

clo.cpp: In function 'void load()':
clo.cpp:37:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |         freopen(name".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
clo.cpp:38:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |         freopen(name".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 16220 KB Output is correct
2 Correct 3 ms 16220 KB Output is correct
3 Incorrect 3 ms 16220 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 16520 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 16220 KB Output is correct
2 Correct 3 ms 16220 KB Output is correct
3 Incorrect 4 ms 16288 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 16220 KB Output is correct
2 Correct 3 ms 16220 KB Output is correct
3 Correct 3 ms 16280 KB Output is correct
4 Incorrect 1 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 16220 KB Output is correct
2 Correct 14 ms 16276 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 16220 KB Output is correct
2 Correct 3 ms 16220 KB Output is correct
3 Incorrect 3 ms 16220 KB Output isn't correct
4 Halted 0 ms 0 KB -