Submission #1981254


Source Code Expand

#include <cmath>
#include <cstdlib>
#include <complex>
#include <iostream>
#include <limits>
#include <vector>


int
main()
{
  std::cin.tie(nullptr);
  std::ios::sync_with_stdio(false);

  int n, m;
  std::cin >> n >> m;

  std::vector<std::pair<int, int>> froms(n);
  for (auto&& e : froms) {
    std::cin >> e.first >> e.second;
  }
  std::vector<std::pair<int, int>> tos(m);
  for (auto&& e : tos) {
    std::cin >> e.first >> e.second;
  }

  std::vector<int> checkPoints;
  checkPoints.reserve(n);
  for (const auto& e : froms) {
    auto min = std::numeric_limits<int>::max();
    auto checkPoint = 0;
    for (decltype(tos)::size_type i = 0; i < tos.size(); i++) {
      auto d = std::abs(e.first - tos[i].first) + std::abs(e.second - tos[i].second);
      if (d < min) {
        min = d;
        checkPoint = static_cast<int>(i);
      }
    }
    checkPoints.push_back(checkPoint + 1);
  }

  for (const auto& e : checkPoints) {
    std::cout << e << std::endl;
  }

  return EXIT_SUCCESS;
}

Submission Info

Submission Time
Task B - Checkpoints
User koturn
Language C++14 (GCC 5.4.1)
Score 200
Code Size 1049 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 10
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_1.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB
subtask_1_1.txt AC 1 ms 256 KB
subtask_1_2.txt AC 1 ms 256 KB
subtask_1_3.txt AC 1 ms 256 KB
subtask_1_4.txt AC 1 ms 256 KB
subtask_1_5.txt AC 1 ms 256 KB
subtask_1_6.txt AC 1 ms 256 KB
subtask_1_7.txt AC 1 ms 256 KB