Submission #1372844

---

Source Code Expand

#include <bits/stdc++.h>
 
#define pii pair<int, int>
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define ll long long 
#define ull unsigned long long 
#define ld long double
#define sz(v) int(v.size())
#define all(v) v.begin(), v.end()
 
#define y1 what
 
using namespace std;
 
const int N = (int) 1e6 + 10;
const int M = (int) 101;
const ll big =  (1LL << 51);
const ll LINF = (ll) 1e18;
const int INF = (int) 1e9 + 7;
const int INF1 = (int) 1e9 + 3;
const double EPS = (double) 1e-6;
const double PI =  3.14159265359;
 
int n;
ll a[N], b[N];

int add(int x, int y) {
    x += y;
    if (x > n) x -= n;
    return x;
}
 
int main() {
    #define fn "balls"
    #ifdef witch
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #else
//        freopen(fn".in", "r", stdin);
//        freopen(fn".out", "w", stdout);
    #endif
    srand(time(0));
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    for (int i = 1; i <= n; i++) {
        b[i] = a[add(i, 1)] - a[i];
    }
    for (int i = 1; i <= n; i++) {
        if ((b[i] % n + n) % n != (b[1] % n + n) % n) {
            cout << "NO";
            return 0;
        }
    }
    cout << "NO";
    return 0;
    for (ll iter = (b[1] % n + n) % n, ptr = 0; ptr <= 1e5; iter += n, ++ptr) {
        for (int i = 1; i <= n; i++) {
            b[i] = a[add(i, 1)] - a[i];
        }
        for (int j = 1; j <= n; j++) {
            b[j] -= iter;
        }
        ll ans = 0;
        for (int j = 1; j <= n; j++) {
            if (b[j] <= 0) {
                if (abs(b[j]) % n) {
                    assert(0);
                }
                ans += -b[j] / n;
            } else {
                ans = LINF;
            }
        }
        if (ans <= iter) {
            cout << "YES";
            return 0;
        }
    }
    cout << "NO";
    return 0;
}

Submission Info

Judge Result