oj.uz

Submission #947129

# Submission time Handle Problem Language Result Execution time Memory
947129 2024-03-15T14:32:38 Z Nhoksocqt1 Catfish Farm (IOI22_fish) C++17
53 / 100
 1000 ms 458904 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], sum[303][303], maxPre[303][303], maxSuf[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 sub5(void) {
    for (int i = 0; i < numFish; ++i)
        sum[fish[i].x][fish[i].y + 1] += fish[i].w;

    for (int i = 0; i < nSize; ++i) {
        for (int j = 1; j <= nSize; ++j)
            sum[i][j] += sum[i][j - 1];
    }

    for (int j = 0; j <= nSize; ++j) {
        for (int k = 0; k <= nSize; ++k) {
            f[0][j][k] = -1e18;
        }
    }

    f[0][0][0] = 0;
    for (int j = 0; j <= nSize; ++j) {
        for (int k = 0; k <= nSize; ++k) {
            maxPre[j][k] = f[0][j][k];
            if(k > 0)
                maxPre[j][k] = max(maxPre[j][k], maxPre[j][k - 1]);
        }
    }

    for (int j = nSize; j >= 0; --j) {
        for (int k = nSize; k >= 0; --k) {
            maxSuf[j][k] = f[0][j][k];
            if(k + 1 < nSize)
                maxSuf[j][k] = max(maxSuf[j][k], maxSuf[j][k + 1]);
        }
    }

    for (int i = 0; i < nSize; ++i) {
        for (int coln = 0; coln <= nSize; ++coln) {
            for (int pcol = 0; pcol <= nSize; ++pcol) {
                if(coln <= pcol) {
                    f[i + 1][coln][pcol] = maxSuf[pcol][0] + sum[i][pcol] - sum[i][coln];
                    continue;
                }

                f[i + 1][coln][pcol] = maxPre[pcol][nSize] + (i > 0 ? sum[i - 1][coln] : 0);
                f[i + 1][coln][pcol] = max(f[i + 1][coln][pcol], maxSuf[pcol][0]);
            }
        }

        for (int j = 0; j <= nSize; ++j) {
            for (int k = 0; k <= nSize; ++k) {
                maxPre[j][k] = f[i + 1][j][k] - sum[i][max(j, k)];
                if(k > 0)
                    maxPre[j][k] = max(maxPre[j][k], maxPre[j][k - 1]);
            }
        }

        for (int j = nSize; j >= 0; --j) {
            for (int k = nSize; k >= 0; --k) {
                maxSuf[j][k] = f[i + 1][j][k];
                if(k < nSize)
                    maxSuf[j][k] = max(maxSuf[j][k], maxSuf[j][k + 1]);
            }
        }
    }

    ll res(0);
    for (int j = 0; j <= nSize; ++j)
        res = max(res, maxSuf[j][0]);

    return res;
}

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();
            } else
                if(nSize <= 300) {
                    return sub5();
                }
}

#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';
    cout << "SUB5: " << sub5() << '\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:189:1: warning: control reaches end of non-void function [-Wreturn-type]
  189 | }
      | ^

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 7760 KB Output is correct
2 Correct 29 ms 8528 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 93 ms 17428 KB Output is correct
6 Correct 94 ms 17896 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 48 ms 11016 KB Output is correct
3 Correct 60 ms 12700 KB Output is correct
4 Correct 29 ms 7772 KB Output is correct
5 Correct 36 ms 8380 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 23 ms 7676 KB Output is correct
13 Correct 35 ms 8464 KB Output is correct
14 Correct 24 ms 7972 KB Output is correct
15 Correct 27 ms 8020 KB Output is correct
16 Correct 31 ms 7760 KB Output is correct
17 Correct 27 ms 8008 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 2 ms 8552 KB Output is correct
3 Correct 17 ms 10844 KB Output is correct
4 Correct 16 ms 10076 KB Output is correct
5 Correct 30 ms 12636 KB Output is correct
6 Correct 25 ms 12160 KB Output is correct
7 Correct 30 ms 12624 KB Output is correct
8 Correct 30 ms 12728 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10588 KB Output is correct
2 Correct 2 ms 12636 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4440 KB Output is correct
5 Correct 1 ms 4528 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 10588 KB Output is correct
9 Correct 38 ms 115308 KB Output is correct
10 Correct 247 ms 223128 KB Output is correct
11 Correct 38 ms 115224 KB Output is correct
12 Correct 247 ms 223052 KB Output is correct
13 Correct 10 ms 61788 KB Output is correct
14 Correct 266 ms 222972 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10588 KB Output is correct
2 Correct 2 ms 12636 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4440 KB Output is correct
5 Correct 1 ms 4528 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 10588 KB Output is correct
9 Correct 38 ms 115308 KB Output is correct
10 Correct 247 ms 223128 KB Output is correct
11 Correct 38 ms 115224 KB Output is correct
12 Correct 247 ms 223052 KB Output is correct
13 Correct 10 ms 61788 KB Output is correct
14 Correct 266 ms 222972 KB Output is correct
15 Correct 262 ms 222896 KB Output is correct
16 Correct 10 ms 62040 KB Output is correct
17 Correct 259 ms 224796 KB Output is correct
18 Correct 262 ms 224848 KB Output is correct
19 Correct 277 ms 224956 KB Output is correct
20 Correct 266 ms 224908 KB Output is correct
21 Correct 276 ms 224732 KB Output is correct
22 Correct 272 ms 226532 KB Output is correct
23 Correct 250 ms 223312 KB Output is correct
24 Correct 251 ms 224080 KB Output is correct
25 Correct 253 ms 223056 KB Output is correct
26 Correct 252 ms 223692 KB Output is correct

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10588 KB Output is correct
2 Correct 2 ms 12636 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4440 KB Output is correct
5 Correct 1 ms 4528 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 10588 KB Output is correct
9 Correct 38 ms 115308 KB Output is correct
10 Correct 247 ms 223128 KB Output is correct
11 Correct 38 ms 115224 KB Output is correct
12 Correct 247 ms 223052 KB Output is correct
13 Correct 10 ms 61788 KB Output is correct
14 Correct 266 ms 222972 KB Output is correct
15 Correct 262 ms 222896 KB Output is correct
16 Correct 10 ms 62040 KB Output is correct
17 Correct 259 ms 224796 KB Output is correct
18 Correct 262 ms 224848 KB Output is correct
19 Correct 277 ms 224956 KB Output is correct
20 Correct 266 ms 224908 KB Output is correct
21 Correct 276 ms 224732 KB Output is correct
22 Correct 272 ms 226532 KB Output is correct
23 Correct 250 ms 223312 KB Output is correct
24 Correct 251 ms 224080 KB Output is correct
25 Correct 253 ms 223056 KB Output is correct
26 Correct 252 ms 223692 KB Output is correct
27 Execution timed out 1054 ms 25364 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 2 ms 8552 KB Output is correct
3 Correct 17 ms 10844 KB Output is correct
4 Correct 16 ms 10076 KB Output is correct
5 Correct 30 ms 12636 KB Output is correct
6 Correct 25 ms 12160 KB Output is correct
7 Correct 30 ms 12624 KB Output is correct
8 Correct 30 ms 12728 KB Output is correct
9 Runtime error 276 ms 458904 KB Execution killed with signal 11
10 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 7760 KB Output is correct
2 Correct 29 ms 8528 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 93 ms 17428 KB Output is correct
6 Correct 94 ms 17896 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 48 ms 11016 KB Output is correct
9 Correct 60 ms 12700 KB Output is correct
10 Correct 29 ms 7772 KB Output is correct
11 Correct 36 ms 8380 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4440 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 23 ms 7676 KB Output is correct
19 Correct 35 ms 8464 KB Output is correct
20 Correct 24 ms 7972 KB Output is correct
21 Correct 27 ms 8020 KB Output is correct
22 Correct 31 ms 7760 KB Output is correct
23 Correct 27 ms 8008 KB Output is correct
24 Correct 1 ms 4444 KB Output is correct
25 Correct 2 ms 8552 KB Output is correct
26 Correct 17 ms 10844 KB Output is correct
27 Correct 16 ms 10076 KB Output is correct
28 Correct 30 ms 12636 KB Output is correct
29 Correct 25 ms 12160 KB Output is correct
30 Correct 30 ms 12624 KB Output is correct
31 Correct 30 ms 12728 KB Output is correct
32 Correct 2 ms 10588 KB Output is correct
33 Correct 2 ms 12636 KB Output is correct
34 Correct 1 ms 4444 KB Output is correct
35 Correct 1 ms 4440 KB Output is correct
36 Correct 1 ms 4528 KB Output is correct
37 Correct 1 ms 4444 KB Output is correct
38 Correct 1 ms 4444 KB Output is correct
39 Correct 1 ms 10588 KB Output is correct
40 Correct 38 ms 115308 KB Output is correct
41 Correct 247 ms 223128 KB Output is correct
42 Correct 38 ms 115224 KB Output is correct
43 Correct 247 ms 223052 KB Output is correct
44 Correct 10 ms 61788 KB Output is correct
45 Correct 266 ms 222972 KB Output is correct
46 Correct 262 ms 222896 KB Output is correct
47 Correct 10 ms 62040 KB Output is correct
48 Correct 259 ms 224796 KB Output is correct
49 Correct 262 ms 224848 KB Output is correct
50 Correct 277 ms 224956 KB Output is correct
51 Correct 266 ms 224908 KB Output is correct
52 Correct 276 ms 224732 KB Output is correct
53 Correct 272 ms 226532 KB Output is correct
54 Correct 250 ms 223312 KB Output is correct
55 Correct 251 ms 224080 KB Output is correct
56 Correct 253 ms 223056 KB Output is correct
57 Correct 252 ms 223692 KB Output is correct
58 Execution timed out 1054 ms 25364 KB Time limit exceeded
59 Halted 0 ms 0 KB -