oj.uz

Submission #654805

# Submission time Handle Problem Language Result Execution time Memory
654805 2022-11-01T16:51:22 Z t6twotwo Catfish Farm (IOI22_fish) C++17
53 / 100
 315 ms 45544 KB 
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
const long long inf = -(1LL << 50);
long long max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w) {
  vector<vector<int>> b(n);
  for (int i = 0; i < m; i++) {
    b[x[i]].push_back(i);
  }
  vector d(n, vector<int>{0});
  vector<vector<int>> r(n), p(n);
  for (int i = 0; i < n; i++) {
    sort(b[i].begin(), b[i].end(), [&](int j, int k) {
      return y[j] < y[k];
    });
    for (int j : b[i]) {
      r[i].push_back(y[j] + 1);
      p[i].push_back(w[j]);
      if (i > 0) {
        d[i - 1].push_back(y[j] + 1);
      }
      if (i < n - 1) {
        d[i + 1].push_back(y[j] + 1);
      }
    }
  }
  vector<vector<long long>> ssum(n), psum(n);
  for (int i = 0; i < n; i++) {
    int k = p[i].size();
    psum[i] = vector<long long>(k + 1);
    ssum[i] = vector<long long>(k + 1);
    for (int j = 0; j < k; j++) {
      psum[i][j + 1] = psum[i][j] + p[i][j];
    }
    for (int j = k - 1; j >= 0; j--) {
      ssum[i][j] = ssum[i][j + 1] + p[i][j];
    }
  }
  auto suf_sum = [&](int i, int x) -> long long {
    if (i == -1) {
      return 0;
    }
    return ssum[i][upper_bound(r[i].begin(), r[i].end(), x) - r[i].begin()];
  };
  auto pre_sum = [&](int i, int x) -> long long {
    if (i == -1) {
      return 0;
    }
    return psum[i][upper_bound(r[i].begin(), r[i].end(), x) - r[i].begin()];
  };
  vector<int> e{0};
  vector<array<long long, 2>> dp{{0, 0}};
  for (int i = 0; i < n; i++) {
    auto pd = dp;
    int l = d[i].size();
    dp = vector(l, array<long long, 2>{inf, inf});
    int k = pd.size();
    vector<long long> pmax(k + 1, inf);
    for (int j = 0; j < k; j++) {
      pmax[j + 1] = max(pmax[j], pd[j][0] + suf_sum(i - 1, e[j]));
    }
    vector<long long> smax(k + 1, inf);
    for (int j = k - 1; j >= 0; j--) {
      smax[j] = max(smax[j + 1], max(pd[j][0], pd[j][1]) - suf_sum(i, e[j]));
    }
    for (int j = 0; j < k; j++) {
      dp[0][0] = max(dp[0][0], max(pd[j][0], pd[j][1]));
      dp[0][1] = max(dp[0][1], max(pd[j][0], pd[j][1]) + pre_sum(i, e[j]));
    }
    for (int j = 1; j < l; j++) {
      dp[j][0] = max({dp[j][0], max(pd[0][1], pd[0][0] + pre_sum(i - 1, d[i][j])), pmax[upper_bound(e.begin(), e.end(), d[i][j]) - e.begin()] - suf_sum(i - 1, d[i][j])});
      dp[j][1] = max({dp[j][1], max(pd[0][1], pd[0][0] + pre_sum(i - 1, d[i][j])), smax[lower_bound(e.begin(), e.end(), d[i][j]) - e.begin()] + suf_sum(i, d[i][j])});
    }
    swap(e, d[i]);
  }
  long long ans = inf;
  for (auto v : dp) {
    ans = max(ans, max(v[0], v[1]));
  }
  return ans;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 28320 KB Output is correct
2 Correct 88 ms 32320 KB Output is correct
3 Correct 33 ms 23756 KB Output is correct
4 Correct 32 ms 23692 KB Output is correct
5 Correct 239 ms 45544 KB Output is correct
6 Correct 246 ms 44132 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 161 ms 34668 KB Output is correct
3 Correct 196 ms 40060 KB Output is correct
4 Correct 76 ms 28376 KB Output is correct
5 Correct 91 ms 32332 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 36 ms 23676 KB Output is correct
11 Correct 36 ms 23780 KB Output is correct
12 Correct 84 ms 29540 KB Output is correct
13 Correct 99 ms 33668 KB Output is correct
14 Correct 92 ms 28092 KB Output is correct
15 Correct 104 ms 31176 KB Output is correct
16 Correct 88 ms 28180 KB Output is correct
17 Correct 97 ms 31040 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 23764 KB Output is correct
2 Correct 34 ms 23752 KB Output is correct
3 Correct 69 ms 27668 KB Output is correct
4 Correct 59 ms 27996 KB Output is correct
5 Correct 102 ms 35480 KB Output is correct
6 Correct 97 ms 35408 KB Output is correct
7 Correct 104 ms 35432 KB Output is correct
8 Correct 104 ms 35404 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 44 ms 3176 KB Output is correct
18 Correct 44 ms 3772 KB Output is correct
19 Correct 32 ms 3656 KB Output is correct
20 Correct 33 ms 3660 KB Output is correct
21 Correct 32 ms 3692 KB Output is correct
22 Correct 74 ms 7044 KB Output is correct
23 Correct 7 ms 980 KB Output is correct
24 Correct 26 ms 2320 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 7 ms 980 KB Output is correct

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 44 ms 3176 KB Output is correct
18 Correct 44 ms 3772 KB Output is correct
19 Correct 32 ms 3656 KB Output is correct
20 Correct 33 ms 3660 KB Output is correct
21 Correct 32 ms 3692 KB Output is correct
22 Correct 74 ms 7044 KB Output is correct
23 Correct 7 ms 980 KB Output is correct
24 Correct 26 ms 2320 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 7 ms 980 KB Output is correct
27 Correct 3 ms 1236 KB Output is correct
28 Correct 239 ms 16512 KB Output is correct
29 Correct 315 ms 21512 KB Output is correct
30 Incorrect 266 ms 20596 KB 1st lines differ - on the 1st token, expected: '102439236138254', found: '102437773898393'
31 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 23764 KB Output is correct
2 Correct 34 ms 23752 KB Output is correct
3 Correct 69 ms 27668 KB Output is correct
4 Correct 59 ms 27996 KB Output is correct
5 Correct 102 ms 35480 KB Output is correct
6 Correct 97 ms 35408 KB Output is correct
7 Correct 104 ms 35432 KB Output is correct
8 Correct 104 ms 35404 KB Output is correct
9 Correct 106 ms 35512 KB Output is correct
10 Correct 84 ms 19876 KB Output is correct
11 Correct 172 ms 39396 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 40 ms 23700 KB Output is correct
19 Correct 34 ms 23712 KB Output is correct
20 Correct 36 ms 23664 KB Output is correct
21 Correct 34 ms 23764 KB Output is correct
22 Incorrect 120 ms 32476 KB 1st lines differ - on the 1st token, expected: '45561826463480', found: '45557677700171'
23 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 28320 KB Output is correct
2 Correct 88 ms 32320 KB Output is correct
3 Correct 33 ms 23756 KB Output is correct
4 Correct 32 ms 23692 KB Output is correct
5 Correct 239 ms 45544 KB Output is correct
6 Correct 246 ms 44132 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 161 ms 34668 KB Output is correct
9 Correct 196 ms 40060 KB Output is correct
10 Correct 76 ms 28376 KB Output is correct
11 Correct 91 ms 32332 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 36 ms 23676 KB Output is correct
17 Correct 36 ms 23780 KB Output is correct
18 Correct 84 ms 29540 KB Output is correct
19 Correct 99 ms 33668 KB Output is correct
20 Correct 92 ms 28092 KB Output is correct
21 Correct 104 ms 31176 KB Output is correct
22 Correct 88 ms 28180 KB Output is correct
23 Correct 97 ms 31040 KB Output is correct
24 Correct 33 ms 23764 KB Output is correct
25 Correct 34 ms 23752 KB Output is correct
26 Correct 69 ms 27668 KB Output is correct
27 Correct 59 ms 27996 KB Output is correct
28 Correct 102 ms 35480 KB Output is correct
29 Correct 97 ms 35408 KB Output is correct
30 Correct 104 ms 35432 KB Output is correct
31 Correct 104 ms 35404 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 2 ms 468 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 2 ms 468 KB Output is correct
48 Correct 44 ms 3176 KB Output is correct
49 Correct 44 ms 3772 KB Output is correct
50 Correct 32 ms 3656 KB Output is correct
51 Correct 33 ms 3660 KB Output is correct
52 Correct 32 ms 3692 KB Output is correct
53 Correct 74 ms 7044 KB Output is correct
54 Correct 7 ms 980 KB Output is correct
55 Correct 26 ms 2320 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 7 ms 980 KB Output is correct
58 Correct 3 ms 1236 KB Output is correct
59 Correct 239 ms 16512 KB Output is correct
60 Correct 315 ms 21512 KB Output is correct
61 Incorrect 266 ms 20596 KB 1st lines differ - on the 1st token, expected: '102439236138254', found: '102437773898393'
62 Halted 0 ms 0 KB -