oj.uz

답안 #884075

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
884075 2023-12-06T15:30:42 Z seriouslyFlawed Cloud Computing (CEOI18_clo) C++17
100 / 100
 343 ms 1368 KB 
#include <bits/stdc++.h>

using namespace std;

// Shortcuts for common operations
#define pb push_back
#define ppb pop_back
#define f first
#define s second
#define all(x) (x).begin(), (x).end()
#define ll long long
#define endl "\n"

// Type definitions for convenience
typedef vector<int> vi;
typedef vector<bool> vb;
typedef pair<int, int> pii;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef unordered_set<int> usi;
typedef unordered_map<int, int> umii;

// Debugging macros
#define debug(x) cerr << #x << " = " << (x) << '\n'
#define debug_vector(v) _debug_vector(#v, v)
template<typename T>
void _debug_vector(const string& name, const vector<T>& a) {
    cerr << name << " = [ ";
    for(const auto &x : a) cerr << x << ' ';
    cerr << "]\n";
}

// I/O redirection for local testing
#define iofile(io) \
        freopen((io + ".in").c_str(), "r", stdin); \
        freopen((io + ".out").c_str(), "w", stdout);

// delta for floodfill
vi dx = {0, 1, 0, -1};
vi dy = {1, 0, -1, 0};

// extended deltas for floodfill
vi edx = {0, 1, 0, -1, 1, 1, -1, -1};
vi edy = {1, 0, -1, 0, 1, -1, 1, -1};

// Common outputs
void yes() { cout << "YES" << '\n'; }
void no() { cout << "NO" << '\n'; }

// cin.tie(0)->sync_with_stdio(0);

#define C s.f
#define V s.s

vector<ll>dp;
vector<pair<pii, pii>>tab;
int n, m;

void fx() {
    // Functionality for fx
    cin >> n;
    int c, f, v;

    for(int i = 0; i < n; i++){
        cin >> c >> f >> v;
        tab.pb({{-f, -1}, {c, v}});
    }

    cin >> m;
    dp.assign(50*max(n,m) +1, -100000000000000);
    
    for(int i = 0; i < m; i++){
        cin >> c >> f >> v;
        tab.pb({{-f, 1}, {c, v}});
    }

    sort(all(tab));
    dp[0] = 0;

    for(int i = 0; i < n+m; i++){
        if(tab[i].f.s == -1){
            //buy computer?
            for(int j = 50 * max(n, m) - tab[i].C; j >= 0; j--) dp[j + tab[i].C] = max(dp[j + tab[i].C], dp[j] - tab[i].V);
        }else{
            //take customer?
            for(int j = 0; j <= 50 * max(n, m) - tab[i].C; j++) dp[j] = max(dp[j], dp[j +  tab[i].C] + tab[i].V);
        }
    }

    cout << *max_element(all(dp)) << endl;

}

int main() {
    // Uncomment the following lines for file I/O
    // iofile(string("hello"));
    
    // Uncomment the following lines for multiple test cases
    // int t; cin >> t;
    // while(t--) fx();
    
    // Single test case
    fx();
    
    return 0;
}

Subtask #1
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 147 ms 1232 KB Output is correct
6 Correct 138 ms 1236 KB Output is correct
7 Correct 161 ms 1276 KB Output is correct
8 Correct 173 ms 1116 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 33 ms 604 KB Output is correct
6 Correct 31 ms 604 KB Output is correct
7 Correct 149 ms 1264 KB Output is correct
8 Correct 179 ms 1116 KB Output is correct
9 Correct 148 ms 1244 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 4 ms 348 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 5 ms 348 KB Output is correct
8 Correct 5 ms 344 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 85 ms 1072 KB Output is correct
4 Correct 131 ms 1116 KB Output is correct
5 Correct 278 ms 1328 KB Output is correct
6 Correct 327 ms 1364 KB Output is correct
7 Correct 303 ms 1116 KB Output is correct
8 Correct 297 ms 1112 KB Output is correct

Subtask #5
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 28 ms 604 KB Output is correct
4 Correct 89 ms 860 KB Output is correct
5 Correct 311 ms 1112 KB Output is correct
6 Correct 343 ms 1332 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 147 ms 1232 KB Output is correct
6 Correct 138 ms 1236 KB Output is correct
7 Correct 161 ms 1276 KB Output is correct
8 Correct 173 ms 1116 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 33 ms 604 KB Output is correct
14 Correct 31 ms 604 KB Output is correct
15 Correct 149 ms 1264 KB Output is correct
16 Correct 179 ms 1116 KB Output is correct
17 Correct 148 ms 1244 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 4 ms 348 KB Output is correct
23 Correct 3 ms 348 KB Output is correct
24 Correct 5 ms 348 KB Output is correct
25 Correct 5 ms 344 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 85 ms 1072 KB Output is correct
29 Correct 131 ms 1116 KB Output is correct
30 Correct 278 ms 1328 KB Output is correct
31 Correct 327 ms 1364 KB Output is correct
32 Correct 303 ms 1116 KB Output is correct
33 Correct 297 ms 1112 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 28 ms 604 KB Output is correct
37 Correct 89 ms 860 KB Output is correct
38 Correct 311 ms 1112 KB Output is correct
39 Correct 343 ms 1332 KB Output is correct
40 Correct 20 ms 604 KB Output is correct
41 Correct 100 ms 948 KB Output is correct
42 Correct 181 ms 1364 KB Output is correct
43 Correct 325 ms 1328 KB Output is correct
44 Correct 296 ms 1368 KB Output is correct
45 Correct 299 ms 1368 KB Output is correct
46 Correct 74 ms 860 KB Output is correct
47 Correct 176 ms 1168 KB Output is correct
48 Correct 163 ms 1176 KB Output is correct