oj.uz

Submission #1028112

# Submission time Handle Problem Language Result Execution time Memory
1028112 2024-07-19T13:49:22 Z NeroZein Catfish Farm (IOI22_fish) C++17
78 / 100
 1000 ms 52156 KB 
#include "fish.h"
#include <bits/stdc++.h>
 
using namespace std;

int n; 
vector<vector<long long>> nxt;
vector<vector<long long>> pre;
vector<vector<vector<long long>>> dp;
vector<vector<pair<int, int>>> in_col;
 
long long max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
  n = N;
  in_col.resize(N);
  for (int i = 0; i < M; ++i) {
    in_col[X[i]].push_back({Y[i], W[i]});
  }
  for (int i = 0; i < N; ++i) {
    sort(in_col[i].begin(), in_col[i].end());
    in_col[i].push_back({N, 0});
  }
  pre.resize(N);
  for (int col = 1; col < N; ++col) {
    pre[col].resize(in_col[col].size());
    for (int i = 0; i < (int) in_col[col].size(); ++i) {
      int ptr = 0; 
      long long sum = 0; 
      while (ptr < (int) in_col[col - 1].size() && in_col[col - 1][ptr].first < in_col[col][i].first) {
        sum += in_col[col - 1][ptr].second; 
        ptr++; 
      }
      pre[col][i] = sum; 
    }
  }
  nxt.resize(N);
  for (int col = 0; col < N - 1; ++col) {
    nxt[col].resize(in_col[col].size());
    for (int i = 0; i < (int) in_col[col].size(); ++i) {//M tot
      int ptr = 0;
      long long sum = 0;
      while (ptr < (int) in_col[col + 1].size() && in_col[col + 1][ptr].first < in_col[col][i].first) {
        sum += in_col[col + 1][ptr].second;
        ptr++;
      }
      nxt[col][i] = sum; 
    }
  }
  dp.resize(N + 1);
  for (int i = 0; i < N + 1; ++i) {
    dp[i].resize(2);
    dp[i][0].assign(2, -1);
    dp[i][1].assign(2, -1);
  }
  dp[0][0][0] = 0;  
  for (int col = 0; col < N; ++col) {
    int sz = (int) in_col[col].size();
    for (int f = 0; f < 2; ++f) {
      for (int f2 = 0; f2 < 2; ++f2) {
        if (dp[col][f][f2] == -1) {
          continue; 
        }
        if (f) {
          long long s = 0; 
          for (int i = 0; i < sz; ++i) {
            long long w = s;
            if (col < N - 1) {
              w += nxt[col][i];
            }
            dp[col + 1][1][0] = max(dp[col + 1][1][0], dp[col][f][f2] + w);
            s -= in_col[col][i].second; 
          }
          dp[col + 1][0][0] = max(dp[col + 1][0][0], dp[col][f][f2]);
        } else {
          long long s = 0;
          for (int i = 0; i < sz; ++i) {
            long long w = s; 
            if (f2) {
              w += pre[col][i];
            }
            dp[col + 1][0][1] = max(dp[col + 1][0][1], dp[col][f][f2] + w); 
            s -= in_col[col][i].second; 
          }
          s = 0;
          if (col < N - 1) {
            s = nxt[col][sz - 1];
          }
          if (f2) {
            s += pre[col][sz - 1]; 
          }
          dp[col + 1][1][0] = max(dp[col + 1][1][0], dp[col][f][f2] + s);
        }
      }
    }
  }
  long long ans = 0;
  for (int f = 0; f < 2; ++f) {
    for (int f2 = 0; f2 < 2; ++f2) {
      ans = max(ans, dp[n][f][f2]); 
    }
  }
  return ans; 
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 32976 KB Output is correct
2 Correct 69 ms 37296 KB Output is correct
3 Correct 32 ms 31636 KB Output is correct
4 Correct 30 ms 31588 KB Output is correct
5 Correct 119 ms 52156 KB Output is correct
6 Correct 113 ms 52028 KB Output is correct

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 352 KB Output is correct
2 Execution timed out 1030 ms 15932 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 31836 KB Output is correct
2 Correct 30 ms 31580 KB Output is correct
3 Correct 41 ms 30628 KB Output is correct
4 Correct 40 ms 33104 KB Output is correct
5 Correct 50 ms 35680 KB Output is correct
6 Correct 68 ms 34900 KB Output is correct
7 Correct 56 ms 35664 KB Output is correct
8 Correct 53 ms 35412 KB Output is correct

Subtask #4
14.0 / 14.0

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

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 464 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 18 ms 3420 KB Output is correct
18 Correct 21 ms 3664 KB Output is correct
19 Correct 19 ms 3672 KB Output is correct
20 Correct 15 ms 3676 KB Output is correct
21 Correct 15 ms 3580 KB Output is correct
22 Correct 38 ms 6748 KB Output is correct
23 Correct 3 ms 1112 KB Output is correct
24 Correct 10 ms 2396 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 3 ms 960 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 464 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 18 ms 3420 KB Output is correct
18 Correct 21 ms 3664 KB Output is correct
19 Correct 19 ms 3672 KB Output is correct
20 Correct 15 ms 3676 KB Output is correct
21 Correct 15 ms 3580 KB Output is correct
22 Correct 38 ms 6748 KB Output is correct
23 Correct 3 ms 1112 KB Output is correct
24 Correct 10 ms 2396 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 3 ms 960 KB Output is correct
27 Correct 2 ms 1372 KB Output is correct
28 Correct 156 ms 15852 KB Output is correct
29 Correct 414 ms 22140 KB Output is correct
30 Correct 94 ms 21584 KB Output is correct
31 Correct 91 ms 21604 KB Output is correct
32 Correct 157 ms 22108 KB Output is correct
33 Correct 98 ms 21588 KB Output is correct
34 Correct 95 ms 21584 KB Output is correct
35 Correct 31 ms 9060 KB Output is correct
36 Correct 119 ms 22232 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 31836 KB Output is correct
2 Correct 30 ms 31580 KB Output is correct
3 Correct 41 ms 30628 KB Output is correct
4 Correct 40 ms 33104 KB Output is correct
5 Correct 50 ms 35680 KB Output is correct
6 Correct 68 ms 34900 KB Output is correct
7 Correct 56 ms 35664 KB Output is correct
8 Correct 53 ms 35412 KB Output is correct
9 Correct 53 ms 35256 KB Output is correct
10 Correct 41 ms 21060 KB Output is correct
11 Correct 83 ms 41812 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 34 ms 31716 KB Output is correct
19 Correct 30 ms 31580 KB Output is correct
20 Correct 30 ms 31664 KB Output is correct
21 Correct 32 ms 31696 KB Output is correct
22 Correct 68 ms 36516 KB Output is correct
23 Correct 89 ms 41808 KB Output is correct
24 Correct 86 ms 42324 KB Output is correct

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 32976 KB Output is correct
2 Correct 69 ms 37296 KB Output is correct
3 Correct 32 ms 31636 KB Output is correct
4 Correct 30 ms 31588 KB Output is correct
5 Correct 119 ms 52156 KB Output is correct
6 Correct 113 ms 52028 KB Output is correct
7 Correct 0 ms 352 KB Output is correct
8 Execution timed out 1030 ms 15932 KB Time limit exceeded
9 Halted 0 ms 0 KB -