QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#763370#9745. 递增序列tianxiawoyou#WA 0ms4080kbC++14989b2024-11-19 19:52:302024-11-19 19:52:31

Judging History

This is the latest submission verdict.

  • [2024-11-19 19:52:31]
  • Judged
  • Verdict: WA
  • Time: 0ms
  • Memory: 4080kb
  • [2024-11-19 19:52:30]
  • Submitted

answer

#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=1000005;
int n,a[N];
int h[65][2],sum[65],as,k;
signed main(){
     freopen("1.in","r",stdin);
    cin.tie(0),cout.tie(0),ios::sync_with_stdio(0);
    cin>>n>>k;  
    for(int i=1;i<=n;++i)cin>>a[i];
    for(int o=1;o<n;++o){
        int x=a[o],y=a[o+1],p,q;
        for(int i=62;i>=0;--i){
            if((1ll<<i)&x)p=1;else p=0;
            if((1ll<<i)&y)q=1;else q=0;
            if(p==q)continue;
            if(p<q)h[i][0]=1;
            else h[i][1]=1;
            break;
        }
    }
    for(int i=62;i>=0;--i)if(h[i][0]&&h[i][1])return puts("0"),0;
    sum[0]=(h[0][0]==0&&h[0][1]==0);
    for(int i=1;i<=62;++i)sum[i]=sum[i-1]+(h[i][0]==0&&h[i][1]==0);
    for(int i=62;i>=0;--i)if((1ll<<i)&k){
        if(!h[i][0]&&!h[i][1])as+=(1ll<<sum[i-1]);
        else if(h[i][0]){as+=(1ll<<sum[i-1]);break;}
    }else{
        if(h[i][1])break;
    }cout<<as;
    return 0;
}

詳細信息

Test #1:

score: 0
Wrong Answer
time: 0ms
memory: 4080kb

input:

1
4 17
3 2 5 16

output:

0

result:

wrong answer 1st lines differ - expected: '4', found: '0'