Submission #6929608


Source Code Expand

using System;
using System.Text;
using System.Linq;
using System.Collections;
using System.Collections.Generic;
using static System.Console;
using static System.Math;

namespace AtCorder
{
    public class Program
    {
        public static void Main(string[] args)
        {
            new Program().Solve(new ConsoleInput(Console.In, ' '));
        }

        public void Solve(ConsoleInput cin)
        {
            var N = cin.ReadInt;
            var M = cin.ReadInt;
            var a = new int[N];
            var b = new int[N];
            var c = new int[M];
            var d = new int[M];
            var ans = new int[N];
            for(int i = 0; i < N; i++)
            {
                a[i] = cin.ReadInt;
                b[i] = cin.ReadInt;
                ans[i] = M - 1;
            }
            for(int i = 0; i < M; i++)
            {
                c[i] = cin.ReadInt;
                d[i] = cin.ReadInt;
            }
            for(int i = 0; i < N; i++)
            {
                for(int j = M - 2; j >= 0; j--)
                {
                    var nowAns = Abs(a[i] - c[ans[i]]) + Abs(b[i] - d[ans[i]]);
                    var dis = Abs(a[i] - c[j]) + Abs(b[i] - d[j]);
                    if(dis <= nowAns)
                    {
                        ans[i] = j;
                    }
                }
            }
            for(int i = 0; i < N; i++)
            {
                WriteLine(ans[i] + 1);
            }
        }


        public class ConsoleInput
        {
            private readonly System.IO.TextReader _stream;
            private char _separator = ' ';
            private Queue<string> inputStream;
            public ConsoleInput(System.IO.TextReader stream, char separator = ' ')
            {
                this._separator = separator;
                this._stream = stream;
                inputStream = new Queue<string>();
            }
            public string Read
            {
                get
                {
                    if (inputStream.Count != 0) return inputStream.Dequeue();
                    string[] tmp = _stream.ReadLine().Split(_separator);
                    for (int i = 0; i < tmp.Length; ++i)
                        inputStream.Enqueue(tmp[i]);
                    return inputStream.Dequeue();
                }
            }
            public string ReadLine { get { return _stream.ReadLine(); } }
            public int ReadInt { get { return int.Parse(Read); } }
            public long ReadLong { get { return long.Parse(Read); } }
            public double ReadDouble { get { return double.Parse(Read); } }
            public string[] ReadStrArray(long N) { var ret = new string[N]; for (long i = 0; i < N; ++i) ret[i] = Read; return ret; }
            public int[] ReadIntArray(long N) { var ret = new int[N]; for (long i = 0; i < N; ++i) ret[i] = ReadInt; return ret; }
            public long[] ReadLongArray(long N) { var ret = new long[N]; for (long i = 0; i < N; ++i) ret[i] = ReadLong; return ret; }
        }
    }
}

Submission Info

Submission Time
Task B - Checkpoints
User Naoki08
Language C# (Mono 4.6.2.0)
Score 200
Code Size 3140 Byte
Status AC
Exec Time 24 ms
Memory 11348 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 23 ms 11348 KB
sample_02.txt AC 23 ms 11220 KB
sample_03.txt AC 22 ms 9172 KB
subtask_1_1.txt AC 23 ms 11220 KB
subtask_1_2.txt AC 24 ms 11220 KB
subtask_1_3.txt AC 23 ms 11220 KB
subtask_1_4.txt AC 22 ms 9172 KB
subtask_1_5.txt AC 23 ms 9172 KB
subtask_1_6.txt AC 23 ms 11220 KB
subtask_1_7.txt AC 23 ms 11220 KB