Submission #2291727
Source Code Expand
#include<cstdio>
#include<cmath>
#include<algorithm>
int a[200001],b[200001],Sx,Sy,Tx,Ty,n,p[200001],top,stk[200001],f[200001],ans;
bool ok=1;
double res;
bool cmp(int x,int y){return a[x]<a[y];}
int Max(int x,int y){return x>y?x:y;}
int Min(int x,int y){return x<y?x:y;}
int main(){
scanf("%d%d%d%d",&Sx,&Sy,&Tx,&Ty);
scanf("%d",&n);
for(int i=1;i<=n;++i)scanf("%d%d",a+i,b+i),p[i]=i;
if(Sx>Tx){
for(int i=1;i<=n;++i)a[i]=100000000-a[i];
Sx=100000000-Sx;Tx=100000000-Tx;}
if(Sy>Ty){
for(int i=1;i<=n;++i)b[i]=100000000-b[i];
Sx=100000000-Sx;Tx=100000000-Tx;}
std::sort(p+1,p+n+1,cmp);
for(int i=1;i<=n;++i)if(a[p[i]]>=Sx&&b[p[i]]>=Sy&&a[p[i]]<=Tx&&b[p[i]]<=Ty){
int t=b[p[i]],k=0;
while(top&&b[p[stk[top]]]<t)k=Max(k,f[p[stk[top--]]]);
stk[++top]=i;
f[p[i]]=k+1;ans=Max(ans,k+1);
if(a[p[i]]>Sx&&a[p[i]]<=Tx&&b[p[i]]>Sy&&b[p[i]]<=Ty)if(a[p[i]]!=a[p[i-1]]+1||b[p[i]]!=b[p[i-1]]+1)ok=0;
}
res=(Tx+Ty-Sx-Sy)*100.0;
res+=acos(-1)*5*ans-20.0*ans;
if(Min(Tx-Sx,Ty-Sy)+1==ans&&ok)res+=acos(-1)*5;
printf("%.15lf",res);
return 0;
}
Submission Info
Submission Time |
|
Task |
C - Fountain Walk |
User |
luogu_bot2 |
Language |
C++ (GCC 5.4.1) |
Score |
0 |
Code Size |
1086 Byte |
Status |
WA |
Exec Time |
67 ms |
Memory |
4096 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:11:35: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d%d",&Sx,&Sy,&Tx,&Ty);
^
./Main.cpp:12:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&n);
^
./Main.cpp:13:51: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
for(int i=1;i<=n;++i)scanf("%d%d",a+i,b+i),p[i]=i;
^
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
0 / 900 |
Status |
|
|
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 |
128 KB |
sample_02.txt |
WA |
1 ms |
128 KB |
sample_03.txt |
AC |
1 ms |
128 KB |
subtask_1_01.txt |
AC |
1 ms |
128 KB |
subtask_1_02.txt |
WA |
1 ms |
128 KB |
subtask_1_03.txt |
WA |
1 ms |
128 KB |
subtask_1_04.txt |
WA |
1 ms |
128 KB |
subtask_1_05.txt |
AC |
1 ms |
128 KB |
subtask_1_06.txt |
AC |
1 ms |
128 KB |
subtask_1_07.txt |
WA |
1 ms |
128 KB |
subtask_1_08.txt |
WA |
1 ms |
128 KB |
subtask_1_09.txt |
AC |
21 ms |
1024 KB |
subtask_1_10.txt |
WA |
45 ms |
1920 KB |
subtask_1_11.txt |
WA |
11 ms |
768 KB |
subtask_1_12.txt |
WA |
65 ms |
3328 KB |
subtask_1_13.txt |
AC |
49 ms |
2048 KB |
subtask_1_14.txt |
WA |
22 ms |
1024 KB |
subtask_1_15.txt |
WA |
10 ms |
640 KB |
subtask_1_16.txt |
WA |
63 ms |
2560 KB |
subtask_1_17.txt |
WA |
40 ms |
1664 KB |
subtask_1_18.txt |
WA |
30 ms |
1408 KB |
subtask_1_19.txt |
WA |
30 ms |
1280 KB |
subtask_1_20.txt |
AC |
63 ms |
3328 KB |
subtask_1_21.txt |
AC |
65 ms |
3328 KB |
subtask_1_22.txt |
WA |
62 ms |
2560 KB |
subtask_1_23.txt |
WA |
65 ms |
3328 KB |
subtask_1_24.txt |
AC |
1 ms |
128 KB |
subtask_1_25.txt |
AC |
1 ms |
128 KB |
subtask_1_26.txt |
AC |
1 ms |
128 KB |
subtask_1_27.txt |
AC |
1 ms |
128 KB |
subtask_1_28.txt |
WA |
59 ms |
2560 KB |
subtask_1_29.txt |
WA |
63 ms |
3328 KB |
subtask_1_30.txt |
WA |
67 ms |
3328 KB |
subtask_1_31.txt |
AC |
45 ms |
4096 KB |
subtask_1_32.txt |
AC |
45 ms |
3328 KB |
subtask_1_33.txt |
AC |
45 ms |
3328 KB |
subtask_1_34.txt |
AC |
45 ms |
3328 KB |
subtask_1_35.txt |
AC |
49 ms |
3328 KB |
subtask_1_36.txt |
WA |
51 ms |
3328 KB |
subtask_1_37.txt |
AC |
49 ms |
3328 KB |
subtask_1_38.txt |
AC |
49 ms |
3328 KB |
subtask_1_39.txt |
AC |
49 ms |
3328 KB |
subtask_1_40.txt |
AC |
49 ms |
3712 KB |
subtask_1_41.txt |
AC |
49 ms |
3712 KB |