oj.uz

답안 #1048435

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1048435 2024-08-08T07:36:12 Z 변재우(#11039) Bikeparking (EGOI24_bikeparking) C++17
16 / 100
 5 ms 9844 KB 
#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=0; i<=N; i++) for(int j=0; j<=10000; j++) {
        D[i+1][A[i+1]+j]=max(D[i+1][A[i+1]+j], D[i][j]);
        D[i+1][A[i+1]+j-min(A[i+1], B[i+1])]=max(D[i+1][A[i+1]+j-min(A[i+1], B[i+1])], D[i][j]);
        D[i+1][A[i+1]+j-min(j, B[i+1])]=max(D[i+1][A[i+1]+j-min(j, B[i+1])], D[i][j]+min(j, B[i+1]));
        D[i+1][A[i+1]+j-min(A[i+1]+j, B[i+1])]=max(D[i+1][A[i+1]+j-min(A[i+1]+j, B[i+1])], D[i][j]+min(j, B[i+1]));
    }
    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 2652 KB Output is correct
2 Correct 0 ms 2652 KB Output is correct
3 Correct 0 ms 2808 KB Output is correct
4 Correct 0 ms 2652 KB Output is correct
5 Correct 0 ms 2652 KB Output is correct
6 Correct 0 ms 2652 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 0 ms 2652 KB Output is correct
9 Correct 0 ms 2652 KB Output is correct
10 Correct 0 ms 2652 KB Output is correct
11 Correct 0 ms 2652 KB Output is correct
12 Correct 0 ms 2652 KB Output is correct
13 Correct 0 ms 2652 KB Output is correct
14 Correct 0 ms 2652 KB Output is correct
15 Correct 0 ms 2460 KB Output is correct
16 Correct 0 ms 2652 KB Output is correct
17 Correct 1 ms 2652 KB Output is correct
18 Correct 0 ms 2652 KB Output is correct
19 Correct 1 ms 2652 KB Output is correct
20 Correct 1 ms 2652 KB Output is correct
21 Correct 0 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 0 ms 604 KB Output is correct
3 Correct 0 ms 2652 KB Output is correct
4 Correct 4 ms 9844 KB Output is correct
5 Correct 0 ms 604 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 1 ms 2652 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Incorrect 0 ms 604 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2652 KB Output is correct
2 Correct 0 ms 2652 KB Output is correct
3 Correct 0 ms 2808 KB Output is correct
4 Correct 0 ms 2652 KB Output is correct
5 Correct 0 ms 2652 KB Output is correct
6 Correct 0 ms 2652 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 0 ms 2652 KB Output is correct
9 Correct 0 ms 2652 KB Output is correct
10 Correct 0 ms 2652 KB Output is correct
11 Correct 0 ms 2652 KB Output is correct
12 Correct 0 ms 2652 KB Output is correct
13 Correct 0 ms 2652 KB Output is correct
14 Correct 0 ms 2652 KB Output is correct
15 Correct 0 ms 2460 KB Output is correct
16 Correct 0 ms 2652 KB Output is correct
17 Correct 1 ms 2652 KB Output is correct
18 Correct 0 ms 2652 KB Output is correct
19 Correct 1 ms 2652 KB Output is correct
20 Correct 1 ms 2652 KB Output is correct
21 Correct 0 ms 2652 KB Output is correct
22 Correct 1 ms 2648 KB Output is correct
23 Correct 0 ms 2652 KB Output is correct
24 Correct 0 ms 2652 KB Output is correct
25 Correct 0 ms 2652 KB Output is correct
26 Correct 0 ms 2652 KB Output is correct
27 Correct 0 ms 2652 KB Output is correct
28 Correct 0 ms 2652 KB Output is correct
29 Correct 1 ms 2904 KB Output is correct
30 Correct 0 ms 2652 KB Output is correct
31 Correct 1 ms 2652 KB Output is correct
32 Correct 0 ms 2652 KB Output is correct
33 Correct 0 ms 2652 KB Output is correct
34 Correct 0 ms 2652 KB Output is correct
35 Correct 1 ms 2652 KB Output is correct
36 Correct 0 ms 2652 KB Output is correct
37 Correct 0 ms 2652 KB Output is correct
38 Correct 0 ms 2672 KB Output is correct
39 Correct 0 ms 2652 KB Output is correct
40 Correct 0 ms 2652 KB Output is correct
41 Correct 1 ms 2540 KB Output is correct
42 Correct 0 ms 604 KB Output is correct
43 Correct 4 ms 9820 KB Output is correct
44 Correct 5 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 1 ms 2652 KB Output is correct
49 Correct 1 ms 2652 KB Output is correct
50 Correct 4 ms 9820 KB Output is correct
51 Correct 4 ms 9844 KB Output is correct
52 Correct 4 ms 9840 KB Output is correct
53 Correct 4 ms 9820 KB Output is correct
54 Correct 4 ms 9820 KB Output is correct
55 Correct 4 ms 9820 KB Output is correct
56 Correct 4 ms 9820 KB Output is correct
57 Correct 4 ms 9820 KB Output is correct
58 Correct 4 ms 9820 KB Output is correct
59 Incorrect 4 ms 9820 KB Output isn't correct
60 Halted 0 ms 0 KB -

Subtask #5
0.0 / 32.0

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