oj.uz

답안 #1075020

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1075020 2024-08-25T17:39:52 Z Zicrus 메기 농장 (IOI22_fish) C++17
0 / 100
 389 ms 264964 KB 
#include <bits/stdc++.h>
#include "fish.h"
using namespace std;
    
typedef long long ll;
    
int n, m;
vector<int> x, y, w;
    
ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
    n = N; m = M; x = X; y = Y; w = W;
    int q = min(n, 8+1);
    vector<vector<ll>> a(n, vector<ll>(q));
    for (int i = 0; i < m; i++) {
        a[x[i]][y[i]] = w[i];
    }
    vector<vector<ll>> sum(n, vector<ll>(q+1));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < q; j++) {
            sum[i][j+1] = sum[i][j] + a[i][j];
        }
    }

    vector<vector<vector<ll>>> dp(n, vector<vector<ll>>(q+1, vector<ll>(q+1)));
    for (int i = 1; i < n; i++) {
        for (int j = 0; j <= q; j++) {
            for (int j1 = 0; j1 <= q; j1++) {
                for (int k = 0; k <= q; k++) {
                    ll val = dp[i-1][j1][k];
                    if (j1 > j) val += sum[i][j1] - sum[i][j];
                    if (j > max(j1, k)) val += sum[i-1][j] - sum[i-1][max(j1, k)];
                    dp[i][j][j1] = max(dp[i][j][j1], val);
                }
            }
        }
    }

    ll res = 0;
    for (int j = 0; j <= q; j++) {
        for (int j1 = 0; j1 <= q; j1++) {
            res = max(res, dp[n-1][j][j1]);
        }
    }
    for (int i = n-2; i >= n-5 && i >= 0; i--) {
        for (int j = 0; j <= q; j++) {
            for (int j1 = 0; j1 <= q; j1++) {
                ll val = dp[i][j][j1] + sum[i][j];
                res = max(res, val);
            }
        }
    }
    return res;
}
    
#ifdef TEST
#include "grader.cpp"
#endif

Subtask #1
0 / 3.0

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

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 295 ms 143444 KB Output is correct
2 Correct 299 ms 143448 KB Output is correct
3 Correct 269 ms 132012 KB Output is correct
4 Correct 307 ms 145448 KB Output is correct
5 Correct 312 ms 148836 KB Output is correct
6 Correct 314 ms 147988 KB Output is correct
7 Incorrect 316 ms 148756 KB 1st lines differ - on the 1st token, expected: '136990846207', found: '136990846724'
8 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

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

Subtask #5
0 / 21.0

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

Subtask #6
0 / 17.0

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

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 295 ms 143444 KB Output is correct
2 Correct 299 ms 143448 KB Output is correct
3 Correct 269 ms 132012 KB Output is correct
4 Correct 307 ms 145448 KB Output is correct
5 Correct 312 ms 148836 KB Output is correct
6 Correct 314 ms 147988 KB Output is correct
7 Incorrect 316 ms 148756 KB 1st lines differ - on the 1st token, expected: '136990846207', found: '136990846724'
8 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

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