oj.uz

답안 #1042138

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1042138 2024-08-02T15:14:34 Z VMaksimoski008 메기 농장 (IOI22_fish) C++17
35 / 100
 1000 ms 152632 KB 
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

ll pref[3005][3005], dp[3005][3005][2], pmx1[3005][3005];
 
ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
    for(int i=0; i<M; i++) pref[X[i]+1][Y[i]+1] += W[i];
    for(int i=1; i<=N; i++)
        for(int j=1; j<=N; j++) pref[i][j] += pref[i][j-1];
    for(int i=1; i<=N; i++)
        for(int j=0; j<=N; j++) pmx1[i][j] = -1e18;
    pmx1[1][0] = dp[1][0][1] - pref[1][0];
    for(int i=1; i<=N; i++) pmx1[1][i] = max(pmx1[1][i-1], dp[1][i][1] - pref[1][i]);

    for(int i=2; i<=N; i++) {
        for(int j=0; j<=N; j++) {
            dp[i][j][1] = max(dp[i][j][1], pmx1[i-1][j] + pref[i-1][j]);
            for(int k=0; k<=N; k++) {
                if(j <= k) dp[i][j][0] = max(dp[i][j][0], (max(dp[i-1][k][0], dp[i-1][k][1]) + pref[i][k]) - pref[i][j]);
                if(i >= 3) dp[i][j][0] = max(dp[i][j][0], max(dp[i-2][k][0], dp[i-2][k][1]) + max(pref[i-1][j], pref[i-1][k]));
                if(i >= 3) dp[i][j][1] = max(dp[i][j][1], max(dp[i-2][k][0], dp[i-2][k][1]) + max(pref[i-1][j], pref[i-1][k]));
            }
            if(j) pmx1[i][j] = pmx1[i][j-1];
            pmx1[i][j] = max(pmx1[i][j], dp[i][j][1] - pref[i][j]);
        }
    }

    ll ans = 0;
    for(int i=1; i<=N; i++)
        for(int j=1; j<=N; j++) ans = max({ ans, dp[i][j][0] + pref[i+1][j], dp[i][j][1] + pref[i+1][j] });
    return ans;
}

Subtask #1
0 / 3.0

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

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Runtime error 250 ms 152632 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

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

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 8 ms 9564 KB Output is correct
10 Correct 55 ms 19356 KB Output is correct
11 Correct 10 ms 9560 KB Output is correct
12 Correct 57 ms 19284 KB Output is correct
13 Correct 2 ms 7000 KB Output is correct
14 Correct 55 ms 19444 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 8 ms 9564 KB Output is correct
10 Correct 55 ms 19356 KB Output is correct
11 Correct 10 ms 9560 KB Output is correct
12 Correct 57 ms 19284 KB Output is correct
13 Correct 2 ms 7000 KB Output is correct
14 Correct 55 ms 19444 KB Output is correct
15 Correct 55 ms 19312 KB Output is correct
16 Correct 2 ms 7004 KB Output is correct
17 Correct 61 ms 20448 KB Output is correct
18 Correct 61 ms 20560 KB Output is correct
19 Correct 74 ms 20560 KB Output is correct
20 Correct 66 ms 20368 KB Output is correct
21 Correct 61 ms 20560 KB Output is correct
22 Correct 69 ms 21468 KB Output is correct
23 Correct 56 ms 19540 KB Output is correct
24 Correct 60 ms 20048 KB Output is correct
25 Correct 56 ms 19440 KB Output is correct
26 Correct 57 ms 19540 KB Output is correct

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 8 ms 9564 KB Output is correct
10 Correct 55 ms 19356 KB Output is correct
11 Correct 10 ms 9560 KB Output is correct
12 Correct 57 ms 19284 KB Output is correct
13 Correct 2 ms 7000 KB Output is correct
14 Correct 55 ms 19444 KB Output is correct
15 Correct 55 ms 19312 KB Output is correct
16 Correct 2 ms 7004 KB Output is correct
17 Correct 61 ms 20448 KB Output is correct
18 Correct 61 ms 20560 KB Output is correct
19 Correct 74 ms 20560 KB Output is correct
20 Correct 66 ms 20368 KB Output is correct
21 Correct 61 ms 20560 KB Output is correct
22 Correct 69 ms 21468 KB Output is correct
23 Correct 56 ms 19540 KB Output is correct
24 Correct 60 ms 20048 KB Output is correct
25 Correct 56 ms 19440 KB Output is correct
26 Correct 57 ms 19540 KB Output is correct
27 Execution timed out 1037 ms 144772 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

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

Subtask #8
0 / 16.0

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