oj.uz

답안 #1070661

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1070661 2024-08-22T16:33:56 Z beaconmc 메기 농장 (IOI22_fish) C++17
52 / 100
 1000 ms 727076 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 = 3005;


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

ll p[maxn][maxn];



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

ll pref[maxn][maxn][2];
ll pref2[maxn][maxn][2];
ll suff[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,M){
        Y[i]++;
        fish[X[i]][Y[i]] = true;
        weights[X[i]][Y[i]] = W[i];
    }
    FOR(i,0,maxn){
        p[i][0] = 0;
        FOR(j,1,maxn){
            p[i][j] = p[i][j-1] + weights[i][j];
        }
    }

    FOR(i,0,N+1){
        FOR(j,0,N+1){
            FOR(k,0,2){


                if (i<2) continue;
                ll temp = 0;
                ll add = 0;
                if (k==0){
                    temp = max(temp, suff[i-1][j+1][0] - p[i-1][j]);
                    temp = max(temp, suff[i-1][j+1][1] - p[i-1][j]);
                    // 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{
                    temp = max(temp, pref[i-1][j][0]);
                    temp = max(temp, pref[i-1][j][1] + p[i-2][j]);
                    // 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]);
                    //     temp = max(temp, dp[i-1][p][1] + add);
                    // }
                }
                dp[i][j][k] = temp;
            }
        }

        FOR(k,0,2){
            ll tempadd = 0;
            ll tempadd2 = 0;


            FOR(j,0,N+1){
                tempadd += weights[i][j];
                suff[i][j][k] = dp[i][j][k]+tempadd;
            }

            FOR(j,0,N+1){
                if (i>1) tempadd2 -= weights[i-1][j];
                pref[i][j][k] = dp[i][j][k] + tempadd2;
                pref2[i][j][k] = dp[i][j][k];
            }

            FOR(j,1,N+1){
                pref[i][j][k] = max(pref[i][j][k], pref[i][j-1][k]);
                pref2[i][j][k] = max(pref2[i][j][k], pref2[i][j-1][k]);
            }

            FORNEG(j,N,-1){
                suff[i][j][k] = max(suff[i][j][k], suff[i][j+1][k]);
            }
        }

    }


    ll ans = 0;
    FOR(i,0,N+1) FOR(j,0,N+1)FOR(k,0,2){
        //if (dp[i][j][k]==305) cout << i << " " << j << " " << k << endl;
        ans = max(ans, dp[i][j][k]);
    }
    return ans;







}

Compilation message

fish.cpp: In function 'long long int max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:52:20: warning: unused variable 'add' [-Wunused-variable]
   52 |                 ll add = 0;
      |                    ^~~

Subtask #1
0 / 3.0

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

Subtask #2
0 / 6.0

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

Subtask #3
0 / 9.0

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

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 80436 KB Output is correct
2 Correct 11 ms 82580 KB Output is correct
3 Correct 15 ms 78516 KB Output is correct
4 Correct 12 ms 78380 KB Output is correct
5 Correct 12 ms 78348 KB Output is correct
6 Correct 12 ms 78424 KB Output is correct
7 Correct 11 ms 78580 KB Output is correct
8 Correct 11 ms 78428 KB Output is correct
9 Correct 14 ms 107612 KB Output is correct
10 Correct 18 ms 113752 KB Output is correct
11 Correct 15 ms 109404 KB Output is correct
12 Correct 17 ms 113756 KB Output is correct
13 Correct 17 ms 97116 KB Output is correct
14 Correct 19 ms 115292 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 80436 KB Output is correct
2 Correct 11 ms 82580 KB Output is correct
3 Correct 15 ms 78516 KB Output is correct
4 Correct 12 ms 78380 KB Output is correct
5 Correct 12 ms 78348 KB Output is correct
6 Correct 12 ms 78424 KB Output is correct
7 Correct 11 ms 78580 KB Output is correct
8 Correct 11 ms 78428 KB Output is correct
9 Correct 14 ms 107612 KB Output is correct
10 Correct 18 ms 113752 KB Output is correct
11 Correct 15 ms 109404 KB Output is correct
12 Correct 17 ms 113756 KB Output is correct
13 Correct 17 ms 97116 KB Output is correct
14 Correct 19 ms 115292 KB Output is correct
15 Correct 17 ms 113756 KB Output is correct
16 Correct 15 ms 96856 KB Output is correct
17 Correct 26 ms 118864 KB Output is correct
18 Correct 28 ms 118620 KB Output is correct
19 Correct 28 ms 115540 KB Output is correct
20 Correct 27 ms 117076 KB Output is correct
21 Correct 39 ms 117072 KB Output is correct
22 Correct 36 ms 117332 KB Output is correct
23 Correct 20 ms 115804 KB Output is correct
24 Correct 23 ms 114772 KB Output is correct
25 Correct 18 ms 115292 KB Output is correct
26 Correct 18 ms 114012 KB Output is correct

Subtask #6
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 80436 KB Output is correct
2 Correct 11 ms 82580 KB Output is correct
3 Correct 15 ms 78516 KB Output is correct
4 Correct 12 ms 78380 KB Output is correct
5 Correct 12 ms 78348 KB Output is correct
6 Correct 12 ms 78424 KB Output is correct
7 Correct 11 ms 78580 KB Output is correct
8 Correct 11 ms 78428 KB Output is correct
9 Correct 14 ms 107612 KB Output is correct
10 Correct 18 ms 113752 KB Output is correct
11 Correct 15 ms 109404 KB Output is correct
12 Correct 17 ms 113756 KB Output is correct
13 Correct 17 ms 97116 KB Output is correct
14 Correct 19 ms 115292 KB Output is correct
15 Correct 17 ms 113756 KB Output is correct
16 Correct 15 ms 96856 KB Output is correct
17 Correct 26 ms 118864 KB Output is correct
18 Correct 28 ms 118620 KB Output is correct
19 Correct 28 ms 115540 KB Output is correct
20 Correct 27 ms 117076 KB Output is correct
21 Correct 39 ms 117072 KB Output is correct
22 Correct 36 ms 117332 KB Output is correct
23 Correct 20 ms 115804 KB Output is correct
24 Correct 23 ms 114772 KB Output is correct
25 Correct 18 ms 115292 KB Output is correct
26 Correct 18 ms 114012 KB Output is correct
27 Correct 314 ms 715604 KB Output is correct
28 Correct 91 ms 164580 KB Output is correct
29 Correct 363 ms 707252 KB Output is correct
30 Correct 396 ms 726992 KB Output is correct
31 Correct 377 ms 726908 KB Output is correct
32 Correct 85 ms 145244 KB Output is correct
33 Correct 385 ms 727076 KB Output is correct
34 Correct 380 ms 726864 KB Output is correct
35 Correct 344 ms 719956 KB Output is correct
36 Correct 328 ms 682976 KB Output is correct

Subtask #7
0 / 14.0

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

Subtask #8
0 / 16.0

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