oj.uz

Submission #947104

# Submission time Handle Problem Language Result Execution time Memory
947104 2024-03-15T13:50:41 Z Nhoksocqt1 Catfish Farm (IOI22_fish) C++17
18 / 100
 98 ms 11396 KB 
#include<bits/stdc++.h>
using namespace std;

#define inf 0x3f3f3f3f
#define sz(x) int((x).size())
#define fi first
#define se second
typedef long long ll;
typedef pair<int, int> ii;

template<class X, class Y>
	inline bool maximize(X &x, const Y &y) {return (x < y ? x = y, 1 : 0);}
template<class X, class Y>
	inline bool minimize(X &x, const Y &y) {return (x > y ? x = y, 1 : 0);}

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int Random(int l, int r) {
    return uniform_int_distribution<int>(l, r)(rng);
}

const int MAXN = 100005;

struct Fish {
    int x, y, w;
} fish[3 * MAXN];

ll f[303][303][303];
int val[MAXN], nSize, numFish;

ll sub1(void) {
    ll sum(0);
    for (int i = 0; i < numFish; ++i)
        sum += fish[i].w;

    return sum;
}

ll sub2(void) {
    ll ans(0), sum0(0), sum1(0);
    int j(numFish);
    for (int i = 0; i < numFish; ++i) {
        if(fish[i].x == 0) {
            sum0 += fish[i].w;
        } else {
            if(j == numFish)
                j = i;

            sum1 += fish[i].w;
        }
    }

    ans = max(sum0, sum1);
    if(nSize == 2)
        return ans;

    sum0 = 0;
    for (int i = 0; i < numFish; ++i) {
        if(fish[i].x == 1)
            break;

        sum0 += fish[i].w;
        while(j < numFish && fish[j].y <= fish[i].y) {
            sum1 -= fish[j].w;
            ++j;
        }

        ans = max(ans, sum0 + sum1);
    }

    return ans;
}

ll sub3(void) {
    for (int i = 0; i <= 1; ++i)
        f[i][0][0] = f[i][1][0] = f[i][2][0] = -1e18;

    for (int i = 0; i < numFish; ++i)
        val[fish[i].x] = fish[i].w;

    f[0][2][0] = 0;
    for (int i = 0; i < nSize; ++i) {
        int pre(i & 1), cur(!pre);
        f[cur][0][0] = max(f[pre][0][0], max(f[pre][1][0], f[pre][2][0] + (i > 0 ? val[i - 1] : 0)));
        f[cur][1][0] = f[pre][0][0] + val[i];
        f[cur][2][0] = max(f[pre][2][0], f[pre][1][0]);

        //cout << f[cur][0][0] << ' ' << f[cur][1][0] << ' ' << f[cur][2][0] << '\n';
    }

    return max({f[nSize & 1][0][0], f[nSize & 1][1][0], f[nSize & 1][2][0]});
}

ll max_weights(int _N, int _M, vector<int> _X, vector<int> _Y, vector<int> _W) {
    nSize = _N, numFish = _M;

    bool check1(1), check2(1), check3(1);
    for (int i = 0; i < numFish; ++i) {
        fish[i] = {_X[i], _Y[i], _W[i]};
        check1 &= !(fish[i].x & 1);
        check2 &= (fish[i].x <= 1);
        check3 &= (fish[i].y == 0);
    }

    sort(fish, fish + numFish, [](const Fish &a, const Fish &b) {
        return (a.x != b.x) ? a.x < b.x : a.y < b.y;
    });

    if(check1) {
        return sub1();
    } else
        if(check2) {
            return sub2();
        } else
            if(check3) {
                return sub3();
            }
}

#ifdef Nhoksocqt1

int main(void) {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    #define TASK "fish"
    if(fopen(TASK".inp", "r")) {
        freopen(TASK".inp", "r", stdin);
        freopen(TASK".out", "w", stdout);
    }

    vector<int> _X, _Y, _W;
    int _N, _M;
    cin >> _N >> _M;

    _X.resize(_N), _Y.resize(_N), _W.resize(_N);
    for (int i = 0; i < _N; ++i)
        cin >> _X[i] >> _Y[i] >> _W[i];

    ll ans = max_weights(_N, _M, _X, _Y, _W);
    cout << "ANSWER: " << ans << '\n';

    return 0;
}

#endif // Nhoksocqt1

Compilation message

fish.cpp: In function 'll max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:117:1: warning: control reaches end of non-void function [-Wreturn-type]
  117 | }
      | ^

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 4188 KB Output is correct
2 Correct 31 ms 4692 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 98 ms 11348 KB Output is correct
6 Correct 97 ms 11396 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 48 ms 6456 KB Output is correct
3 Correct 67 ms 7904 KB Output is correct
4 Correct 24 ms 4188 KB Output is correct
5 Correct 28 ms 4700 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 24 ms 4444 KB Output is correct
13 Correct 29 ms 4704 KB Output is correct
14 Correct 24 ms 4188 KB Output is correct
15 Correct 29 ms 4444 KB Output is correct
16 Correct 35 ms 4184 KB Output is correct
17 Correct 30 ms 4628 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 2 ms 4444 KB Output is correct
3 Correct 19 ms 6884 KB Output is correct
4 Correct 12 ms 5980 KB Output is correct
5 Correct 31 ms 8644 KB Output is correct
6 Correct 29 ms 7880 KB Output is correct
7 Correct 29 ms 8468 KB Output is correct
8 Correct 37 ms 8664 KB Output is correct

Subtask #4
0 / 14.0

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

Subtask #5
0 / 21.0

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

Subtask #6
0 / 17.0

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

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 2 ms 4444 KB Output is correct
3 Correct 19 ms 6884 KB Output is correct
4 Correct 12 ms 5980 KB Output is correct
5 Correct 31 ms 8644 KB Output is correct
6 Correct 29 ms 7880 KB Output is correct
7 Correct 29 ms 8468 KB Output is correct
8 Correct 37 ms 8664 KB Output is correct
9 Incorrect 28 ms 8284 KB 1st lines differ - on the 1st token, expected: '99999', found: '66666'
10 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 4188 KB Output is correct
2 Correct 31 ms 4692 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 98 ms 11348 KB Output is correct
6 Correct 97 ms 11396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 48 ms 6456 KB Output is correct
9 Correct 67 ms 7904 KB Output is correct
10 Correct 24 ms 4188 KB Output is correct
11 Correct 28 ms 4700 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 24 ms 4444 KB Output is correct
19 Correct 29 ms 4704 KB Output is correct
20 Correct 24 ms 4188 KB Output is correct
21 Correct 29 ms 4444 KB Output is correct
22 Correct 35 ms 4184 KB Output is correct
23 Correct 30 ms 4628 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 2 ms 4444 KB Output is correct
26 Correct 19 ms 6884 KB Output is correct
27 Correct 12 ms 5980 KB Output is correct
28 Correct 31 ms 8644 KB Output is correct
29 Correct 29 ms 7880 KB Output is correct
30 Correct 29 ms 8468 KB Output is correct
31 Correct 37 ms 8664 KB Output is correct
32 Incorrect 1 ms 4444 KB 1st lines differ - on the 1st token, expected: '3', found: '2'
33 Halted 0 ms 0 KB -