Submission #1248734
Source Code Expand
#include <iostream> #include <vector> #include <algorithm> using namespace std; void inT(int i, int j, bool a[]) { for(int k = i; k < j; ++k) { a[k] = true; } } int main() { int n; cin >> n; int a[n]; for(int i = 0; i < n; ++i) { cin >> a[i]; } bool table[n]; for(int i = 0; i < n; ++i) { table[i] = false; } int sum = 0; int average; for(int i = 0; i < n; ++i) { sum += a[i]; } if(sum % n == 0) { average = sum / n; } else { cout << -1 << endl; return 0; } int diff[n]; fill(diff, diff + n, 0); for(int i = 0; i < n; ++i) { if(a[i] - average > 0) { diff[i] = a[i] - average; } } int first; int min; int max; for(int i = 0; i < n; ++i) { first = i; if(diff[i] > 0) { for(int j = 0; j < n; ++j) { if(a[j] < average) { min = j; break; } } int k = min; for(; diff[i] > 0; ++k) { a[k] += diff[i]; diff[i] = a[k] - average; if(diff[i] > 0) { a[k] = average; } } max = k > first ? k : first; inT(min, max,table); } } int ans = 0; for(int i = 0; i < n; ++i ){ if(table[i]) { ++ans; } } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 島と橋 |
User | daizu39 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1217 Byte |
Status | RE |
Exec Time | 99 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 | AC | 1 ms | 256 KB |
subtask1_06.txt | AC | 1 ms | 256 KB |
subtask1_07.txt | AC | 1 ms | 256 KB |
subtask1_08.txt | AC | 1 ms | 256 KB |
subtask1_09.txt | AC | 1 ms | 256 KB |
subtask1_10.txt | AC | 1 ms | 256 KB |
subtask1_11.txt | AC | 1 ms | 256 KB |
subtask1_12.txt | WA | 1 ms | 256 KB |
subtask1_13.txt | AC | 1 ms | 256 KB |
subtask1_14.txt | WA | 1 ms | 256 KB |
subtask1_15.txt | RE | 97 ms | 256 KB |
subtask1_16.txt | RE | 97 ms | 256 KB |
subtask1_17.txt | RE | 99 ms | 256 KB |
subtask1_18.txt | AC | 1 ms | 256 KB |
subtask1_19.txt | RE | 98 ms | 256 KB |
subtask1_20.txt | RE | 96 ms | 256 KB |
subtask1_21.txt | RE | 96 ms | 256 KB |
subtask1_22.txt | AC | 1 ms | 256 KB |
subtask1_23.txt | WA | 1 ms | 256 KB |
subtask1_24.txt | RE | 97 ms | 256 KB |
subtask1_25.txt | RE | 97 ms | 256 KB |
subtask1_26.txt | AC | 1 ms | 256 KB |
subtask1_27.txt | RE | 96 ms | 256 KB |
subtask1_28.txt | AC | 1 ms | 256 KB |
subtask1_29.txt | WA | 1 ms | 256 KB |
subtask1_30.txt | AC | 1 ms | 256 KB |
subtask1_31.txt | AC | 1 ms | 256 KB |
subtask1_32.txt | AC | 1 ms | 256 KB |
subtask1_33.txt | AC | 1 ms | 256 KB |
subtask1_34.txt | AC | 1 ms | 256 KB |