Submission #1174484
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define int long long const int MAX_N = 110; int bit[MAX_N+1],n,ans; int sum(int i){ int s=0; while(i>0){ s+=bit[i]; i -= i &-i; } return s; } void add(int i,int x){ while(i<=n){ bit[i]+=x; i+=i&-i; } } signed main(){ cin>>n; int a; for(int i=1;i<=n;i++){ cin>>a; add(i,a); } int res=sum(n); if(res%n!=0){ cout<<"-1"<<endl; return 0; } int t=res/n; for(int i=1;i<n-1;i++){ int rP=0,lP=0; rP=sum(i); 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 | |
---|---|
Task | B - 島と橋 |
User | albicilla |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 799 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 KB |
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 | WA | 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 | AC | 1 ms | 256 KB |
subtask1_03.txt | WA | 1 ms | 256 KB |
subtask1_04.txt | WA | 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 | AC | 1 ms | 256 KB |
subtask1_16.txt | WA | 1 ms | 256 KB |
subtask1_17.txt | WA | 1 ms | 256 KB |
subtask1_18.txt | AC | 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 | AC | 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 | AC | 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 | AC | 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 | AC | 1 ms | 256 KB |