oj.uz

Submission #947100

# Submission time Handle Problem Language Result Execution time Memory
947100 2024-03-15T13:48:06 Z Nhoksocqt1 Catfish Farm (IOI22_fish) C++17
9 / 100
 97 ms 17652 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 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;

    f[0][2][0] = 0;
    for (int i = 0; i < numFish; ++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 ? fish[i - 1].w : 0)));
        f[cur][1][0] = f[pre][0][0] + fish[i].w;
        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[numFish & 1][0][0], f[numFish & 1][1][0], f[numFish & 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:113:1: warning: control reaches end of non-void function [-Wreturn-type]
  113 | }
      | ^

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 5720 KB Output is correct
2 Correct 29 ms 6484 KB Output is correct
3 Correct 0 ms 2392 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 93 ms 17384 KB Output is correct
6 Correct 97 ms 17652 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 52 ms 9436 KB Output is correct
3 Correct 61 ms 10840 KB Output is correct
4 Correct 23 ms 5720 KB Output is correct
5 Correct 29 ms 6484 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 26 ms 5980 KB Output is correct
13 Correct 29 ms 6588 KB Output is correct
14 Correct 24 ms 5720 KB Output is correct
15 Correct 32 ms 6240 KB Output is correct
16 Correct 25 ms 5724 KB Output is correct
17 Correct 27 ms 5980 KB Output is correct

Subtask #3
0 / 9.0

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

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 4440 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 4440 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 4440 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 2392 KB Output is correct
2 Incorrect 1 ms 4444 KB 1st lines differ - on the 1st token, expected: '882019', found: '0'
3 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 5720 KB Output is correct
2 Correct 29 ms 6484 KB Output is correct
3 Correct 0 ms 2392 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 93 ms 17384 KB Output is correct
6 Correct 97 ms 17652 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 52 ms 9436 KB Output is correct
9 Correct 61 ms 10840 KB Output is correct
10 Correct 23 ms 5720 KB Output is correct
11 Correct 29 ms 6484 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2392 KB Output is correct
18 Correct 26 ms 5980 KB Output is correct
19 Correct 29 ms 6588 KB Output is correct
20 Correct 24 ms 5720 KB Output is correct
21 Correct 32 ms 6240 KB Output is correct
22 Correct 25 ms 5724 KB Output is correct
23 Correct 27 ms 5980 KB Output is correct
24 Correct 1 ms 2392 KB Output is correct
25 Incorrect 1 ms 4444 KB 1st lines differ - on the 1st token, expected: '882019', found: '0'
26 Halted 0 ms 0 KB -