Submission #1304064


Source Code Expand

#include<bits/stdc++.h>
#define INF 2000000000
#define int long long int
#define MOD 1000000007
#define pb push_back
#define cin1(n) (cin >> n)
#define cin2(a,b) (cin >> a >> b)
#define cin3(a,b,c) (cin >> a >> b >> c)
#define cout(n) (cout << n << endl)
#define for_(i,a,b) for(int i=(a);i<(b);++i)
#define fr first 
#define sc second 
#define EPS (1e-10)




using namespace std;

typedef vector<int> vi;
typedef vector< vector<int> > vvi;
typedef vector<pair<int,int>> vpii;
typedef vector<string> vs;
typedef vector<vector<string>> vss;
typedef pair<int,int> pii;

int dx[] = {1,-1,0,0};
int dy[] = {0,0,1,-1};
int n,m;
int a,b;
int p,q;


signed main() {
	cin2(n,m);

	vpii stu(n);
	vpii pnt(m);
	for_(i,0,n) {
		cin2(stu[i].fr,stu[i].sc);	
	}

	for_(i,0,m) {
		cin2(pnt[i].fr,pnt[i].sc);	
	}
	for_(i,0,n) {
		int m = abs(stu[i].fr - pnt[0].fr) + abs(stu[i].sc - pnt[0].sc);
		int mj = 0;
		for_(j,0,m) {
			if (m > abs(stu[i].fr - pnt[j].fr) + abs(stu[i].sc - pnt[j].sc)) {
				m = abs(stu[i].fr - pnt[j].fr) + abs(stu[i].sc - pnt[j].sc);
				mj = j;
			}
		}
		cout(mj + 1);
	}



	return 0;
}



Submission Info

Submission Time
Task B - Checkpoints
User kikuchi0408
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1168 Byte
Status RE
Exec Time 98 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 200
Status
AC × 2
WA × 1
AC × 2
WA × 1
RE × 7
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 WA 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB
subtask_1_1.txt RE 97 ms 256 KB
subtask_1_2.txt RE 98 ms 256 KB
subtask_1_3.txt RE 96 ms 256 KB
subtask_1_4.txt RE 97 ms 256 KB
subtask_1_5.txt RE 96 ms 256 KB
subtask_1_6.txt RE 96 ms 256 KB
subtask_1_7.txt RE 97 ms 256 KB