Submission #467846


Source Code Expand

#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>

#include <map>
#include <set>
#include <string>
#include <algorithm>
#include <functional>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define INF 1<<30
#define MP make_pair
#define mp make_pair
#define pb push_back
#define PB push_back
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define ll long long
#define ull unsigned long long

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    int n;
    cin >> n;

    int peoples[n];
    int sumpeoples = 0;
    REP(i, n) {
        int p;
        cin >> p;
        peoples[i] = p;
        sumpeoples += p;
    }

    if(sumpeoples % n != 0) {
        cout << "-1" << endl;
    } else {
        int pp = sumpeoples / n;  // perpeople
        int res = 0;
        REP(i, n-1) {
            int left = 0;
            FOR(j, 0, i+1) {
                left += peoples[j];
            }
            int right = 0;
            FOR(j, i+1, n) {
                right += peoples[j];
            }

            // cout << "DEBUG: " << left << " " << (i+1) * pp << endl;
            // cout << "DEBUG: " << right << " " << (n-i-1) * pp << endl;
            if(left != (i+1) * pp && right != (n-i-1) * pp) {
                res++;
            }
        }

        cout << res << endl;
    }

    return 0;
}

Submission Info

Submission Time
Task B - 島と橋
User yumechi
Language C++11 (GCC 4.9.2)
Score 100
Code Size 1549 Byte
Status AC
Exec Time 28 ms
Memory 932 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 4
AC × 38
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 23 ms 800 KB
sample_02.txt AC 23 ms 800 KB
sample_03.txt AC 22 ms 928 KB
sample_04.txt AC 24 ms 924 KB
subtask1_01.txt AC 26 ms 752 KB
subtask1_02.txt AC 22 ms 928 KB
subtask1_03.txt AC 24 ms 844 KB
subtask1_04.txt AC 24 ms 808 KB
subtask1_05.txt AC 24 ms 804 KB
subtask1_06.txt AC 24 ms 924 KB
subtask1_07.txt AC 24 ms 924 KB
subtask1_08.txt AC 24 ms 792 KB
subtask1_09.txt AC 24 ms 804 KB
subtask1_10.txt AC 24 ms 932 KB
subtask1_11.txt AC 28 ms 924 KB
subtask1_12.txt AC 23 ms 928 KB
subtask1_13.txt AC 22 ms 924 KB
subtask1_14.txt AC 24 ms 924 KB
subtask1_15.txt AC 24 ms 924 KB
subtask1_16.txt AC 24 ms 924 KB
subtask1_17.txt AC 24 ms 928 KB
subtask1_18.txt AC 22 ms 804 KB
subtask1_19.txt AC 24 ms 844 KB
subtask1_20.txt AC 23 ms 928 KB
subtask1_21.txt AC 24 ms 928 KB
subtask1_22.txt AC 22 ms 800 KB
subtask1_23.txt AC 22 ms 796 KB
subtask1_24.txt AC 23 ms 924 KB
subtask1_25.txt AC 23 ms 796 KB
subtask1_26.txt AC 26 ms 728 KB
subtask1_27.txt AC 25 ms 916 KB
subtask1_28.txt AC 25 ms 916 KB
subtask1_29.txt AC 25 ms 912 KB
subtask1_30.txt AC 25 ms 912 KB
subtask1_31.txt AC 25 ms 916 KB
subtask1_32.txt AC 24 ms 920 KB
subtask1_33.txt AC 25 ms 920 KB
subtask1_34.txt AC 24 ms 912 KB