Submission #1444489
Source Code Expand
#include<iostream> #include<vector> #include<algorithm> #include<string> #include<cstdlib> #include <cmath> #define MAX 1000000000000000000LL using namespace std; int main(){ int n,m; cin>>n>>m; int a[51],b[51]; for(int i=0; i<n; i++){ cin>>a[i]>>b[i]; } int x[105],y[105]; for(int j=0; j<m; j++){ cin>>x[j]>>y[j]; } for(int i=0; i<n; i++){ long long min=MAX; int key=0; for(int j=0; j<m; j++){ if(abs(a[i]-x[j])+abs(b[i]-y[j])<min){ min=abs(a[i]-x[j])+abs(b[i]-y[j]); key=j+1; } } cout<<key<<endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Checkpoints |
User | birdway |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 703 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
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 |