oj.uz

답안 #761890

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
761890 2023-06-20T11:01:09 Z Sohsoh84 이상적인 도시 (IOI12_city) C++17
23 / 100
 26 ms 1716 KB 
#include <bits/stdc++.h>

using namespace std;

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

#define X		first
#define Y		second

const ll MAXN = 1e6 + 10;
const ll MOD = 1000000000;

int n;
vector<pll> vec;

int DistanceSum(int N, int *X, int *Y) {
	n = N;
	sort(X, X + n);
	sort(Y, Y + n);

	ll ps = 0, ans = 0;
	for (int i = 0; i < n; i++) {
		ans = (ans + (1ll * i * X[i] - ps + MOD)) % MOD;
		ps = ps + X[i] % MOD;
	}

	ps = 0;
	for (int i = 0; i < n; i++) {
		ans = (ans + (1ll * i * Y[i] - ps + MOD)) % MOD;
		ps = ps + Y[i] % MOD;
	}

	return ans % MOD;
}

Subtask #1
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 308 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 560 KB Output is correct
2 Correct 4 ms 552 KB Output is correct
3 Correct 11 ms 1096 KB Output is correct
4 Correct 11 ms 1068 KB Output is correct
5 Correct 23 ms 1652 KB Output is correct
6 Correct 26 ms 1696 KB Output is correct
7 Correct 22 ms 1716 KB Output is correct
8 Correct 21 ms 1700 KB Output is correct
9 Correct 22 ms 1652 KB Output is correct
10 Correct 21 ms 1696 KB Output is correct

Subtask #4
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 596 KB Output isn't correct
2 Halted 0 ms 0 KB -