oj.uz

Submission #625508

# Submission time Handle Problem Language Result Execution time Memory
625508 2022-08-10T14:02:01 Z I_love_Hoang_Yen Catfish Farm (IOI22_fish) C++17
18 / 100
 98 ms 19788 KB 
#include "bits/stdc++.h"
using namespace std;

#define int long long
struct Fish {
    int col, row;
    int weight;
};
bool operator < (const Fish& a, const Fish& b) {
    if (a.col != b.col) return a.col < b.col;
    return a.row < b.row;
}

// fishes are on even columns -> build piers on odd columns
// & catch all fishes
int sub1(const std::vector<Fish>& fishes) {
    int res = 0;
    for (const auto& fish : fishes) {
        res += fish.weight;
    }
    return res;
}

// fishes are on first 2 columns
int sub2(int n, const std::vector<Fish>& fishes) {
    std::vector<int> zeroes(n);  // prefix sum of fish weights at column == 0
    std::vector<int> ones(n);    // prefix sum of fish weights at column == 1
    for (const auto& fish : fishes) {
        if (fish.col == 0) zeroes[fish.row] += fish.weight;
        if (fish.col == 1) ones[fish.row] += fish.weight;
    }

    std::partial_sum(zeroes.begin(), zeroes.end(), zeroes.begin());
    std::partial_sum(ones.begin(), ones.end(), ones.begin());

    int res = ones.back();  // init: only catch fishes at column == 1
    for (int i = 0; i < n; ++i) {
        // build pier until at column 1, row 0-i
        if (n == 2) res = std::max(res, zeroes[i]);
        else res = std::max(res, zeroes[i] + ones.back() - ones[i]);
    }
    return res;
}

// all fishes are on row == 0
int sub3(int n, const std::vector<Fish>& fishes) {
    std::vector<int> weights(n);  // weights[i] = weight of fish at column i
    for (const auto& fish : fishes) {
        weights[fish.col] += fish.weight;
    }

    // f[i] = best strategy if we BUILD PIER AT i, only considering col 0..i
    // i-4 i-3 i-2 i-1 i
    std::vector<int> f(n);
    f[0] = 0;
    for (int i = 1; i < n; ++i) {
        f[i] = std::max(f[i-1], weights[i-1]);
        if (i >= 2) {
            f[i] = std::max(f[i], f[i-2] + weights[i-1]);
        }
        if (i >= 3) {
            f[i] = std::max(f[i], f[i-3] + weights[i-2] + weights[i-1]);
        }
    }

    int res = 0;
    for (int i = 0; i < n; ++i) {
        int cur = f[i];
        if (i + 1 < n) cur += weights[i+1];
        res = std::max(res, cur);
    }
    return res;
}

#undef int
long long max_weights(
        int n, int nFish,
        std::vector<int> xs,
        std::vector<int> ys,
        std::vector<int> ws) {
    std::vector<Fish> fishes;
    for (int i = 0; i < nFish; ++i) {
        fishes.push_back({xs[i], ys[i], ws[i]});
    }

    if (std::all_of(xs.begin(), xs.end(), [] (int x) { return x % 2 == 0; })) {
        return sub1(fishes);
    }
    if (*std::max_element(xs.begin(), xs.end()) <= 1) {
        return sub2(n, fishes);
    }
    if (*std::max_element(ys.begin(), ys.end()) == 0) {
        return sub3(n, fishes);
    }
    return 0;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 5320 KB Output is correct
2 Correct 30 ms 5816 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 98 ms 19788 KB Output is correct
6 Correct 98 ms 19676 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 56 ms 10376 KB Output is correct
3 Correct 64 ms 11212 KB Output is correct
4 Correct 26 ms 5332 KB Output is correct
5 Correct 32 ms 5820 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 26 ms 5460 KB Output is correct
13 Correct 30 ms 6456 KB Output is correct
14 Correct 26 ms 5476 KB Output is correct
15 Correct 33 ms 6204 KB Output is correct
16 Correct 28 ms 5532 KB Output is correct
17 Correct 29 ms 6092 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 1876 KB Output is correct
3 Correct 16 ms 4128 KB Output is correct
4 Correct 12 ms 3672 KB Output is correct
5 Correct 30 ms 6456 KB Output is correct
6 Correct 27 ms 6460 KB Output is correct
7 Correct 28 ms 6456 KB Output is correct
8 Correct 38 ms 6452 KB Output is correct

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB 1st lines differ - on the 1st token, expected: '3', found: '0'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB 1st lines differ - on the 1st token, expected: '3', found: '0'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB 1st lines differ - on the 1st token, expected: '3', found: '0'
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 1876 KB Output is correct
3 Correct 16 ms 4128 KB Output is correct
4 Correct 12 ms 3672 KB Output is correct
5 Correct 30 ms 6456 KB Output is correct
6 Correct 27 ms 6460 KB Output is correct
7 Correct 28 ms 6456 KB Output is correct
8 Correct 38 ms 6452 KB Output is correct
9 Incorrect 28 ms 5820 KB 1st lines differ - on the 1st token, expected: '99999', found: '0'
10 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 5320 KB Output is correct
2 Correct 30 ms 5816 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 98 ms 19788 KB Output is correct
6 Correct 98 ms 19676 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 56 ms 10376 KB Output is correct
9 Correct 64 ms 11212 KB Output is correct
10 Correct 26 ms 5332 KB Output is correct
11 Correct 32 ms 5820 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 26 ms 5460 KB Output is correct
19 Correct 30 ms 6456 KB Output is correct
20 Correct 26 ms 5476 KB Output is correct
21 Correct 33 ms 6204 KB Output is correct
22 Correct 28 ms 5532 KB Output is correct
23 Correct 29 ms 6092 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 2 ms 1876 KB Output is correct
26 Correct 16 ms 4128 KB Output is correct
27 Correct 12 ms 3672 KB Output is correct
28 Correct 30 ms 6456 KB Output is correct
29 Correct 27 ms 6460 KB Output is correct
30 Correct 28 ms 6456 KB Output is correct
31 Correct 38 ms 6452 KB Output is correct
32 Incorrect 1 ms 212 KB 1st lines differ - on the 1st token, expected: '3', found: '0'
33 Halted 0 ms 0 KB -