oj.uz

Submission #654790

# Submission time Handle Problem Language Result Execution time Memory
654790 2022-11-01T15:49:22 Z t6twotwo Catfish Farm (IOI22_fish) C++17
53 / 100
 309 ms 45416 KB 
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
const long long inf = -(1LL << 61);
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>{-1});
  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]);
      p[i].push_back(w[j]);
      if (i > 0) {
        d[i - 1].push_back(y[j]);
      }
      if (i < n - 1) {
        d[i + 1].push_back(y[j]);
      }
    }
  }
  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{-1};
  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 = 1; 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 >= 1; 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 = 0;
  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 72 ms 28376 KB Output is correct
2 Correct 87 ms 32408 KB Output is correct
3 Correct 33 ms 23780 KB Output is correct
4 Correct 36 ms 23764 KB Output is correct
5 Correct 238 ms 45416 KB Output is correct
6 Correct 240 ms 44336 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 171 ms 34612 KB Output is correct
3 Correct 181 ms 39984 KB Output is correct
4 Correct 73 ms 28400 KB Output is correct
5 Correct 85 ms 32384 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 32 ms 23764 KB Output is correct
11 Correct 33 ms 23764 KB Output is correct
12 Correct 85 ms 29584 KB Output is correct
13 Correct 97 ms 33668 KB Output is correct
14 Correct 85 ms 28052 KB Output is correct
15 Correct 109 ms 31136 KB Output is correct
16 Correct 83 ms 28052 KB Output is correct
17 Correct 94 ms 31176 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 23788 KB Output is correct
2 Correct 38 ms 23724 KB Output is correct
3 Correct 71 ms 27688 KB Output is correct
4 Correct 62 ms 27980 KB Output is correct
5 Correct 97 ms 35440 KB Output is correct
6 Correct 94 ms 35400 KB Output is correct
7 Correct 96 ms 35404 KB Output is correct
8 Correct 97 ms 35400 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 0 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 0 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 0 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 0 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 42 ms 3156 KB Output is correct
18 Correct 43 ms 3912 KB Output is correct
19 Correct 32 ms 3668 KB Output is correct
20 Correct 31 ms 3724 KB Output is correct
21 Correct 30 ms 3684 KB Output is correct
22 Correct 69 ms 6900 KB Output is correct
23 Correct 8 ms 1036 KB Output is correct
24 Correct 27 ms 2340 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 0 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 0 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 42 ms 3156 KB Output is correct
18 Correct 43 ms 3912 KB Output is correct
19 Correct 32 ms 3668 KB Output is correct
20 Correct 31 ms 3724 KB Output is correct
21 Correct 30 ms 3684 KB Output is correct
22 Correct 69 ms 6900 KB Output is correct
23 Correct 8 ms 1036 KB Output is correct
24 Correct 27 ms 2340 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 219 ms 16380 KB Output is correct
29 Correct 309 ms 21508 KB Output is correct
30 Incorrect 259 ms 20448 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 32 ms 23788 KB Output is correct
2 Correct 38 ms 23724 KB Output is correct
3 Correct 71 ms 27688 KB Output is correct
4 Correct 62 ms 27980 KB Output is correct
5 Correct 97 ms 35440 KB Output is correct
6 Correct 94 ms 35400 KB Output is correct
7 Correct 96 ms 35404 KB Output is correct
8 Correct 97 ms 35400 KB Output is correct
9 Correct 95 ms 35404 KB Output is correct
10 Correct 79 ms 19932 KB Output is correct
11 Correct 154 ms 39376 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 32 ms 23708 KB Output is correct
19 Correct 32 ms 23748 KB Output is correct
20 Correct 32 ms 23784 KB Output is correct
21 Correct 32 ms 23700 KB Output is correct
22 Incorrect 111 ms 32456 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 72 ms 28376 KB Output is correct
2 Correct 87 ms 32408 KB Output is correct
3 Correct 33 ms 23780 KB Output is correct
4 Correct 36 ms 23764 KB Output is correct
5 Correct 238 ms 45416 KB Output is correct
6 Correct 240 ms 44336 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 171 ms 34612 KB Output is correct
9 Correct 181 ms 39984 KB Output is correct
10 Correct 73 ms 28400 KB Output is correct
11 Correct 85 ms 32384 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 32 ms 23764 KB Output is correct
17 Correct 33 ms 23764 KB Output is correct
18 Correct 85 ms 29584 KB Output is correct
19 Correct 97 ms 33668 KB Output is correct
20 Correct 85 ms 28052 KB Output is correct
21 Correct 109 ms 31136 KB Output is correct
22 Correct 83 ms 28052 KB Output is correct
23 Correct 94 ms 31176 KB Output is correct
24 Correct 32 ms 23788 KB Output is correct
25 Correct 38 ms 23724 KB Output is correct
26 Correct 71 ms 27688 KB Output is correct
27 Correct 62 ms 27980 KB Output is correct
28 Correct 97 ms 35440 KB Output is correct
29 Correct 94 ms 35400 KB Output is correct
30 Correct 96 ms 35404 KB Output is correct
31 Correct 97 ms 35400 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 0 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 0 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 42 ms 3156 KB Output is correct
49 Correct 43 ms 3912 KB Output is correct
50 Correct 32 ms 3668 KB Output is correct
51 Correct 31 ms 3724 KB Output is correct
52 Correct 30 ms 3684 KB Output is correct
53 Correct 69 ms 6900 KB Output is correct
54 Correct 8 ms 1036 KB Output is correct
55 Correct 27 ms 2340 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 219 ms 16380 KB Output is correct
60 Correct 309 ms 21508 KB Output is correct
61 Incorrect 259 ms 20448 KB 1st lines differ - on the 1st token, expected: '102439236138254', found: '102437773898393'
62 Halted 0 ms 0 KB -