oj.uz

답안 #594958

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
594958 2022-07-13T07:51:29 Z azberjibiou Uplifting Excursion (BOI22_vault) C++17
40 / 100
 1792 ms 5068 KB 
#include <bits/stdc++.h>
#define gibon ios::sync_with_stdio(false); cin.tie(0);
#define fir first
#define sec second
#define pdd pair<long double, long double>
#define pii pair<int, int>
#define pll pair<ll, ll>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
typedef long long ll;
using namespace std;
const int mxN=303;
const int MOD=1e9+7;
ll M, L;
ll A[2*mxN];
ll nval, ncnt;
vector <pll> minu, plu;
int dp[mxN*mxN];
int sps[mxN*mxN][12];
void make_sps(int jump, int buho)
{
    for(int i=L-nval;i<=M*M;i++)    sps[i+mxN][0]=dp[i+mxN]-((i+mxN)/jump)*buho;
    for(int i=1;i<12;i++)
    {
        for(int j=L-nval;j<=M*M;j++)
        {
            if(j-(1<<i)*jump>=L-nval)   sps[j+mxN][i]=max(sps[j+mxN][i-1], sps[j-(1<<i-1)*jump+mxN][i-1]);
            else    sps[j+mxN][i]=sps[j+mxN][i-1];
        }
    }
}
int solv(int st, int wid, int jump)
{
    int ret=-MOD;
    for(int i=11;i>=0;i--)
    {
        if(wid>=(1<<i))
        {
            wid-=(1<<i);
            ret=max(ret, sps[st][i]);
            st-=jump*(1<<i);
        }
    }
    return ret;
}
int main()
{
    gibon
    cin >> M >> L;
    for(int i=-M;i<=M;i++)  cin >> A[i+mxN];
    ll psum=0, msum=0;
    for(int i=-M;i<0;i++)   msum+=i*A[i+mxN];
    for(int i=1;i<=M;i++)   psum+=i*A[i+mxN];
    if(L>psum || L<msum)    {cout << "impossible";  return 0;}
    if(L==msum+psum)
    {
        ll tmp=0;
        for(int i=-M;i<=M;i++)  tmp+=A[i+mxN];
        cout << tmp;    return 0;
    }
    if(L>msum+psum)
    {
        L*=-1;
        for(int i=1;i<=M;i++)   swap(A[i+mxN], A[-i+mxN]);
    }
    for(int i=-M;i<0;i++)   minu.emplace_back(i, A[i+mxN]);
    for(ll i=-M;i<0;i++)   nval+=A[i+mxN]*i, ncnt+=A[i+mxN];
    for(int i=1;i<=M;i++)
    {
        if(nval>L)
        {
            plu.emplace_back(i, A[i+mxN]);
            continue;
        }
        if(L-nval>i*A[i+mxN])   nval+=i*A[i+mxN], ncnt+=A[i+mxN], minu.emplace_back(i, A[i+mxN]);
        else if((L-nval)%i==0)
        {
            ncnt+=(L-nval)/i;
            cout << ncnt+A[mxN];
            return 0;
        }
        else
        {
            minu.emplace_back(i, (L-nval)/i+1);
            plu.emplace_back(i, A[i+mxN]-(L-nval)/i-1);
            ncnt+=(L-nval)/i+1;
            nval+=i*((L-nval)/i+1);
        }
    }
    for(int i=L-nval;i<=M*M;i++)    dp[i+mxN]=-MOD;
    dp[mxN]=0;
    for(pll ele : plu)
    {
        make_sps(ele.fir, 1);
        for(int i=M*M;i>=L-nval;i--)
        {
            int wid=min(ele.sec, (i-(L-nval))/ele.fir);
            if(wid==0)  continue;
            dp[i+mxN]=max((ll)dp[i+mxN], solv(i+mxN-ele.fir, wid, ele.fir)+(i+mxN)/ele.fir);
            //for(int j=1;j<=min(ele.sec, (i-(L-nval))/ele.fir);j++)  dp[i+mxN]=max(dp[i+mxN], dp[i+mxN-j*ele.fir]+j);
        }
    }
    for(pll ele : minu)
    {
        if(ele.fir<0)
        {
            make_sps(-ele.fir, -1);
            for(int i=M*M;i>=L-nval;i--)
            {
                int wid=min(ele.sec, (i-(L-nval))/(-ele.fir));
                if(wid==0)  continue;
                dp[i+mxN]=max((ll)dp[i+mxN], solv(i+mxN+ele.fir, wid, ele.fir)-(i+mxN)/(-ele.fir));
                //for(int j=1;j<=min(ele.sec, (i-(L-nval))/(-ele.fir));j++)  dp[i+mxN]=max(dp[i+mxN], dp[i+mxN+j*ele.fir]-j);
            }
        }
        if(ele.fir>0)
        {
            make_sps(ele.fir, 1);
            for(int i=L-nval;i<=M*M;i++)
            {
                int wid=min(ele.sec, (M*M-i)/ele.fir);
                if(wid==0)  continue;
                dp[i+mxN]=max((ll)dp[i+mxN], solv(i+mxN+ele.fir*wid, wid, ele.fir)+(i+mxN)/ele.fir);
                //for(int j=1;j<=min(ele.sec, (M*M-i)/ele.fir);j++)    dp[i+mxN]=max(dp[i+mxN], dp[i+mxN+j*ele.fir]-j);
            }
        }
    }
    if(dp[L-nval+mxN]<-MOD/10)    cout << "impossible";
    else    cout << ncnt+dp[L-nval+mxN]+A[mxN];
}
/*
2 2
0 0 0 0 1
*/

Compilation message

vault.cpp: In function 'void make_sps(int, int)':
vault.cpp:28:87: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   28 |             if(j-(1<<i)*jump>=L-nval)   sps[j+mxN][i]=max(sps[j+mxN][i-1], sps[j-(1<<i-1)*jump+mxN][i-1]);
      |                                                                                      ~^~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Incorrect 9 ms 456 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Incorrect 9 ms 456 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3-1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 336 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 3 ms 328 KB Output is correct
7 Correct 2 ms 328 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 340 KB Output is correct

Subtask #3-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 336 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 3 ms 328 KB Output is correct
7 Correct 2 ms 328 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 2 ms 340 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 2 ms 468 KB Output is correct
23 Correct 2 ms 328 KB Output is correct
24 Incorrect 3 ms 340 KB Output isn't correct
25 Halted 0 ms 0 KB -

Subtask #4-1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 336 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 3 ms 328 KB Output is correct
7 Correct 2 ms 328 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 3 ms 340 KB Output is correct
14 Correct 3 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 2 ms 340 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 7 ms 468 KB Output is correct
22 Correct 7 ms 468 KB Output is correct
23 Correct 8 ms 468 KB Output is correct
24 Correct 9 ms 468 KB Output is correct
25 Correct 8 ms 468 KB Output is correct
26 Correct 7 ms 468 KB Output is correct
27 Correct 8 ms 472 KB Output is correct
28 Correct 7 ms 476 KB Output is correct

Subtask #4-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Incorrect 9 ms 456 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5-1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 336 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 3 ms 328 KB Output is correct
7 Correct 2 ms 328 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 3 ms 340 KB Output is correct
14 Correct 3 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 2 ms 340 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 7 ms 468 KB Output is correct
22 Correct 7 ms 468 KB Output is correct
23 Correct 8 ms 468 KB Output is correct
24 Correct 9 ms 468 KB Output is correct
25 Correct 8 ms 468 KB Output is correct
26 Correct 7 ms 468 KB Output is correct
27 Correct 8 ms 472 KB Output is correct
28 Correct 7 ms 476 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 2 ms 340 KB Output is correct
32 Correct 2 ms 340 KB Output is correct
33 Correct 2 ms 340 KB Output is correct
34 Correct 3 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 2 ms 340 KB Output is correct
37 Correct 2 ms 340 KB Output is correct
38 Correct 2 ms 340 KB Output is correct
39 Correct 7 ms 468 KB Output is correct
40 Correct 7 ms 472 KB Output is correct
41 Correct 8 ms 460 KB Output is correct
42 Correct 6 ms 468 KB Output is correct
43 Correct 9 ms 480 KB Output is correct
44 Correct 8 ms 468 KB Output is correct
45 Correct 8 ms 340 KB Output is correct
46 Correct 7 ms 468 KB Output is correct
47 Correct 58 ms 852 KB Output is correct
48 Correct 51 ms 860 KB Output is correct
49 Correct 54 ms 852 KB Output is correct
50 Correct 52 ms 852 KB Output is correct
51 Correct 65 ms 852 KB Output is correct
52 Correct 66 ms 852 KB Output is correct
53 Correct 54 ms 852 KB Output is correct
54 Correct 55 ms 852 KB Output is correct

Subtask #5-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Incorrect 9 ms 456 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #6-1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 336 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 3 ms 328 KB Output is correct
7 Correct 2 ms 328 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 3 ms 340 KB Output is correct
14 Correct 3 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 2 ms 340 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 7 ms 468 KB Output is correct
22 Correct 7 ms 468 KB Output is correct
23 Correct 8 ms 468 KB Output is correct
24 Correct 9 ms 468 KB Output is correct
25 Correct 8 ms 468 KB Output is correct
26 Correct 7 ms 468 KB Output is correct
27 Correct 8 ms 472 KB Output is correct
28 Correct 7 ms 476 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 2 ms 340 KB Output is correct
32 Correct 2 ms 340 KB Output is correct
33 Correct 2 ms 340 KB Output is correct
34 Correct 3 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 2 ms 340 KB Output is correct
37 Correct 2 ms 340 KB Output is correct
38 Correct 2 ms 340 KB Output is correct
39 Correct 7 ms 468 KB Output is correct
40 Correct 7 ms 472 KB Output is correct
41 Correct 8 ms 460 KB Output is correct
42 Correct 6 ms 468 KB Output is correct
43 Correct 9 ms 480 KB Output is correct
44 Correct 8 ms 468 KB Output is correct
45 Correct 8 ms 340 KB Output is correct
46 Correct 7 ms 468 KB Output is correct
47 Correct 58 ms 852 KB Output is correct
48 Correct 51 ms 860 KB Output is correct
49 Correct 54 ms 852 KB Output is correct
50 Correct 52 ms 852 KB Output is correct
51 Correct 65 ms 852 KB Output is correct
52 Correct 66 ms 852 KB Output is correct
53 Correct 54 ms 852 KB Output is correct
54 Correct 55 ms 852 KB Output is correct
55 Correct 0 ms 212 KB Output is correct
56 Correct 3 ms 340 KB Output is correct
57 Correct 2 ms 340 KB Output is correct
58 Correct 3 ms 336 KB Output is correct
59 Correct 2 ms 340 KB Output is correct
60 Correct 2 ms 340 KB Output is correct
61 Correct 2 ms 340 KB Output is correct
62 Correct 2 ms 332 KB Output is correct
63 Correct 2 ms 340 KB Output is correct
64 Correct 2 ms 340 KB Output is correct
65 Correct 7 ms 408 KB Output is correct
66 Correct 6 ms 468 KB Output is correct
67 Correct 7 ms 468 KB Output is correct
68 Correct 6 ms 472 KB Output is correct
69 Correct 7 ms 468 KB Output is correct
70 Correct 7 ms 472 KB Output is correct
71 Correct 8 ms 468 KB Output is correct
72 Correct 7 ms 468 KB Output is correct
73 Correct 49 ms 852 KB Output is correct
74 Correct 60 ms 852 KB Output is correct
75 Correct 67 ms 852 KB Output is correct
76 Correct 57 ms 852 KB Output is correct
77 Correct 54 ms 852 KB Output is correct
78 Correct 53 ms 852 KB Output is correct
79 Correct 57 ms 852 KB Output is correct
80 Correct 52 ms 852 KB Output is correct
81 Correct 1792 ms 5068 KB Output is correct
82 Correct 1616 ms 4948 KB Output is correct
83 Correct 1735 ms 4948 KB Output is correct
84 Correct 1707 ms 4920 KB Output is correct
85 Correct 1499 ms 4924 KB Output is correct
86 Correct 1553 ms 4948 KB Output is correct
87 Correct 1657 ms 4948 KB Output is correct

Subtask #6-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Incorrect 9 ms 456 KB Output isn't correct
7 Halted 0 ms 0 KB -