Submission #1370903
Source Code Expand
#include<iostream> using namespace std; int main(){ int n, ave=0, ans=0, a[n]; cin >> n; for(int i=0; i<n; i++){ cin >> a[i]; ave += a[i]; } if(ave%n==0){ ave/=n; for(int i=0; i<n-1; i++){ if(a[i]!=ave){ int dec = ave - a[i]; a[i] += dec; a[i+1] -= dec; ans++; } } cout << ans << endl; } else { cout << -1 << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 島と橋 |
User | tenkyu |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 484 Byte |
Status | RE |
Exec Time | 101 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 | AC | 1 ms | 256 KB |
sample_02.txt | AC | 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 | AC | 1 ms | 256 KB |
subtask1_04.txt | AC | 1 ms | 256 KB |
subtask1_05.txt | RE | 98 ms | 256 KB |
subtask1_06.txt | RE | 98 ms | 256 KB |
subtask1_07.txt | RE | 101 ms | 256 KB |
subtask1_08.txt | RE | 98 ms | 256 KB |
subtask1_09.txt | RE | 98 ms | 256 KB |
subtask1_10.txt | RE | 97 ms | 256 KB |
subtask1_11.txt | RE | 98 ms | 256 KB |
subtask1_12.txt | RE | 98 ms | 256 KB |
subtask1_13.txt | RE | 97 ms | 256 KB |
subtask1_14.txt | RE | 97 ms | 256 KB |
subtask1_15.txt | RE | 100 ms | 256 KB |
subtask1_16.txt | WA | 1 ms | 256 KB |
subtask1_17.txt | RE | 99 ms | 256 KB |
subtask1_18.txt | RE | 99 ms | 256 KB |
subtask1_19.txt | RE | 98 ms | 256 KB |
subtask1_20.txt | RE | 99 ms | 256 KB |
subtask1_21.txt | RE | 97 ms | 256 KB |
subtask1_22.txt | RE | 98 ms | 256 KB |
subtask1_23.txt | RE | 97 ms | 256 KB |
subtask1_24.txt | RE | 98 ms | 256 KB |
subtask1_25.txt | RE | 97 ms | 256 KB |
subtask1_26.txt | RE | 97 ms | 256 KB |
subtask1_27.txt | RE | 97 ms | 256 KB |
subtask1_28.txt | RE | 98 ms | 256 KB |
subtask1_29.txt | RE | 97 ms | 256 KB |
subtask1_30.txt | RE | 97 ms | 256 KB |
subtask1_31.txt | AC | 1 ms | 256 KB |
subtask1_32.txt | RE | 97 ms | 256 KB |
subtask1_33.txt | RE | 97 ms | 256 KB |
subtask1_34.txt | RE | 97 ms | 256 KB |