oj.uz

답안 #1070744

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1070744 2024-08-22T17:40:28 Z beaconmc 메기 농장 (IOI22_fish) C++17
52 / 100
 1000 ms 727120 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){
                      if (j==N) continue;
                        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:24: warning: unused variable 'add' [-Wunused-variable]
   52 |                     ll add = 0;
      |                        ^~~

Subtask #1
0 / 3.0

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

Subtask #2
0 / 6.0

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

Subtask #3
0 / 9.0

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

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 74332 KB Output is correct
2 Correct 13 ms 76636 KB Output is correct
3 Correct 13 ms 74332 KB Output is correct
4 Correct 13 ms 74324 KB Output is correct
5 Correct 13 ms 74428 KB Output is correct
6 Correct 12 ms 74328 KB Output is correct
7 Correct 13 ms 74328 KB Output is correct
8 Correct 13 ms 74332 KB Output is correct
9 Correct 20 ms 82268 KB Output is correct
10 Correct 24 ms 93008 KB Output is correct
11 Correct 18 ms 82268 KB Output is correct
12 Correct 26 ms 93020 KB Output is correct
13 Correct 14 ms 77924 KB Output is correct
14 Correct 19 ms 93020 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 74332 KB Output is correct
2 Correct 13 ms 76636 KB Output is correct
3 Correct 13 ms 74332 KB Output is correct
4 Correct 13 ms 74324 KB Output is correct
5 Correct 13 ms 74428 KB Output is correct
6 Correct 12 ms 74328 KB Output is correct
7 Correct 13 ms 74328 KB Output is correct
8 Correct 13 ms 74332 KB Output is correct
9 Correct 20 ms 82268 KB Output is correct
10 Correct 24 ms 93008 KB Output is correct
11 Correct 18 ms 82268 KB Output is correct
12 Correct 26 ms 93020 KB Output is correct
13 Correct 14 ms 77924 KB Output is correct
14 Correct 19 ms 93020 KB Output is correct
15 Correct 21 ms 93020 KB Output is correct
16 Correct 14 ms 77916 KB Output is correct
17 Correct 27 ms 94800 KB Output is correct
18 Correct 27 ms 94824 KB Output is correct
19 Correct 30 ms 94780 KB Output is correct
20 Correct 31 ms 94804 KB Output is correct
21 Correct 28 ms 94800 KB Output is correct
22 Correct 35 ms 96592 KB Output is correct
23 Correct 24 ms 93524 KB Output is correct
24 Correct 27 ms 94308 KB Output is correct
25 Correct 27 ms 93012 KB Output is correct
26 Correct 22 ms 93520 KB Output is correct

Subtask #6
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 74332 KB Output is correct
2 Correct 13 ms 76636 KB Output is correct
3 Correct 13 ms 74332 KB Output is correct
4 Correct 13 ms 74324 KB Output is correct
5 Correct 13 ms 74428 KB Output is correct
6 Correct 12 ms 74328 KB Output is correct
7 Correct 13 ms 74328 KB Output is correct
8 Correct 13 ms 74332 KB Output is correct
9 Correct 20 ms 82268 KB Output is correct
10 Correct 24 ms 93008 KB Output is correct
11 Correct 18 ms 82268 KB Output is correct
12 Correct 26 ms 93020 KB Output is correct
13 Correct 14 ms 77924 KB Output is correct
14 Correct 19 ms 93020 KB Output is correct
15 Correct 21 ms 93020 KB Output is correct
16 Correct 14 ms 77916 KB Output is correct
17 Correct 27 ms 94800 KB Output is correct
18 Correct 27 ms 94824 KB Output is correct
19 Correct 30 ms 94780 KB Output is correct
20 Correct 31 ms 94804 KB Output is correct
21 Correct 28 ms 94800 KB Output is correct
22 Correct 35 ms 96592 KB Output is correct
23 Correct 24 ms 93524 KB Output is correct
24 Correct 27 ms 94308 KB Output is correct
25 Correct 27 ms 93012 KB Output is correct
26 Correct 22 ms 93520 KB Output is correct
27 Correct 302 ms 704852 KB Output is correct
28 Correct 78 ms 148304 KB Output is correct
29 Correct 387 ms 707408 KB Output is correct
30 Correct 389 ms 722748 KB Output is correct
31 Correct 424 ms 722772 KB Output is correct
32 Correct 81 ms 129684 KB Output is correct
33 Correct 383 ms 727120 KB Output is correct
34 Correct 425 ms 727120 KB Output is correct
35 Correct 347 ms 709716 KB Output is correct
36 Correct 347 ms 682680 KB Output is correct

Subtask #7
0 / 14.0

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

Subtask #8
0 / 16.0

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