oj.uz

답안 #1083840

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1083840 2024-09-04T09:00:55 Z SamueleVid 메기 농장 (IOI22_fish) C++17
18 / 100
 56 ms 17492 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long

constexpr int MAXN = 1e5 + 5;

ll sum_tutto(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
    ll sum = 0;
    for (auto x : W) sum += x;
    return sum;
}

ll res_minore_di_due(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
    if (N == 2) {
        // massimo tra 0 e 1    
        ll one = 0;
        ll zero = 0;
        for (int i = 0; i < M; i ++) {
            if (X[i] == 0) zero += W[i];
            else one += W[i];
        }

        return max(one, zero);
    }

    // altrimenti piazza una riga in 2 e poi prendi prefisso maggiore piazzando in 1
    
    ll sum = 0;
    for (int i = 0; i < M; i ++) {
        if (X[i] == 1) sum += W[i];
    }

    vector<vector<ll>> pos(2, vector<ll>(N + 5, 0));

    for (int i = 0; i < M; i ++) {
        pos[X[i]][Y[i]] += W[i];
    }

    ll best_res = sum;

    ll sum_zero = 0;
    ll sum_uno = 0;
    for (int i = 0; i < N + 5; i ++) {
        sum_zero += pos[0][i];
        sum_uno += pos[1][i];
        best_res = max(best_res, sum - sum_uno + sum_zero);
    }

    return best_res;
}

ll res_y_zero(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
    vector<vector<ll>> dp(2, vector<ll>(N + 5)); // posso prendere a sx o no, posizione

    vector<ll> grid(N + 5);
    for (int i = 0; i < M; i ++) grid[X[i]] = W[i];

    for (int i = N - 1; i >= 0; i --) {
        dp[0][i] = dp[1][i + 1];
        dp[0][i] = max(dp[0][i], dp[0][i + 1]);
        dp[0][i] = max(dp[0][i], dp[0][i + 2] + grid[i + 1]);
        dp[0][i] = max(dp[0][i], dp[1][i + 3] + grid[i + 1]);
        dp[0][i] = max(dp[0][i], dp[0][i + 3] + grid[i + 1]);

        if (i != 0) {
            dp[1][i] = dp[1][i + 1];
            dp[1][i] = max(dp[1][i], dp[0][i + 1] + grid[i - 1]);
            dp[1][i] = max(dp[1][i], dp[0][i + 2] + grid[i - 1] + grid[i + 1]); 
            dp[1][i] = max(dp[1][i], dp[1][i + 3] + grid[i - 1] + grid[i + 1]); 
            dp[1][i] = max(dp[1][i], dp[0][i + 3] + grid[i - 1] + grid[i + 1]); 
        }
    }

    ll best_res = 0;
    for (int i = 0; i <= N; i ++) {
        best_res = max(best_res, dp[0][i]);
        best_res = max(best_res, dp[1][i]);
    }
    return best_res;
}


ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
    bool all_even = 1;
    for (auto x : X) if (x % 2) all_even = 0;
    if (all_even) return sum_tutto(N, M, X, Y, W);

    bool minore_di_due = 1;
    for (auto x : X) if (x >= 2) minore_di_due = 0;
    if (minore_di_due) return res_minore_di_due(N, M, X, Y, W);

    bool y_zero = 1;
    for (auto y : Y) if (y >= 0) minore_di_due = 0;
    return res_y_zero(N, M, X, Y, W);
}

Compilation message

fish.cpp: In function 'long long int max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:92:10: warning: unused variable 'y_zero' [-Wunused-variable]
   92 |     bool y_zero = 1;
      |          ^~~~~~

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 4444 KB Output is correct
2 Correct 19 ms 5724 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 55 ms 17128 KB Output is correct
6 Correct 56 ms 17492 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 34 ms 10908 KB Output is correct
3 Correct 43 ms 13136 KB Output is correct
4 Correct 15 ms 4440 KB Output is correct
5 Correct 18 ms 5588 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 16 ms 6748 KB Output is correct
13 Correct 21 ms 7864 KB Output is correct
14 Correct 18 ms 6748 KB Output is correct
15 Correct 20 ms 7516 KB Output is correct
16 Correct 18 ms 6640 KB Output is correct
17 Correct 18 ms 7504 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Correct 13 ms 5272 KB Output is correct
4 Correct 9 ms 4700 KB Output is correct
5 Correct 21 ms 7772 KB Output is correct
6 Correct 18 ms 7260 KB Output is correct
7 Correct 21 ms 7768 KB Output is correct
8 Correct 22 ms 7772 KB Output is correct

Subtask #4
0 / 14.0

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

Subtask #5
0 / 21.0

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

Subtask #6
0 / 17.0

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

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Correct 13 ms 5272 KB Output is correct
4 Correct 9 ms 4700 KB Output is correct
5 Correct 21 ms 7772 KB Output is correct
6 Correct 18 ms 7260 KB Output is correct
7 Correct 21 ms 7768 KB Output is correct
8 Correct 22 ms 7772 KB Output is correct
9 Incorrect 19 ms 7512 KB 1st lines differ - on the 1st token, expected: '99999', found: '66666'
10 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 4444 KB Output is correct
2 Correct 19 ms 5724 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 55 ms 17128 KB Output is correct
6 Correct 56 ms 17492 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 34 ms 10908 KB Output is correct
9 Correct 43 ms 13136 KB Output is correct
10 Correct 15 ms 4440 KB Output is correct
11 Correct 18 ms 5588 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 16 ms 6748 KB Output is correct
19 Correct 21 ms 7864 KB Output is correct
20 Correct 18 ms 6748 KB Output is correct
21 Correct 20 ms 7516 KB Output is correct
22 Correct 18 ms 6640 KB Output is correct
23 Correct 18 ms 7504 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 2 ms 2652 KB Output is correct
26 Correct 13 ms 5272 KB Output is correct
27 Correct 9 ms 4700 KB Output is correct
28 Correct 21 ms 7772 KB Output is correct
29 Correct 18 ms 7260 KB Output is correct
30 Correct 21 ms 7768 KB Output is correct
31 Correct 22 ms 7772 KB Output is correct
32 Incorrect 1 ms 348 KB 1st lines differ - on the 1st token, expected: '3', found: '2'
33 Halted 0 ms 0 KB -