Submission #1129872


Source Code Expand

#include<stdio.h>
#include<math.h>
#define EPS 1e-10

int x[1000], y[1000];

double distance(int x1, int y1, int x2, int y2) {
	double res=0;
	res = sqrt((double)(x2-x1)*(x2-x1)+(double)(y2-y1)*(y2-y1));

	return res;
}

int main(void)
{
	int tx1, ty1, tx2, ty2, T, V;
	int n;
	int i;
	double res = 0;
	int flag=0;

	scanf("%d %d %d %d %d %d",&tx1,&ty1,&tx2,&ty2,&T,&V);
	scanf("%d",&n);
	for (i = 0; i < n; i++) 
		scanf("%d %d",&x[i],&y[i]);

	for (i = 0; i < n; i++) {
		res += distance(tx1,ty1,x[i],y[i]);
		res += distance(tx2, ty2, x[i], y[i]);
		if (res <= (double)T*V + EPS) {
			flag = 1;
			break;
		}
		res = 0;
	}
	
	if (flag)printf("YES\n");
	else printf("NO\n");

	return 0;
}

Submission Info

Submission Time
Task C - 浮気調査
User jj
Language C (GCC 5.4.1)
Score 100
Code Size 730 Byte
Status AC
Exec Time 1 ms
Memory 128 KB

Compile Error

./Main.c: In function ‘main’:
./Main.c:22:2: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d %d %d %d %d",&tx1,&ty1,&tx2,&ty2,&T,&V);
  ^
./Main.c:23:2: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ^
./Main.c:25:3: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d",&x[i],&y[i]);
   ^

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 35
Set Name Test Cases
All sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 128 KB
sample_02.txt AC 1 ms 128 KB
sample_03.txt AC 1 ms 128 KB
sample_04.txt AC 1 ms 128 KB
test_01.txt AC 1 ms 128 KB
test_02.txt AC 1 ms 128 KB
test_03.txt AC 1 ms 128 KB
test_04.txt AC 1 ms 128 KB
test_05.txt AC 1 ms 128 KB
test_06.txt AC 1 ms 128 KB
test_07.txt AC 1 ms 128 KB
test_08.txt AC 1 ms 128 KB
test_09.txt AC 1 ms 128 KB
test_10.txt AC 1 ms 128 KB
test_11.txt AC 1 ms 128 KB
test_12.txt AC 1 ms 128 KB
test_13.txt AC 1 ms 128 KB
test_14.txt AC 1 ms 128 KB
test_15.txt AC 1 ms 128 KB
test_16.txt AC 1 ms 128 KB
test_17.txt AC 1 ms 128 KB
test_18.txt AC 1 ms 128 KB
test_19.txt AC 1 ms 128 KB
test_20.txt AC 1 ms 128 KB
test_21.txt AC 1 ms 128 KB
test_22.txt AC 1 ms 128 KB
test_23.txt AC 1 ms 128 KB
test_24.txt AC 1 ms 128 KB
test_25.txt AC 1 ms 128 KB
test_26.txt AC 1 ms 128 KB
test_27.txt AC 1 ms 128 KB
test_28.txt AC 1 ms 128 KB
test_29.txt AC 1 ms 128 KB
test_30.txt AC 1 ms 128 KB
test_31.txt AC 1 ms 128 KB