oj.uz

Submission #728779

# Submission time Handle Problem Language Result Execution time Memory
728779 2023-04-23T05:24:18 Z kwongweng Catfish Farm (IOI22_fish) C++17
0 / 100
 875 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){
    if (i > 0){
      ROF(j,n-1,0){
        //decreasing
        if (j<n-1){
          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]);
        }
        if (i>1){
          dp[i][j][1] = max(dp[i][j][1], dp[i-2][j][0]);
        }
        dp[i][j][1] += mat[i][j];
      }
    }
    if (i < n-1){
      if (i>0) dp[i][0][0] = max(dp[i][0][0], dp[i-1][0][1]);
      FOR(j,0,n){
        // increasing
        if (j>0){
          dp[i][j][0] = max(dp[i][j][0], dp[i][j-1][0]);
        }
        if (i>0 && j>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 833 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 875 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 736 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 1 ms 216 KB Output is correct
4 Correct 1 ms 216 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 1 ms 216 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 216 KB Output is correct
9 Incorrect 1 ms 852 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '214714912058'
10 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 1 ms 216 KB Output is correct
4 Correct 1 ms 216 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 1 ms 216 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 216 KB Output is correct
9 Incorrect 1 ms 852 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '214714912058'
10 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 1 ms 216 KB Output is correct
4 Correct 1 ms 216 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 1 ms 216 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 216 KB Output is correct
9 Incorrect 1 ms 852 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '214714912058'
10 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 736 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 833 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -