Submission #559383


Source Code Expand

#include <stdio.h>

int main()
{
	int N, M, X, Y, a[100002], b[100002], i, j = 1, k = 0, time = 0;
	
	scanf("%d %d", &N, &M);
	scanf("%d %d", &X, &Y);
	
	for (i = 1; i <= N; i++) {
		scanf("%d", &a[i]);
	}
	for (i = 1; i <= M; i++) {
		scanf("%d", &b[i]);
	}
	
	i = 1;
	
	while (1) {
		while (a[i] < time)
			i++;
		
		time += (a[i] - time) + X;
		
		if (b[M] < time)
			break;
		
		while (b[j] < time)
			j++;
		
		time += (b[j] - time) + Y;
		
		k++;
	}
	
	printf("%d\n", k);
	
	return 0;
}

Submission Info

Submission Time
Task C - 飛行機乗り
User abcdefg
Language C (GCC 4.9.2)
Score 30
Code Size 530 Byte
Status WA
Exec Time 64 ms
Memory 1444 KiB

Compile Error

./Main.c: In function ‘main’:
./Main.c:7:2: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &N, &M);
  ^
./Main.c:8:2: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &X, &Y);
  ^
./Main.c:11:3: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &a[i]);
   ^
./Main.c:14:3: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &b[i]);
   ^

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 30 / 30 0 / 70
Status
AC × 3
AC × 18
AC × 32
WA × 1
Set Name Test Cases
Sample subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt
Subtask1 subtask0_0.txt, subtask0_1.txt, subtask0_10.txt, subtask0_11.txt, subtask0_12.txt, subtask0_13.txt, subtask0_14.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt, subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt
All subtask0_0.txt, subtask0_1.txt, subtask0_10.txt, subtask0_11.txt, subtask0_12.txt, subtask0_13.txt, subtask0_14.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt, subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt
Case Name Status Exec Time Memory
subtask0_0.txt AC 56 ms 1432 KiB
subtask0_1.txt AC 47 ms 1164 KiB
subtask0_10.txt AC 48 ms 1192 KiB
subtask0_11.txt AC 50 ms 1308 KiB
subtask0_12.txt AC 53 ms 1368 KiB
subtask0_13.txt AC 45 ms 1184 KiB
subtask0_14.txt AC 51 ms 1240 KiB
subtask0_2.txt AC 48 ms 1172 KiB
subtask0_3.txt AC 49 ms 1188 KiB
subtask0_4.txt AC 48 ms 1188 KiB
subtask0_5.txt AC 40 ms 1052 KiB
subtask0_6.txt AC 56 ms 1368 KiB
subtask0_7.txt AC 50 ms 1312 KiB
subtask0_8.txt AC 41 ms 1060 KiB
subtask0_9.txt AC 58 ms 1444 KiB
subtask0_sample_01.txt AC 27 ms 792 KiB
subtask0_sample_02.txt AC 24 ms 704 KiB
subtask0_sample_03.txt AC 24 ms 804 KiB
subtask1_0.txt AC 63 ms 1316 KiB
subtask1_1.txt WA 60 ms 1312 KiB
subtask1_10.txt AC 49 ms 1056 KiB
subtask1_11.txt AC 59 ms 1316 KiB
subtask1_12.txt AC 63 ms 1316 KiB
subtask1_13.txt AC 64 ms 1316 KiB
subtask1_14.txt AC 55 ms 1188 KiB
subtask1_2.txt AC 61 ms 1316 KiB
subtask1_3.txt AC 56 ms 1196 KiB
subtask1_4.txt AC 60 ms 1324 KiB
subtask1_5.txt AC 59 ms 1316 KiB
subtask1_6.txt AC 60 ms 1324 KiB
subtask1_7.txt AC 57 ms 1312 KiB
subtask1_8.txt AC 59 ms 1320 KiB
subtask1_9.txt AC 64 ms 1376 KiB