oj.uz

Submission #434308

# Submission time Handle Problem Language Result Execution time Memory
434308 2021-06-20T22:33:40 Z xiaowuc1 Cloud Computing (CEOI18_clo) C++17
100 / 100
 659 ms 1228 KB 
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <vector>

using namespace std;

// BEGIN NO SAD
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
typedef vector<int> vi;
#define f first
#define s second
// END NO SAD

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<vector<ll>> matrix;

void init(vector<array<int, 3>>& v) {
  int n;
  cin >> n;
  v.resize(n);
  for(auto& x: v) cin >> x[1] >> x[0] >> x[2];
  sort(all(v));
}

const ll BAD = -1e18;
ll dp[100005];
void solve() {
  vector<array<int, 3>> computers; // <clock rate, cores, price>
  vector<array<int, 3>> jobs; // <clock rate, cores, price>
  init(computers);
  init(jobs);
  fill(dp, dp + 100005, BAD);
  dp[0] = 0;
  ll ret = 0;
  while(sz(jobs)) {
    if(sz(computers) && computers.back()[0] >= jobs.back()[0]) {
      auto x = computers.back(); computers.pop_back();
      for(int i = 100000; i >= x[1]; i--) {
        if(dp[i-x[1]] == BAD) continue;
        dp[i] = max(dp[i], dp[i-x[1]] - x[2]);
      }
    }
    else {
      auto x = jobs.back(); jobs.pop_back();
      for(int i = 0; i + x[1] <= 100000; i++) {
        if(dp[i+x[1]] == BAD) continue;
        ret = max(ret, dp[i] = max(dp[i], dp[i+x[1]] + x[2]));
      }
    }
  }
  cout << ret << "\n";
}

// what would chika do
// are there edge cases (N=1?)
// are array sizes proper (scaled by proper constant, for example 2* for koosaga tree)
// integer overflow?
// DS reset properly between test cases
// are you doing geometry in floating points

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL); cout.tie(NULL);
  solve();
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 1 ms 972 KB Output is correct
3 Correct 12 ms 1088 KB Output is correct
4 Correct 21 ms 1100 KB Output is correct
5 Correct 195 ms 1140 KB Output is correct
6 Correct 190 ms 1156 KB Output is correct
7 Correct 208 ms 1104 KB Output is correct
8 Correct 194 ms 1148 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 972 KB Output is correct
2 Correct 2 ms 972 KB Output is correct
3 Correct 17 ms 1100 KB Output is correct
4 Correct 17 ms 1100 KB Output is correct
5 Correct 130 ms 1108 KB Output is correct
6 Correct 135 ms 1108 KB Output is correct
7 Correct 253 ms 1164 KB Output is correct
8 Correct 305 ms 1148 KB Output is correct
9 Correct 260 ms 1120 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1100 KB Output is correct
2 Correct 5 ms 1100 KB Output is correct
3 Correct 18 ms 1104 KB Output is correct
4 Correct 17 ms 1108 KB Output is correct
5 Correct 48 ms 1100 KB Output is correct
6 Correct 49 ms 1100 KB Output is correct
7 Correct 64 ms 1100 KB Output is correct
8 Correct 62 ms 1100 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1088 KB Output is correct
2 Correct 4 ms 1088 KB Output is correct
3 Correct 282 ms 1112 KB Output is correct
4 Correct 174 ms 1100 KB Output is correct
5 Correct 572 ms 1176 KB Output is correct
6 Correct 547 ms 1220 KB Output is correct
7 Correct 592 ms 1184 KB Output is correct
8 Correct 545 ms 1168 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1100 KB Output is correct
2 Correct 14 ms 1088 KB Output is correct
3 Correct 119 ms 1100 KB Output is correct
4 Correct 238 ms 1100 KB Output is correct
5 Correct 545 ms 1184 KB Output is correct
6 Correct 571 ms 1156 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 1 ms 972 KB Output is correct
3 Correct 12 ms 1088 KB Output is correct
4 Correct 21 ms 1100 KB Output is correct
5 Correct 195 ms 1140 KB Output is correct
6 Correct 190 ms 1156 KB Output is correct
7 Correct 208 ms 1104 KB Output is correct
8 Correct 194 ms 1148 KB Output is correct
9 Correct 1 ms 972 KB Output is correct
10 Correct 2 ms 972 KB Output is correct
11 Correct 17 ms 1100 KB Output is correct
12 Correct 17 ms 1100 KB Output is correct
13 Correct 130 ms 1108 KB Output is correct
14 Correct 135 ms 1108 KB Output is correct
15 Correct 253 ms 1164 KB Output is correct
16 Correct 305 ms 1148 KB Output is correct
17 Correct 260 ms 1120 KB Output is correct
18 Correct 4 ms 1100 KB Output is correct
19 Correct 5 ms 1100 KB Output is correct
20 Correct 18 ms 1104 KB Output is correct
21 Correct 17 ms 1108 KB Output is correct
22 Correct 48 ms 1100 KB Output is correct
23 Correct 49 ms 1100 KB Output is correct
24 Correct 64 ms 1100 KB Output is correct
25 Correct 62 ms 1100 KB Output is correct
26 Correct 3 ms 1088 KB Output is correct
27 Correct 4 ms 1088 KB Output is correct
28 Correct 282 ms 1112 KB Output is correct
29 Correct 174 ms 1100 KB Output is correct
30 Correct 572 ms 1176 KB Output is correct
31 Correct 547 ms 1220 KB Output is correct
32 Correct 592 ms 1184 KB Output is correct
33 Correct 545 ms 1168 KB Output is correct
34 Correct 2 ms 1100 KB Output is correct
35 Correct 14 ms 1088 KB Output is correct
36 Correct 119 ms 1100 KB Output is correct
37 Correct 238 ms 1100 KB Output is correct
38 Correct 545 ms 1184 KB Output is correct
39 Correct 571 ms 1156 KB Output is correct
40 Correct 127 ms 1100 KB Output is correct
41 Correct 237 ms 1104 KB Output is correct
42 Correct 441 ms 1160 KB Output is correct
43 Correct 578 ms 1100 KB Output is correct
44 Correct 598 ms 1188 KB Output is correct
45 Correct 659 ms 1228 KB Output is correct
46 Correct 252 ms 1140 KB Output is correct
47 Correct 375 ms 1164 KB Output is correct
48 Correct 461 ms 1164 KB Output is correct