Submission #1301287
Source Code Expand
import java.util.Scanner; public class Main { public static void main(String[] args) { // TODO 自動生成されたメソッド・スタブ Scanner scan=new Scanner(System.in); int N=scan.nextInt(); int M=scan.nextInt(); int[][] ab = new int[N][2]; int[][] cd = new int[M][2]; for(int i=0;i<N;i++){ ab[i][0]=scan.nextInt(); ab[i][1]=scan.nextInt(); } for(int i=0;i<M;i++){ cd[i][0]=scan.nextInt(); cd[i][1]=scan.nextInt(); } int[] chk = new int[N]; for(int i=0;i<N;i++){ int min = 1000000000; for(int j=0;j<M;j++){ int dis=Math.abs(ab[i][0]-cd[j][0])+Math.abs(ab[i][1]-cd[j][1]); if(dis<min){ min = dis; chk[i]=j+1; } } System.out.println(chk[i]); } } }
Submission Info
Submission Time | |
---|---|
Task | B - Checkpoints |
User | inmir |
Language | Java8 (OpenJDK 1.8.0) |
Score | 200 |
Code Size | 784 Byte |
Status | AC |
Exec Time | 117 ms |
Memory | 21972 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 | 93 ms | 21972 KB |
sample_02.txt | AC | 92 ms | 20564 KB |
sample_03.txt | AC | 93 ms | 21844 KB |
subtask_1_1.txt | AC | 101 ms | 20948 KB |
subtask_1_2.txt | AC | 102 ms | 18772 KB |
subtask_1_3.txt | AC | 99 ms | 21204 KB |
subtask_1_4.txt | AC | 97 ms | 19792 KB |
subtask_1_5.txt | AC | 100 ms | 19924 KB |
subtask_1_6.txt | AC | 100 ms | 19028 KB |
subtask_1_7.txt | AC | 117 ms | 21716 KB |