답안 #1068479

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1068479	2024-08-21T10:05:31 Z	Unforgettablepl	메기 농장 (IOI22_fish)	C++17	52 / 100	1000 ms	1840764 KB

fish

#include "fish.h"
#include <bits/stdc++.h>
using namespace std;

long long max_weights(int N, int M,vector<int> X,vector<int> Y,
                      vector<int> W){
    vector DP(N+1,vector(N+1,vector(2,0ll)));
    vector pref(N+2,vector(N+1,0ll));
    vector transition1(N+1,vector(N+1,0ll));
    vector transition2(N+1,vector(N+1,0ll));
    vector transition3(N+1,vector(N+1,0ll));
    vector transition4(N+1,vector(N+1,0ll));
    for(int i=0;i<M;i++) {
        pref[X[i]+1][Y[i]+1]=W[i];
    }
    for(int i=1;i<=N;i++)for(int j=1;j<=N;j++)pref[i][j]+=pref[i][j-1];
    for(int i=2;i<=N;i++) {
        for(int j=0;j<=N;j++) {
            if(i!=2)DP[i][j][1]=max(DP[i][j][1],-pref[i][j]+transition1[i-1][j]);
            else {
                for(int x=j;x<=N;x++) {
                    DP[i][j][1]=max(DP[i][j][1],pref[i][x]-pref[i][j]+max(DP[i-1][x][0],DP[i-1][x][1]));
                }
            }
            if(i>2) {
                if(i!=3) {
                    DP[i][j][0]=max(DP[i][j][0],pref[i-1][j]+transition2[i-2][j]);
                    DP[i][j][0]=max(DP[i][j][0],transition3[i-2][j]);
                }
                else for(int x=0;x<=N;x++) {
                    DP[i][j][0]=max(DP[i][j][0],pref[i-1][max(x,j)]+max(DP[i-2][x][0],DP[i-2][x][1]));
                }
            }
            if(i!=2)DP[i][j][0]=max(DP[i][j][0],pref[i-1][j]+transition4[i-1][j]);
            else for(int x=0;x<=j;x++) {
                DP[i][j][0]=max(DP[i][j][0],pref[i-1][j]-pref[i-1][x]+DP[i-1][x][0]);
            }
            transition1[i][j]=pref[i+1][j]+max(DP[i][j][0],DP[i][j][1]);
            transition2[i][j]=max(DP[i][j][0],DP[i][j][1]);
            transition3[i][j]=pref[i+1][j]+max(DP[i][j][0],DP[i][j][1]);
            transition4[i][j]=-pref[i][j]+DP[i][j][0];
        }
        for(int j=N-1;j>=0;j--)transition1[i][j]=max(transition1[i][j],transition1[i][j+1]);
        for(int j=1;j<=N;j++)transition2[i][j]=max(transition2[i][j],transition2[i][j-1]);
        for(int j=N-1;j>=0;j--)transition3[i][j]=max(transition3[i][j],transition3[i][j+1]);
        for(int j=1;j<=N;j++)transition4[i][j]=max(transition4[i][j],transition4[i][j-1]);
    }
    long long ans = 0;
    for(int j=0;j<=N;j++)ans=max(ans,DP[N][j][0]);
    for(int j=0;j<=N;j++)ans=max(ans,DP[N][j][1]);
    return ans;
}

Subtask #1
0 / 3.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	1104 ms	1727516 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #2
0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Execution timed out	1163 ms	1834064 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #3
0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	1128 ms	1840764 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #4
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	408 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	392 KB	Output is correct
9	Correct	2 ms	2652 KB	Output is correct
10	Correct	9 ms	8904 KB	Output is correct
11	Correct	2 ms	2396 KB	Output is correct
12	Correct	8 ms	8796 KB	Output is correct
13	Correct	1 ms	860 KB	Output is correct
14	Correct	7 ms	8792 KB	Output is correct

Subtask #5
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	408 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	392 KB	Output is correct
9	Correct	2 ms	2652 KB	Output is correct
10	Correct	9 ms	8904 KB	Output is correct
11	Correct	2 ms	2396 KB	Output is correct
12	Correct	8 ms	8796 KB	Output is correct
13	Correct	1 ms	860 KB	Output is correct
14	Correct	7 ms	8792 KB	Output is correct
15	Correct	8 ms	8792 KB	Output is correct
16	Correct	1 ms	860 KB	Output is correct
17	Correct	15 ms	10528 KB	Output is correct
18	Correct	15 ms	10328 KB	Output is correct
19	Correct	15 ms	10536 KB	Output is correct
20	Correct	16 ms	10500 KB	Output is correct
21	Correct	16 ms	10332 KB	Output is correct
22	Correct	24 ms	12124 KB	Output is correct
23	Correct	8 ms	9308 KB	Output is correct
24	Correct	14 ms	10212 KB	Output is correct
25	Correct	8 ms	8796 KB	Output is correct
26	Correct	9 ms	9308 KB	Output is correct

Subtask #6
17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	408 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	392 KB	Output is correct
9	Correct	2 ms	2652 KB	Output is correct
10	Correct	9 ms	8904 KB	Output is correct
11	Correct	2 ms	2396 KB	Output is correct
12	Correct	8 ms	8796 KB	Output is correct
13	Correct	1 ms	860 KB	Output is correct
14	Correct	7 ms	8792 KB	Output is correct
15	Correct	8 ms	8792 KB	Output is correct
16	Correct	1 ms	860 KB	Output is correct
17	Correct	15 ms	10528 KB	Output is correct
18	Correct	15 ms	10328 KB	Output is correct
19	Correct	15 ms	10536 KB	Output is correct
20	Correct	16 ms	10500 KB	Output is correct
21	Correct	16 ms	10332 KB	Output is correct
22	Correct	24 ms	12124 KB	Output is correct
23	Correct	8 ms	9308 KB	Output is correct
24	Correct	14 ms	10212 KB	Output is correct
25	Correct	8 ms	8796 KB	Output is correct
26	Correct	9 ms	9308 KB	Output is correct
27	Correct	722 ms	847032 KB	Output is correct
28	Correct	109 ms	62212 KB	Output is correct
29	Correct	745 ms	859496 KB	Output is correct
30	Correct	770 ms	859612 KB	Output is correct
31	Correct	749 ms	859476 KB	Output is correct
32	Correct	72 ms	40812 KB	Output is correct
33	Correct	703 ms	859740 KB	Output is correct
34	Correct	706 ms	859620 KB	Output is correct
35	Correct	670 ms	851536 KB	Output is correct
36	Correct	701 ms	859572 KB	Output is correct

Subtask #7
0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	1128 ms	1840764 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #8
0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	1104 ms	1727516 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

답안 #1068479

Compilation message