oj.uz

Submission #285887

# Submission time Handle Problem Language Result Execution time Memory
285887 2020-08-29T17:21:00 Z Dymo Bali Sculptures (APIO15_sculpture) C++14
100 / 100
 553 ms 1408 KB 
#include<bits/stdc++.h>

#define ll long long
#define ld long double
#define pb push_back
#define all(n) n.begin(),n.end()
#define eb emplace_back
#define endl "\n"
#define pll pair<ll,ll>
#define ff first
#define ss second
using namespace std;
const ll maxn=2e3+5;
const ll mod=998244353;
const ll base=1e15;

ll ans=0;

bool chk(ll p,ll bit)
{
    for (ll i=42; i>=bit; i--)
    {
        if ((ans&(1ll<<i)))
        {
        }
        else
        {
             if (p&(1ll<<i))
                return false;
        }
    }
    return true;
}
ll dp[maxn][maxn];
ll dp1[maxn][maxn];
ll dp2[maxn];
ll dp3[maxn];

ll f[maxn];

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    /*if (fopen("terrorists.inp","r"))
    {
        freopen("terrorists.inp","r",stdin);
        freopen("terrorists.out","w",stdout);
    }*/
    ll n, a, b;
    cin>>n>>a>>b;
    for (int i=1; i<=n; i++)
    {
        ll x;
        cin>>x;
        f[i]=f[i-1]+x;

    }

       if (n<=100)
       {

        for (int i=1; i<=b; i++)
        {
            for (int j=i; j<=n; j++)
            {
                dp[i][j]=1;

            }
        }
        for (ll bit=42; bit>=0; bit--)
        {

            for (int i=1; i<=b; i++)
            {
                for (int j=i; j<=n; j++)
                {
                    dp1[i][j]=dp[i][j];

                }
            }
            for (int j=1; j<=n; j++)
            {
                if (!dp1[1][j])
                    continue;

                ll p=f[j];
                 if (!chk(p,bit))
                {
                    dp1[1][j]=0;

                }
            }
            bool kt=false;
            if (dp1[1][n]&&1>=b) kt=true;

            for (int i=2; i<=b; i++)
            {
                for (int j=i; j<=n; j++)
                {
                    if (!dp1[i][j])
                        continue;
                    dp1[i][j]=0;
                    for (int k=j-1; k>=i-1; k--)
                    {
                        if (!dp1[i-1][k])
                            continue;
                        ll p=f[j]-f[k];
                        if (chk(p,bit))
                        {
                            dp1[i][j]=1;
                            break;
                        }
                    }

                }
                if (i>=a&&dp1[i][n])
                    {
                        kt=true;

                    }
            }
            if (kt)
            {

                for (int i=1; i<=b; i++)
                {
                    for (int j=i; j<=n; j++)
                    {
                        dp[i][j]=dp1[i][j];

                    }
                }
            }
            else
            {
                ans=ans+(1ll<<bit);
            }
        }
       }
       else
       {
          for (ll bit=42;bit>=0;bit--)
          {
              for (int i=0;i<=n;i++)
                dp2[i]=dp3[i];
              for (int i=1;i<=n;i++)
              {
                  if(dp2[i]==base) continue;
                  dp2[i]=base;
                  for (int j=i-1;j>=0;j--)
                  {
                      if (dp2[j]==base) continue;

                    ll p= f[i]-f[j];
                     if (chk(p,bit))
                     {
                         dp2[i]=min(dp2[i],dp2[j]+1);

                     }
                  }
                  if (dp2[i]>b) dp2[i]=base;


              }
              if (dp2[n]<=b)
              {
                   for (int i=0;i<=n;i++)
                   {
                       dp3[i]=dp2[i];
                   }
              }
              else
              {
                 ans=ans+(1ll<<bit);
              }
          }
       }



   /* else
    {

    }*/
    cout <<ans<<endl ;



}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 512 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 512 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 512 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 512 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 512 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 2 ms 512 KB Output is correct
31 Correct 3 ms 512 KB Output is correct
32 Correct 2 ms 512 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 2 ms 512 KB Output is correct
35 Correct 2 ms 512 KB Output is correct
36 Correct 1 ms 384 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 416 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 1 ms 544 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 2 ms 512 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 2 ms 512 KB Output is correct
22 Correct 2 ms 512 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 2 ms 512 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 4 ms 512 KB Output is correct
27 Correct 9 ms 896 KB Output is correct
28 Correct 9 ms 1280 KB Output is correct
29 Correct 8 ms 1280 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 11 ms 768 KB Output is correct
32 Correct 8 ms 1024 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 512 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 512 KB Output is correct
27 Correct 0 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 512 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 512 KB Output is correct
37 Correct 1 ms 512 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 1 ms 512 KB Output is correct
41 Correct 3 ms 512 KB Output is correct
42 Correct 2 ms 512 KB Output is correct
43 Correct 1 ms 384 KB Output is correct
44 Correct 2 ms 512 KB Output is correct
45 Correct 2 ms 512 KB Output is correct
46 Correct 2 ms 384 KB Output is correct
47 Correct 2 ms 512 KB Output is correct
48 Correct 2 ms 384 KB Output is correct
49 Correct 4 ms 512 KB Output is correct
50 Correct 7 ms 896 KB Output is correct
51 Correct 9 ms 1280 KB Output is correct
52 Correct 11 ms 1280 KB Output is correct
53 Correct 1 ms 384 KB Output is correct
54 Correct 8 ms 768 KB Output is correct
55 Correct 8 ms 1024 KB Output is correct
56 Correct 1 ms 512 KB Output is correct
57 Correct 5 ms 512 KB Output is correct
58 Correct 3 ms 896 KB Output is correct
59 Correct 4 ms 1280 KB Output is correct
60 Correct 5 ms 1280 KB Output is correct
61 Correct 1 ms 384 KB Output is correct
62 Correct 8 ms 1280 KB Output is correct
63 Correct 9 ms 1280 KB Output is correct
64 Correct 11 ms 1152 KB Output is correct
65 Correct 2 ms 512 KB Output is correct
66 Correct 2 ms 384 KB Output is correct
67 Correct 2 ms 512 KB Output is correct
68 Correct 5 ms 896 KB Output is correct
69 Correct 4 ms 1280 KB Output is correct
70 Correct 4 ms 1280 KB Output is correct
71 Correct 1 ms 384 KB Output is correct
72 Correct 7 ms 1280 KB Output is correct
73 Correct 8 ms 1024 KB Output is correct
74 Correct 12 ms 896 KB Output is correct

Subtask #5
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 512 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 512 KB Output is correct
24 Correct 1 ms 512 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 512 KB Output is correct
28 Correct 2 ms 512 KB Output is correct
29 Correct 2 ms 512 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 2 ms 512 KB Output is correct
32 Correct 2 ms 512 KB Output is correct
33 Correct 2 ms 384 KB Output is correct
34 Correct 2 ms 512 KB Output is correct
35 Correct 2 ms 384 KB Output is correct
36 Correct 4 ms 512 KB Output is correct
37 Correct 6 ms 896 KB Output is correct
38 Correct 11 ms 1280 KB Output is correct
39 Correct 8 ms 1408 KB Output is correct
40 Correct 1 ms 384 KB Output is correct
41 Correct 8 ms 768 KB Output is correct
42 Correct 8 ms 1024 KB Output is correct
43 Correct 1 ms 512 KB Output is correct
44 Correct 3 ms 640 KB Output is correct
45 Correct 3 ms 896 KB Output is correct
46 Correct 4 ms 1280 KB Output is correct
47 Correct 3 ms 1280 KB Output is correct
48 Correct 1 ms 512 KB Output is correct
49 Correct 7 ms 1280 KB Output is correct
50 Correct 10 ms 1280 KB Output is correct
51 Correct 2 ms 384 KB Output is correct
52 Correct 43 ms 384 KB Output is correct
53 Correct 28 ms 384 KB Output is correct
54 Correct 171 ms 504 KB Output is correct
55 Correct 124 ms 384 KB Output is correct
56 Correct 195 ms 384 KB Output is correct
57 Correct 171 ms 384 KB Output is correct
58 Correct 225 ms 632 KB Output is correct
59 Correct 314 ms 460 KB Output is correct
60 Correct 59 ms 384 KB Output is correct
61 Correct 2 ms 384 KB Output is correct
62 Correct 26 ms 384 KB Output is correct
63 Correct 171 ms 384 KB Output is correct
64 Correct 44 ms 504 KB Output is correct
65 Correct 89 ms 384 KB Output is correct
66 Correct 135 ms 384 KB Output is correct
67 Correct 31 ms 384 KB Output is correct
68 Correct 553 ms 504 KB Output is correct
69 Correct 181 ms 504 KB Output is correct