oj.uz

답안 #579692

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
579692 2022-06-19T16:05:57 Z wdjpng Uplifting Excursion (BOI22_vault) C++17
5 / 100
 5000 ms 8916 KB 
#include <bits/stdc++.h>

#define int long long
#define rep(i,n) for(int i = 0; i < n; i++)
#define per(i,n) for(int i = n-1; i >=0; i--)

using namespace std;

signed main()
{
    int m,l;
    cin>>m>>l;
    int maxl=(m)*(m+1)/2*100; //TODO change to 100
    if(l>maxl) {cout<<"impossible\n"; exit(0);}
    vector<int>dp(2*maxl+100000, -1);
    dp[maxl]=0;
 
    for(int cl = -m; cl <= m; cl++)
    {
        int a;
        cin>>a;
        rep(whatever,a)
        {
            if(cl>0)
            {
                per(i,2*maxl+1)
                {
                    if(i-cl<0||i-cl>=dp.size()||dp[i-cl]==-1) continue;
                    dp[i]=max(dp[i], dp[i-cl]+1);
                }
            } else
            rep(i,2*maxl+1) 
            {
                if(i-cl<0||i-cl>=dp.size()||dp[i-cl]==-1) continue;
                dp[i]=max(dp[i], dp[i-cl]+1);
            }
        }
    }

    if(l+maxl<dp.size()&&dp[l+maxl]>0) cout<<dp[l+maxl]<<'\n';
    else cout<<"impossible\n";
}

Compilation message

vault.cpp: In function 'int main()':
vault.cpp:28:36: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |                     if(i-cl<0||i-cl>=dp.size()||dp[i-cl]==-1) continue;
      |                                ~~~~^~~~~~~~~~~
vault.cpp:34:32: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |                 if(i-cl<0||i-cl>=dp.size()||dp[i-cl]==-1) continue;
      |                            ~~~~^~~~~~~~~~~
vault.cpp:40:14: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |     if(l+maxl<dp.size()&&dp[l+maxl]>0) cout<<dp[l+maxl]<<'\n';
      |        ~~~~~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 2 ms 1108 KB Output is correct
5 Correct 600 ms 3072 KB Output is correct
6 Correct 690 ms 3064 KB Output is correct
7 Correct 255 ms 3072 KB Output is correct
8 Correct 605 ms 3068 KB Output is correct
9 Correct 1299 ms 3072 KB Output is correct
10 Correct 30 ms 3028 KB Output is correct
11 Correct 28 ms 3064 KB Output is correct

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 2 ms 1108 KB Output is correct
5 Correct 600 ms 3072 KB Output is correct
6 Correct 690 ms 3064 KB Output is correct
7 Correct 255 ms 3072 KB Output is correct
8 Correct 605 ms 3068 KB Output is correct
9 Correct 1299 ms 3072 KB Output is correct
10 Correct 30 ms 3028 KB Output is correct
11 Correct 28 ms 3064 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 1 ms 980 KB Output is correct
15 Correct 2 ms 1108 KB Output is correct
16 Correct 683 ms 3068 KB Output is correct
17 Correct 670 ms 3068 KB Output is correct
18 Correct 261 ms 3064 KB Output is correct
19 Correct 619 ms 3076 KB Output is correct
20 Correct 1158 ms 3064 KB Output is correct
21 Correct 37 ms 3028 KB Output is correct
22 Correct 30 ms 3028 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Execution timed out 5050 ms 8916 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #3-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1108 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1108 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1108 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 2 ms 1108 KB Output is correct
5 Correct 600 ms 3072 KB Output is correct
6 Correct 690 ms 3064 KB Output is correct
7 Correct 255 ms 3072 KB Output is correct
8 Correct 605 ms 3068 KB Output is correct
9 Correct 1299 ms 3072 KB Output is correct
10 Correct 30 ms 3028 KB Output is correct
11 Correct 28 ms 3064 KB Output is correct
12 Correct 2 ms 1108 KB Output is correct
13 Incorrect 1 ms 212 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #5-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1108 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 2 ms 1108 KB Output is correct
5 Correct 600 ms 3072 KB Output is correct
6 Correct 690 ms 3064 KB Output is correct
7 Correct 255 ms 3072 KB Output is correct
8 Correct 605 ms 3068 KB Output is correct
9 Correct 1299 ms 3072 KB Output is correct
10 Correct 30 ms 3028 KB Output is correct
11 Correct 28 ms 3064 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 1 ms 980 KB Output is correct
15 Correct 2 ms 1108 KB Output is correct
16 Correct 683 ms 3068 KB Output is correct
17 Correct 670 ms 3068 KB Output is correct
18 Correct 261 ms 3064 KB Output is correct
19 Correct 619 ms 3076 KB Output is correct
20 Correct 1158 ms 3064 KB Output is correct
21 Correct 37 ms 3028 KB Output is correct
22 Correct 30 ms 3028 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Execution timed out 5050 ms 8916 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1108 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 2 ms 1108 KB Output is correct
5 Correct 600 ms 3072 KB Output is correct
6 Correct 690 ms 3064 KB Output is correct
7 Correct 255 ms 3072 KB Output is correct
8 Correct 605 ms 3068 KB Output is correct
9 Correct 1299 ms 3072 KB Output is correct
10 Correct 30 ms 3028 KB Output is correct
11 Correct 28 ms 3064 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 1 ms 980 KB Output is correct
15 Correct 2 ms 1108 KB Output is correct
16 Correct 683 ms 3068 KB Output is correct
17 Correct 670 ms 3068 KB Output is correct
18 Correct 261 ms 3064 KB Output is correct
19 Correct 619 ms 3076 KB Output is correct
20 Correct 1158 ms 3064 KB Output is correct
21 Correct 37 ms 3028 KB Output is correct
22 Correct 30 ms 3028 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Execution timed out 5050 ms 8916 KB Time limit exceeded
25 Halted 0 ms 0 KB -