답안 #681973

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
681973	2023-01-15T03:57:16 Z	Jarif_Rahman	메기 농장 (IOI22_fish)	C++17	35 / 100	1000 ms	2097152 KB

fish

#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;

ll max_weights(int n, int m, vector<int> X, vector<int> Y, vector<int> W){
    vector<vector<ll>> v(n, vector<ll>(n+1, 0));
    for(int i = 0; i < m; i++) v[X[i]][Y[i]+1]+=W[i];

    vector<vector<ll>> dp_up(n, vector<ll>(n+1, 0)), dp_down = dp_up,
    dtu2 = dp_up;
    vector<ll> dtu(n, 0);

    vector<vector<ll>> pref(n, vector<ll>(n+1, 0));
    for(int i = 0; i < n; i++) for(int j = 0; j <= n; j++){
        if(j) pref[i][j] = pref[i][j-1];
        pref[i][j]+=v[i][j];
    }

    for(int i = n-1; i >= 0; i--){
        for(int j = 0; j <= n; j++){
            if(i == n-1){
                dp_down[i][j] = 0;
                dp_up[i][j] = 0;
                continue;
            }

            dp_up[i][j]-=pref[i][j];
            dp_down[i][j]-=pref[i+1][n]-pref[i+1][j];
            dp_up[i][j] = max(dp_up[i][j], pref[i][n]-pref[i][j]+dp_down[i+1][n]);

            if(i+2 < n){
                ll s = 0;
                for(int k = 0; k <= j; k++) s+=v[i+1][k];
                for(int k = 0; k <= n; k++){
                    if(k > j) s+=v[i+1][k];
                    dp_down[i][j] = max(dp_down[i][j], s+dp_up[i+2][k]);
                }
                dp_down[i][j] = max(dp_down[i][j], s+dp_down[i+2][n]);
            }
        }

        if(i){
            ll mx = 0;
            for(int j = 0; j <= n; j++) mx = max(mx, pref[i-1][j]+dp_up[i][j]);
            fill(dp_up[i-1].begin(), dp_up[i-1].end(), mx);
            dtu[i] = mx;

            mx = 0;
            for(int j = 0; j <= n; j++) mx = max(mx, pref[i][n]-pref[i][j]+dp_down[i][j]);
            fill(dp_down[i-1].begin(), dp_down[i-1].end(), mx);

            for(int j = 0; j <= n; j++){
                if(j) dtu2[i][j] = dtu2[i][j-1];
                dtu2[i][j] = max(dtu2[i][j], dp_up[i][j]);
            }
        }
    }

    return max(*max_element(dp_up[0].begin(), dp_up[0].end()), *max_element(dp_down[0].begin(), dp_down[0].end()));
}

Subtask #1
0 / 3.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	849 ms	2097152 KB	Execution killed with signal 9
2	Halted	0 ms	0 KB	-

Subtask #2
0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Runtime error	800 ms	2097152 KB	Execution killed with signal 9
3	Halted	0 ms	0 KB	-

Subtask #3
0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	740 ms	2097152 KB	Execution killed with signal 9
2	Halted	0 ms	0 KB	-

Subtask #4
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	224 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	6 ms	1108 KB	Output is correct
10	Correct	41 ms	3964 KB	Output is correct
11	Correct	6 ms	1108 KB	Output is correct
12	Correct	41 ms	3924 KB	Output is correct
13	Correct	1 ms	468 KB	Output is correct
14	Correct	43 ms	3796 KB	Output is correct

Subtask #5
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	224 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	6 ms	1108 KB	Output is correct
10	Correct	41 ms	3964 KB	Output is correct
11	Correct	6 ms	1108 KB	Output is correct
12	Correct	41 ms	3924 KB	Output is correct
13	Correct	1 ms	468 KB	Output is correct
14	Correct	43 ms	3796 KB	Output is correct
15	Correct	44 ms	3876 KB	Output is correct
16	Correct	2 ms	596 KB	Output is correct
17	Correct	54 ms	5640 KB	Output is correct
18	Correct	63 ms	5648 KB	Output is correct
19	Correct	53 ms	5664 KB	Output is correct
20	Correct	54 ms	5588 KB	Output is correct
21	Correct	60 ms	5584 KB	Output is correct
22	Correct	71 ms	7272 KB	Output is correct
23	Correct	44 ms	4180 KB	Output is correct
24	Correct	52 ms	5076 KB	Output is correct
25	Correct	43 ms	3924 KB	Output is correct
26	Correct	43 ms	4208 KB	Output is correct

Subtask #6
0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	224 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	6 ms	1108 KB	Output is correct
10	Correct	41 ms	3964 KB	Output is correct
11	Correct	6 ms	1108 KB	Output is correct
12	Correct	41 ms	3924 KB	Output is correct
13	Correct	1 ms	468 KB	Output is correct
14	Correct	43 ms	3796 KB	Output is correct
15	Correct	44 ms	3876 KB	Output is correct
16	Correct	2 ms	596 KB	Output is correct
17	Correct	54 ms	5640 KB	Output is correct
18	Correct	63 ms	5648 KB	Output is correct
19	Correct	53 ms	5664 KB	Output is correct
20	Correct	54 ms	5588 KB	Output is correct
21	Correct	60 ms	5584 KB	Output is correct
22	Correct	71 ms	7272 KB	Output is correct
23	Correct	44 ms	4180 KB	Output is correct
24	Correct	52 ms	5076 KB	Output is correct
25	Correct	43 ms	3924 KB	Output is correct
26	Correct	43 ms	4208 KB	Output is correct
27	Execution timed out	1103 ms	353136 KB	Time limit exceeded
28	Halted	0 ms	0 KB	-

Subtask #7
0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	740 ms	2097152 KB	Execution killed with signal 9
2	Halted	0 ms	0 KB	-

Subtask #8
0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	849 ms	2097152 KB	Execution killed with signal 9
2	Halted	0 ms	0 KB	-

답안 #681973

Compilation message