제출 #118427

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
118427		E869120	이상적인 도시 (IOI12_city)	C++14	55 / 100	128 ms	4472 KiB

city

#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;

vector<int>vec[2009]; int dist[2009];

int DistanceSum(int N, int *X, int *Y) {
	if (N <= 2000) {
		for (int i = 0; i < N; i++) {
			for (int j = 0; j < N; j++) {
				if (abs(X[i] - X[j]) + abs(Y[i] - Y[j]) == 1) {
					vec[i].push_back(j);
				}
			}
		}

		long long sum = 0;
		for (int i = 0; i < N; i++) {
			for (int j = 0; j < N; j++) dist[j] = (1 << 30);
			queue<int>Q; Q.push(i); dist[i] = 0;
			while (!Q.empty()) {
				int pos = Q.front(); Q.pop();
				for (int j = 0; j < vec[pos].size(); j++) {
					if (dist[vec[pos][j]] > dist[pos] + 1) {
						dist[vec[pos][j]] = dist[pos] + 1;
						Q.push(vec[pos][j]);
					}
				}
			}
			for (int j = 0; j < N; j++) sum += dist[j];
		}
		return (int)((sum / 2LL) % 1000000000LL);
	}
	else {
		vector<long long>CX, CY;
		for (int i = 0; i < N; i++) CX.push_back(X[i]);
		for (int i = 0; i < N; i++) CY.push_back(Y[i]);
		sort(CX.begin(), CX.end());
		sort(CY.begin(), CY.end());
		long long sum = 0;
		for (int i = 0; i < N; i++) sum += CX[i] * (2LL * i - 1LL * N + 1LL);
		for (int i = 0; i < N; i++) sum += CY[i] * (2LL * i - 1LL * N + 1LL);
		return (int)(sum % 1000000000LL);
	}
}

컴파일 시 표준 에러 (stderr) 메시지

city.cpp: In function 'int DistanceSum(int, int*, int*)':
city.cpp:25:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int j = 0; j < vec[pos].size(); j++) {
                     ~~^~~~~~~~~~~~~~~~~

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