Submission #1985272


Source Code Expand

#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;

int main()
{
	int n, m, a[50], b[50], c[50], d[50], num;
	cin >> n >> m;
	for (int i = 0; i < n; i++) {
		cin >> a[i] >> b[i];

	}
	for (int j = 0; j < m; j++) {
		cin >> c[j] >> d[j];
	}
	for (int i = 0; i < n; i++) {
		int min = 1000000000;
		for (int j = 0; j < m; j++) {
			int man = abs(a[i] - c[j]) + abs(b[i] - d[j]);
			if (min > man) {
				min = man;
				num = j + 1;
			}
		}
		cout << num << endl;
	}
	return 0;
}

Submission Info

Submission Time
Task B - Checkpoints
User tako_39
Language C++14 (GCC 5.4.1)
Score 200
Code Size 529 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