oj.uz

답안 #1022946

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1022946 2024-07-14T07:56:38 Z vjudge1 메기 농장 (IOI22_fish) C++17
55 / 100
 1000 ms 295924 KB 
#include "fish.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define pii pair<int, int>
#define ff first
#define ss second

const int MAXN = 300100;
int n, w[MAXN], m;
pii a[MAXN];

namespace A{
    ll solve(){
        ll ans = 0;
        for(int i=1; i<=m; i++){
            ans += w[i];
        }
        return ans;
    }
}

namespace B{
    ll d[3001][3001];
    ll dp[3001][3001];
    ll pref[3001][3001];
    ll ddp[3001][3001];
    ll suf[3001];
    ll solve(){
        for(int i=1; i<=m; i++){
            d[a[i].ff][a[i].ss] += w[i];
        }
        for(int i=1; i<=n; i++){
            dp[0][i] = -1e18;
            ddp[0][i] = -1e18;
        }
        dp[0][0] = 0;
        ddp[0][0] = 0;
        for(int i=1; i<=n; i++){
            for(int j=1; j<=n; j++){
                pref[i][j] = pref[i][j - 1] + d[i][j];
            }
            ll mx = -1e18;
            for(int j=n; j>=0; j--){
                mx = max(mx, dp[i-1][j] + pref[i][j]);
                suf[j] = mx;
            }
            ll pddp = -1e18, pdp = -1e18;
            mx = -1e18;
            for(int j=0; j<=n; j++) mx = max(mx, dp[i-1][j]);
            for(int j=0; j<=n; j++){
                ddp[i][j] = mx;
                dp[i][j] = 0;
                pddp = max(pddp, ddp[i-1][j]-pref[i-1][j]);
                ddp[i][j] = max(ddp[i][j], pddp + pref[i-1][j]);
                dp[i][j] = ddp[i][j];
                dp[i][j] = max(dp[i][j], suf[j]-pref[i][j]);
                pdp = max(pdp, ddp[i-1][j]-pref[i-1][j]);
                dp[i][j] = max(dp[i][j], pdp+pref[i-1][j]);
            }
        }
        //for(int i=1; i<=n; i++){
        //    for(int j=0; j<=n; j++){
        //        cout<<dp[i][j]<<' ';
        //    }
        //    cout<<'\n';
        //}
        ll ans = 0;
        for(int i=0; i<=n; i++) ans = max(ans, dp[n][i]);
        return ans;
    }
}

namespace C{
    ll d[5][100100];
    ll dp[5][100100];
    ll pref[5][100100];
    ll ddp[5][100100];
    ll suf[100100];
    ll solve(){
        for(int i=1; i<=m; i++){
            d[a[i].ff][a[i].ss] += w[i];
        }
        for(int i=1; i<=n; i++){
            dp[0][i] = -1e18;
            ddp[0][i] = -1e18;
        }
        dp[0][0] = 0;
        ddp[0][0] = 0;
        for(int i=1; i<=3; i++){
            for(int j=1; j<=n; j++){
                pref[i][j] = pref[i][j - 1] + d[i][j];
            }
            ll mx = -1e18;
            for(int j=n; j>=0; j--){
                mx = max(mx, dp[i-1][j] + pref[i][j]);
                suf[j] = mx;
            }
            ll pddp = -1e18, pdp = -1e18;
            mx = -1e18;
            for(int j=0; j<=n; j++) mx = max(mx, dp[i-1][j]);
            for(int j=0; j<=n; j++){
                ddp[i][j] = mx;
                dp[i][j] = 0;
                pddp = max(pddp, ddp[i-1][j]-pref[i-1][j]);
                ddp[i][j] = max(ddp[i][j], pddp + pref[i-1][j]);
                dp[i][j] = ddp[i][j];
                dp[i][j] = max(dp[i][j], suf[j]-pref[i][j]);
                pdp = max(pdp, ddp[i-1][j]-pref[i-1][j]);
                dp[i][j] = max(dp[i][j], pdp+pref[i-1][j]);
            }
        }
        //for(int i=1; i<=n; i++){
        //    for(int j=0; j<=n; j++){
        //        cout<<dp[i][j]<<' ';
        //    }
        //    cout<<'\n';
        //}
        ll ans = 0;
        for(int i=0; i<=n; i++) ans = max(ans, dp[n][i]);
        return ans;
    }
}



long long max_weights(int N, int M, vector<int> X, vector<int> Y,
                      vector<int> W) {
    n = N;
    m = M;
    for(int i=1; i<=m; i++){
        a[i] = {X[i-1]+1, Y[i-1]+1};
    }
    for(int i=1; i<=m; i++){
        w[i] = W[i-1];
    }
    int ok1 = 1;
    int ok2 = 1, ok3 = 1;
    for(int i=1; i<=m; i++){
        ok1 &= (a[i].ff % 2 == 1);
        ok2 &= (a[i].ff < 2);
    }
    if(ok1) return A::solve();
    if(ok2) return C::solve();
    return B::solve();
    return 0;
}

Compilation message

fish.cpp: In function 'long long int max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:139:18: warning: unused variable 'ok3' [-Wunused-variable]
  139 |     int ok2 = 1, ok3 = 1;
      |                  ^~~

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 7248 KB Output is correct
2 Correct 19 ms 8532 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 58 ms 18032 KB Output is correct
6 Correct 63 ms 17584 KB Output is correct

Subtask #2
0 / 6.0

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

Subtask #3
0 / 9.0

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

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 0 ms 2392 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 2 ms 5468 KB Output is correct
10 Correct 4 ms 11612 KB Output is correct
11 Correct 2 ms 5468 KB Output is correct
12 Correct 3 ms 9308 KB Output is correct
13 Correct 2 ms 3672 KB Output is correct
14 Correct 6 ms 9308 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 0 ms 2392 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 2 ms 5468 KB Output is correct
10 Correct 4 ms 11612 KB Output is correct
11 Correct 2 ms 5468 KB Output is correct
12 Correct 3 ms 9308 KB Output is correct
13 Correct 2 ms 3672 KB Output is correct
14 Correct 6 ms 9308 KB Output is correct
15 Correct 4 ms 9308 KB Output is correct
16 Correct 1 ms 5724 KB Output is correct
17 Correct 13 ms 11308 KB Output is correct
18 Correct 12 ms 11096 KB Output is correct
19 Correct 13 ms 13268 KB Output is correct
20 Correct 13 ms 11732 KB Output is correct
21 Correct 13 ms 13264 KB Output is correct
22 Correct 22 ms 13916 KB Output is correct
23 Correct 5 ms 10332 KB Output is correct
24 Correct 9 ms 13400 KB Output is correct
25 Correct 4 ms 9564 KB Output is correct
26 Correct 6 ms 10076 KB Output is correct

Subtask #6
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 0 ms 2392 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 2 ms 5468 KB Output is correct
10 Correct 4 ms 11612 KB Output is correct
11 Correct 2 ms 5468 KB Output is correct
12 Correct 3 ms 9308 KB Output is correct
13 Correct 2 ms 3672 KB Output is correct
14 Correct 6 ms 9308 KB Output is correct
15 Correct 4 ms 9308 KB Output is correct
16 Correct 1 ms 5724 KB Output is correct
17 Correct 13 ms 11308 KB Output is correct
18 Correct 12 ms 11096 KB Output is correct
19 Correct 13 ms 13268 KB Output is correct
20 Correct 13 ms 11732 KB Output is correct
21 Correct 13 ms 13264 KB Output is correct
22 Correct 22 ms 13916 KB Output is correct
23 Correct 5 ms 10332 KB Output is correct
24 Correct 9 ms 13400 KB Output is correct
25 Correct 4 ms 9564 KB Output is correct
26 Correct 6 ms 10076 KB Output is correct
27 Correct 169 ms 224020 KB Output is correct
28 Correct 97 ms 35920 KB Output is correct
29 Correct 216 ms 228496 KB Output is correct
30 Correct 203 ms 271440 KB Output is correct
31 Correct 198 ms 271904 KB Output is correct
32 Correct 63 ms 31828 KB Output is correct
33 Correct 223 ms 295924 KB Output is correct
34 Correct 257 ms 295792 KB Output is correct
35 Correct 174 ms 234764 KB Output is correct
36 Correct 188 ms 242544 KB Output is correct

Subtask #7
0 / 14.0

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

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 7248 KB Output is correct
2 Correct 19 ms 8532 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 58 ms 18032 KB Output is correct
6 Correct 63 ms 17584 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Execution timed out 1056 ms 193620 KB Time limit exceeded
9 Halted 0 ms 0 KB -