Submission #171735


Source Code Expand

Copy
#include <stdio.h>

#define MAX_LENGTH 2000

int A[MAX_LENGTH][MAX_LENGTH];
int f(int dist);

int main(){
	int R,C,D,i,j,max=0,temp;

	scanf("%d %d %d",&R,&C,&D);

	for(i = 0 ; i<R ; i++){
		for(j = 0 ; j<C ; j++){
			scanf("%d ",&A[j][i]);
		}
	}

	for(i = D ; i>=0 ; i-=2){
		temp = f(i);
		if(temp > max){
			max = temp;
		}
	}

	printf("%d\n",max);

	return 0;
}

int f(int dist){
	int m = 0,t,i;
	for(i = 0 ; i<=dist ; i++){
		t = A[dist-i][i];
		if( t > m ){
			m = t;
		}
	}

	return m;
}

Submission Info

Submission Time
Task B - 謎の人物X
User NKudryavka
Language C (GCC 4.6.4)
Score 100
Code Size 535 Byte
Status AC
Exec Time 240 ms
Memory 8544 KB

Compile Error

./Main.c: In function ‘main’:
./Main.c:11:7: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
./Main.c:15:9: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]

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 19 ms 788 KB
sample_02.txt AC 22 ms 796 KB
sample_03.txt AC 26 ms 636 KB
subtask1_01.txt AC 21 ms 788 KB
subtask1_02.txt AC 23 ms 1172 KB
subtask1_03.txt AC 22 ms 736 KB
subtask1_04.txt AC 24 ms 1168 KB
subtask1_05.txt AC 23 ms 1168 KB
subtask1_06.txt AC 22 ms 1048 KB
subtask1_07.txt AC 26 ms 1068 KB
subtask1_08.txt AC 21 ms 1176 KB
subtask1_09.txt AC 25 ms 1236 KB
subtask1_10.txt AC 23 ms 1172 KB
subtask1_11.txt AC 24 ms 1112 KB
subtask1_12.txt AC 24 ms 1128 KB
subtask1_13.txt AC 27 ms 1176 KB
subtask1_14.txt AC 24 ms 1240 KB
subtask1_15.txt AC 24 ms 1160 KB
subtask2_01.txt AC 28 ms 4696 KB
subtask2_02.txt AC 24 ms 792 KB
subtask2_03.txt AC 77 ms 4708 KB
subtask2_04.txt AC 28 ms 2840 KB
subtask2_05.txt AC 34 ms 2444 KB
subtask2_06.txt AC 70 ms 4152 KB
subtask2_07.txt AC 167 ms 8544 KB
subtask2_08.txt AC 224 ms 8468 KB
subtask2_09.txt AC 226 ms 8472 KB
subtask2_10.txt AC 240 ms 8476 KB
subtask2_11.txt AC 192 ms 8480 KB
subtask2_12.txt AC 216 ms 8456 KB
subtask2_13.txt AC 231 ms 8480 KB
subtask2_14.txt AC 226 ms 8468 KB
subtask2_15.txt AC 230 ms 8472 KB