oj.uz

답안 #1079117

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1079117 2024-08-28T10:58:45 Z ArthuroWich 메기 농장 (IOI22_fish) C++17
0 / 100
 31 ms 21332 KB 
#include "fish.h"
#include<bits/stdc++.h>
using namespace std;
#define int long long int
int max_weights(int32_t N, int32_t M, vector<int32_t> X, vector<int32_t> Y, vector<int32_t> W) {
    int n = N, m = M;
    vector<vector<int>> c(1, vector<int>(n+1, 0));
    vector<vector<vector<int>>> dp(1, vector<vector<int>>(n+1, vector<int>(2, 0)));
    for (int i = 0; i < m; i++) {
        c[Y[i]][X[i]] = W[i];
    }
    int i = 0;
    for (int j = 0; j <= n; j++) {
        if (j-1 >= 0) {
            dp[i][j][0] = max(dp[i][j][0], dp[i][j-1][1]+c[i][j]);
            dp[i][j][0] = max(dp[i][j][0], dp[i][j-1][0]);
            dp[i][j][1] = max(dp[i][j][1], dp[i][j-1][0]);
            dp[i][j][1] = max(dp[i][j][1], dp[i][j-1][1]);
        }
        if (j == 1) {
            dp[i][j][1] = max(dp[i][j][1], dp[i][j-1][0]+c[i][j-1]);
        }
        if (j-2 >= 0) {
            dp[i][j][1] = max(dp[i][j][1], dp[i][j-2][0]+c[i][j-1]);
            dp[i][j][1] = max(dp[i][j][1], dp[i][j-2][1]+c[i][j-1]);
        }
    }
    return max(dp[0][n][0], dp[0][n][1]);
}

Subtask #1
0 / 3.0

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

Subtask #2
0 / 6.0

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

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 12104 KB Output is correct
2 Correct 12 ms 12108 KB Output is correct
3 Correct 19 ms 12188 KB Output is correct
4 Correct 15 ms 13640 KB Output is correct
5 Incorrect 30 ms 16084 KB 1st lines differ - on the 1st token, expected: '1673106170551', found: '1673122841934'
6 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

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

Subtask #5
0 / 21.0

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

Subtask #6
0 / 17.0

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

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 12104 KB Output is correct
2 Correct 12 ms 12108 KB Output is correct
3 Correct 19 ms 12188 KB Output is correct
4 Correct 15 ms 13640 KB Output is correct
5 Incorrect 30 ms 16084 KB 1st lines differ - on the 1st token, expected: '1673106170551', found: '1673122841934'
6 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

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