Submission #3716854


Source Code Expand

#include <stdio.h>
#include <math.h>
#include <string.h>
#include <stdlib.h>

#define llong long long
#define fr(i,l,r) for(i=(l);i<(r);i++)
#define min(p,q)((p)<(q)?(p):(q))


int compare_int(const void *a, const void *b)
{
    return *(int*)a - *(int*)b;
}

int main(void)
{
	//変数の宣言
	int n;
	int a[200010];
	int r=0;
	
	//よく使う変数
	int i,j,k;
	int flag=0;
	int ans=0;
	long int count=0;
	int sum=0;
	int temp,temp1,temp2;
	int max,min;
	int len;
	//データの読み込み
	
	//データの読み込み
	scanf("%d",&n);
	
	for(i=0;i<n;i++){
		scanf("%d",&a[i]);
	}
	
//	printf("nは%dです\n", n);
//	printf("データの読み込み終了\n");
	//実際の処理
	
	
	for(i=0;i<n;i++){
		flag=0;
		while(flag==0){
//			printf("a[i]=%d,sum=%d\n",a[i],sum);
//			printf("a[r]=%d,sum=%d,a[r]|sum=%d,a[r]+sum=%d\n",a[r],sum,a[r]|sum,a[r]+sum);
			temp1=a[r]|sum;
			temp2=a[r]+sum;
			if(temp1==temp2&&r<n){
				sum=sum+a[r];
				r++;
			}else{
				count=count+r-i;
//				printf("i=%d,r=%d count=%d\n",i,r,count);
				sum=sum-a[i];
				flag=1;
			}
		}
	}
	
	
//	printf("計算部分終了\n");
	
	//出力
	
	printf("%ld",count);
	
//	printf("結果の出力終了\n");
	
	return 0;
}

Submission Info

Submission Time
Task D - Xor Sum 2
User rausumaru
Language C (GCC 5.4.1)
Score 500
Code Size 1287 Byte
Status AC
Exec Time 23 ms
Memory 896 KB

Compile Error

./Main.c: In function ‘main’:
./Main.c:36:2: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ^
./Main.c:39:3: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
   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 1 ms 128 KB
sample_02.txt AC 1 ms 128 KB
sample_03.txt AC 1 ms 128 KB
subtask_1_01.txt AC 1 ms 128 KB
subtask_1_02.txt AC 1 ms 128 KB
subtask_1_03.txt AC 14 ms 768 KB
subtask_1_04.txt AC 1 ms 128 KB
subtask_1_05.txt AC 11 ms 640 KB
subtask_1_06.txt AC 8 ms 512 KB
subtask_1_07.txt AC 1 ms 128 KB
subtask_1_08.txt AC 9 ms 512 KB
subtask_1_09.txt AC 13 ms 640 KB
subtask_1_10.txt AC 15 ms 768 KB
subtask_1_11.txt AC 16 ms 768 KB
subtask_1_12.txt AC 21 ms 896 KB
subtask_1_13.txt AC 5 ms 384 KB
subtask_1_14.txt AC 4 ms 384 KB
subtask_1_15.txt AC 7 ms 512 KB
subtask_1_16.txt AC 1 ms 128 KB
subtask_1_17.txt AC 17 ms 896 KB
subtask_1_18.txt AC 19 ms 896 KB
subtask_1_19.txt AC 19 ms 896 KB
subtask_1_20.txt AC 22 ms 896 KB
subtask_1_21.txt AC 20 ms 896 KB
subtask_1_22.txt AC 22 ms 896 KB
subtask_1_23.txt AC 20 ms 896 KB
subtask_1_24.txt AC 21 ms 896 KB
subtask_1_25.txt AC 20 ms 896 KB
subtask_1_26.txt AC 23 ms 896 KB
subtask_1_27.txt AC 17 ms 896 KB
subtask_1_28.txt AC 17 ms 896 KB
subtask_1_29.txt AC 17 ms 896 KB
subtask_1_30.txt AC 17 ms 896 KB
subtask_1_31.txt AC 17 ms 896 KB
subtask_1_32.txt AC 17 ms 896 KB