Submission #1443963


Source Code Expand

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace ConsoleApplication4
{
    class Program
    {
        static void Main(string[] args)
        {
            // 整数の入力
            int N = int.Parse(Console.ReadLine());
            // スペース区切りの整数の入力
            int[][] D = new int[N][];
            int i, j;
            for (i = 0; i < N; i++) D[i] = Console.ReadLine().Split(' ').Select(s => int.Parse(s)).ToArray();
            // 整数の入力
            int Q = int.Parse(Console.ReadLine());
            int[] P = new int[Q];
            for (i = 0; i < Q; i++) P[i] = int.Parse(Console.ReadLine());

            //各個数の最大値と入れる
            int[] max1 = new int[N * N];
            for (i = 0; i < N * N; i++)
            {
                max1[i] = 0;
            }
            int x, y, l, h, val1 = 0, k,q;

            for (x = 0; x < N; x++)
            {
                for (y = 0; y < N; y++)
                {
                    for (l = 1; l < (N - x + 1); l++)
                    {
                        for (h = 1; h < (N - y + 1); h++)
                        {
                            val1 = 0;
                            //for (k = 0; k < l * h; k++)
                            //{
                            //    val1 = val1 + D[x + l - 1][y + h - 1];
                            //}
                            for (k = 0; k < l; k++)
                            {
                                for (q = 0; q < h; q++)
                                {
                                    val1 = val1 + D[x + k][y + q];
                                }
                            }
                            if (val1 > max1[l * h - 1]) max1[l * h - 1] = val1;
                        }
                    }
                }
            }
            for (i = 0; i < Q; i++)
            {
                int max_p = 0;
                for (j = 0; j < P[i]; j++)
                {
                    if (max1[j] > max_p) max_p = max1[j];
                }
                Console.WriteLine(max_p);
            }
        }
    }
}

Submission Info

Submission Time
Task D - おいしいたこ焼きの焼き方
User zitianjp
Language C# (Mono 4.6.2.0)
Score 100
Code Size 2273 Byte
Status AC
Exec Time 995 ms
Memory 13396 KB

Judge Result

Set Name Subtask1 Subtask2
Score / Max Score 50 / 50 50 / 50
Status
AC × 18
AC × 20
Set Name Test Cases
Subtask1 sub0.txt, sub1.txt, sub2.txt, sub_rand_max0.txt, sub_rand_max1.txt, sub_rand_max2.txt, sub_rand_max3.txt, sub_rand_min0.txt, s1.txt, s2.txt, sub0.txt, sub1.txt, sub2.txt, sub_rand_max0.txt, sub_rand_max1.txt, sub_rand_max2.txt, sub_rand_max3.txt, sub_rand_min0.txt
Subtask2 rand0.txt, rand1.txt, rand2.txt, rand3.txt, rand4.txt, rand_max0.txt, rand_max1.txt, rand_max2.txt, rand_max3.txt, rand_max4.txt, s1.txt, s2.txt, sub0.txt, sub1.txt, sub2.txt, sub_rand_max0.txt, sub_rand_max1.txt, sub_rand_max2.txt, sub_rand_max3.txt, sub_rand_min0.txt
Case Name Status Exec Time Memory
rand0.txt AC 406 ms 11348 KB
rand1.txt AC 188 ms 11348 KB
rand2.txt AC 369 ms 13396 KB
rand3.txt AC 56 ms 9300 KB
rand4.txt AC 23 ms 9300 KB
rand_max0.txt AC 993 ms 13364 KB
rand_max1.txt AC 993 ms 11316 KB
rand_max2.txt AC 986 ms 9268 KB
rand_max3.txt AC 986 ms 11316 KB
rand_max4.txt AC 995 ms 13364 KB
s1.txt AC 23 ms 11348 KB
s2.txt AC 23 ms 9300 KB
sub0.txt AC 24 ms 11348 KB
sub1.txt AC 23 ms 9300 KB
sub2.txt AC 24 ms 11348 KB
sub_rand_max0.txt AC 24 ms 13396 KB
sub_rand_max1.txt AC 23 ms 11348 KB
sub_rand_max2.txt AC 24 ms 11348 KB
sub_rand_max3.txt AC 23 ms 11348 KB
sub_rand_min0.txt AC 23 ms 9300 KB