oj.uz

Submission #837993

# Submission time Handle Problem Language Result Execution time Memory
837993 2023-08-26T03:25:48 Z 12345678 Catfish Farm (IOI22_fish) C++17
0 / 100
 1000 ms 125856 KB 
#include "fish.h"

#include <vector>
#include <bits/stdc++.h>

using namespace std;

#define ll long long

const int nx=3e3+5;
ll dp[nx][nx][2], qs[nx][nx], mx;

long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) {
  for (int i=0; i<M; i++) qs[X[i]+1][Y[i]+1]=W[i];
  for (int i=1; i<=N; i++) for (int j=1; j<=N; j++) qs[i][j]+=qs[i][j-1];
  for (int i=1; i<=N; i++)
  {
    for (int j=1; j<=N; j++)
    {
      for (int k=0; k<=j; k++) dp[i][j][0]=max(dp[i][j][0], dp[i-1][k][0]+qs[i+1][j]+qs[i-1][j]-qs[i-1][k]-qs[i][k]);
      for (int k=j+1; k<=N; k++) dp[i][j][1]=max(dp[i][j][1], max(dp[i-1][k][1], dp[i-1][k][0])+qs[i+1][j]-qs[i][j]);
      if (i>=2) for (int k=0; k<=N; k++) dp[i][j][1]=dp[i][j][0]=max(dp[i][j][0], max(dp[i-2][k][0], dp[i-2][k][1])+qs[i+1][j]+max(0ll, qs[i-1][j]-qs[i-1][k]));
      mx=max({mx, dp[i][j][0], dp[i][j][1]});
    }
  }
  return mx;
}

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1070 ms 125856 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

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

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1060 ms 112456 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 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 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Incorrect 0 ms 340 KB 1st lines differ - on the 1st token, expected: '2', found: '1'
9 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 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 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Incorrect 0 ms 340 KB 1st lines differ - on the 1st token, expected: '2', found: '1'
9 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 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 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Incorrect 0 ms 340 KB 1st lines differ - on the 1st token, expected: '2', found: '1'
9 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1060 ms 112456 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1070 ms 125856 KB Time limit exceeded
2 Halted 0 ms 0 KB -