oj.uz

Submission #983456

# Submission time Handle Problem Language Result Execution time Memory
983456 2024-05-15T13:06:16 Z Peter2017 Cloud Computing (CEOI18_clo) C++14
18 / 100
 178 ms 130392 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 = 250 + 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[N][N][N];
    ll btr(int i, int j, int rem){
        if (i > n || j > m) return 0;
        ll &res = f[i][j][rem];
        if (res >= -oo) return res;
        res = -oo;
        maxi(res, btr(i + 1, j, rem));
        maxi(res, btr(i, j + 1, rem));

        maxi(res, btr(i + 1, j, rem + a[i].c) - a[i].v);
        if (b[j].f <= a[i - 1].f && rem >= b[j].c){
            maxi(res, btr(i, j + 1, rem - b[j].c) + b[j].v);
        }
        return res;
    }
    void solve(){
        sort(a + 1, a + n + 1);
        sort(b + 1, b + m + 1);
        mem(f, -0x3f);
        cout << btr(1, 1, 0);
    }
}

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

# Verdict Execution time Memory Grader output
1 Incorrect 53 ms 130060 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 18 ms 130132 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 130136 KB Output is correct
2 Correct 16 ms 130012 KB Output is correct
3 Correct 20 ms 130140 KB Output is correct
4 Correct 20 ms 130120 KB Output is correct
5 Correct 82 ms 130188 KB Output is correct
6 Correct 82 ms 130140 KB Output is correct
7 Correct 156 ms 130284 KB Output is correct
8 Correct 178 ms 130132 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 130392 KB Output is correct
2 Correct 17 ms 130112 KB Output is correct
3 Correct 16 ms 130012 KB Output is correct
4 Incorrect 16 ms 130136 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 130140 KB Output is correct
2 Correct 34 ms 130264 KB Output is correct
3 Runtime error 3 ms 604 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 53 ms 130060 KB Output isn't correct
2 Halted 0 ms 0 KB -