Submission #3225888
Source Code Expand
import java.io.IOException; import java.util.NoSuchElementException; import java.io.BufferedReader; import java.io.InputStream; import java.io.InputStreamReader; public class Main { public static void main(String[] args) throws IOException { try ( BufferedReader reader = new BufferedReader( new InputStreamReader(System.in))) { FastScanner fs = new FastScanner(); final int INF = 400000001; final int N = fs.nextInt(); final int M = fs.nextInt(); int[] a = new int[N]; int[] b = new int[N]; int[] c = new int[M]; int[] d = new int[M]; for (int i = 0; i < N; i++) { a[i] = fs.nextInt(); b[i] = fs.nextInt(); } for (int i = 0; i < M; i++) { c[i] = fs.nextInt(); d[i] = fs.nextInt(); } for (int i = 0; i < N; i++) { int ans = 0; int dst = INF; for (int j = 0; j < M; j++) { int x = Math.abs(a[i] - c[j]) + Math.abs(b[i] - d[j]); // 0-indexed if (x < dst) { ans = j + 1; dst = x; } } System.out.println(ans); } } } } class FastScanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; private boolean hasNextByte() { if (ptr < buflen) { return true; } else { ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1; } private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126; } public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte(); } public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while(isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while(true) { if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; } else if(b == -1 || !isPrintableChar(b)) { return minus ? -n : n; } else { throw new NumberFormatException(); } b = readByte(); } } public int nextInt() { long nl = nextLong(); if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException(); return (int) nl; } public double nextDouble() { return Double.parseDouble(next()); } }
Submission Info
Submission Time | |
---|---|
Task | B - Checkpoints |
User | ShinjiSHIBATA |
Language | Java8 (OpenJDK 1.8.0) |
Score | 200 |
Code Size | 3715 Byte |
Status | AC |
Exec Time | 72 ms |
Memory | 22612 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 | 69 ms | 22612 KB |
sample_02.txt | AC | 69 ms | 21076 KB |
sample_03.txt | AC | 70 ms | 18260 KB |
subtask_1_1.txt | AC | 69 ms | 19284 KB |
subtask_1_2.txt | AC | 72 ms | 20692 KB |
subtask_1_3.txt | AC | 70 ms | 20820 KB |
subtask_1_4.txt | AC | 69 ms | 18004 KB |
subtask_1_5.txt | AC | 70 ms | 18004 KB |
subtask_1_6.txt | AC | 69 ms | 19156 KB |
subtask_1_7.txt | AC | 72 ms | 18260 KB |