oj.uz

답안 #1069418

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1069418 2024-08-21T21:50:02 Z beaconmc 메기 농장 (IOI22_fish) C++17
14 / 100
 226 ms 15668 KB 
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include "fish.h"

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define FOR(i,x,y) for(ll i=x; i<y; i++)
#define FORNEG(i,x,y) for(ll i=x; i>y; i--)

const ll maxn = 305;


bool fish[maxn][maxn];
ll weights[maxn][maxn];


ll dp[maxn][maxn][2][2];



long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,
                      std::vector<int> W) {
    FOR(i,0,maxn){
        FOR(j,0,maxn){
                fish[i][j] = false;

                dp[i][j][0][0] = 0;
                dp[i][j][1][0] = 0;
                dp[i][j][1][1] = 0;
                dp[i][j][0][1] = 0;

        }
    }


    FOR(i,0,M){
        Y[i]++;
        fish[X[i]][Y[i]] = 1;
        weights[X[i]][Y[i]] = W[i];
    }


    FOR(j,0,N){
        FOR(i,0,N+1){
            FOR(k,0,2){
                FOR(l,0,2){
                    if (l==1 && k==0) continue;
                    ll temp = 0;
                    if (l==1){


                        FOR(height, 0, N+1){
                            if (j>0 && fish[j-1][height] && i < height) temp += weights[j-1][height];
                            if (fish[j+1][height]) temp += weights[j+1][height];
                            dp[height][j+1][k][0] = max(dp[height][j+1][k][0], dp[i][j][k][l] + temp);

                        }

                    }else{

                        FOR(height, 0, N+1){
                            
                            if (fish[j][height] && i >= height) temp -= weights[j][height];
                            if (k != 0 && j>0 && fish[j-1][height] && i < height) temp += weights[j-1][height];
                            if (fish[j+1][height]) temp += weights[j+1][height];



                            if (i != 0 && height==0){
                                dp[i][j+1][1][1] = max( dp[i][j+1][1][1], dp[i][j][k][l]+temp);
                            }
                            else if (height<i){
                                dp[height][j+1][0][0] = max(dp[height][j+1][0][0], dp[i][j][k][l]+temp);
                            }else if (height >= i) {
                                dp[height][j+1][1][0] = max(dp[height][j+1][1][0], dp[i][j][k][l]+temp);
                            }

                        }
                    }
                }
            }
        }
    }


    ll ans = 0;

    FOR(i,0,N) FOR(j,0,N+1) FOR(k,0,2) FOR(l,0,2){
        ans = max(ans, dp[i][j][k][l]);


    }

    return ans;





}

Subtask #1
0 / 3.0

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

Subtask #2
0 / 6.0

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

Subtask #3
0 / 9.0

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

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3420 KB Output is correct
2 Correct 1 ms 3420 KB Output is correct
3 Correct 1 ms 3420 KB Output is correct
4 Correct 1 ms 3420 KB Output is correct
5 Correct 1 ms 3420 KB Output is correct
6 Correct 1 ms 3420 KB Output is correct
7 Correct 1 ms 3420 KB Output is correct
8 Correct 1 ms 3420 KB Output is correct
9 Correct 24 ms 3676 KB Output is correct
10 Correct 195 ms 4188 KB Output is correct
11 Correct 24 ms 3676 KB Output is correct
12 Correct 176 ms 3932 KB Output is correct
13 Correct 4 ms 3420 KB Output is correct
14 Correct 175 ms 4144 KB Output is correct

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3420 KB Output is correct
2 Correct 1 ms 3420 KB Output is correct
3 Correct 1 ms 3420 KB Output is correct
4 Correct 1 ms 3420 KB Output is correct
5 Correct 1 ms 3420 KB Output is correct
6 Correct 1 ms 3420 KB Output is correct
7 Correct 1 ms 3420 KB Output is correct
8 Correct 1 ms 3420 KB Output is correct
9 Correct 24 ms 3676 KB Output is correct
10 Correct 195 ms 4188 KB Output is correct
11 Correct 24 ms 3676 KB Output is correct
12 Correct 176 ms 3932 KB Output is correct
13 Correct 4 ms 3420 KB Output is correct
14 Correct 175 ms 4144 KB Output is correct
15 Correct 202 ms 4136 KB Output is correct
16 Correct 5 ms 3420 KB Output is correct
17 Incorrect 226 ms 5004 KB 1st lines differ - on the 1st token, expected: '15950010139738', found: '15949988704079'
18 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3420 KB Output is correct
2 Correct 1 ms 3420 KB Output is correct
3 Correct 1 ms 3420 KB Output is correct
4 Correct 1 ms 3420 KB Output is correct
5 Correct 1 ms 3420 KB Output is correct
6 Correct 1 ms 3420 KB Output is correct
7 Correct 1 ms 3420 KB Output is correct
8 Correct 1 ms 3420 KB Output is correct
9 Correct 24 ms 3676 KB Output is correct
10 Correct 195 ms 4188 KB Output is correct
11 Correct 24 ms 3676 KB Output is correct
12 Correct 176 ms 3932 KB Output is correct
13 Correct 4 ms 3420 KB Output is correct
14 Correct 175 ms 4144 KB Output is correct
15 Correct 202 ms 4136 KB Output is correct
16 Correct 5 ms 3420 KB Output is correct
17 Incorrect 226 ms 5004 KB 1st lines differ - on the 1st token, expected: '15950010139738', found: '15949988704079'
18 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

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

Subtask #8
0 / 16.0

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