Kemija

#include<bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
using ii=long long;

vector<int> v,d;

int p[10100];
ii asd[10100];
ii dd[10100];
int n;

ii haku(ii x)
{
    fill(p, p + n, 0);
    asd[0] = x;
    p[0] = 1;
    int it = 0;
    while (!p[(it + 3) % n]) {
        p[(it + 3) % n] = 1;
        asd[(it + 3) % n] = asd[it] + dd[it];
        it += 3;
        it %= n;
    }
    for (int i = 0; i < n; ++i) if (!p[i]) {
        asd[i] = v[i]-asd[(i-1+n)%n]+asd[(i+1)%n];
    }
    ii s = 0;
    for (int i = 0; i < n; ++i) {
        s += asd[i];
    }
    return s;
}


int main()
{
    cin >> n;
    v=vector<int>(n);
    ii s = 0;
    for (int i = 0; i < n; ++i) {
        cin >> v[i];
        s += v[i];
    }
    assert(s % 3 == 0);
    s /= 3;
    if (n == 3) {
        cout << 1 << " " << 1 << " " << s - 2 << "\n";
        return 0;
    }
    d=vector<int>(n);
    for (int i = 0; i < n; ++i) {
        d[i] = v[(i+2)%n] - v[(i + 1) % n];
        dd[i] = d[i];
        //printf("dd[%d] =%d\n", i, d[i]);
        
    }
    ii b = 0;
    for (ii z = (1l << 32); z; z /= 2) {
        if (haku(b + z) <= s) b += z;
    }
    haku(b);
    for (int i = 0; i < n; ++i) {
        cout << asd[i] << "\n";
    }
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: WRONG ANSWER