답안 #931167

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
931167	2024-02-21T10:32:22 Z	VMaksimoski008	메기 농장 (IOI22_fish)	C++17	18 / 100	72 ms	14044 KB

fish

#include <bits/stdc++.h>

#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

int64_t max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w) {
    bool even = true;
    bool sub2 = true;
    bool sub3 = true;

    for(int i=0; i<m; i++) {
        if(x[i] % 2 == 1) even = false;
        if(x[i] > 1) sub2 = false;
        if(y[i] > 0) sub3 = false;
    }

    if(even) {
        ll ans = 0;
        for(int &x : w) ans += x;
        return ans;
    }

    if(sub2) {
        ll ans = 0;

        ll prefix[n][2];
        memset(prefix, 0, sizeof(prefix));
        for(int i=0; i<m; i++)
            prefix[y[i]][x[i]] += w[i];

        for(int i=1; i<n; i++) {
            prefix[i][0] += prefix[i-1][0];
            prefix[i][1] += prefix[i-1][1];
        }

        if(n == 2) return max(prefix[n-1][0], prefix[n-1][1]);

        for(int i=0; i<n; i++) {
            ll res = 0;
            res += prefix[i][0];
            res += prefix[n-1][1];
            res -= prefix[i][1];
            ans = max(ans, res);
        }

        return max({ ans, prefix[n-1][0], prefix[n-1][1] });
    }

    if(sub3) {
        vector<int> v(n, 0);
        vector<ll> dp(n, 0);
        vector<ll> mx(n, 0);

        for(int i=0; i<m; i++)
            v[x[i]] = w[i];

        dp[0] = (n > 1 ? v[1] : 0);
        mx[0] = dp[0];
        for(int i=1; i<n; i++) {
            ll res1 = dp[i-1] - v[i];
            if(i < n-1) res1 += v[i+1];

            ll res2 = (i > 1 ? dp[i-2] : 0);
            if(i < n-1) res2 += v[i+1];

            ll res3 = (i > 2 ? mx[i-3] : 0);
            res3 += v[i-1];
            if(i < n-1) res3 += v[i+1];

            dp[i] = max(dp[i], res1);
            dp[i] = max(dp[i], res2);
            dp[i] = max(dp[i], res3);

            mx[i] = max(mx[i-1], dp[i]);
        }

        return *max_element(all(mx));
    }

    return 0;
}

// int32_t main() {
//     setIO();

//     int n, m;
//     cin >> n >> m;

//     vector<int> x(m), y(m), w(m);
//     for(int i=0; i<m; i++)
//         cin >> x[i] >> y[i] >> w[i];
    
//     cout << max_weights(n, m, x, y, w) << '\n';
//     return 0;
// }

Subtask #1
3.0 / 3.0

#	결과	실행 시간	메모리	Grader output
1	Correct	17 ms	3668 KB	Output is correct
2	Correct	21 ms	4292 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	67 ms	13652 KB	Output is correct
6	Correct	72 ms	14044 KB	Output is correct

Subtask #2
6.0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	39 ms	8212 KB	Output is correct
3	Correct	46 ms	10068 KB	Output is correct
4	Correct	20 ms	3672 KB	Output is correct
5	Correct	22 ms	4444 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	432 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	19 ms	5100 KB	Output is correct
13	Correct	24 ms	5956 KB	Output is correct
14	Correct	20 ms	5012 KB	Output is correct
15	Correct	21 ms	5720 KB	Output is correct
16	Correct	19 ms	4956 KB	Output is correct
17	Correct	21 ms	5468 KB	Output is correct

Subtask #3
9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	13 ms	4392 KB	Output is correct
4	Correct	9 ms	3772 KB	Output is correct
5	Correct	23 ms	6224 KB	Output is correct
6	Correct	21 ms	5724 KB	Output is correct
7	Correct	22 ms	6064 KB	Output is correct
8	Correct	22 ms	6236 KB	Output is correct

Subtask #4
0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	348 KB	1st lines differ - on the 1st token, expected: '3', found: '0'
2	Halted	0 ms	0 KB	-

Subtask #5
0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	348 KB	1st lines differ - on the 1st token, expected: '3', found: '0'
2	Halted	0 ms	0 KB	-

Subtask #6
0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	348 KB	1st lines differ - on the 1st token, expected: '3', found: '0'
2	Halted	0 ms	0 KB	-

Subtask #7
0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	13 ms	4392 KB	Output is correct
4	Correct	9 ms	3772 KB	Output is correct
5	Correct	23 ms	6224 KB	Output is correct
6	Correct	21 ms	5724 KB	Output is correct
7	Correct	22 ms	6064 KB	Output is correct
8	Correct	22 ms	6236 KB	Output is correct
9	Incorrect	21 ms	3976 KB	1st lines differ - on the 1st token, expected: '99999', found: '0'
10	Halted	0 ms	0 KB	-

Subtask #8
0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	17 ms	3668 KB	Output is correct
2	Correct	21 ms	4292 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	67 ms	13652 KB	Output is correct
6	Correct	72 ms	14044 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	39 ms	8212 KB	Output is correct
9	Correct	46 ms	10068 KB	Output is correct
10	Correct	20 ms	3672 KB	Output is correct
11	Correct	22 ms	4444 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	432 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	19 ms	5100 KB	Output is correct
19	Correct	24 ms	5956 KB	Output is correct
20	Correct	20 ms	5012 KB	Output is correct
21	Correct	21 ms	5720 KB	Output is correct
22	Correct	19 ms	4956 KB	Output is correct
23	Correct	21 ms	5468 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	1 ms	2396 KB	Output is correct
26	Correct	13 ms	4392 KB	Output is correct
27	Correct	9 ms	3772 KB	Output is correct
28	Correct	23 ms	6224 KB	Output is correct
29	Correct	21 ms	5724 KB	Output is correct
30	Correct	22 ms	6064 KB	Output is correct
31	Correct	22 ms	6236 KB	Output is correct
32	Incorrect	1 ms	348 KB	1st lines differ - on the 1st token, expected: '3', found: '0'
33	Halted	0 ms	0 KB	-

답안 #931167

Compilation message