Submission #171536


Source Code Expand

Copy
using System;
using System.IO;
using System.Text;
using System.Linq;
using System.Collections.Generic;

class Program
{
    void Solve()
    {
        int H = reader.Int(), W = reader.Int(), D = reader.Int();
        var grid = reader.IntGrid(H);
        int ans = -1;

        for (int i = 0; i < H; i++)
            for (int j = 0; j < W; j++)
                if (i + j <= D && (i + j) % 2 == D % 2)
                    ans = Math.Max(ans, grid[i][j]);

        Console.WriteLine(ans);
        Console.ReadLine();
    }



    static void Main() { new Program().Solve(); }
    static Reader reader = new Reader(Console.In);

    class Reader
    {
        private readonly TextReader reader;
        private readonly char[] separator = new char[] { ' ' };
        private string[] s = new string[0];
        private int i;
        public Reader(TextReader r) { reader = r; }
        public bool HasNext() { return Enqueue(); }
        public string String() { return Dequeue(); }
        public int Int() { return int.Parse(Dequeue()); }
        public long Long() { return long.Parse(Dequeue()); }
        public double Double() { return double.Parse(Dequeue()); }
        public int[] IntArray() { return Array.ConvertAll(Line().Split(), int.Parse); }
        public int[][] IntGrid(int H) { return Enumerable.Range(0, H).Select(i => IntArray()).ToArray(); }
        public string[] StringArray(int N) { return Enumerable.Range(0, N).Select(i => Line()).ToArray(); }
        public string Line() { return reader.ReadLine().Trim(); }
        private bool Enqueue()
        {
            if (i < s.Length) return true;
            string line = reader.ReadLine();
            if (string.IsNullOrEmpty(line)) return false;
            s = line.Split(separator, StringSplitOptions.RemoveEmptyEntries);
            i = 0;
            return true;
        }
        private string Dequeue() { Enqueue(); return s[i++]; }
    }
}

Submission Info

Submission Time
Task B - 謎の人物X
User eitaho
Language C# (Mono 2.10.8.1)
Score 100
Code Size 1981 Byte
Status AC
Exec Time 1391 ms
Memory 14988 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 60 / 60 40 / 40
Status
AC × 3
AC × 18
AC × 30
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
Subtask1 sample_01.txt, sample_02.txt, sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt
Subtask2 subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt
Case Name Status Exec Time Memory
sample_01.txt AC 222 ms 8840 KB
sample_02.txt AC 155 ms 8784 KB
sample_03.txt AC 168 ms 8780 KB
subtask1_01.txt AC 157 ms 8784 KB
subtask1_02.txt AC 161 ms 8728 KB
subtask1_03.txt AC 168 ms 8776 KB
subtask1_04.txt AC 169 ms 8912 KB
subtask1_05.txt AC 165 ms 8780 KB
subtask1_06.txt AC 160 ms 8956 KB
subtask1_07.txt AC 170 ms 8912 KB
subtask1_08.txt AC 168 ms 8980 KB
subtask1_09.txt AC 168 ms 8912 KB
subtask1_10.txt AC 172 ms 8892 KB
subtask1_11.txt AC 168 ms 8916 KB
subtask1_12.txt AC 171 ms 8912 KB
subtask1_13.txt AC 165 ms 8916 KB
subtask1_14.txt AC 165 ms 8912 KB
subtask1_15.txt AC 170 ms 8912 KB
subtask2_01.txt AC 166 ms 8788 KB
subtask2_02.txt AC 167 ms 8912 KB
subtask2_03.txt AC 425 ms 11668 KB
subtask2_04.txt AC 165 ms 8912 KB
subtask2_05.txt AC 199 ms 9168 KB
subtask2_06.txt AC 295 ms 10312 KB
subtask2_07.txt AC 510 ms 14868 KB
subtask2_08.txt AC 995 ms 14740 KB
subtask2_09.txt AC 1391 ms 14864 KB
subtask2_10.txt AC 950 ms 14732 KB
subtask2_11.txt AC 799 ms 14860 KB
subtask2_12.txt AC 946 ms 14988 KB
subtask2_13.txt AC 1011 ms 14860 KB
subtask2_14.txt AC 1043 ms 14860 KB
subtask2_15.txt AC 971 ms 14860 KB