oj.uz

답안 #1042171

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1042171 2024-08-02T15:37:27 Z VMaksimoski008 메기 농장 (IOI22_fish) C++17
64 / 100
 294 ms 501600 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], smx1[3005][3005], pmx2[3005][3005], smx2[3005][3005];
 
ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
    int mask = 0, mx = 0;
    for(int i=0; i<M; i++) mask |= (1 << (X[i] % 2));
    for(int i=0; i<M; i++) mx = max(mx, Y[i]);
 
    if(mask == 1) {
        ll ans = 0;
        for(int &x : W) ans += x;
        return ans;
    }

    if(mx == 0) {
        vector<ll> val(N+5), dp(N+5);
        for(int i=0; i<M; i++) val[X[i]] = W[i];
 
        ll ans = 0;
        vector<ll> MX(N+5); MX[0] = val[1];
        for(int i=1; i<N; i++) {
            dp[i] = max(dp[i-1], val[i-1]);
            if(i >= 3) dp[i] = max(dp[i], MX[i-3] + val[i-1]);
            if(i >= 2) dp[i] = max(dp[i], dp[i-2] + val[i-1]);
            MX[i] = max(MX[i-1], dp[i] + val[i+1]);
        }
 
        for(int i=0; i<N; i++) ans = max(ans, dp[i] + val[i+1]);
        return ans;
    }


    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] = smx1[i][j] = pmx2[i][j] = smx2[i][j] = -1e18;

    pmx1[1][0] = dp[1][0][1] - pref[1][0];
    smx1[1][N] = max(dp[1][N][0], dp[1][N][1]) + pref[2][N];
    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=N-1; i>=0; i--) smx1[1][i] = max(smx1[1][i+1], max(dp[1][i][0], dp[1][i][1]) + pref[2][i]);
    for(int i=1; i<=N; i++) pmx2[1][i] = max(pmx2[1][i-1], max(dp[1][i][0], dp[1][i][1]));
    for(int i=N-1; i>=0; i--) smx2[1][i] = max(smx2[i][i+1], max(dp[1][i][0], dp[1][i][1]));

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

            if(j) pmx1[i][j] = pmx1[i][j-1];
            if(j) pmx2[i][j] = pmx2[i][j-1];
            pmx1[i][j] = max(pmx1[i][j], dp[i][j][1] - pref[i][j]);
            pmx2[i][j] = max(pmx2[i][j], max(dp[i][j][0], dp[i][j][1]));
        }

        smx1[i][N] = max(dp[i][N][0], dp[i][N][1]) + pref[i+1][N];
        for(int j=N-1; j>=0; j--) smx1[i][j] = max(smx1[i][j+1], max(dp[i][j][0], dp[i][j][1]) + pref[i+1][j]);
        smx2[i][N] = max(dp[i][N][0], dp[i][N][1]);
        for(int j=N-1; j>=0; j--) smx2[i][j] = max(smx2[i][j+1], max(dp[i][j][0], dp[i][j][1]));
    }

    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
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 2140 KB Output is correct
2 Correct 17 ms 4424 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 61 ms 13652 KB Output is correct
6 Correct 48 ms 13908 KB Output is correct

Subtask #2
0 / 6.0

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

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 9 ms 4532 KB Output is correct
4 Correct 7 ms 4188 KB Output is correct
5 Correct 15 ms 6736 KB Output is correct
6 Correct 14 ms 6096 KB Output is correct
7 Correct 15 ms 6488 KB Output is correct
8 Correct 15 ms 6492 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Correct 1 ms 8540 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 1 ms 8540 KB Output is correct
8 Correct 1 ms 8540 KB Output is correct
9 Correct 3 ms 28136 KB Output is correct
10 Correct 6 ms 48216 KB Output is correct
11 Correct 3 ms 27996 KB Output is correct
12 Correct 6 ms 48220 KB Output is correct
13 Correct 2 ms 19292 KB Output is correct
14 Correct 7 ms 48220 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Correct 1 ms 8540 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 1 ms 8540 KB Output is correct
8 Correct 1 ms 8540 KB Output is correct
9 Correct 3 ms 28136 KB Output is correct
10 Correct 6 ms 48216 KB Output is correct
11 Correct 3 ms 27996 KB Output is correct
12 Correct 6 ms 48220 KB Output is correct
13 Correct 2 ms 19292 KB Output is correct
14 Correct 7 ms 48220 KB Output is correct
15 Correct 6 ms 48216 KB Output is correct
16 Correct 2 ms 19292 KB Output is correct
17 Correct 12 ms 49284 KB Output is correct
18 Correct 12 ms 47452 KB Output is correct
19 Correct 13 ms 49244 KB Output is correct
20 Correct 12 ms 49240 KB Output is correct
21 Correct 13 ms 49244 KB Output is correct
22 Correct 20 ms 50264 KB Output is correct
23 Correct 7 ms 48220 KB Output is correct
24 Correct 10 ms 48732 KB Output is correct
25 Correct 6 ms 48220 KB Output is correct
26 Correct 7 ms 48220 KB Output is correct

Subtask #6
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Correct 1 ms 8540 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 1 ms 8540 KB Output is correct
8 Correct 1 ms 8540 KB Output is correct
9 Correct 3 ms 28136 KB Output is correct
10 Correct 6 ms 48216 KB Output is correct
11 Correct 3 ms 27996 KB Output is correct
12 Correct 6 ms 48220 KB Output is correct
13 Correct 2 ms 19292 KB Output is correct
14 Correct 7 ms 48220 KB Output is correct
15 Correct 6 ms 48216 KB Output is correct
16 Correct 2 ms 19292 KB Output is correct
17 Correct 12 ms 49284 KB Output is correct
18 Correct 12 ms 47452 KB Output is correct
19 Correct 13 ms 49244 KB Output is correct
20 Correct 12 ms 49240 KB Output is correct
21 Correct 13 ms 49244 KB Output is correct
22 Correct 20 ms 50264 KB Output is correct
23 Correct 7 ms 48220 KB Output is correct
24 Correct 10 ms 48732 KB Output is correct
25 Correct 6 ms 48220 KB Output is correct
26 Correct 7 ms 48220 KB Output is correct
27 Correct 230 ms 494500 KB Output is correct
28 Correct 56 ms 95656 KB Output is correct
29 Correct 269 ms 501584 KB Output is correct
30 Correct 271 ms 501328 KB Output is correct
31 Correct 278 ms 501600 KB Output is correct
32 Correct 59 ms 82768 KB Output is correct
33 Correct 294 ms 501296 KB Output is correct
34 Correct 284 ms 501584 KB Output is correct
35 Correct 245 ms 496924 KB Output is correct
36 Correct 270 ms 501556 KB Output is correct

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 9 ms 4532 KB Output is correct
4 Correct 7 ms 4188 KB Output is correct
5 Correct 15 ms 6736 KB Output is correct
6 Correct 14 ms 6096 KB Output is correct
7 Correct 15 ms 6488 KB Output is correct
8 Correct 15 ms 6492 KB Output is correct
9 Runtime error 22 ms 6492 KB Execution killed with signal 11
10 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 2140 KB Output is correct
2 Correct 17 ms 4424 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 61 ms 13652 KB Output is correct
6 Correct 48 ms 13908 KB Output is correct
7 Correct 1 ms 8536 KB Output is correct
8 Runtime error 192 ms 154048 KB Execution killed with signal 11
9 Halted 0 ms 0 KB -