oj.uz

Submission #1083808

# Submission time Handle Problem Language Result Execution time Memory
1083808 2024-09-04T07:54:31 Z SamueleVid Catfish Farm (IOI22_fish) C++17
9 / 100
 67 ms 17488 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 == 1) exit(-1);
    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];
    }



    // cout << "sum : " << sum << '\n';

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

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

    // for (int i = 0; i < N + 5; i ++) {
    //     cout << pos[0][i] << " ";
    // }
    // cout << '\n';
    // for (int i = 0; i < N + 5; i ++) {
    //     cout << pos[1][i] << " ";
    // }
    // cout << '\n';

    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);
        // cout << "per i : " << i << " avremmo " << sum - sum_uno + sum_zero << '\n';
    }

    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<int> 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[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]);

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

    return dp[0][0];
}


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;
    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:97:10: warning: unused variable 'y_zero' [-Wunused-variable]
   97 |     bool y_zero = 1;
      |          ^~~~~~
fish.cpp:99:29: warning: control reaches end of non-void function [-Wreturn-type]
   99 |     res_y_zero(N, M, X, Y, W);
      |                             ^

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 4696 KB Output is correct
2 Correct 18 ms 5460 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 67 ms 17124 KB Output is correct
6 Correct 61 ms 17488 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 31 ms 11020 KB Output is correct
3 Correct 39 ms 13144 KB Output is correct
4 Correct 15 ms 4440 KB Output is correct
5 Correct 17 ms 5456 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 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 15 ms 6632 KB Output is correct
13 Correct 19 ms 8028 KB Output is correct
14 Correct 17 ms 6764 KB Output is correct
15 Correct 19 ms 7516 KB Output is correct
16 Correct 16 ms 6748 KB Output is correct
17 Correct 18 ms 7500 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Runtime error 2 ms 2652 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 348 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 348 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 348 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Runtime error 2 ms 2652 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 4696 KB Output is correct
2 Correct 18 ms 5460 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 67 ms 17124 KB Output is correct
6 Correct 61 ms 17488 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 31 ms 11020 KB Output is correct
9 Correct 39 ms 13144 KB Output is correct
10 Correct 15 ms 4440 KB Output is correct
11 Correct 17 ms 5456 KB Output is correct
12 Correct 0 ms 348 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 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 15 ms 6632 KB Output is correct
19 Correct 19 ms 8028 KB Output is correct
20 Correct 17 ms 6764 KB Output is correct
21 Correct 19 ms 7516 KB Output is correct
22 Correct 16 ms 6748 KB Output is correct
23 Correct 18 ms 7500 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Runtime error 2 ms 2652 KB Execution killed with signal 6
26 Halted 0 ms 0 KB -