oj.uz

답안 #1067622

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1067622 2024-08-20T21:47:44 Z mariaclara 메기 농장 (IOI22_fish) C++17
64 / 100
 103 ms 29012 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;
        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;
                dp[0][x][i+1] = max(dp[0][x][i+1], w);
                j--;
            }
 
            dp[0][x][i+1] = max(dp[0][x][i+1], ans_col[x-1]);
            //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 16836 KB Output is correct
2 Correct 32 ms 19140 KB Output is correct
3 Correct 13 ms 14320 KB Output is correct
4 Correct 13 ms 14428 KB Output is correct
5 Correct 103 ms 28600 KB Output is correct
6 Correct 89 ms 29012 KB Output is correct

Subtask #2
0 / 6.0

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

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 14428 KB Output is correct
2 Correct 17 ms 14428 KB Output is correct
3 Correct 26 ms 15952 KB Output is correct
4 Correct 24 ms 16988 KB Output is correct
5 Correct 41 ms 21588 KB Output is correct
6 Correct 36 ms 20948 KB Output is correct
7 Correct 37 ms 21328 KB Output is correct
8 Correct 42 ms 21328 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 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 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 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 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 12 ms 2516 KB Output is correct
18 Correct 14 ms 2908 KB Output is correct
19 Correct 11 ms 2908 KB Output is correct
20 Correct 10 ms 2912 KB Output is correct
21 Correct 10 ms 2908 KB Output is correct
22 Correct 20 ms 5204 KB Output is correct
23 Correct 2 ms 864 KB Output is correct
24 Correct 7 ms 1884 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 2 ms 856 KB Output is correct

Subtask #6
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 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 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 12 ms 2516 KB Output is correct
18 Correct 14 ms 2908 KB Output is correct
19 Correct 11 ms 2908 KB Output is correct
20 Correct 10 ms 2912 KB Output is correct
21 Correct 10 ms 2908 KB Output is correct
22 Correct 20 ms 5204 KB Output is correct
23 Correct 2 ms 864 KB Output is correct
24 Correct 7 ms 1884 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 2 ms 856 KB Output is correct
27 Correct 1 ms 860 KB Output is correct
28 Correct 51 ms 15884 KB Output is correct
29 Correct 103 ms 21720 KB Output is correct
30 Correct 74 ms 21224 KB Output is correct
31 Correct 82 ms 21224 KB Output is correct
32 Correct 72 ms 21996 KB Output is correct
33 Correct 83 ms 21328 KB Output is correct
34 Correct 80 ms 21200 KB Output is correct
35 Correct 28 ms 8528 KB Output is correct
36 Correct 74 ms 21844 KB Output is correct

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 14428 KB Output is correct
2 Correct 17 ms 14428 KB Output is correct
3 Correct 26 ms 15952 KB Output is correct
4 Correct 24 ms 16988 KB Output is correct
5 Correct 41 ms 21588 KB Output is correct
6 Correct 36 ms 20948 KB Output is correct
7 Correct 37 ms 21328 KB Output is correct
8 Correct 42 ms 21328 KB Output is correct
9 Correct 39 ms 21248 KB Output is correct
10 Correct 33 ms 12884 KB Output is correct
11 Correct 64 ms 25684 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 436 KB Output is correct
18 Correct 13 ms 14424 KB Output is correct
19 Correct 14 ms 14428 KB Output is correct
20 Correct 13 ms 14428 KB Output is correct
21 Correct 12 ms 14428 KB Output is correct
22 Correct 41 ms 20892 KB Output is correct
23 Incorrect 66 ms 25680 KB 1st lines differ - on the 1st token, expected: '77772396150817', found: '77771938846818'
24 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 16836 KB Output is correct
2 Correct 32 ms 19140 KB Output is correct
3 Correct 13 ms 14320 KB Output is correct
4 Correct 13 ms 14428 KB Output is correct
5 Correct 103 ms 28600 KB Output is correct
6 Correct 89 ms 29012 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Incorrect 53 ms 20964 KB 1st lines differ - on the 1st token, expected: '40604614618209', found: '40479197388443'
9 Halted 0 ms 0 KB -