oj.uz

답안 #837995

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
837995 2023-08-26T03:31:50 Z 12345678 메기 농장 (IOI22_fish) C++17
35 / 100
 1000 ms 128788 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=0; 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; 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][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

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1074 ms 126420 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Execution timed out 1096 ms 128788 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1059 ms 111972 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 240 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 10 ms 2004 KB Output is correct
10 Correct 70 ms 4828 KB Output is correct
11 Correct 10 ms 2004 KB Output is correct
12 Correct 69 ms 4812 KB Output is correct
13 Correct 2 ms 980 KB Output is correct
14 Correct 70 ms 4780 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 240 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 10 ms 2004 KB Output is correct
10 Correct 70 ms 4828 KB Output is correct
11 Correct 10 ms 2004 KB Output is correct
12 Correct 69 ms 4812 KB Output is correct
13 Correct 2 ms 980 KB Output is correct
14 Correct 70 ms 4780 KB Output is correct
15 Correct 69 ms 4812 KB Output is correct
16 Correct 2 ms 980 KB Output is correct
17 Correct 79 ms 6112 KB Output is correct
18 Correct 87 ms 6144 KB Output is correct
19 Correct 85 ms 6120 KB Output is correct
20 Correct 82 ms 6092 KB Output is correct
21 Correct 83 ms 6128 KB Output is correct
22 Correct 91 ms 7432 KB Output is correct
23 Correct 72 ms 4960 KB Output is correct
24 Correct 77 ms 5708 KB Output is correct
25 Correct 70 ms 4868 KB Output is correct
26 Correct 73 ms 4936 KB Output is correct

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 240 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 10 ms 2004 KB Output is correct
10 Correct 70 ms 4828 KB Output is correct
11 Correct 10 ms 2004 KB Output is correct
12 Correct 69 ms 4812 KB Output is correct
13 Correct 2 ms 980 KB Output is correct
14 Correct 70 ms 4780 KB Output is correct
15 Correct 69 ms 4812 KB Output is correct
16 Correct 2 ms 980 KB Output is correct
17 Correct 79 ms 6112 KB Output is correct
18 Correct 87 ms 6144 KB Output is correct
19 Correct 85 ms 6120 KB Output is correct
20 Correct 82 ms 6092 KB Output is correct
21 Correct 83 ms 6128 KB Output is correct
22 Correct 91 ms 7432 KB Output is correct
23 Correct 72 ms 4960 KB Output is correct
24 Correct 77 ms 5708 KB Output is correct
25 Correct 70 ms 4868 KB Output is correct
26 Correct 73 ms 4936 KB Output is correct
27 Execution timed out 1093 ms 73164 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1059 ms 111972 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1074 ms 126420 KB Time limit exceeded
2 Halted 0 ms 0 KB -