QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#704064#138. Bali SculpturesTheZone100 ✓1ms8468kbC++2011.6kb2024-11-02 19:12:312024-11-02 19:12:40

Judging History

This is the latest submission verdict.

  • [2024-11-02 19:12:40]
  • Judged
  • Verdict: 100
  • Time: 1ms
  • Memory: 8468kb
Show
  • [2024-11-02 19:12:31]
  • Submitted

answer

#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll inf=1e18;
ll n,m,i,j,k,l,r,x,y,z,w,s,t,a[110000],dp[110000],adj[2200][2200],e,ans;
int main()
{
    scanf("%lld %lld %lld",&n,&x,&y);
    for(i=1;i<=n;i++)
    {
        scanf("%lld",&a[i]);
    }
    for(e=60;e>=0;e--)
    {
        t=(ans|((1LL<<e)-1));
      //  printf("(%lld)\n",t);
        for(i=1;i<=n;i++)
        {
            s=0;
            for(j=i;j>=1;j--)
            {
                s+=a[j];
                adj[j-1][i]=0;
                if((s&t)==s)
                {
                    adj[j-1][i]=1;
                }
            }
        }
        for(i=1;i<=n;i++)
            dp[i]=inf;
        dp[0]=0;
        for(i=0;i<=n;i++)
        {
            for(j=i;j<=n;j++)
            {
              //  printf("(%lld)",adj[i][j]);
                if(adj[i][j]==0)
                    continue;
                dp[j]=min(dp[j],dp[i]+adj[i][j]);
            }
         //   printf("\n");
        }
        if(dp[n]>y)
            ans|=((1LL<<e));
    }
    printf("%lld",ans);
}

/*#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll inf=1e18;
ll n,m,i,j,k,l,r,x,y,z,w,s,t,a[110000],dp[110000],adj[2200][2200],e,ans;
int main()
{
    scanf("%lld %lld %lld",&n,&x,&y);
    for(i=1;i<=n;i++)
    {
        scanf("%lld",&a[i]);
    }
    for(e=60;e>=0;e--)
    {
        t=(ans|((1LL<<e)-1));
      //  printf("(%lld)\n",t);
        for(i=1;i<=n;i++)
        {
            s=0;
            for(j=i;j>=1;j--)
            {
                s+=a[j];
                adj[j-1][i]=0;
                if((s&t)==s)
                {
                    adj[j-1][i]=1;
                }
            }
        }
        for(i=1;i<=n;i++)
            dp[i]=inf;
        dp[0]=0;
        for(i=0;i<=n;i++)
        {
            for(j=i;j<=n;j++)
            {
              //  printf("(%lld)",adj[i][j]);
                if(adj[i][j]==0)
dddddddddddddddddddddddddddddddddddddddddddddddddd
vdddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddd
vdddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddd
vdddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddd
vdddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddd
vddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddd
                    continue;
                dp[j]=min(dp[j],dp[i]+adj[i][j]);
            }
         //   printf("\n");
        }
        if(dp[n]>y)
            ans|=((1LL<<e));
    }
    printf("%lld",ans);
}
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll inf=1e18;
ll n,m,i,j,k,l,r,x,y,z,w,s,t,a[110000],dp[110000],adj[2200][2200],e,ans;
int main()
{
    scanf("%lld %lld %lld",&n,&x,&y);
    for(i=1;i<=n;i++)
    {
        scanf("%lld",&a[i]);
    }
    for(e=60;e>=0;e--)
    {
        t=(ans|((1LL<<e)-1));
      //  printf("(%lld)\n",t);
        for(i=1;i<=n;i++)
        {
            s=0;
            for(j=i;j>=1;j--)
            {
                s+=a[j];
                adj[j-1][i]=0;
                if((s&t)==s)
                {
                    adj[j-1][i]=1;
                }
            }
        }
        for(i=1;i<=n;i++)
            dp[i]=inf;
        dp[0]=0;
        for(i=0;i<=n;i++)
        {
            for(j=i;j<=n;j++)
            {
              //  printf("(%lld)",adj[i][j]);
                if(adj[i][j]==0)
                    continue;
                dp[j]=min(dp[j],dp[i]+adj[i][j]);
            }
         //   printf("\n");
        }
        if(dp[n]>y)
            ans|=((1LL<<e));
    }
    printf("%lld",ans);
}
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll inf=1e18;
ll n,m,i,j,k,l,r,x,y,z,w,s,t,a[110000],dp[110000],adj[2200][2200],e,ans;
int main()
{
    scanf("%lld %lld %lld",&n,&x,&y);
    for(i=1;i<=n;i++)
    {
        scanf("%lld",&a[i]);
    }
    for(e=60;e>=0;e--)
    {
        t=(ans|((1LL<<e)-1));
      //  printf("(%lld)\n",t);
        for(i=1;i<=n;i++)
        {
            s=0;
            for(j=i;j>=1;j--)
            {
                s+=a[j];
                adj[j-1][i]=0;
                if((s&t)==s)
                {
                    adj[j-1][i]=1;
                }
            }
        }
        for(i=1;i<=n;i++)
            dp[i]=inf;
        dp[0]=0;
        for(i=0;i<=n;i++)
        {
            for(j=i;j<=n;j++)
            {
              //  printf("(%lld)",adj[i][j]);
                if(adj[i][j]==0)
                    continue;
                dp[j]=min(dp[j],dp[i]+adj[i][j]);
            }
         //   printf("\n");
        }
        if(dp[n]>y)
            ans|=((1LL<<e));
    }
    printf("%lld",ans);
}
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll inf=1e18;
ll n,m,i,j,k,l,r,x,y,z,w,s,t,a[110000],dp[110000],adj[2200][2200],e,ans;
int main()
{
    scanf("%lld %lld %lld",&n,&x,&y);
    for(i=1;i<=n;i++)
    {
        scanf("%lld",&a[i]);
    }
    for(e=60;e>=0;e--)
    {
        t=(ans|((1LL<<e)-1));
      //  printf("(%lld)\n",t);
        for(i=1;i<=n;i++)
        {
            s=0;
            for(j=i;j>=1;j--)
            {
                s+=a[j];
                adj[j-1][i]=0;
                if((s&t)==s)
                {
                    adj[j-1][i]=1;
                }
            }
        }
        for(i=1;i<=n;i++)
            dp[i]=inf;
        dp[0]=0;
        for(i=0;i<=n;i++)
        {
            for(j=i;j<=n;j++)
            {
              //  printf("(%lld)",adj[i][j]);
                if(adj[i][j]==0)
                    continue;
                dp[j]=min(dp[j],dp[i]+adj[i][j]);
            }
         //   printf("\n");
        }
        if(dp[n]>y)
            ans|=((1LL<<e));
    }
    printf("%lld",ans);
}
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll inf=1e18;
ll n,m,i,j,k,l,r,x,y,z,w,s,t,a[110000],dp[110000],adj[2200][2200],e,ans;
int main()
{
    scanf("%lld %lld %lld",&n,&x,&y);
    for(i=1;i<=n;i++)
    {
        scanf("%lld",&a[i]);
    }
    for(e=60;e>=0;e--)
    {
        t=(ans|((1LL<<e)-1));
      //  printf("(%lld)\n",t);
        for(i=1;i<=n;i++)
        {
            s=0;
            for(j=i;j>=1;j--)
            {
                s+=a[j];
                adj[j-1][i]=0;
                if((s&t)==s)
                {
                    adj[j-1][i]=1;
                }
            }
        }
        for(i=1;i<=n;i++)
            dp[i]=inf;
        dp[0]=0;
        for(i=0;i<=n;i++)
        {
            for(j=i;j<=n;j++)
            {
              //  printf("(%lld)",adj[i][j]);
                if(adj[i][j]==0)
                    continue;
                dp[j]=min(dp[j],dp[i]+adj[i][j]);
            }
         //   printf("\n");
        }
        if(dp[n]>y)
            ans|=((1LL<<e));
    }
    printf("%lld",ans);
}
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll inf=1e18;
ll n,m,i,j,k,l,r,x,y,z,w,s,t,a[110000],dp[110000],adj[2200][2200],e,ans;
int main()
{
    scanf("%lld %lld %lld",&n,&x,&y);
    for(i=1;i<=n;i++)
    {
        scanf("%lld",&a[i]);
    }
    for(e=60;e>=0;e--)
    {
        t=(ans|((1LL<<e)-1));
      //  printf("(%lld)\n",t);
        for(i=1;i<=n;i++)
        {
            s=0;
            for(j=i;j>=1;j--)
            {
                s+=a[j];
                adj[j-1][i]=0;
                if((s&t)==s)
                {
                    adj[j-1][i]=1;
                }
            }
        }
        for(i=1;i<=n;i++)
            dp[i]=inf;
        dp[0]=0;
        for(i=0;i<=n;i++)
        {
            for(j=i;j<=n;j++)
            {
              //  printf("(%lld)",adj[i][j]);
                if(adj[i][j]==0)
                    continue;
                dp[j]=min(dp[j],dp[i]+adj[i][j]);
            }
         //   printf("\n");
        }
        if(dp[n]>y)
            ans|=((1LL<<e));
    }
    printf("%lld",ans);
}
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll inf=1e18;
ll n,m,i,j,k,l,r,x,y,z,w,s,t,a[110000],dp[110000],adj[2200][2200],e,ans;
int main()
{
    scanf("%lld %lld %lld",&n,&x,&y);
    for(i=1;i<=n;i++)
    {
        scanf("%lld",&a[i]);
    }
    for(e=60;e>=0;e--)
    {
        t=(ans|((1LL<<e)-1));
      //  printf("(%lld)\n",t);
        for(i=1;i<=n;i++)
        {
            s=0;
            for(j=i;j>=1;j--)
            {
                s+=a[j];
                adj[j-1][i]=0;
                if((s&t)==s)
                {
                    adj[j-1][i]=1;
                }
            }
        }
        for(i=1;i<=n;i++)
            dp[i]=inf;
        dp[0]=0;
        for(i=0;i<=n;i++)
        {
            for(j=i;j<=n;j++)
            {
              //  printf("(%lld)",adj[i][j]);
                if(adj[i][j]==0)
                    continue;
                dp[j]=min(dp[j],dp[i]+adj[i][j]);
            }
         //   printf("\n");
        }
        if(dp[n]>y)
            ans|=((1LL<<e));
    }
    printf("%lld",ans);
}
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll inf=1e18;
ll n,m,i,j,k,l,r,x,y,z,w,s,t,a[110000],dp[110000],adj[2200][2200],e,ans;
int main()
{
    scanf("%lld %lld %lld",&n,&x,&y);
    for(i=1;i<=n;i++)
    {
        scanf("%lld",&a[i]);
    }
    for(e=60;e>=0;e--)
    {
        t=(ans|((1LL<<e)-1));
      //  printf("(%lld)\n",t);
        for(i=1;i<=n;i++)
        {
            s=0;
            for(j=i;j>=1;j--)
            {
                s+=a[j];
                adj[j-1][i]=0;
                if((s&t)==s)
                {
                    adj[j-1][i]=1;
                }
            }
        }
        for(i=1;i<=n;i++)
            dp[i]=inf;
        dp[0]=0;
        for(i=0;i<=n;i++)
        {
            for(j=i;j<=n;j++)
            {
              //  printf("(%lld)",adj[i][j]);
                if(adj[i][j]==0)
                    continue;
                dp[j]=min(dp[j],dp[i]+adj[i][j]);
            }
         //   printf("\n");
        }
        if(dp[n]>y)
            ans|=((1LL<<e));
    }
    printf("%lld",ans);
}
*/
源文件, 语言: C++20

詳細信息

Subtask #1:

score: 0
Accepted

Test #1:

score: 0
Accepted
time: 1ms
memory: 5816kb

input:

8 1 4
1 2 1 1 1 0 4 6

output:

6

result:

ok single line: '6'

Subtask #2:

score: 0
Accepted

Test #13:

score: 0
Accepted
time: 0ms
memory: 7960kb

input:

6 2 3
1 1 1 1 1 1

output:

2

result:

ok single line: '2'

Subtask #3:

score: 0
Accepted

Test #26:

score: 0
Accepted
time: 0ms
memory: 5804kb

input:

5 1 3
451631570 250518388 397580948 477427142 699144811

output:

1040187263

result:

ok single line: '1040187263'

Subtask #4:

score: 0
Accepted

Test #36:

score: 0
Accepted
time: 0ms
memory: 6088kb

input:

21 1 20
7 2 8 9 5 5 2 8 3 0 5 0 5 9 3 4 1 4 7 7 10

output:

15

result:

ok single line: '15'

Subtask #5:

score: 0
Accepted

Test #46:

score: 0
Accepted
time: 0ms
memory: 6188kb

input:

51 1 20
6 10 12 9 0 3 14 3 0 1 18 20 4 9 7 16 11 15 17 16 10 15 11 1 6 16 19 15 12 17 10 3 6 5 14 6 11 0 18 6 0 2 4 7 7 16 7 9 10 13 0

output:

31

result:

ok single line: '31'

Subtask #6:

score: 0
Accepted

Test #55:

score: 0
Accepted
time: 1ms
memory: 6040kb

input:

51 1 20
112872931 738945953 683278169 770763749 516510818 790818428 875172481 703986370 60868760 918060338 785761560 775662511 633498896 598270657 590667589 115223551 657182582 662359373 423527461 442741161 404625684 341975402 396747626 126186088 753822361 159840892 743886212 135361223 217348329 815...

output:

1879048191

result:

ok single line: '1879048191'

Subtask #7:

score: 0
Accepted

Test #63:

score: 0
Accepted
time: 0ms
memory: 6364kb

input:

90 45 90
0 0 0 1 1 2 0 0 0 1 1 2 0 0 0 1 1 2 0 0 0 1 1 2 0 0 0 1 1 2 0 0 0 1 1 2 0 0 0 1 1 2 0 0 0 1 1 2 0 0 0 1 1 2 0 0 0 1 1 2 0 0 0 1 1 2 0 0 0 1 1 2 0 0 0 1 1 2 0 0 0 1 1 2 0 0 0 1 1 2

output:

2

result:

ok single line: '2'

Subtask #8:

score: 0
Accepted

Test #74:

score: 0
Accepted
time: 1ms
memory: 8468kb

input:

101 1 20
109288331 167187936 289459547 455669706 656308194 233503022 562258473 2210429 243994669 58628149 750503963 610269250 29072940 251143410 458350486 696874700 870849343 646709707 646709077 746808795 87439926 187779526 762073671 569489420 380238922 982163795 784978520 933220915 264403502 755738...

output:

3221159935

result:

ok single line: '3221159935'

Subtask #9:

score: 9
Accepted

Dependency #1:

100%
Accepted

Dependency #2:

100%
Accepted

Dependency #3:

100%
Accepted

Subtask #10:

score: 16
Accepted

Dependency #1:

100%
Accepted

Dependency #2:

100%
Accepted

Dependency #4:

100%
Accepted

Subtask #11:

score: 21
Accepted

Dependency #1:

100%
Accepted

Dependency #4:

100%
Accepted

Dependency #5:

100%
Accepted

Subtask #12:

score: 25
Accepted

Dependency #1:

100%
Accepted

Dependency #2:

100%
Accepted

Dependency #3:

100%
Accepted

Dependency #4:

100%
Accepted

Dependency #5:

100%
Accepted

Dependency #6:

100%
Accepted

Dependency #7:

100%
Accepted

Subtask #13:

score: 29
Accepted

Dependency #1:

100%
Accepted

Dependency #3:

100%
Accepted

Dependency #4:

100%
Accepted

Dependency #5:

100%
Accepted

Dependency #6:

100%
Accepted

Dependency #8:

100%
Accepted

Extra Test:

score: 0
Extra Test Passed
English 繁體中文 简体中文

伺服器時間: 2025-02-08 15:25:05 | 開源專案