Submission #3367722


Source Code Expand

#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
const int MAXN=200005;
#define y1 kuhgahbidlawslgfuhhfiuhs

int N,M,x1,y1,x2,y2;
pair<int,int> P[MAXN];
int dp[MAXN];

int main()
{
	scanf("%d%d%d%d%d",&x1,&y1,&x2,&y2,&N);
	for(int i=1;i<=N;i++)
	{
		int x,y;
		scanf("%d%d",&x,&y);
		if(min(x1,x2)<=x&&x<=max(x1,x2)&&min(y1,y2)<=y&&y<=max(y1,y2))
			P[++M]=make_pair(x,y);
	}
	if(x1>x2)
	{
		swap(x1,x2);
		swap(y1,y2);
	}
	if(y1>y2)
	{
		for(int i=1;i<=M;i++)
			P[i].second=y2+y1-P[i].second;
		swap(y1,y2);
	}
	
	sort(P+1,P+M+1);
	memset(dp,0x3F,sizeof dp);
	dp[0]=-1;
	int lis=0;
	for(int i=1;i<=M;i++)
	{
		int j=upper_bound(dp,dp+M+1,i)-dp;
		dp[j]=min(dp[j],P[i].second);
		lis=max(lis,j);
	}
	double ans=0;
	ans=100.0*(x2-x1+y2-y1)-20.0*lis+5.0*lis*acos(-1);
	if(lis==min(y2-y1+1,x2-x1+1))
		ans+=5.0*acos(-1);
	printf("%.15lf\n",ans);
	
	return 0;
}

Submission Info

Submission Time
Task C - Fountain Walk
User vjudge3
Language C++14 (GCC 5.4.1)
Score 0
Code Size 902 Byte
Status WA
Exec Time 59 ms
Memory 2560 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:15:40: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d%d%d",&x1,&y1,&x2,&y2,&N);
                                        ^
./Main.cpp:19:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&x,&y);
                      ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 900
Status
AC × 3
AC × 20
WA × 27
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_28.txt, subtask_1_29.txt, subtask_1_30.txt, subtask_1_31.txt, subtask_1_32.txt, subtask_1_33.txt, subtask_1_34.txt, subtask_1_35.txt, subtask_1_36.txt, subtask_1_37.txt, subtask_1_38.txt, subtask_1_39.txt, subtask_1_40.txt, subtask_1_41.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 896 KB
sample_02.txt AC 1 ms 896 KB
sample_03.txt AC 1 ms 896 KB
subtask_1_01.txt AC 1 ms 896 KB
subtask_1_02.txt AC 1 ms 896 KB
subtask_1_03.txt AC 1 ms 896 KB
subtask_1_04.txt WA 1 ms 896 KB
subtask_1_05.txt AC 1 ms 896 KB
subtask_1_06.txt AC 1 ms 896 KB
subtask_1_07.txt AC 1 ms 896 KB
subtask_1_08.txt AC 1 ms 896 KB
subtask_1_09.txt AC 14 ms 896 KB
subtask_1_10.txt WA 29 ms 896 KB
subtask_1_11.txt WA 8 ms 896 KB
subtask_1_12.txt WA 57 ms 2560 KB
subtask_1_13.txt AC 31 ms 896 KB
subtask_1_14.txt WA 14 ms 896 KB
subtask_1_15.txt WA 7 ms 896 KB
subtask_1_16.txt WA 59 ms 2560 KB
subtask_1_17.txt AC 25 ms 896 KB
subtask_1_18.txt WA 20 ms 896 KB
subtask_1_19.txt WA 20 ms 896 KB
subtask_1_20.txt WA 56 ms 2560 KB
subtask_1_21.txt WA 57 ms 2432 KB
subtask_1_22.txt WA 59 ms 2560 KB
subtask_1_23.txt WA 57 ms 2560 KB
subtask_1_24.txt AC 1 ms 896 KB
subtask_1_25.txt AC 1 ms 896 KB
subtask_1_26.txt AC 1 ms 896 KB
subtask_1_27.txt AC 1 ms 896 KB
subtask_1_28.txt WA 36 ms 1024 KB
subtask_1_29.txt WA 39 ms 1024 KB
subtask_1_30.txt WA 57 ms 2560 KB
subtask_1_31.txt WA 44 ms 2560 KB
subtask_1_32.txt WA 47 ms 2560 KB
subtask_1_33.txt WA 47 ms 2560 KB
subtask_1_34.txt WA 45 ms 2560 KB
subtask_1_35.txt WA 46 ms 2560 KB
subtask_1_36.txt WA 46 ms 2560 KB
subtask_1_37.txt WA 46 ms 2560 KB
subtask_1_38.txt WA 46 ms 2560 KB
subtask_1_39.txt WA 46 ms 2560 KB
subtask_1_40.txt WA 46 ms 2560 KB
subtask_1_41.txt WA 46 ms 2560 KB