oj.uz

Submission #803910

# Submission time Handle Problem Language Result Execution time Memory
803910 2023-08-03T06:32:03 Z Dan4Life Ideal city (IOI12_city) C++17
0 / 100
 5 ms 472 KB 
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000000;

int DistanceSum(int N, int *X, int *Y) {
    int ans = 0, tot = 0;
    sort(X,X+N), sort(Y,Y+N);
    for(int i = 0; i < N; i++){
        ans+=(1ll*X[i]*i-tot+MOD)%MOD;
        tot+=X[i], tot%=MOD;
    }
    tot = 0;
    for(int i = 0; i < N; i++){
        swap(X[i],Y[i]);
        ans+=(1ll*X[i]*i-tot+MOD)%MOD;
        tot+=X[i], tot%=MOD;
        swap(X[i],Y[i]);
    }
    return ans;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 468 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 472 KB Output isn't correct
2 Halted 0 ms 0 KB -