oj.uz

Submission #728810

# Submission time Handle Problem Language Result Execution time Memory
728810 2023-04-23T06:53:56 Z kwongweng Catfish Farm (IOI22_fish) C++17
52 / 100
 791 ms 2097152 KB 
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef long double ld;
typedef pair<ll, ll> pll;
#define FOR(i, a, b) for(int i = a; i < b; i++)
#define ROF(i, a, b) for(int i = a; i >= b; i--)
#define ms memset
#define pb push_back
#define fi first
#define se second

// O(n^2) dp

ll max_weights(int n, int m, vi X, vi Y, vi W){
  ll mat[n][n]; //position of all fishes
  ms(mat, 0, sizeof(mat));
  FOR(i,0,m){
    mat[X[i]][Y[i]] = W[i];
  }
  ll dp[n][n][2];
  // dp[i][j][0] - mat[i][j] chosen, while increasing
  // dp[i][j][1] - while decreasing
  ms(dp,0,sizeof(dp));
  FOR(i,0,n){
    //decreasing
    if (i > 0){
      FOR(k,0,i-1){
        dp[i][n-1][1] = max(dp[i][n-1][1], dp[k][n-1][0]);
        dp[i][n-1][1] = max(dp[i][n-1][1], dp[k][0][1]);
      }
      dp[i][n-1][1] += mat[i][n-1];
      ROF(j,n-2,0){
        dp[i][j][1] = max(dp[i][j][1], dp[i][j+1][1]);
        dp[i][j][1] = max(dp[i][j][1], dp[i-1][j+1][1]);
        dp[i][j][1] += mat[i][j];
      }
    }
    if (i < n-1){
      //increasing
      if (i>1) dp[i][0][0] = max(dp[i][0][0], dp[i-1][0][1]);
      if (i>2) dp[i][0][0] = max(dp[i][0][0], dp[i-2][n-1][0]);
      dp[i][0][0] += mat[i][0];
      FOR(j,1,n){
        dp[i][j][0] = max(dp[i][j][0], dp[i][j-1][0]);
        if (i>0){
          dp[i][j][0] = max(dp[i][j][0], dp[i-1][j-1][0]);
        }
        dp[i][j][0] += mat[i][j];
      }
    }
  }
  ll ans = 0;
  FOR(i,0,n){
    FOR(j,0,n){
      ans = max(ans, max(dp[i][j][0], dp[i][j][1]));
    }
  }
  return ans;
}

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Runtime error 753 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Runtime error 791 ms 2097152 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 731 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
14.0 / 14.0

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

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 216 KB Output is correct
2 Correct 0 ms 216 KB Output is correct
3 Correct 0 ms 216 KB Output is correct
4 Correct 1 ms 216 KB Output is correct
5 Correct 1 ms 216 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 216 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 724 KB Output is correct
10 Correct 3 ms 2388 KB Output is correct
11 Correct 1 ms 852 KB Output is correct
12 Correct 2 ms 2388 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 3 ms 2388 KB Output is correct
15 Correct 2 ms 2388 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 14 ms 4160 KB Output is correct
18 Correct 15 ms 4180 KB Output is correct
19 Correct 14 ms 4144 KB Output is correct
20 Correct 15 ms 4152 KB Output is correct
21 Correct 15 ms 4180 KB Output is correct
22 Correct 26 ms 5936 KB Output is correct
23 Correct 4 ms 2740 KB Output is correct
24 Correct 10 ms 3584 KB Output is correct
25 Correct 3 ms 2372 KB Output is correct
26 Correct 5 ms 2648 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 216 KB Output is correct
2 Correct 0 ms 216 KB Output is correct
3 Correct 0 ms 216 KB Output is correct
4 Correct 1 ms 216 KB Output is correct
5 Correct 1 ms 216 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 216 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 724 KB Output is correct
10 Correct 3 ms 2388 KB Output is correct
11 Correct 1 ms 852 KB Output is correct
12 Correct 2 ms 2388 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 3 ms 2388 KB Output is correct
15 Correct 2 ms 2388 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 14 ms 4160 KB Output is correct
18 Correct 15 ms 4180 KB Output is correct
19 Correct 14 ms 4144 KB Output is correct
20 Correct 15 ms 4152 KB Output is correct
21 Correct 15 ms 4180 KB Output is correct
22 Correct 26 ms 5936 KB Output is correct
23 Correct 4 ms 2740 KB Output is correct
24 Correct 10 ms 3584 KB Output is correct
25 Correct 3 ms 2372 KB Output is correct
26 Correct 5 ms 2648 KB Output is correct
27 Correct 201 ms 211688 KB Output is correct
28 Correct 69 ms 22268 KB Output is correct
29 Correct 289 ms 224016 KB Output is correct
30 Correct 288 ms 224068 KB Output is correct
31 Correct 286 ms 224012 KB Output is correct
32 Correct 86 ms 19528 KB Output is correct
33 Correct 285 ms 224084 KB Output is correct
34 Correct 284 ms 224004 KB Output is correct
35 Correct 228 ms 216308 KB Output is correct
36 Correct 282 ms 223988 KB Output is correct

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 731 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Runtime error 753 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -