oj.uz

Submission #362195

# Submission time Handle Problem Language Result Execution time Memory
362195 2021-02-02T02:41:43 Z sumit_kk10 Cloud Computing (CEOI18_clo) C++14
100 / 100
 1138 ms 2284 KB 
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll long long int
using namespace std;
const int MOD = 1e9 + 7;
const int N = 2e5 + 5;
long long int dp[1000000 + 1], sum = 0;
vector<pair<long long int, pair<long long int, long long int> > > v;

void solve() {
    int n;
    cin >> n;
    for(int i = 0; i < n; ++i){
        long long int c, f, p;
        cin >> c >> f >> p;
        sum += c;
        p *= -1;
        v.push_back({f, {c, p}});
    }
    int m;
    cin >> m;
    for(int i = 0; i < m; ++i){
        long long int c, f, p;
        cin >> c >> f >> p;
        sum += c;
        c *= -1;
        v.push_back({f, {c, p}});
    }
    sort(v.begin(), v.end());
    for(int i = 0; i < v.size(); ++i){
        int f = v[i].first, c = v[i].second.first, p = v[i].second.second;
        if(p < 0){
            // buying a computer;
            for(int cores = 0; cores <= sum; ++cores)
                if(cores + c >= 0 and cores + c <= sum)
                    // if i have this many cores already;
                    dp[cores] = max(dp[cores], dp[cores + c] + p);
        }
        else{
            // taking an order;
            for(int cores = sum; cores >= 0; --cores)
                // if i have this many cores already;
                if(cores + c >= 0 and cores + c <= sum)
                    // I can take this order then.
                    dp[cores] = max(dp[cores], dp[cores + c] + p);
        }
    }
    cout << dp[0] << "\n";
}

int main() {
    fast;
    int t = 1;
    // cin >> t;
    while(t--)
        solve();
    return 0;
}

Compilation message

clo.cpp: In function 'void solve()':
clo.cpp:30:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |     for(int i = 0; i < v.size(); ++i){
      |                    ~~^~~~~~~~~~
clo.cpp:31:13: warning: unused variable 'f' [-Wunused-variable]
   31 |         int f = v[i].first, c = v[i].second.first, p = v[i].second.second;
      |             ^

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 132 ms 880 KB Output is correct
6 Correct 42 ms 620 KB Output is correct
7 Correct 266 ms 1260 KB Output is correct
8 Correct 278 ms 1260 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 35 ms 620 KB Output is correct
6 Correct 4 ms 364 KB Output is correct
7 Correct 169 ms 876 KB Output is correct
8 Correct 31 ms 492 KB Output is correct
9 Correct 257 ms 1132 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 12 ms 492 KB Output is correct
4 Correct 25 ms 512 KB Output is correct
5 Correct 536 ms 1348 KB Output is correct
6 Correct 1035 ms 2156 KB Output is correct
7 Correct 1074 ms 2028 KB Output is correct
8 Correct 991 ms 2028 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 31 ms 620 KB Output is correct
4 Correct 15 ms 492 KB Output is correct
5 Correct 1018 ms 1988 KB Output is correct
6 Correct 1117 ms 2028 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 132 ms 880 KB Output is correct
6 Correct 42 ms 620 KB Output is correct
7 Correct 266 ms 1260 KB Output is correct
8 Correct 278 ms 1260 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 35 ms 620 KB Output is correct
14 Correct 4 ms 364 KB Output is correct
15 Correct 169 ms 876 KB Output is correct
16 Correct 31 ms 492 KB Output is correct
17 Correct 257 ms 1132 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 12 ms 492 KB Output is correct
29 Correct 25 ms 512 KB Output is correct
30 Correct 536 ms 1348 KB Output is correct
31 Correct 1035 ms 2156 KB Output is correct
32 Correct 1074 ms 2028 KB Output is correct
33 Correct 991 ms 2028 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 2 ms 364 KB Output is correct
36 Correct 31 ms 620 KB Output is correct
37 Correct 15 ms 492 KB Output is correct
38 Correct 1018 ms 1988 KB Output is correct
39 Correct 1117 ms 2028 KB Output is correct
40 Correct 66 ms 748 KB Output is correct
41 Correct 236 ms 1204 KB Output is correct
42 Correct 14 ms 620 KB Output is correct
43 Correct 1138 ms 2212 KB Output is correct
44 Correct 1116 ms 2220 KB Output is correct
45 Correct 1125 ms 2284 KB Output is correct
46 Correct 6 ms 492 KB Output is correct
47 Correct 14 ms 620 KB Output is correct
48 Correct 14 ms 620 KB Output is correct