Submission #1174530
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX_N = 110;
int n,dat[2*MAX_N-1],ans,a[110];
void init(int n_){
n=1;
while(n<n_)n*=2;
for(int i=0;i<2*n-1;i++)dat[i]=0;
}
void add(int x,int val){
x+=n-1;
dat[x]+=val;
while(x>0){
x=(x-1)/2;
dat[x]=dat[x*2+1]+dat[x*2+2];
}
}
int getSum(int a,int b,int k,int l,int r){
if(r <= a || b <= l){
return 0;
}
if(a <= l && r <= b){
return dat[k];
}
return(getSum(a,b,k*2+1,l,(l+r)/2)+getSum(a,b,k*2+2,(l+r)/2,r));
}
signed main(){
int N;
cin>>N;
init(N);
for(int i=0;i<N;i++){
scanf("%d",&a[i]);
}
for(int i=0;i<N;i++){
add(i,a[i]);
}
int res=getSum(0,n,0,0,n);
if(res%N!=0){
cout<<"-1"<<endl;
return 0;
}
int t=res/N;
for(int i=0;i<N-1;i++){
int rP=0,lP=0;
rP=getSum(0,i-1,0,0,N);
lP=res-rP;
if(rP%(i+1)==0 && rP/(i+1)==t && lP%(N-(i+1))==0 && lP/(N-(i+1))==t){
}else{
//cout<<"rP="<<rP<<endl;
//cout<<"lP="<<lP<<endl;
ans++;
}
}
cout<<ans<<endl;
return 0;
}
Submission Info
Submission Time
2017-03-20 19:41:36+0900
Task
B - 島と橋
User
albicilla
Language
C++14 (GCC 5.4.1)
Score
0
Code Size
1154 Byte
Status
WA
Exec Time
1 ms
Memory
256 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:43:21: warning: format ‘%d’ expects argument of type ‘int*’, but argument 2 has type ‘long long int*’ [-Wformat=]
scanf("%d",&a[i]);
^
./Main.cpp:43:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&a[i]);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
0 / 100
Status
Set Name
Test Cases
Sample
sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt
All
sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, subtask1_30.txt, subtask1_31.txt, subtask1_32.txt, subtask1_33.txt, subtask1_34.txt
Case Name
Status
Exec Time
Memory
sample_01.txt
AC
1 ms
256 KB
sample_02.txt
WA
1 ms
256 KB
sample_03.txt
AC
1 ms
256 KB
sample_04.txt
AC
1 ms
256 KB
subtask1_01.txt
AC
1 ms
256 KB
subtask1_02.txt
WA
1 ms
256 KB
subtask1_03.txt
AC
1 ms
256 KB
subtask1_04.txt
AC
1 ms
256 KB
subtask1_05.txt
AC
1 ms
256 KB
subtask1_06.txt
WA
1 ms
256 KB
subtask1_07.txt
WA
1 ms
256 KB
subtask1_08.txt
WA
1 ms
256 KB
subtask1_09.txt
WA
1 ms
256 KB
subtask1_10.txt
WA
1 ms
256 KB
subtask1_11.txt
WA
1 ms
256 KB
subtask1_12.txt
WA
1 ms
256 KB
subtask1_13.txt
WA
1 ms
256 KB
subtask1_14.txt
WA
1 ms
256 KB
subtask1_15.txt
WA
1 ms
256 KB
subtask1_16.txt
AC
1 ms
256 KB
subtask1_17.txt
WA
1 ms
256 KB
subtask1_18.txt
WA
1 ms
256 KB
subtask1_19.txt
WA
1 ms
256 KB
subtask1_20.txt
WA
1 ms
256 KB
subtask1_21.txt
WA
1 ms
256 KB
subtask1_22.txt
WA
1 ms
256 KB
subtask1_23.txt
WA
1 ms
256 KB
subtask1_24.txt
WA
1 ms
256 KB
subtask1_25.txt
WA
1 ms
256 KB
subtask1_26.txt
WA
1 ms
256 KB
subtask1_27.txt
WA
1 ms
256 KB
subtask1_28.txt
WA
1 ms
256 KB
subtask1_29.txt
WA
1 ms
256 KB
subtask1_30.txt
WA
1 ms
256 KB
subtask1_31.txt
WA
1 ms
256 KB
subtask1_32.txt
WA
1 ms
256 KB
subtask1_33.txt
WA
1 ms
256 KB
subtask1_34.txt
WA
1 ms
256 KB