oj.uz

답안 #1070306

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1070306 2024-08-22T13:02:13 Z beaconmc 메기 농장 (IOI22_fish) C++17
0 / 100
 1000 ms 5980 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];



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;
                dp[i][j][1] = 0;
        }
    }

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

    FOR(i,2,N+1){
        FOR(j,0,N+1){
            FOR(k,0,2){
                ll temp = 0;
                ll add = 0;
                if (k==0){
                    FOR(p,j+1,N+1){
                        if (fish[i-1][p]) add += weights[i-1][p];
                        temp = max(temp, dp[i-1][p][0] + add);
                        temp = max(temp, dp[i-1][p][1] + add);
                    }
                }else{
                    FOR(p,0,j+1) if (fish[i-2][p]) add += weights[i-2][p];
                    FOR(p,0,j+1){
                        if (fish[i-2][p]) add -= weights[i-2][p];
                        temp = max(temp, dp[i-1][p][0] + add);
                        temp = max(temp, dp[i-1][p][1] + add);
                    }
                }
                dp[i][j][k] = temp;
            }
        }
    }







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







}

Subtask #1
0 / 3.0

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

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 2652 KB 1st lines differ - on the 1st token, expected: '2', found: '1'
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

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

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 2488 KB 1st lines differ - on the 1st token, expected: '3', found: '2'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 2488 KB 1st lines differ - on the 1st token, expected: '3', found: '2'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 2488 KB 1st lines differ - on the 1st token, expected: '3', found: '2'
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

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

Subtask #8
0 / 16.0

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