oj.uz

Submission #580343

# Submission time Handle Problem Language Result Execution time Memory
580343 2022-06-21T06:11:14 Z 반딧불(#8355) Uplifting Excursion (BOI22_vault) C++17
5 / 100
 5000 ms 16168 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
const int LIM = 505000;
const int LIM2 = LIM+LIM;

void imp(){
    puts("impossible");
    exit(0);
}

int n, k;
int arr[702];
int DP[2][LIM2+2];
pair<int, int> dq[LIM2+2];
int fr, sz;

int main(){
    scanf("%d %d", &n, &k);
    for(int i=0; i<=n+n; i++) scanf("%d", &arr[i]);
    if(k<=-LIM || k>=LIM) imp();
    for(int i=0; i<=LIM2; i++) DP[0][i] = DP[1][i] = -1e9;
    DP[1][LIM] = 0;

    for(int i=0; i<=n+n; i++){ /// ����ġ: i+n
        int b = i%2;
        if(i>n){ /// ���� ����ġ
            int ri = i-n;
            for(int s=0; s<i+ri; s++){
                fr=sz=0;
                for(int j=s, p=0; j<=LIM2; j+=ri, p++){
                    DP[b][j] = max(DP[b][j], DP[!b][j]);
                    while(fr!=sz && dq[fr].second < p) fr++;
                    pair<int, int> np = make_pair(DP[!b][j] - p, p+arr[i]);
                    while(fr!=sz && dq[sz-1].first < np.first) sz--;
                    dq[sz++] = np;
                    DP[b][j] = max(DP[b][j], dq[fr].first + p);
                }
            }
        }
        else if(i==n){
            for(int j=0; j<=LIM2; j++) DP[b][j] = max(DP[b][j], DP[!b][j]) + arr[i];
        }
        else{
            int ri = n-i;
            for(int s=0; s<i+ri; s++){
                fr=sz=0;
                for(int j=LIM2-s, p=0; j>=0; j-=ri, p++){
                    DP[b][j] = max(DP[b][j], DP[!b][j]);
                    while(fr!=sz && dq[fr].second < p) fr++;
                    pair<int, int> np = make_pair(DP[!b][j] - p, p+arr[i]);
                    while(fr!=sz && dq[sz-1].first < np.first) sz--;
                    dq[sz++] = np;
                    DP[b][j] = max(DP[b][j], dq[fr].first + p);
                }
            }
        }
    }

    if(DP[0][LIM+k] <= 0) imp();
    printf("%d", DP[0][LIM+k]);
}

Compilation message

vault.cpp: In function 'int main()':
vault.cpp:21:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |     scanf("%d %d", &n, &k);
      |     ~~~~~^~~~~~~~~~~~~~~~~
vault.cpp:22:36: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |     for(int i=0; i<=n+n; i++) scanf("%d", &arr[i]);
      |                               ~~~~~^~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 16012 KB Output is correct
2 Correct 73 ms 16104 KB Output is correct
3 Correct 25 ms 16084 KB Output is correct
4 Correct 379 ms 16092 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 3391 ms 15980 KB Output is correct
7 Correct 3278 ms 16076 KB Output is correct
8 Correct 4270 ms 16096 KB Output is correct
9 Correct 3375 ms 16076 KB Output is correct
10 Correct 3579 ms 16168 KB Output is correct
11 Correct 3500 ms 15996 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 16012 KB Output is correct
2 Correct 73 ms 16104 KB Output is correct
3 Correct 25 ms 16084 KB Output is correct
4 Correct 379 ms 16092 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 3391 ms 15980 KB Output is correct
7 Correct 3278 ms 16076 KB Output is correct
8 Correct 4270 ms 16096 KB Output is correct
9 Correct 3375 ms 16076 KB Output is correct
10 Correct 3579 ms 16168 KB Output is correct
11 Correct 3500 ms 15996 KB Output is correct
12 Correct 48 ms 16092 KB Output is correct
13 Correct 73 ms 16012 KB Output is correct
14 Correct 30 ms 16040 KB Output is correct
15 Correct 354 ms 16092 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 3749 ms 16000 KB Output is correct
18 Correct 3925 ms 16096 KB Output is correct
19 Correct 3901 ms 16092 KB Output is correct
20 Correct 3863 ms 16092 KB Output is correct
21 Correct 3789 ms 16088 KB Output is correct
22 Correct 3505 ms 15996 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Execution timed out 5091 ms 15996 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #3-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 339 ms 16092 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 339 ms 16092 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 339 ms 16092 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 16012 KB Output is correct
2 Correct 73 ms 16104 KB Output is correct
3 Correct 25 ms 16084 KB Output is correct
4 Correct 379 ms 16092 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 3391 ms 15980 KB Output is correct
7 Correct 3278 ms 16076 KB Output is correct
8 Correct 4270 ms 16096 KB Output is correct
9 Correct 3375 ms 16076 KB Output is correct
10 Correct 3579 ms 16168 KB Output is correct
11 Correct 3500 ms 15996 KB Output is correct
12 Correct 339 ms 16092 KB Output is correct
13 Incorrect 0 ms 212 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #5-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 339 ms 16092 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 16012 KB Output is correct
2 Correct 73 ms 16104 KB Output is correct
3 Correct 25 ms 16084 KB Output is correct
4 Correct 379 ms 16092 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 3391 ms 15980 KB Output is correct
7 Correct 3278 ms 16076 KB Output is correct
8 Correct 4270 ms 16096 KB Output is correct
9 Correct 3375 ms 16076 KB Output is correct
10 Correct 3579 ms 16168 KB Output is correct
11 Correct 3500 ms 15996 KB Output is correct
12 Correct 48 ms 16092 KB Output is correct
13 Correct 73 ms 16012 KB Output is correct
14 Correct 30 ms 16040 KB Output is correct
15 Correct 354 ms 16092 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 3749 ms 16000 KB Output is correct
18 Correct 3925 ms 16096 KB Output is correct
19 Correct 3901 ms 16092 KB Output is correct
20 Correct 3863 ms 16092 KB Output is correct
21 Correct 3789 ms 16088 KB Output is correct
22 Correct 3505 ms 15996 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Execution timed out 5091 ms 15996 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 339 ms 16092 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 16012 KB Output is correct
2 Correct 73 ms 16104 KB Output is correct
3 Correct 25 ms 16084 KB Output is correct
4 Correct 379 ms 16092 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 3391 ms 15980 KB Output is correct
7 Correct 3278 ms 16076 KB Output is correct
8 Correct 4270 ms 16096 KB Output is correct
9 Correct 3375 ms 16076 KB Output is correct
10 Correct 3579 ms 16168 KB Output is correct
11 Correct 3500 ms 15996 KB Output is correct
12 Correct 48 ms 16092 KB Output is correct
13 Correct 73 ms 16012 KB Output is correct
14 Correct 30 ms 16040 KB Output is correct
15 Correct 354 ms 16092 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 3749 ms 16000 KB Output is correct
18 Correct 3925 ms 16096 KB Output is correct
19 Correct 3901 ms 16092 KB Output is correct
20 Correct 3863 ms 16092 KB Output is correct
21 Correct 3789 ms 16088 KB Output is correct
22 Correct 3505 ms 15996 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Execution timed out 5091 ms 15996 KB Time limit exceeded
25 Halted 0 ms 0 KB -