oj.uz

Submission #579727

# Submission time Handle Problem Language Result Execution time Memory
579727 2022-06-19T16:54:31 Z wdjpng Uplifting Excursion (BOI22_vault) C++17
5 / 100
 5000 ms 8332 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--)
    
// #pragma GCC optimize("O3")
// #pragma optimize("sse,sse2,sse3,sse4,avx,avx2")
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, -1);
    dp[maxl]=0;
    
    vector<int>in(2*m+1);
    rep(i,2*m+1) cin>>in[i];

    for(int cll = m; cll >=0; cll--)
    {
        int cl = cll;
        int a = in[m+cl];
        rep(whatever,a)
        {
                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);
                
            }
        }
        if(cl==0) continue;
        a=in[m-cl];
        cl=-cl;
        rep(whatever,a)
        {
            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:31: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]
   31 |                     if(i-cl<0||i-cl>=dp.size()||dp[i-cl]==-1) continue;
      |                                ~~~~^~~~~~~~~~~
vault.cpp:43: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]
   43 |                 if(i-cl<0||i-cl>=dp.size()||dp[i-cl]==-1) continue;
      |                            ~~~~^~~~~~~~~~~
vault.cpp:51: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]
   51 |     if(l+maxl<dp.size()&&dp[l+maxl]>0) cout<<dp[l+maxl]<<'\n';
      |        ~~~~~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 640 ms 2288 KB Output is correct
6 Correct 716 ms 2292 KB Output is correct
7 Correct 249 ms 2288 KB Output is correct
8 Correct 607 ms 2284 KB Output is correct
9 Correct 1227 ms 2292 KB Output is correct
10 Correct 22 ms 2260 KB Output is correct
11 Correct 17 ms 2260 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 640 ms 2288 KB Output is correct
6 Correct 716 ms 2292 KB Output is correct
7 Correct 249 ms 2288 KB Output is correct
8 Correct 607 ms 2284 KB Output is correct
9 Correct 1227 ms 2292 KB Output is correct
10 Correct 22 ms 2260 KB Output is correct
11 Correct 17 ms 2260 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 619 ms 2292 KB Output is correct
17 Correct 639 ms 2284 KB Output is correct
18 Correct 234 ms 2288 KB Output is correct
19 Correct 601 ms 2296 KB Output is correct
20 Correct 1178 ms 2288 KB Output is correct
21 Correct 22 ms 2308 KB Output is correct
22 Correct 18 ms 2260 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Execution timed out 5087 ms 8332 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #3-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 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 1 ms 340 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 1 ms 340 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 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 640 ms 2288 KB Output is correct
6 Correct 716 ms 2292 KB Output is correct
7 Correct 249 ms 2288 KB Output is correct
8 Correct 607 ms 2284 KB Output is correct
9 Correct 1227 ms 2292 KB Output is correct
10 Correct 22 ms 2260 KB Output is correct
11 Correct 17 ms 2260 KB Output is correct
12 Correct 1 ms 340 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 1 ms 340 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 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 640 ms 2288 KB Output is correct
6 Correct 716 ms 2292 KB Output is correct
7 Correct 249 ms 2288 KB Output is correct
8 Correct 607 ms 2284 KB Output is correct
9 Correct 1227 ms 2292 KB Output is correct
10 Correct 22 ms 2260 KB Output is correct
11 Correct 17 ms 2260 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 619 ms 2292 KB Output is correct
17 Correct 639 ms 2284 KB Output is correct
18 Correct 234 ms 2288 KB Output is correct
19 Correct 601 ms 2296 KB Output is correct
20 Correct 1178 ms 2288 KB Output is correct
21 Correct 22 ms 2308 KB Output is correct
22 Correct 18 ms 2260 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Execution timed out 5087 ms 8332 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 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 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 640 ms 2288 KB Output is correct
6 Correct 716 ms 2292 KB Output is correct
7 Correct 249 ms 2288 KB Output is correct
8 Correct 607 ms 2284 KB Output is correct
9 Correct 1227 ms 2292 KB Output is correct
10 Correct 22 ms 2260 KB Output is correct
11 Correct 17 ms 2260 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 619 ms 2292 KB Output is correct
17 Correct 639 ms 2284 KB Output is correct
18 Correct 234 ms 2288 KB Output is correct
19 Correct 601 ms 2296 KB Output is correct
20 Correct 1178 ms 2288 KB Output is correct
21 Correct 22 ms 2308 KB Output is correct
22 Correct 18 ms 2260 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Execution timed out 5087 ms 8332 KB Time limit exceeded
25 Halted 0 ms 0 KB -