oj.uz

답안 #1070986

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1070986 2024-08-22T22:18:56 Z c2zi6 메기 농장 (IOI22_fish) C++17
53 / 100
 1000 ms 2097152 KB 
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "fish.h"

#define solvefor(a) if (a::check(N, M, X, Y, W)) return a::solve(N, M, X, Y, W);

namespace TEST1 {
    bool check(int N, int M, VI X, VI Y, VI W) {
        for (int x : X) if (x & 1) return false;
        return true;
    }
    ll solve(int N, int M, VI X, VI Y, VI W) {
        ll ans = 0;
        for (int x : W) ans += x;
        return ans;
    }
};
namespace TEST2 {
    bool check(int N, int M, VI X, VI Y, VI W) {
        for (int x : X) if (x > 1) return false;
        return true;
    }
    struct POINT {
        int x, y, w;
    };
    ll solve(int N, int M, VI X, VI Y, VI W) {
        if (N == 2) {
            ll sum[2]{};
            rep(i, M) sum[X[i]] += W[i];
            return max(sum[0], sum[1]);
        }
        vector<POINT> vec;
        rep(i, M) vec.pb({X[i], Y[i], W[i]});
        int n = vec.size();
        sort(all(vec), [](const POINT& a, const POINT& b){return make_tuple(a.y, -a.x, a.w) < make_tuple(b.y, -b.x, b.w);});

        ll sum = 0;
        rep(i, n) if (vec[i].x == 1) sum += vec[i].w;
        ll ans = sum;
        rep(i, n) {
            if (vec[i].x == 1) sum -= vec[i].w;
            else sum += vec[i].w;
            setmax(ans, sum);
        }
        return ans;
    }
};
namespace TEST3 {
    bool check(int N, int M, VI X, VI Y, VI W) {
        for (int x : Y) if (x != 0) return false;
        return true;
    }
    ll solve(int N, int M, VI X, VI Y, VI W) {
        int n = N+3;
        VL a(n+2);
        rep(i, M) a[X[i]+3] = W[i];
        VL dp(n);
        replr(i, 3, n-1) {
            dp[i] = dp[i-1];
            setmax(dp[i], dp[i-3] + a[i-1] + a[i+1]);
            setmax(dp[i], dp[i-2] + a[i+1]);
            setmax(dp[i], dp[i-1] - a[i] + a[i+1]);
        }
        return dp[n-1];
    }
};
namespace TLE {
    ll solve(int N, int M, VI X, VI Y, VI W) {
        int n = N+3;
        int m = N;
        VVL a(n+1, VL(m));
        rep(i, M) a[X[i]+3][Y[i]] = W[i];
        VVL dpvar(n, VL(m));
        VVL dpver(n, VL(m));
        VL dp2(n);
        replr(i, 3, n-1) {
            replr(k, 0, m-1) {
                replr(prevk, 0, k) {
                    ll sum = 0;
                    replr(l, 0, k) {
                        sum += a[i+1][l];
                        if (l <= prevk) sum -= a[i][l];
                        else sum += a[i-1][l];
                    }
                    setmax(dpver[i][k], dpver[i-1][prevk] + sum);
                }
                replr(prevk, k, m-1) {
                    ll sum = 0;
                    replr(l, 0, k) {
                        sum += a[i+1][l];
                        if (l <= k) sum -= a[i][l];
                        else sum += a[i-1][l];
                    }
                    setmax(dpvar[i][k], dpvar[i-1][prevk] + sum);
                    setmax(dpvar[i][k], dpver[i-1][prevk] + sum);
                }
                replr(prevk, 0, m-1) {
                    ll sum = 0;
                    replr(l, 0, k) sum += a[i+1][l];
                    setmax(dpver[i][k], dpvar[i-2][prevk] + sum);
                    setmax(dpver[i][k], dpver[i-2][prevk] + sum);
                }
                ll sum = 0;
                replr(l, 0, k) {
                    sum += a[i-1][l];
                    sum += a[i+1][l];
                }
                setmax(dpver[i][k], dp2[i-3] + sum);
                setmax(dp2[i], dpver[i][k]);
                setmax(dp2[i], dpvar[i][k]);
                setmax(dp2[i], dp2[i-1]);
            }
        }
        return dp2[n-1];
    }
};
namespace TEST4 {
    ll solve(int N, int M, VI X, VI Y, VI W) {
        int n = N+3;
        int m = N;
        VVL a(n+1, VL(m));
        rep(i, M) a[X[i]+3][Y[i]] = W[i];
        VVL dpvar(n, VL(m)); // mec, poqr
        VVL dpver(n, VL(m)); // poqr, mec
        VL dp2(n);


        replr(i, 3, n-1) {
            replr(k, 0, m-1) {
                ll sum;

                sum = 0;
                replr(l, 0, k) {
                    sum += a[i+1][l];
                    sum += a[i-1][l];
                }
                replr(prevk, 0, k) {
                    sum -= a[i][prevk];
                    sum -= a[i-1][prevk];
                    setmax(dpver[i][k], dpver[i-1][prevk] + sum);
                }

                sum = 0;
                replr(l, 0, k) {
                    sum += a[i+1][l];
                    if (l <= k) sum -= a[i][l];
                    else sum += a[i-1][l];
                }
                replr(prevk, k, m-1) {
                    setmax(dpvar[i][k], dpvar[i-1][prevk] + sum);
                    setmax(dpvar[i][k], dpver[i-1][prevk] + sum);
                }

                sum = 0;
                replr(l, 0, k) sum += a[i+1][l];
                replr(prevk, 0, m-1) {
                    setmax(dpver[i][k], dpvar[i-2][prevk] + sum);
                    setmax(dpver[i][k], dpver[i-2][prevk] + sum);
                }

                sum = 0;
                replr(l, 0, k) {
                    sum += a[i-1][l];
                    sum += a[i+1][l];
                }
                setmax(dpver[i][k], dp2[i-3] + sum);
                setmax(dp2[i], dpver[i][k]);
                setmax(dp2[i], dpvar[i][k]);
                setmax(dp2[i], dp2[i-1]);
            }
        }
        /*cout << "dpver" << endl;*/
        /*reprl(j, m-1, 0) {*/
        /*    replr(i, 3, n-1) cout << dpver[i][j] << " ";*/
        /*    cout << endl;*/
        /*}*/
        /*cout << endl;*/
        /*cout << "dpvar" << endl;*/
        /*reprl(j, m-1, 0) {*/
        /*    replr(i, 3, n-1) cout << dpvar[i][j] << " ";*/
        /*    cout << endl;*/
        /*}*/
        /*cout << endl;*/
        return dp2[n-1];
    }
};

mt19937 rng;
void stresstest() {
    rng = mt19937(chrono::steady_clock().now().time_since_epoch().count());
    int t = 2000;
    while (t--) {
        int N, M;
        VI X, Y, W;
        N = 50;
        M = 50 * 50 / 5;
        X = Y = W = VI(M);
        for (int& x : X) x = rng()%N;
        for (int& x : X) x = rng()%N;
        for (int& x : W) x = rng()%30+1;
        int ans1 = TEST3::solve(N, M, X, Y, W);
        int ans2 = TEST4::solve(N, M, X, Y, W);
        if (ans1 != ans2) {
            cout << N << " " << M << endl;
            rep(i, M) cout << X[i] << " " << Y[i] << " " << W[i] << endl;
            cout << "answers" << endl;
            cout << ans1 << " " << ans2 << endl;
            abort();
        }
        cout << "tests left " << t << endl;
    }
}

ll max_weights(int N, int M, VI X, VI Y, VI W) {
    /*stresstest(); return 0;*/
    solvefor(TEST1);
    solvefor(TEST2);
    solvefor(TEST3);
    return TEST4::solve(N, M, X, Y, W);
    return -1;
}

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 3240 KB Output is correct
2 Correct 27 ms 5672 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 77 ms 17308 KB Output is correct
6 Correct 68 ms 17560 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 51 ms 14132 KB Output is correct
3 Correct 57 ms 14852 KB Output is correct
4 Correct 21 ms 4524 KB Output is correct
5 Correct 26 ms 5564 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 448 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 24 ms 6584 KB Output is correct
13 Correct 45 ms 7344 KB Output is correct
14 Correct 27 ms 6572 KB Output is correct
15 Correct 26 ms 7008 KB Output is correct
16 Correct 36 ms 6548 KB Output is correct
17 Correct 41 ms 7020 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 2 ms 1884 KB Output is correct
3 Correct 19 ms 4500 KB Output is correct
4 Correct 9 ms 3820 KB Output is correct
5 Correct 34 ms 7076 KB Output is correct
6 Correct 17 ms 6312 KB Output is correct
7 Correct 21 ms 7084 KB Output is correct
8 Correct 22 ms 7076 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 13 ms 1016 KB Output is correct
10 Correct 128 ms 2648 KB Output is correct
11 Correct 23 ms 856 KB Output is correct
12 Correct 114 ms 2628 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 104 ms 2624 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 13 ms 1016 KB Output is correct
10 Correct 128 ms 2648 KB Output is correct
11 Correct 23 ms 856 KB Output is correct
12 Correct 114 ms 2628 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 104 ms 2624 KB Output is correct
15 Correct 98 ms 2392 KB Output is correct
16 Correct 3 ms 600 KB Output is correct
17 Correct 120 ms 4224 KB Output is correct
18 Correct 113 ms 4188 KB Output is correct
19 Correct 109 ms 4196 KB Output is correct
20 Correct 107 ms 3980 KB Output is correct
21 Correct 154 ms 3980 KB Output is correct
22 Correct 118 ms 5700 KB Output is correct
23 Correct 102 ms 2904 KB Output is correct
24 Correct 110 ms 3516 KB Output is correct
25 Correct 111 ms 2648 KB Output is correct
26 Correct 135 ms 2884 KB Output is correct

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 13 ms 1016 KB Output is correct
10 Correct 128 ms 2648 KB Output is correct
11 Correct 23 ms 856 KB Output is correct
12 Correct 114 ms 2628 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 104 ms 2624 KB Output is correct
15 Correct 98 ms 2392 KB Output is correct
16 Correct 3 ms 600 KB Output is correct
17 Correct 120 ms 4224 KB Output is correct
18 Correct 113 ms 4188 KB Output is correct
19 Correct 109 ms 4196 KB Output is correct
20 Correct 107 ms 3980 KB Output is correct
21 Correct 154 ms 3980 KB Output is correct
22 Correct 118 ms 5700 KB Output is correct
23 Correct 102 ms 2904 KB Output is correct
24 Correct 110 ms 3516 KB Output is correct
25 Correct 111 ms 2648 KB Output is correct
26 Correct 135 ms 2884 KB Output is correct
27 Execution timed out 1053 ms 212312 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 2 ms 1884 KB Output is correct
3 Correct 19 ms 4500 KB Output is correct
4 Correct 9 ms 3820 KB Output is correct
5 Correct 34 ms 7076 KB Output is correct
6 Correct 17 ms 6312 KB Output is correct
7 Correct 21 ms 7084 KB Output is correct
8 Correct 22 ms 7076 KB Output is correct
9 Runtime error 879 ms 2097152 KB Execution killed with signal 9
10 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 3240 KB Output is correct
2 Correct 27 ms 5672 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 77 ms 17308 KB Output is correct
6 Correct 68 ms 17560 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 51 ms 14132 KB Output is correct
9 Correct 57 ms 14852 KB Output is correct
10 Correct 21 ms 4524 KB Output is correct
11 Correct 26 ms 5564 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 448 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 24 ms 6584 KB Output is correct
19 Correct 45 ms 7344 KB Output is correct
20 Correct 27 ms 6572 KB Output is correct
21 Correct 26 ms 7008 KB Output is correct
22 Correct 36 ms 6548 KB Output is correct
23 Correct 41 ms 7020 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 2 ms 1884 KB Output is correct
26 Correct 19 ms 4500 KB Output is correct
27 Correct 9 ms 3820 KB Output is correct
28 Correct 34 ms 7076 KB Output is correct
29 Correct 17 ms 6312 KB Output is correct
30 Correct 21 ms 7084 KB Output is correct
31 Correct 22 ms 7076 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 13 ms 1016 KB Output is correct
41 Correct 128 ms 2648 KB Output is correct
42 Correct 23 ms 856 KB Output is correct
43 Correct 114 ms 2628 KB Output is correct
44 Correct 2 ms 348 KB Output is correct
45 Correct 104 ms 2624 KB Output is correct
46 Correct 98 ms 2392 KB Output is correct
47 Correct 3 ms 600 KB Output is correct
48 Correct 120 ms 4224 KB Output is correct
49 Correct 113 ms 4188 KB Output is correct
50 Correct 109 ms 4196 KB Output is correct
51 Correct 107 ms 3980 KB Output is correct
52 Correct 154 ms 3980 KB Output is correct
53 Correct 118 ms 5700 KB Output is correct
54 Correct 102 ms 2904 KB Output is correct
55 Correct 110 ms 3516 KB Output is correct
56 Correct 111 ms 2648 KB Output is correct
57 Correct 135 ms 2884 KB Output is correct
58 Execution timed out 1053 ms 212312 KB Time limit exceeded
59 Halted 0 ms 0 KB -