oj.uz

답안 #1067604

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1067604 2024-08-20T21:19:11 Z mariaclara 메기 농장 (IOI22_fish) C++17
3 / 100
 96 ms 35672 KB 
#include "fish.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef tuple<int,int,int> trio;
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define pb push_back
#define mk make_pair
#define fr first 
#define sc second

ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
    vector<ll> ans_col(N);
    vector<vector<pii>> val(N);
    vector<vector<ll>> dp[2];
    dp[0].resize(N); // x-1 < x
    dp[1].resize(N); // x-1 > x

    for(int i = 0; i < M; i++) val[X[i]].pb({Y[i], W[i]});
    
    dp[0][0].resize(sz(val[0])+1, 0);
    dp[1][0].resize(sz(val[0])+1, 0);

    for(int x = 1; x < N; x++) {
        sort(all(val[x]));
        reverse(all(val[x]));

        dp[0][x].resize(sz(val[x])+1);
        dp[1][x].resize(sz(val[x])+1);

        // >
        for(int i = 0, j = 0; i < sz(val[x]); i++) {
            auto [y,w] = val[x][i];
            if(i != 0) dp[1][x][i+1] = dp[1][x][i] + w;

            while(j < sz(val[x-1]) and val[x-1][j].fr > y) j++;
            
            dp[1][x][i+1] = max(dp[1][x][i+1], dp[1][x-1][j] + w); // LEMBRAR DE dp[1][x][j] max= dp[1][x][j-1]
            //cout << "x = " << x << ", i = " << i << ", y = " << y << ", w = " << w << ", dp = " << dp[1][x][i+1] << "\n";
        }

        // <
        ll w = 0, aux = 0;
        for(int i = sz(val[x]) - 1, j = sz(val[x-1]) - 1, y; i >= -1; i--) {
            if(i >= 0) y = val[x][i].fr;
            else y = N;

            dp[0][x][i+1] = max(dp[0][x][i+1], w);
            while(j >= 0 and val[x-1][j].fr < y) {
                w = max(w, dp[0][x-1][j+1]);
                w += val[x-1][j].sc;
                aux += val[x-1][j].sc;
                dp[0][x][i+1] = max(dp[0][x][i+1], w);
                j--;
            }

            if(x >= 2) dp[0][x][i+1] = max(dp[0][x][i+1], ans_col[x-2] + aux);
            //cout << "x = " << x << ", i = " << i << ", y = " << y << ", w = " << w << ", dp = " << dp[0][x][i+1] << "\n";
        }

        dp[1][x][0] = max(dp[1][x][0], dp[0][x][0]);
        for(int i = 1; i <= sz(val[x]); i++)
            dp[1][x][i] = max({dp[1][x][i], dp[1][x][i-1], dp[0][x][i]});

        ans_col[x] = dp[1][x][sz(val[x])];
    }

    return ans_col[N-1];
}

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 18256 KB Output is correct
2 Correct 39 ms 20880 KB Output is correct
3 Correct 11 ms 14428 KB Output is correct
4 Correct 11 ms 14424 KB Output is correct
5 Correct 96 ms 34872 KB Output is correct
6 Correct 96 ms 35672 KB Output is correct

Subtask #2
0 / 6.0

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

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 14428 KB Output is correct
2 Correct 11 ms 14500 KB Output is correct
3 Incorrect 25 ms 16988 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '21040570429644'
4 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Incorrect 1 ms 348 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '216535146944'
10 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Incorrect 1 ms 348 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '216535146944'
10 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Incorrect 1 ms 348 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '216535146944'
10 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 14428 KB Output is correct
2 Correct 11 ms 14500 KB Output is correct
3 Incorrect 25 ms 16988 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '21040570429644'
4 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 18256 KB Output is correct
2 Correct 39 ms 20880 KB Output is correct
3 Correct 11 ms 14428 KB Output is correct
4 Correct 11 ms 14424 KB Output is correct
5 Correct 96 ms 34872 KB Output is correct
6 Correct 96 ms 35672 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Incorrect 47 ms 23360 KB 1st lines differ - on the 1st token, expected: '40604614618209', found: '40479197388443'
9 Halted 0 ms 0 KB -