Submission #1372861


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++) {
        cout << a[i] << " \n"[i == n];
    }
    for (int i = 1; i <= n; i++) {
        cout << b[i] << " \n"[i == n];
    }
    for (int i = 1; i <= n; i++) {
        a[add(1, i)] -= i;
    }
    for (int i = 1; i <= n; i++) {
        b[i] = a[add(i, 1)] - a[i];
    }
    for (int i = 1; i <= n; i++) {
        cout << a[i] << " \n"[i == n];
    }
    for (int i = 1; i <= n; i++) {
        cout << b[i] << " \n"[i == n];
    }
    */
    for (int i = 1; i <= n; i++) {
        if ((b[i] % n + n) % n != (b[1] % n + n) % n) {
            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

Submission Time
Task B - Boxes
User Nurlykhan
Language C++14 (GCC 5.4.1)
Score 0
Code Size 2457 Byte
Status WA
Exec Time 2103 ms
Memory 5120 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 500
Status
AC × 3
AC × 20
WA × 12
TLE × 1
Set Name Test Cases
Sample sample1.txt, sample2.txt, sample3.txt
All sample1.txt, sample2.txt, sample3.txt, in1.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in2.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in3.txt, in4.txt, in5.txt, in6.txt, in7.txt, in8.txt, in9.txt, sample1.txt, sample2.txt, sample3.txt
Case Name Status Exec Time Memory
in1.txt AC 36 ms 5120 KB
in10.txt WA 6 ms 2432 KB
in11.txt WA 683 ms 5120 KB
in12.txt WA 1441 ms 5120 KB
in13.txt TLE 2103 ms 4992 KB
in14.txt AC 2 ms 2304 KB
in15.txt AC 2 ms 2304 KB
in16.txt WA 2 ms 2304 KB
in17.txt WA 3 ms 2304 KB
in18.txt WA 3 ms 2304 KB
in19.txt AC 2 ms 2304 KB
in2.txt AC 44 ms 5120 KB
in20.txt AC 2 ms 2304 KB
in21.txt AC 41 ms 5120 KB
in22.txt AC 41 ms 5120 KB
in23.txt AC 41 ms 5120 KB
in24.txt WA 4 ms 2304 KB
in25.txt WA 6 ms 2432 KB
in26.txt WA 1006 ms 5120 KB
in27.txt WA 889 ms 5120 KB
in3.txt AC 44 ms 5120 KB
in4.txt AC 45 ms 5120 KB
in5.txt AC 45 ms 5120 KB
in6.txt AC 41 ms 5120 KB
in7.txt AC 42 ms 5120 KB
in8.txt WA 6 ms 2432 KB
in9.txt WA 6 ms 2432 KB
sample1.txt AC 2 ms 2304 KB
sample2.txt AC 2 ms 2304 KB
sample3.txt AC 2 ms 2304 KB