제출 #999362

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
999362		Katie	Best Place (NOI17_bestplace)	C++17	0 / 100	49 ms	2896 KiB

bestplace

#include <iostream>
#include <vector>
#include <cmath>

struct Point {
  int x, y;
};

int calculateTotalDistance(const Point& eventLocation, const std::vector<Point>& participantLocations) {
  int totalDistance = 0;
  for (const auto& participant : participantLocations) {
    int distance = std::abs(eventLocation.x - participant.x) + std::abs(eventLocation.y - participant.y);
    totalDistance += distance;
  }
  return totalDistance;
}

Point findOptimalLocation(const std::vector<Point>& participantLocations) {
  int minX = participantLocations[0].x;
  int maxX = participantLocations[0].x;
  int minY = participantLocations[0].y;
  int maxY = participantLocations[0].y;

  for (const auto& participant : participantLocations) {
    minX = std::min(minX, participant.x);
    maxX = std::max(maxX, participant.x);
    minY = std::min(minY, participant.y);
    maxY = std::max(maxY, participant.y);
  }

  int optimalX = (minX + maxX) / 2;
  int optimalY = (minY + maxY) / 2;

  return {optimalX, optimalY};
}

int main() {
  int N;
  std::cin >> N;

  std::vector<Point> participantLocations(N);
  for (int i = 0; i < N; i++) {
    std::cin >> participantLocations[i].x >> participantLocations[i].y;
  }

  Point optimalLocation = findOptimalLocation(participantLocations);
  int totalDistance = calculateTotalDistance(optimalLocation, participantLocations);

  std::cout << "Optimal location: (" << optimalLocation.x << ", " << optimalLocation.y << ")" << std::endl;
  std::cout << "Total distance: " << totalDistance << std::endl;

  return 0;
}

• Subtask 1: 0 / 3
• Subtask 2: 0 / 20
• Subtask 3: 0 / 28
• Subtask 4: 0 / 13
• Subtask 5: 0 / 17
• Subtask 6: 0 / 19