oj.uz

답안 #1055974

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1055974 2024-08-13T06:54:25 Z mychecksedad 메기 농장 (IOI22_fish) C++17
35 / 100
 1000 ms 2097152 KB 
#include "fish.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(x) x.begin(),x.end()
#define ll long long int
#define en cout << '\n'
#define pi pair<int,int>
#define vi vector<int> 
#define ff first
#define ss second
const int N = 3005;

ll dp[N][N], pref[N][N], mx[N], dp2[N][N], suf[N][N], suf2[N][N];
long long max_weights(int n, int m, std::vector<int> X, std::vector<int> Y, std::vector<int> W) {
  vector<vector<ll>> a(n + 1, vector<ll>(n + 1));
  for(int i = 0; i < m; ++i){
    a[X[i]][Y[i] + 1] = W[i];
  }
  for(int i = 0; i < n; ++i){
    pref[i][0] = a[i][0];
    for(int j = 1; j <= n; ++j) pref[i][j] = pref[i][j - 1] + a[i][j];
  }
  for(int i = 0; i <= n; ++i) dp[0][i] = pref[1][i], dp2[0][i] = pref[1][i];
  mx[0] = pref[1][n];
  for(int i = 1; i < n; ++i){
    mx[i] = 0;
    ll mx_pref = 0, mx_pref2 = 0;
    for(int j = 0; j <= n; ++j){
      ll add = pref[i + 1][j] +  pref[i - 1][j];
      dp[i][j] = add;
      if(i > 2) dp[i][j] = max(dp[i][j], mx[i - 3] + add);
      dp2[i][j] = dp[i][j];
    }
    for(int j = 0; j <= n; ++j){
      ll add = pref[i + 1][j] +  pref[i - 1][j];
      // cout << i << ' ' << j << ' ' << add1 << ' ' <<add2 << ' ';
      ll x = add - pref[i - 1][j] - pref[i][j];
      for(int j2 = j + 1; j2 <= n; ++j2){
        dp[i][j] = max(dp[i][j], dp[i - 1][j2] + x);
      }
      if(i > 1){
        mx_pref = max(mx_pref, dp[i - 2][j] - pref[i - 1][j]);
        dp[i][j] = max(dp[i][j], mx_pref + add);
        dp[i][j] = max(dp[i][j], suf[i - 2][j] - pref[i - 1][j]);
        dp2[i][j] = max(dp2[i][j], mx_pref + add);
        dp2[i][j] = max(dp2[i][j], suf[i - 2][j] - pref[i - 1][j]);
      }
      mx_pref2 = max(mx_pref2, dp2[i - 1][j] - pref[i - 1][j] - pref[i][j]);
      dp[i][j] = max(dp[i][j], mx_pref2 + add);
      dp2[i][j] = max(dp2[i][j], mx_pref2 + add);
      // dp[i][j] = max(dp[i][j], suf[i - 1][j] + x);

      // cout << dp[i][j] << '\n'; 
    }
    for(int j = 0; j <= n; ++j) mx[i] = max(mx[i], dp[i][j]);
    suf[i][n] = dp[i][n];
    // suf2[i][n] = dp[i][n];
    for(int j = n-1; j >= 0 ;--j) suf[i][j] = max(suf[i][j + 1], dp[i][j]);
    // for(int j = n-1; j >= 0 ;--j) suf2[i][j] = max(suf2[i][j + 1], dp[i][j]);
    // en;
  }
  ll ans = mx[n - 1];

  return ans;
}

Subtask #1
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 670 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Runtime error 665 ms 2097152 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 692 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 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 1 ms 348 KB Output is correct
9 Correct 2 ms 3676 KB Output is correct
10 Correct 11 ms 8796 KB Output is correct
11 Correct 2 ms 3676 KB Output is correct
12 Correct 11 ms 8840 KB Output is correct
13 Correct 2 ms 1884 KB Output is correct
14 Correct 11 ms 8652 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 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 1 ms 348 KB Output is correct
9 Correct 2 ms 3676 KB Output is correct
10 Correct 11 ms 8796 KB Output is correct
11 Correct 2 ms 3676 KB Output is correct
12 Correct 11 ms 8840 KB Output is correct
13 Correct 2 ms 1884 KB Output is correct
14 Correct 11 ms 8652 KB Output is correct
15 Correct 10 ms 8792 KB Output is correct
16 Correct 1 ms 1884 KB Output is correct
17 Correct 17 ms 10688 KB Output is correct
18 Correct 36 ms 10588 KB Output is correct
19 Correct 17 ms 10532 KB Output is correct
20 Correct 17 ms 10588 KB Output is correct
21 Correct 18 ms 10580 KB Output is correct
22 Correct 24 ms 12244 KB Output is correct
23 Correct 15 ms 9160 KB Output is correct
24 Correct 15 ms 9820 KB Output is correct
25 Correct 11 ms 8792 KB Output is correct
26 Correct 12 ms 9052 KB Output is correct

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 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 1 ms 348 KB Output is correct
9 Correct 2 ms 3676 KB Output is correct
10 Correct 11 ms 8796 KB Output is correct
11 Correct 2 ms 3676 KB Output is correct
12 Correct 11 ms 8840 KB Output is correct
13 Correct 2 ms 1884 KB Output is correct
14 Correct 11 ms 8652 KB Output is correct
15 Correct 10 ms 8792 KB Output is correct
16 Correct 1 ms 1884 KB Output is correct
17 Correct 17 ms 10688 KB Output is correct
18 Correct 36 ms 10588 KB Output is correct
19 Correct 17 ms 10532 KB Output is correct
20 Correct 17 ms 10588 KB Output is correct
21 Correct 18 ms 10580 KB Output is correct
22 Correct 24 ms 12244 KB Output is correct
23 Correct 15 ms 9160 KB Output is correct
24 Correct 15 ms 9820 KB Output is correct
25 Correct 11 ms 8792 KB Output is correct
26 Correct 12 ms 9052 KB Output is correct
27 Execution timed out 1077 ms 168112 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 692 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 670 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -