제출 #382739

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
382739		ParsaAlizadeh	Ideal city (IOI12_city)	C++17	23 / 100	33 ms	2028 KiB

city

#include <bits/stdc++.h>
using namespace std;

typedef long long       ll;
typedef pair<ll, ll>    pll;
typedef pair<int, int>  pii;

#define all(x)          x.begin(), x.end()
#define kill(x)         return cout << x << endl, 0
#define endl            '\n'

constexpr ll pw(ll a, ll b, ll mod) {
    return (!b    ? 1 :
            b & 1 ? a * pw(a * a % mod, b / 2, mod) % mod :
                    pw(a * a % mod, b / 2, mod));
}

constexpr int N   = 1e5 + 10;
constexpr int MOD = 1e9;

ll ans;

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

• Subtask 1: 0 / 11
• Subtask 2: 0 / 21
• Subtask 3: 23 / 23
• Subtask 4: 0 / 45