Submission #1093055

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

#define pb push_back
#define mp make_pair

int main()
{
    int n;
    int a[123456] = {};
    cin >> n;
    for(int i = 0; i < n; i++) cin >> a[i];
    int mn = 1000000000;
    int mnPos = -1;

    ll sum = 0;
    for(int i = 0; i < n; i++){
        sum += (ll)a[i];
    }
    ll div = (1 + n) * (n) / 2;
    if(sum % div != 0){
        puts("NO");
        exit(0);
    }

    while(1){
        bool ok = true;
        for(int i = 0; i < n; i++){
            if(a[i] != 0) ok = false;
            if(a[i] < mn){
                mn = a[i];
                mnPos = i;
            }
        }
        if(ok) break;
        if(mn == 0){
            puts("NO");
            exit(0);
        }
        int k = mnPos;
        if(k < 0) k += n;
        int cnt = 1;

        for(; cnt <= n; k++){
            int i = k;
            if(i >= n) i -= n;
            if(a[i] >= cnt) a[i] -= cnt;
            else{
                puts("NO");
                exit(0);
            }
            cnt++;
        }
    }
    puts("YES");
    return 0;
}

Submission Info

Judge Result