답안 #1048456

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1048456	2024-08-08T07:44:32 Z	변재우(#11039)	Bikeparking (EGOI24_bikeparking)	C++17	40 / 100	71 ms	9844 KB

Main

#include <bits/stdc++.h>
#define int long long
using namespace std;

const int Nmax=110, INF=1e18;
int N, ans=-INF, A[Nmax], B[Nmax], D[Nmax][Nmax*Nmax];

signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin>>N;
    for(int i=1; i<=N; i++) cin>>A[i];
    for(int i=1; i<=N; i++) cin>>B[i];
    {
        int asum=0, bsum=0;
        for(int i=1; i<=N; i++) asum+=A[i], bsum+=B[i];
        for(int i=N; i>=1; i--) {
            if(A[i]<=asum-bsum) asum-=A[i], A[i]=0;
            else A[i]-=(asum-bsum), asum=bsum;
        }
    }
    for(int i=0; i<=N; i++) for(int j=0; j<=10000; j++) D[i][j]=-INF;
    D[0][0]=0;
    for(int i=1; i<=N; i++) for(int j=0; j<=10000; j++) {
        for(int k=max(0ll, A[i]-j); k<=B[i]; k++) D[i][j]=max(D[i][j], D[i-1][j-A[i]+k]+min(k, j-A[i]+k));
        /*for(int k=0; k<=min(A[i+1]+j, B[i+1]); k++) {
            D[i+1][A[i+1]+j-k]=max(D[i+1][A[i+1]+j-k], D[i][j]+min(j, k));
        }*/
    }
    for(int j=0; j<=100*N; j++) ans=max(ans, D[N][j]-j);
    cout<<ans;
    return 0;
}

Subtask #1
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	2904 KB	Output is correct
2	Correct	1 ms	2652 KB	Output is correct
3	Correct	1 ms	2652 KB	Output is correct
4	Correct	1 ms	2652 KB	Output is correct
5	Correct	1 ms	2652 KB	Output is correct
6	Correct	1 ms	2652 KB	Output is correct
7	Correct	1 ms	2652 KB	Output is correct
8	Correct	1 ms	2652 KB	Output is correct
9	Correct	1 ms	2652 KB	Output is correct
10	Correct	1 ms	2652 KB	Output is correct
11	Correct	1 ms	2652 KB	Output is correct
12	Correct	1 ms	2672 KB	Output is correct
13	Correct	1 ms	2652 KB	Output is correct
14	Correct	2 ms	2652 KB	Output is correct
15	Correct	2 ms	2652 KB	Output is correct
16	Correct	1 ms	2652 KB	Output is correct
17	Correct	1 ms	2652 KB	Output is correct
18	Correct	1 ms	2652 KB	Output is correct
19	Correct	1 ms	2652 KB	Output is correct
20	Correct	2 ms	2652 KB	Output is correct
21	Correct	1 ms	2652 KB	Output is correct

Subtask #2
0.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	2652 KB	Output is correct
2	Correct	1 ms	604 KB	Output is correct
3	Correct	11 ms	2672 KB	Output is correct
4	Correct	62 ms	9820 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Incorrect	0 ms	604 KB	Output isn't correct
7	Halted	0 ms	0 KB	-

Subtask #3
0.0 / 19.0

#	결과	메모리	Grader output
1	Correct	2652 KB	Output is correct
2	Correct	404 KB	Output is correct
3	Incorrect	604 KB	Output isn't correct
4	Halted	0 KB	-

Subtask #4
24.0 / 24.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	2904 KB	Output is correct
2	Correct	1 ms	2652 KB	Output is correct
3	Correct	1 ms	2652 KB	Output is correct
4	Correct	1 ms	2652 KB	Output is correct
5	Correct	1 ms	2652 KB	Output is correct
6	Correct	1 ms	2652 KB	Output is correct
7	Correct	1 ms	2652 KB	Output is correct
8	Correct	1 ms	2652 KB	Output is correct
9	Correct	1 ms	2652 KB	Output is correct
10	Correct	1 ms	2652 KB	Output is correct
11	Correct	1 ms	2652 KB	Output is correct
12	Correct	1 ms	2672 KB	Output is correct
13	Correct	1 ms	2652 KB	Output is correct
14	Correct	2 ms	2652 KB	Output is correct
15	Correct	2 ms	2652 KB	Output is correct
16	Correct	1 ms	2652 KB	Output is correct
17	Correct	1 ms	2652 KB	Output is correct
18	Correct	1 ms	2652 KB	Output is correct
19	Correct	1 ms	2652 KB	Output is correct
20	Correct	2 ms	2652 KB	Output is correct
21	Correct	1 ms	2652 KB	Output is correct
22	Correct	1 ms	2652 KB	Output is correct
23	Correct	1 ms	2652 KB	Output is correct
24	Correct	1 ms	2648 KB	Output is correct
25	Correct	1 ms	2652 KB	Output is correct
26	Correct	1 ms	2652 KB	Output is correct
27	Correct	1 ms	2652 KB	Output is correct
28	Correct	1 ms	2652 KB	Output is correct
29	Correct	1 ms	2652 KB	Output is correct
30	Correct	1 ms	2652 KB	Output is correct
31	Correct	1 ms	2652 KB	Output is correct
32	Correct	1 ms	2652 KB	Output is correct
33	Correct	2 ms	2652 KB	Output is correct
34	Correct	2 ms	2652 KB	Output is correct
35	Correct	2 ms	2652 KB	Output is correct
36	Correct	1 ms	2652 KB	Output is correct
37	Correct	1 ms	2652 KB	Output is correct
38	Correct	1 ms	2652 KB	Output is correct
39	Correct	1 ms	2652 KB	Output is correct
40	Correct	1 ms	2652 KB	Output is correct
41	Correct	1 ms	2652 KB	Output is correct
42	Correct	1 ms	604 KB	Output is correct
43	Correct	71 ms	9824 KB	Output is correct
44	Correct	3 ms	9820 KB	Output is correct
45	Correct	1 ms	2652 KB	Output is correct
46	Correct	1 ms	2652 KB	Output is correct
47	Correct	1 ms	2652 KB	Output is correct
48	Correct	0 ms	2652 KB	Output is correct
49	Correct	1 ms	2652 KB	Output is correct
50	Correct	32 ms	9820 KB	Output is correct
51	Correct	31 ms	9820 KB	Output is correct
52	Correct	31 ms	9844 KB	Output is correct
53	Correct	32 ms	9816 KB	Output is correct
54	Correct	32 ms	9820 KB	Output is correct
55	Correct	32 ms	9820 KB	Output is correct
56	Correct	31 ms	9820 KB	Output is correct
57	Correct	43 ms	9820 KB	Output is correct
58	Correct	69 ms	9820 KB	Output is correct
59	Correct	39 ms	9820 KB	Output is correct
60	Correct	36 ms	9820 KB	Output is correct
61	Correct	32 ms	9820 KB	Output is correct
62	Correct	65 ms	9820 KB	Output is correct
63	Correct	63 ms	9820 KB	Output is correct
64	Correct	60 ms	9820 KB	Output is correct
65	Correct	58 ms	9820 KB	Output is correct
66	Correct	67 ms	9820 KB	Output is correct
67	Correct	4 ms	9820 KB	Output is correct
68	Correct	5 ms	9820 KB	Output is correct
69	Correct	3 ms	9820 KB	Output is correct
70	Correct	3 ms	9820 KB	Output is correct
71	Correct	1 ms	2652 KB	Output is correct
72	Correct	1 ms	2652 KB	Output is correct
73	Correct	1 ms	2652 KB	Output is correct
74	Correct	2 ms	2676 KB	Output is correct
75	Correct	2 ms	2648 KB	Output is correct
76	Correct	1 ms	2652 KB	Output is correct
77	Correct	2 ms	2652 KB	Output is correct
78	Correct	1 ms	2648 KB	Output is correct
79	Correct	1 ms	2652 KB	Output is correct
80	Correct	3 ms	9820 KB	Output is correct
81	Correct	4 ms	9816 KB	Output is correct
82	Correct	3 ms	9820 KB	Output is correct
83	Correct	5 ms	9820 KB	Output is correct
84	Correct	3 ms	9820 KB	Output is correct
85	Correct	5 ms	9820 KB	Output is correct
86	Correct	3 ms	9820 KB	Output is correct
87	Correct	5 ms	9820 KB	Output is correct
88	Correct	1 ms	2652 KB	Output is correct
89	Correct	0 ms	2652 KB	Output is correct
90	Correct	0 ms	2652 KB	Output is correct
91	Correct	1 ms	2652 KB	Output is correct

Subtask #5
0.0 / 32.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	2904 KB	Output is correct
2	Correct	1 ms	2652 KB	Output is correct
3	Correct	1 ms	2652 KB	Output is correct
4	Correct	1 ms	2652 KB	Output is correct
5	Correct	1 ms	2652 KB	Output is correct
6	Correct	1 ms	2652 KB	Output is correct
7	Correct	1 ms	2652 KB	Output is correct
8	Correct	1 ms	2652 KB	Output is correct
9	Correct	1 ms	2652 KB	Output is correct
10	Correct	1 ms	2652 KB	Output is correct
11	Correct	1 ms	2652 KB	Output is correct
12	Correct	1 ms	2672 KB	Output is correct
13	Correct	1 ms	2652 KB	Output is correct
14	Correct	2 ms	2652 KB	Output is correct
15	Correct	2 ms	2652 KB	Output is correct
16	Correct	1 ms	2652 KB	Output is correct
17	Correct	1 ms	2652 KB	Output is correct
18	Correct	1 ms	2652 KB	Output is correct
19	Correct	1 ms	2652 KB	Output is correct
20	Correct	2 ms	2652 KB	Output is correct
21	Correct	1 ms	2652 KB	Output is correct
22	Correct	0 ms	2652 KB	Output is correct
23	Correct	1 ms	604 KB	Output is correct
24	Correct	11 ms	2672 KB	Output is correct
25	Correct	62 ms	9820 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Incorrect	0 ms	604 KB	Output isn't correct
28	Halted	0 ms	0 KB	-

답안 #1048456

Compilation message

Subtask #1 16.0 / 16.0

Subtask #2 0.0 / 9.0

Subtask #3 0.0 / 19.0

Subtask #4 24.0 / 24.0

Subtask #5 0.0 / 32.0

Subtask #1
16.0 / 16.0

Subtask #2
0.0 / 9.0

Subtask #3
0.0 / 19.0

Subtask #4
24.0 / 24.0

Subtask #5
0.0 / 32.0