oj.uz

답안 #925281

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
925281 2024-02-11T10:15:42 Z IS_Rushdi 메기 농장 (IOI22_fish) C++17
0 / 100
 1000 ms 2097152 KB 
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
 
 
long long max_weights(int n,int m,vector<int>x,vector<int>y,vector<int>w){
    long long dp[n+2][n+2][2]{};
    int sum[n+2][n+2]{};
    for(int i = 0; i < m; i++) x[i] += 1;
    for(int i = 0; i < m; i++) y[i] += 1;
    for(int i = 0; i < m; i++) sum[x[i]][y[i]] += w[i];
    long long ans = 0;

    for(int i = 1; i <= n+1; i++){
        for(int j = 0; j < 2; j++){
            dp[0][i][j] = -1e18;
        }
    }
    dp[0][0][1] = 0;
    for(int i = 1; i <= n; i++){
        for(int j = 0; j <= n+1; j++){
            for(int k = 0; k <= n+1; k++){
                long long now = dp[i-1][j][1];
                int cur = k;
                while(cur > j) now += sum[i-1][cur--];
                cur = j;
                while(cur > k) now += sum[i][cur--];

                ans = max(ans,now);
                if(k > j) dp[i][k][1] = max(dp[i][k][1],now);
                else if (k < j){
                    dp[i][k][0] = max(dp[i][k][0],now);
                    now -= dp[i-1][j][1];
                    now += dp[i-1][j][0];
                    ans = max(ans,now);
                    dp[i][k][0] = max(dp[i][k][0],now);
                }
                else{
                    dp[i][k][1] = max(dp[i][k][1],now);
                    dp[i][k][0] = max(dp[i][k][0],now);
                    now -= dp[i-1][j][1];
                    now += dp[i-1][j][0];
                    ans = max(ans,now);
                    dp[i][k][0] = max(dp[i][k][0],now);
                    dp[i][k][1] = max(dp[i][k][1],now);
                }
            }
            dp[i][0][1] = max({dp[i][0][1],dp[i-1][j][1],dp[i-1][j][0]});

        }
    }
    return ans;
}
 
// int main(){
//     cout << max_weights(5, 4, {0, 1, 4, 3}, {2, 1, 4, 3}, {5, 2, 1, 3}) << '\n';
// }

Subtask #1
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1033 ms 2097152 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Execution timed out 1071 ms 2097152 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1039 ms 2097152 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 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 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 108 ms 872 KB Output is correct
10 Execution timed out 1048 ms 2140 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 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 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 108 ms 872 KB Output is correct
10 Execution timed out 1048 ms 2140 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 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 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 108 ms 872 KB Output is correct
10 Execution timed out 1048 ms 2140 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1039 ms 2097152 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1033 ms 2097152 KB Time limit exceeded
2 Halted 0 ms 0 KB -