Snake mall

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define die(x) return cout << x << endl, 0
#define all(o) o.begin(), o.end()
#define endl '\n'
#define IOS ios::sync_with_stdio(0), cin.tie(0)
#define FILE freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#define SZ(x) ((int)(x).size())
typedef long double ld;
typedef long long ll;
int gcd(int x,int y){ return (!y ? x : gcd(y, x%y)); }
int to_int(string sconvert){stringstream geek(sconvert);int xconvert = 0; geek >> xconvert; return xconvert;}
const int MAXN=200000+30,MAX_LOG=40,INF=1e18+10,MOD=1e9+7;
const double PI = acos(-1);
int mod(int x) { return (x % MOD + MOD) % MOD; }
int power(int x,int y){
    if(y==0)return 1;
    int c=power(x,y/2);
    c=(c*c)%MOD;
    if(y%2)c=(c*x)%MOD;
    return c;
}

int n;
int a[MAXN];

// vector<int> g[MAXN];
// int visited[MAXN];
// int color[MAXN];
// int max_color = 1;
// int is_impossible = 0;

// vector<pair<int,int>> edges;
// int dfs(int v, int root){
//     visited[v]=1;

//     int ones = 0;
//     int twos = 0;
//     int is_leaf = 1;
//     for(int u:g[v]){
//         // cout <<v<<"pp pp"<<u<<" " <<visited[u]<<endl;
//         if(!visited[u]){
//             is_leaf = 0;
//             int c = dfs(u, root);
//             if (c == 1) ones++;
//             else twos ++;
//         }
//         else{
//             int c = color [u];
//             // cout <<c<<endl;
//             if (c != 0){
//                 if (c == 1) ones++;
//                 else twos ++; 
//             }
//         }
//     }

//     if(is_leaf){
//         // cout<<v<<" kk"<<g[v].size()<<endl;

//         color[v] = 1;
//         return 1;
//     }

//     // cout<<ones<<" "<<twos<<"--- "<<v<<endl;
//     if (ones>0 && twos >0){
//         is_impossible=1;
//         return 1;
//     }
//     else if (ones>=0){
//         color[v]=2;
//         return 2;
//     }
//     else{
//         color[v]=1;
//         return 1;
//     }
// }




// int a[MAXN];
int b[MAXN];

int MAIN(){
    cin >> n;
    vector<pair<int,int>> shops;
    shops.reserve(n);
    for (int i = 0; i < n; i++) {
        int x;
        cin>>x;
        shops.push_back({x, i});
    }

    sort(shops.begin(), shops.end());

    vector<int> pos(n, 0);
    int left= 0;
    int right = 0;
    long double total = 0;

    for (auto &[w, idx] : shops) {
        if (left <= right) {
            total += left;
            pos[idx] = -left - w;
            left += w;
        } 
        else {
            total += right;
            pos[idx] = right;
            right += w;
        }
    }

    cout<<fixed<<setprecision(5)<< (long double)total / n << endl;
    for (int i = 0; i < n; i++) {
        cout<<pos[i]<<" ";
    }
    return 0;
}
int32_t main(){
    IOS;
    int t=1;
    // cin>>t;
    while(t--)MAIN();
    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED

Test 23

Verdict: ACCEPTED

Test 24

Verdict: ACCEPTED

Test 25

Verdict: ACCEPTED

Test 26

Verdict: ACCEPTED

Test 27

Verdict: ACCEPTED

Test 28

Verdict: ACCEPTED

Test 29

Verdict: ACCEPTED

Test 30

Verdict: ACCEPTED

Test 31

Verdict: ACCEPTED

Test 32

Verdict: ACCEPTED

Test 33

Verdict: ACCEPTED

Test 34

Verdict: ACCEPTED

Test 35

Verdict: ACCEPTED

Test 36

Verdict: ACCEPTED

Test 37

Verdict: ACCEPTED

Test 38

Verdict: ACCEPTED

Test 39

Verdict: ACCEPTED

Test 40

Verdict: ACCEPTED

Test 41

Verdict: ACCEPTED

Test 42

Verdict: ACCEPTED

Test 43

Verdict: ACCEPTED

Test 44

Verdict: ACCEPTED

Test 45

Verdict: ACCEPTED

Test 46

Verdict: ACCEPTED

Test 47

Verdict: ACCEPTED

Test 48

Verdict: ACCEPTED

Test 49

Verdict: ACCEPTED

Test 50

Verdict: ACCEPTED

Test 51

Verdict: ACCEPTED

Test 52

Verdict: ACCEPTED

Test 53

Verdict: ACCEPTED

Test 54

Verdict: ACCEPTED

Test 55

Verdict: ACCEPTED

Test 56

Verdict: ACCEPTED

Test 57

Verdict: ACCEPTED

Test 58

Verdict: ACCEPTED

Test 59

Verdict: ACCEPTED

Test 60

Verdict: ACCEPTED

Test 61

Verdict: ACCEPTED

Test 62

Verdict: ACCEPTED

Test 63

Verdict: ACCEPTED

Test 64

Verdict: ACCEPTED

Test 65

Verdict: ACCEPTED

Test 66

Verdict: ACCEPTED

Test 67

Verdict: ACCEPTED

Test 68

Verdict: ACCEPTED

Test 69

Verdict: ACCEPTED

Test 70

Verdict: ACCEPTED

Test 71

Verdict: ACCEPTED

Test 72

Verdict: ACCEPTED