oj.uz

답안 #1035751

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1035751 2024-07-26T14:34:21 Z Andrey 메기 농장 (IOI22_fish) C++17
0 / 100
 166 ms 202836 KB 
#include "fish.h"
#include<bits/stdc++.h>
using namespace std;

long long haha[5001][5001];
long long dp[5001][5001][3];

long long max_weights(int n, int m, vector<int> x, vector<int> y,  vector<int> w) {
    for(long long i = 0; i <= n; i++) {
        for(long long j = 0; j <= n; j++) {
            haha[i][j] = 0;
        }
    }
    for(long long i = 0; i < m; i++) {
        haha[x[i]+1][y[i]+1] = w[i];
    }
    for(long long i = 0; i <= n; i++) {
        dp[0][i][0] = -LLONG_MAX/2;
        dp[0][i][1] = -LLONG_MAX/2;
        dp[0][i][2] = -LLONG_MAX/2;
    }
    dp[0][0][0] = 0;
    for(long long i = 1; i <= n; i++) {
        long long br = 0;
        for(int j = 0; j <= n; j++) {
            dp[i][j][0] = -LLONG_MAX/2;
            dp[i][j][1] = -LLONG_MAX/2;
            dp[i][j][2] = -LLONG_MAX/2;
        }
        for(long long j = 0; j <= n; j++) {
            br+=haha[i][j];
            long long sb1 = br,sb2 = 0;
            dp[i][j][1] = max(dp[i][j][1],max(dp[i-1][j][0],dp[i-1][j][2])+br);
            for(int k = 0; k <= n; k++) {
                if(k > j) {
                    sb1+=haha[i-1][k];
                    sb2+=haha[i-1][k];
                }
                else {
                    sb1-=haha[i][k];
                }
                if(k <= j) {
                    dp[i][k][2] = max(dp[i][k][2],dp[i-1][j][2]+sb1);
                }
                else {
                    dp[i][k][0] = max(dp[i][k][0],dp[i-1][j][0]+sb1);
                }
                dp[i][k][0] = max(dp[i][k][0],dp[i-1][j][1]+sb2);
            }
        }
    }
    long long ans = 0;
    for(long long i = 0; i <= n; i++) {
        ans = max(ans,max(dp[n][i][0],dp[n][i][1]));
        ans = max(ans,dp[n][i][2]);
    }
    return ans;
}

Subtask #1
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 152 ms 199504 KB Execution killed with signal 11
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 166 ms 202836 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

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

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 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 Incorrect 0 ms 600 KB 1st lines differ - on the 1st token, expected: '2', found: '1'
9 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 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 Incorrect 0 ms 600 KB 1st lines differ - on the 1st token, expected: '2', found: '1'
9 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 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 Incorrect 0 ms 600 KB 1st lines differ - on the 1st token, expected: '2', found: '1'
9 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

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

Subtask #8
0 / 16.0

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