oj.uz

답안 #23665

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
23665 2017-05-18T11:57:37 Z Hiasat 이상적인 도시 (IOI12_city) C++14
23 / 100
 96 ms 8488 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

ll res = 0;
void sum(vector<ll> &x, vector<ll> &preX, ll X) {
	ll idx = lower_bound(x.begin(), x.end(), X) - x.begin();
	if (idx) {
		res += (idx + 1) * X - preX[idx];
	}
	if (idx != preX.size()) {
		res += (preX.back() - (!idx?0:preX[idx - 1])) - 1ll*(preX.size() - idx) * X;
	}
}
vector<ll> preX, preY, x, y;

int DistanceSum(int N, int *X, int *Y) {
	for (int i = 0; i < N; ++i) {
		preX.push_back(X[i]);
		x.push_back(X[i]);
	}
	for (int i = 0; i < N; ++i) {
		preY.push_back(Y[i]);
		y.push_back(Y[i]);
	}
	sort(x.begin(), x.end());
	sort(y.begin(), y.end());
	sort(preX.begin(), preX.end());
	sort(preY.begin(), preY.end());
	for (int i = 1 ; i < preX.size(); ++i) {
		preX[i] += preX[i - 1];
	}
	for (int i = 1 ; i < preY.size(); ++i) {
		preY[i] += preY[i - 1];
	}
	for (int i = 0 ; i < N ; i++) {
		sum(x,preX,X[i]);

		sum(y,preY,Y[i]);
	}
	return (res/2)%1000000000;
}

Compilation message

city.cpp: In function 'void sum(std::vector<long long int>&, std::vector<long long int>&, ll)':
city.cpp:13:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if (idx != preX.size()) {
          ^
city.cpp: In function 'int DistanceSum(int, int*, int*)':
city.cpp:32:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 1 ; i < preX.size(); ++i) {
                     ^
city.cpp:35:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 1 ; i < preY.size(); ++i) {
                     ^

Subtask #1
0 / 11.0

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

Subtask #2
0 / 21.0

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

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 3548 KB Output is correct
2 Correct 13 ms 3548 KB Output is correct
3 Correct 36 ms 5016 KB Output is correct
4 Correct 36 ms 5016 KB Output is correct
5 Correct 79 ms 8488 KB Output is correct
6 Correct 96 ms 8488 KB Output is correct
7 Correct 96 ms 8488 KB Output is correct
8 Correct 89 ms 8488 KB Output is correct
9 Correct 69 ms 8488 KB Output is correct
10 Correct 79 ms 8488 KB Output is correct

Subtask #4
0 / 45.0

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