Submission #1548146


Source Code Expand

#include <algorithm>
#include <vector>
#include <cstdio>
using namespace std;

int main(){
	int x1,y1,x2,y2,n,xf=1,yf=1,x,y;
	scanf("%d%d%d%d%d",&x1,&y1,&x2,&y2,&n);
	if(x1>x2)swap(x1,x2),xf=-1;
	if(y1>y2)swap(y1,y2),yf=-1;
	vector<pair<int,int>>v;
	for(int i=0;i<n;i++){
		scanf("%d%d",&x,&y);
		if(x1<=x&&x<=x2 && y1<=y&&y<=y2)v.emplace_back(x*xf,y*yf);
	}
	sort(v.begin(),v.end());
	vector<int>d(v.size(),1<<30);
	for(auto &e:v)n=e.second,*lower_bound(d.begin(),d.end(),n)=n;
	n=lower_bound(d.begin(),d.end(),1<<30)-d.begin();
	printf("%.9f\n",100.0*(x2-x1+y2-y1)-20*n+5*(n+(n>=min(x2-x1,y2-y1)+1))*3.1415926536);
}

Submission Info

Submission Time
Task C - Fountain Walk
User leafmoon
Language C++14 (GCC 5.4.1)
Score 900
Code Size 638 Byte
Status AC
Exec Time 66 ms
Memory 2544 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:8: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:13: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 900 / 900
Status
AC × 3
AC × 47
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 256 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB
subtask_1_01.txt AC 1 ms 256 KB
subtask_1_02.txt AC 1 ms 256 KB
subtask_1_03.txt AC 1 ms 256 KB
subtask_1_04.txt AC 1 ms 256 KB
subtask_1_05.txt AC 1 ms 256 KB
subtask_1_06.txt AC 1 ms 256 KB
subtask_1_07.txt AC 1 ms 256 KB
subtask_1_08.txt AC 1 ms 256 KB
subtask_1_09.txt AC 14 ms 256 KB
subtask_1_10.txt AC 28 ms 256 KB
subtask_1_11.txt AC 8 ms 256 KB
subtask_1_12.txt AC 65 ms 2544 KB
subtask_1_13.txt AC 31 ms 256 KB
subtask_1_14.txt AC 14 ms 256 KB
subtask_1_15.txt AC 7 ms 256 KB
subtask_1_16.txt AC 65 ms 2544 KB
subtask_1_17.txt AC 25 ms 256 KB
subtask_1_18.txt AC 20 ms 256 KB
subtask_1_19.txt AC 20 ms 256 KB
subtask_1_20.txt AC 62 ms 2544 KB
subtask_1_21.txt AC 65 ms 2544 KB
subtask_1_22.txt AC 65 ms 2544 KB
subtask_1_23.txt AC 65 ms 2544 KB
subtask_1_24.txt AC 1 ms 256 KB
subtask_1_25.txt AC 1 ms 256 KB
subtask_1_26.txt AC 1 ms 256 KB
subtask_1_27.txt AC 1 ms 256 KB
subtask_1_28.txt AC 36 ms 384 KB
subtask_1_29.txt AC 39 ms 384 KB
subtask_1_30.txt AC 66 ms 2544 KB
subtask_1_31.txt AC 43 ms 2544 KB
subtask_1_32.txt AC 49 ms 2544 KB
subtask_1_33.txt AC 48 ms 2544 KB
subtask_1_34.txt AC 44 ms 2544 KB
subtask_1_35.txt AC 53 ms 2544 KB
subtask_1_36.txt AC 55 ms 2544 KB
subtask_1_37.txt AC 54 ms 2544 KB
subtask_1_38.txt AC 54 ms 2544 KB
subtask_1_39.txt AC 54 ms 2544 KB
subtask_1_40.txt AC 51 ms 2544 KB
subtask_1_41.txt AC 51 ms 2544 KB