oj.uz

답안 #1022934

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1022934 2024-07-14T07:46:50 Z vjudge1 메기 농장 (IOI22_fish) C++17
35 / 100
 33 ms 15388 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;
    }
}

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;
    for(int i=1; i<=m; i++){
        ok1 &= (a[i].ff % 2 == 0);
    }
    if(ok1) return A::solve();
    if(n <= 300) return B::solve();
    return 0;
}

Subtask #1
0 / 3.0

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

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Incorrect 33 ms 9340 KB 1st lines differ - on the 1st token, expected: '40604614618209', found: '0'
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

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

Subtask #4
14.0 / 14.0

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

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 2 ms 5468 KB Output is correct
10 Correct 4 ms 11608 KB Output is correct
11 Correct 2 ms 7516 KB Output is correct
12 Correct 4 ms 11356 KB Output is correct
13 Correct 1 ms 3928 KB Output is correct
14 Correct 5 ms 11352 KB Output is correct
15 Correct 4 ms 11352 KB Output is correct
16 Correct 2 ms 5724 KB Output is correct
17 Correct 13 ms 11600 KB Output is correct
18 Correct 12 ms 11352 KB Output is correct
19 Correct 13 ms 13660 KB Output is correct
20 Correct 13 ms 13512 KB Output is correct
21 Correct 12 ms 13656 KB Output is correct
22 Correct 27 ms 15388 KB Output is correct
23 Correct 6 ms 12492 KB Output is correct
24 Correct 14 ms 13396 KB Output is correct
25 Correct 4 ms 11608 KB Output is correct
26 Correct 6 ms 12020 KB Output is correct

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 2 ms 5468 KB Output is correct
10 Correct 4 ms 11608 KB Output is correct
11 Correct 2 ms 7516 KB Output is correct
12 Correct 4 ms 11356 KB Output is correct
13 Correct 1 ms 3928 KB Output is correct
14 Correct 5 ms 11352 KB Output is correct
15 Correct 4 ms 11352 KB Output is correct
16 Correct 2 ms 5724 KB Output is correct
17 Correct 13 ms 11600 KB Output is correct
18 Correct 12 ms 11352 KB Output is correct
19 Correct 13 ms 13660 KB Output is correct
20 Correct 13 ms 13512 KB Output is correct
21 Correct 12 ms 13656 KB Output is correct
22 Correct 27 ms 15388 KB Output is correct
23 Correct 6 ms 12492 KB Output is correct
24 Correct 14 ms 13396 KB Output is correct
25 Correct 4 ms 11608 KB Output is correct
26 Correct 6 ms 12020 KB Output is correct
27 Incorrect 2 ms 4444 KB 1st lines differ - on the 1st token, expected: '2999', found: '0'
28 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

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

Subtask #8
0 / 16.0

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