Submission #45935158

Source Code Expand

// LUOGU_RID: 126053709
#include<cstdio>
#include<utility>
#define x first
#define y second
using namespace std;
#define Ed for(int i=h[x];~i;i=ne[i])
#define Ls(i,l,r) for(int i=l;i<r;++i)
#define Rs(i,l,r) for(int i=l;i>r;--i)
#define Le(i,l,r) for(int i=l;i<=r;++i)
#define Re(i,l,r) for(int i=l;i>=r;--i)
#define L(i,l) for(int i=0;i<l;++i)
#define E(i,l) for(int i=1;i<=l;++i)
#define W(t) while(t--)
#define Wh while
typedef pair<int,int> pii;
const int N=200010;
int n,a[N],r[N];
typedef long long ll;
ll ans;
int main(){
    #ifndef ONLINE_JUDGE
    freopen("1.in","r",stdin);
    #endif
    scanf("%d",&n);
    E(i, n)scanf("%d",a+i);
    int re=n;
    Re(i, n, 1){
        r[i]=re;
        if(a[i])re=i;
    }
    r[n]=0;
    E(l, n){
        int now=0,R,sub;
        for(R=l,sub=1;R;sub=r[R]-R,R=r[R]){
            if((now^a[R])==now+a[R]){
                ans+=sub;
                now+=a[R];
            }
            else{
                ans+=sub-1;
                break;
            }
        }
    }
    printf("%lld",ans);
    return 0;
}

Submission Info

Submission Time
Task D - Xor Sum 2
User WUSICHENG
Language C++ 17 (gcc 12.2)
Score 500
Code Size 1103 Byte
Status AC
Exec Time 18 ms
Memory 3288 KiB

Compile Error

Main.cpp: In function ‘int main()’:
Main.cpp:25:10: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   25 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
Main.cpp:26:17: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   26 |     E(i, n)scanf("%d",a+i);
      |            ~~~~~^~~~~~~~~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 3
AC × 38
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_28.txt, subtask_1_29.txt, subtask_1_30.txt, subtask_1_31.txt, subtask_1_32.txt
Case Name Status Exec Time Memory
sample_01.txt AC 0 ms 1624 KiB
sample_02.txt AC 0 ms 1700 KiB
sample_03.txt AC 0 ms 1736 KiB
subtask_1_01.txt AC 0 ms 1628 KiB
subtask_1_02.txt AC 0 ms 1720 KiB
subtask_1_03.txt AC 8 ms 2932 KiB
subtask_1_04.txt AC 1 ms 1652 KiB
subtask_1_05.txt AC 7 ms 2472 KiB
subtask_1_06.txt AC 6 ms 2224 KiB
subtask_1_07.txt AC 1 ms 1696 KiB
subtask_1_08.txt AC 6 ms 2268 KiB
subtask_1_09.txt AC 10 ms 2660 KiB
subtask_1_10.txt AC 13 ms 2728 KiB
subtask_1_11.txt AC 12 ms 2888 KiB
subtask_1_12.txt AC 16 ms 3024 KiB
subtask_1_13.txt AC 3 ms 2048 KiB
subtask_1_14.txt AC 3 ms 1980 KiB
subtask_1_15.txt AC 4 ms 2320 KiB
subtask_1_16.txt AC 0 ms 1660 KiB
subtask_1_17.txt AC 10 ms 3284 KiB
subtask_1_18.txt AC 11 ms 3212 KiB
subtask_1_19.txt AC 14 ms 3176 KiB
subtask_1_20.txt AC 17 ms 3288 KiB
subtask_1_21.txt AC 14 ms 3168 KiB
subtask_1_22.txt AC 16 ms 3168 KiB
subtask_1_23.txt AC 15 ms 3176 KiB
subtask_1_24.txt AC 18 ms 3128 KiB
subtask_1_25.txt AC 15 ms 3220 KiB
subtask_1_26.txt AC 17 ms 3196 KiB
subtask_1_27.txt AC 11 ms 3120 KiB
subtask_1_28.txt AC 13 ms 3172 KiB
subtask_1_29.txt AC 11 ms 3192 KiB
subtask_1_30.txt AC 11 ms 3216 KiB
subtask_1_31.txt AC 10 ms 3144 KiB
subtask_1_32.txt AC 11 ms 3216 KiB