oj.uz

Submission #654794

# Submission time Handle Problem Language Result Execution time Memory
654794 2022-11-01T15:59:25 Z t6twotwo Catfish Farm (IOI22_fish) C++17
53 / 100
 309 ms 45560 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>{-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 inf;
    }
    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 inf;
    }
    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 = 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 72 ms 28404 KB Output is correct
2 Correct 88 ms 32336 KB Output is correct
3 Correct 32 ms 23772 KB Output is correct
4 Correct 32 ms 23792 KB Output is correct
5 Correct 243 ms 45560 KB Output is correct
6 Correct 241 ms 44136 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 164 ms 34756 KB Output is correct
3 Correct 178 ms 39984 KB Output is correct
4 Correct 76 ms 28332 KB Output is correct
5 Correct 88 ms 32412 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 32 ms 23764 KB Output is correct
11 Correct 33 ms 23704 KB Output is correct
12 Correct 87 ms 29616 KB Output is correct
13 Correct 100 ms 33672 KB Output is correct
14 Correct 89 ms 28052 KB Output is correct
15 Correct 113 ms 31180 KB Output is correct
16 Correct 84 ms 28108 KB Output is correct
17 Correct 92 ms 31044 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 23788 KB Output is correct
2 Correct 39 ms 23728 KB Output is correct
3 Correct 79 ms 27700 KB Output is correct
4 Correct 62 ms 28008 KB Output is correct
5 Correct 98 ms 35504 KB Output is correct
6 Correct 107 ms 35404 KB Output is correct
7 Correct 112 ms 35520 KB Output is correct
8 Correct 114 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 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 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 1 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 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 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 1 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 476 KB Output is correct
17 Correct 47 ms 3192 KB Output is correct
18 Correct 54 ms 3868 KB Output is correct
19 Correct 33 ms 3584 KB Output is correct
20 Correct 32 ms 3668 KB Output is correct
21 Correct 31 ms 3668 KB Output is correct
22 Correct 71 ms 6988 KB Output is correct
23 Correct 10 ms 980 KB Output is correct
24 Correct 28 ms 2240 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 9 ms 972 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 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 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 1 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 476 KB Output is correct
17 Correct 47 ms 3192 KB Output is correct
18 Correct 54 ms 3868 KB Output is correct
19 Correct 33 ms 3584 KB Output is correct
20 Correct 32 ms 3668 KB Output is correct
21 Correct 31 ms 3668 KB Output is correct
22 Correct 71 ms 6988 KB Output is correct
23 Correct 10 ms 980 KB Output is correct
24 Correct 28 ms 2240 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 9 ms 972 KB Output is correct
27 Correct 3 ms 1236 KB Output is correct
28 Correct 222 ms 16384 KB Output is correct
29 Correct 309 ms 21456 KB Output is correct
30 Incorrect 268 ms 20460 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 23788 KB Output is correct
2 Correct 39 ms 23728 KB Output is correct
3 Correct 79 ms 27700 KB Output is correct
4 Correct 62 ms 28008 KB Output is correct
5 Correct 98 ms 35504 KB Output is correct
6 Correct 107 ms 35404 KB Output is correct
7 Correct 112 ms 35520 KB Output is correct
8 Correct 114 ms 35404 KB Output is correct
9 Correct 101 ms 35532 KB Output is correct
10 Correct 104 ms 19784 KB Output is correct
11 Correct 172 ms 39428 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 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 34 ms 23764 KB Output is correct
19 Correct 41 ms 23776 KB Output is correct
20 Correct 37 ms 23756 KB Output is correct
21 Correct 37 ms 23764 KB Output is correct
22 Incorrect 110 ms 32448 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 28404 KB Output is correct
2 Correct 88 ms 32336 KB Output is correct
3 Correct 32 ms 23772 KB Output is correct
4 Correct 32 ms 23792 KB Output is correct
5 Correct 243 ms 45560 KB Output is correct
6 Correct 241 ms 44136 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 164 ms 34756 KB Output is correct
9 Correct 178 ms 39984 KB Output is correct
10 Correct 76 ms 28332 KB Output is correct
11 Correct 88 ms 32412 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 1 ms 336 KB Output is correct
16 Correct 32 ms 23764 KB Output is correct
17 Correct 33 ms 23704 KB Output is correct
18 Correct 87 ms 29616 KB Output is correct
19 Correct 100 ms 33672 KB Output is correct
20 Correct 89 ms 28052 KB Output is correct
21 Correct 113 ms 31180 KB Output is correct
22 Correct 84 ms 28108 KB Output is correct
23 Correct 92 ms 31044 KB Output is correct
24 Correct 33 ms 23788 KB Output is correct
25 Correct 39 ms 23728 KB Output is correct
26 Correct 79 ms 27700 KB Output is correct
27 Correct 62 ms 28008 KB Output is correct
28 Correct 98 ms 35504 KB Output is correct
29 Correct 107 ms 35404 KB Output is correct
30 Correct 112 ms 35520 KB Output is correct
31 Correct 114 ms 35404 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 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 1 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 476 KB Output is correct
48 Correct 47 ms 3192 KB Output is correct
49 Correct 54 ms 3868 KB Output is correct
50 Correct 33 ms 3584 KB Output is correct
51 Correct 32 ms 3668 KB Output is correct
52 Correct 31 ms 3668 KB Output is correct
53 Correct 71 ms 6988 KB Output is correct
54 Correct 10 ms 980 KB Output is correct
55 Correct 28 ms 2240 KB Output is correct
56 Correct 2 ms 340 KB Output is correct
57 Correct 9 ms 972 KB Output is correct
58 Correct 3 ms 1236 KB Output is correct
59 Correct 222 ms 16384 KB Output is correct
60 Correct 309 ms 21456 KB Output is correct
61 Incorrect 268 ms 20460 KB 1st lines differ - on the 1st token, expected: '102439236138254', found: '102437773898393'
62 Halted 0 ms 0 KB -