oj.uz

답안 #629288

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
629288 2022-08-14T10:42:52 Z qwerasdfzxcl 메기 농장 (IOI22_fish) C++17
9 / 100
 781 ms 131352 KB 
#include "fish.h"
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
const ll INF = 4e18;
vector<int> H[100100], A[100100];
vector<ll> dp[2][100100], S[100100], prf[2][100100], suf[2][100100];
int n, sz[100100];

ll cost(int i, int s, int e){
    if (s>e || i==0) return 0;
    int j1 = upper_bound(H[i].begin(), H[i].end(), s-1) - H[i].begin() - 1;
    int j2 = upper_bound(H[i].begin(), H[i].end(), e) - H[i].begin() - 1;
    return S[i][j2] - S[i][j1];
}

long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,
                      std::vector<int> W) {
    n = N;
    for (int i=0;i<=N;i++) {H[i].push_back(0); H[i].push_back(N);}
    for (int i=0;i<M;i++){
        ++X[i], ++Y[i];
        H[X[i]].push_back(Y[i]);
        H[X[i]].push_back(Y[i]-1);
        if (X[i]>1) H[X[i]-1].push_back(Y[i]);
        if (X[i]<N) H[X[i]+1].push_back(Y[i]);
    }


    for (int i=0;i<=N;i++){
        sort(H[i].begin(), H[i].end());
        H[i].erase(unique(H[i].begin(), H[i].end()), H[i].end());
        sz[i] = H[i].size();

        A[i].resize(sz[i], 0);
        S[i].resize(sz[i], 0);
        dp[0][i].resize(sz[i], 0);
        dp[1][i].resize(sz[i], 0);
        prf[0][i].resize(sz[i]);
        prf[1][i].resize(sz[i]);
        suf[0][i].resize(sz[i]);
        suf[1][i].resize(sz[i]);
    }

    for (int i=0;i<M;i++){
        int idx = lower_bound(H[X[i]].begin(), H[X[i]].end(), Y[i]) - H[X[i]].begin();
        assert(idx < sz[X[i]]);
        A[X[i]][idx] = W[i];
    }


    for (int i=1;i<=n;i++){
        for (int j=1;j<sz[i];j++) S[i][j] = S[i][j-1] + A[i][j];
    }


    dp[0][0][0] = 0;
    dp[1][0][0] = 0;
    assert(sz[0]==2);
    dp[0][0][1] = -INF;
    dp[1][0][1] = -INF;

    for (int i=1;i<=n;i++){
        --i;
        for (int j=0;j<sz[i];j++){
            prf[0][i][j] = dp[0][i][j] + cost(i, H[i][j]+1, n);
            prf[1][i][j] = max(dp[0][i][j], dp[1][i][j]);

            if (j==0) continue;
            prf[0][i][j] = max(prf[0][i][j], prf[0][i][j-1]);
            prf[1][i][j] = max(prf[1][i][j], prf[1][i][j-1]);

        }
        for (int j=sz[i]-1;j>=0;j--){
            ll X = cost(i+1, 1, H[i][j]);
            suf[0][i][j] = max(dp[0][i][j], dp[1][i][j]) + X;
            suf[1][i][j] = dp[1][i][j] + X;

            if (j==sz[i]-1) continue;
            suf[0][i][j] = max(suf[0][i][j], suf[0][i][j+1]);
            suf[1][i][j] = max(suf[1][i][j], suf[1][i][j+1]);
        }
        ++i;

        for (int j=0;j<sz[i];j++){
            ll X1 = cost(i-1, 1, H[i][j]);
            ll X2 = cost(i, 1, H[i][j]);

            ///0 -> 0
            int idx00 = upper_bound(H[i-1].begin(), H[i-1].end(), H[i][j]) - H[i-1].begin() - 1;
            dp[0][i][j] = max(dp[0][i][j], prf[0][i-1][idx00] - (S[i-1].back() - X1));

            ///1 -> 0
            if (i>=2){
                int idx10 = upper_bound(H[i-2].begin(), H[i-2].end(), H[i][j]) - H[i-2].begin() - 1;
                dp[0][i][j] = max(dp[0][i][j], prf[1][i-2][idx10] + X1);
                if (idx10+1 < sz[i-2]) dp[0][i][j] = max(dp[0][i][j], suf[0][i-2][idx10+1]);
            }

            ///0 -> 1
            dp[1][i][j] = max(dp[1][i][j], dp[0][i-1][sz[i-1]-1] + (S[i].back() - X2));

            ///1 -> 1
            int idx11 = idx00;
            if (H[i-1][idx11]<H[i][j]) idx11++;
            dp[1][i][j] = max(dp[1][i][j], suf[1][i-1][idx11] - X1);
        }
    }

    return max(*max_element(dp[0][n].begin(), dp[0][n].end()), *max_element(dp[1][n].begin(), dp[1][n].end()));
}

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 190 ms 60000 KB Output is correct
2 Correct 229 ms 65340 KB Output is correct
3 Correct 102 ms 50068 KB Output is correct
4 Correct 88 ms 50132 KB Output is correct
5 Correct 676 ms 116860 KB Output is correct
6 Correct 781 ms 131352 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 21460 KB Output is correct
2 Correct 307 ms 68536 KB Output is correct
3 Correct 365 ms 75100 KB Output is correct
4 Correct 209 ms 60000 KB Output is correct
5 Correct 241 ms 65240 KB Output is correct
6 Correct 13 ms 21460 KB Output is correct
7 Correct 14 ms 21424 KB Output is correct
8 Correct 12 ms 21452 KB Output is correct
9 Correct 13 ms 21460 KB Output is correct
10 Correct 105 ms 50100 KB Output is correct
11 Correct 101 ms 49896 KB Output is correct
12 Correct 261 ms 65160 KB Output is correct
13 Correct 285 ms 71624 KB Output is correct
14 Correct 270 ms 62556 KB Output is correct
15 Correct 227 ms 61928 KB Output is correct
16 Correct 257 ms 62660 KB Output is correct
17 Correct 243 ms 67140 KB Output is correct

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 84 ms 50004 KB Output is correct
2 Correct 114 ms 49984 KB Output is correct
3 Incorrect 127 ms 49412 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '21651144331432'
4 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 21460 KB Output is correct
2 Correct 11 ms 21448 KB Output is correct
3 Correct 11 ms 21460 KB Output is correct
4 Correct 11 ms 21448 KB Output is correct
5 Correct 15 ms 21460 KB Output is correct
6 Correct 14 ms 21384 KB Output is correct
7 Correct 13 ms 21460 KB Output is correct
8 Correct 12 ms 21348 KB Output is correct
9 Correct 15 ms 21460 KB Output is correct
10 Correct 14 ms 21704 KB Output is correct
11 Incorrect 12 ms 21604 KB 1st lines differ - on the 1st token, expected: '278622587073', found: '279844243899'
12 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 21460 KB Output is correct
2 Correct 11 ms 21448 KB Output is correct
3 Correct 11 ms 21460 KB Output is correct
4 Correct 11 ms 21448 KB Output is correct
5 Correct 15 ms 21460 KB Output is correct
6 Correct 14 ms 21384 KB Output is correct
7 Correct 13 ms 21460 KB Output is correct
8 Correct 12 ms 21348 KB Output is correct
9 Correct 15 ms 21460 KB Output is correct
10 Correct 14 ms 21704 KB Output is correct
11 Incorrect 12 ms 21604 KB 1st lines differ - on the 1st token, expected: '278622587073', found: '279844243899'
12 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 21460 KB Output is correct
2 Correct 11 ms 21448 KB Output is correct
3 Correct 11 ms 21460 KB Output is correct
4 Correct 11 ms 21448 KB Output is correct
5 Correct 15 ms 21460 KB Output is correct
6 Correct 14 ms 21384 KB Output is correct
7 Correct 13 ms 21460 KB Output is correct
8 Correct 12 ms 21348 KB Output is correct
9 Correct 15 ms 21460 KB Output is correct
10 Correct 14 ms 21704 KB Output is correct
11 Incorrect 12 ms 21604 KB 1st lines differ - on the 1st token, expected: '278622587073', found: '279844243899'
12 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 84 ms 50004 KB Output is correct
2 Correct 114 ms 49984 KB Output is correct
3 Incorrect 127 ms 49412 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '21651144331432'
4 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 190 ms 60000 KB Output is correct
2 Correct 229 ms 65340 KB Output is correct
3 Correct 102 ms 50068 KB Output is correct
4 Correct 88 ms 50132 KB Output is correct
5 Correct 676 ms 116860 KB Output is correct
6 Correct 781 ms 131352 KB Output is correct
7 Correct 14 ms 21460 KB Output is correct
8 Correct 307 ms 68536 KB Output is correct
9 Correct 365 ms 75100 KB Output is correct
10 Correct 209 ms 60000 KB Output is correct
11 Correct 241 ms 65240 KB Output is correct
12 Correct 13 ms 21460 KB Output is correct
13 Correct 14 ms 21424 KB Output is correct
14 Correct 12 ms 21452 KB Output is correct
15 Correct 13 ms 21460 KB Output is correct
16 Correct 105 ms 50100 KB Output is correct
17 Correct 101 ms 49896 KB Output is correct
18 Correct 261 ms 65160 KB Output is correct
19 Correct 285 ms 71624 KB Output is correct
20 Correct 270 ms 62556 KB Output is correct
21 Correct 227 ms 61928 KB Output is correct
22 Correct 257 ms 62660 KB Output is correct
23 Correct 243 ms 67140 KB Output is correct
24 Correct 84 ms 50004 KB Output is correct
25 Correct 114 ms 49984 KB Output is correct
26 Incorrect 127 ms 49412 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '21651144331432'
27 Halted 0 ms 0 KB -