Submission #172814


Source Code Expand

Copy
<?php
    // タコヤキの最大価値
    $score = 0;
    
    // 縦座標
    $y = 0;
    
	fscanf(STDIN, "%d %d %d\n", $R, $C, $D);
	for ($i = 0; $i < $R; $i++)
	{
	    $arr = explode(" ", trim(fgets(STDIN)));
	    foreach ($arr as $x => $val)
	    {
	        // 距離を計算
	        $dis = $x + $y;
	        
	        if ($dis > $D) 
	        {
	            if ($x == 0)
	            {
        	        // xが0で距離がD以上なら、これ以上の探索は不要(枝刈り)
	                break 2;
	            } else
	            {
        	        // 距離がD以上なら、その右も必然的に届かないので飛ばす(枝刈り)
	                break;
	            }
	        }
	        
	        $number = intval($val);
	        
	        if ($D % 2 == $dis % 2)
	        {
                $score = $score > $number ? $score : $number;
	        }
	    }
	    $y++;
	}
	
	echo $score . PHP_EOL;

Submission Info

Submission Time
Task B - 謎の人物X
User takepan
Language PHP (PHP 5.3.10)
Score 100
Code Size 968 Byte
Status AC
Exec Time 850 ms
Memory 4340 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 77 ms 3752 KB
sample_02.txt AC 48 ms 3816 KB
sample_03.txt AC 47 ms 3804 KB
subtask1_01.txt AC 51 ms 3820 KB
subtask1_02.txt AC 45 ms 3940 KB
subtask1_03.txt AC 48 ms 3808 KB
subtask1_04.txt AC 52 ms 3936 KB
subtask1_05.txt AC 49 ms 3940 KB
subtask1_06.txt AC 52 ms 3932 KB
subtask1_07.txt AC 59 ms 3740 KB
subtask1_08.txt AC 52 ms 3940 KB
subtask1_09.txt AC 51 ms 3936 KB
subtask1_10.txt AC 55 ms 3936 KB
subtask1_11.txt AC 60 ms 3880 KB
subtask1_12.txt AC 61 ms 3936 KB
subtask1_13.txt AC 55 ms 3916 KB
subtask1_14.txt AC 50 ms 3940 KB
subtask1_15.txt AC 55 ms 3940 KB
subtask2_01.txt AC 56 ms 4252 KB
subtask2_02.txt AC 51 ms 3812 KB
subtask2_03.txt AC 260 ms 4128 KB
subtask2_04.txt AC 52 ms 4068 KB
subtask2_05.txt AC 75 ms 4068 KB
subtask2_06.txt AC 167 ms 4200 KB
subtask2_07.txt AC 377 ms 4264 KB
subtask2_08.txt AC 140 ms 4260 KB
subtask2_09.txt AC 473 ms 4256 KB
subtask2_10.txt AC 789 ms 4256 KB
subtask2_11.txt AC 325 ms 4252 KB
subtask2_12.txt AC 104 ms 4264 KB
subtask2_13.txt AC 704 ms 4252 KB
subtask2_14.txt AC 850 ms 4256 KB
subtask2_15.txt AC 701 ms 4340 KB