Submission #1543043


Source Code Expand

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
vector<pair<int,int > >tochki;
int main(){
int x1,y1,x2,y2,n,a=0,b=0;
unsigned long long otg=0;
long long pi=31415926535897;
cin>>x1>>y1>>x2>>y2>>n;
if(x1>x2)swap(x1,x2);
if(y1>y2)swap(y1,y2);
for(int i=0;i<n;i++){
    cin>>a>>b;
    if(x1<=a and a<=x2 and y1<=b and b<=y2){
        tochki.push_back(make_pair(a,b));
    }
}
otg=abs(x1-x2)+abs(y1-y2);
otg*=100;
sort(tochki.begin(),tochki.end());

b=1;
a=1;
for(int i=1;i<tochki.size();i++){
if(tochki[i-1].second>tochki[i].second){
    b=max(b,a);
    a=1;
}else{
    if(tochki[i-1].first!=tochki[i].first){
a++;

}
}

}

 b=max(b,a);
 if(x1==x2 or y1==y2){
    b=tochki.size();
    if(b==0){
        cout<<otg<<"."<<"000000000000000"<<"\n";
    }else{
    otg-=b*20;
    otg*=10000000000000;
    otg+=b*10*pi;
    a=otg/10000000000000;
otg-=a*10000000000000;
cout<<a<<"."<<otg<<"\n";
    }
 }else{
 if(tochki.size()!=0){
otg-=b*20;
otg*=10000000000000;
otg+=b*5*pi;
a=otg/10000000000000;
otg-=a*10000000000000;

cout<<a<<"."<<otg<<"\n";
}else{
cout<<otg<<"."<<"000000000000000"<<"\n";
}
 }
return 0;
}

Submission Info

Submission Time
Task C - Fountain Walk
User bgspartanetsa
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1196 Byte
Status WA
Exec Time 210 ms
Memory 2420 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 900
Status
AC × 3
AC × 18
WA × 29
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 WA 68 ms 256 KB
subtask_1_10.txt WA 139 ms 256 KB
subtask_1_11.txt WA 37 ms 256 KB
subtask_1_12.txt WA 208 ms 2420 KB
subtask_1_13.txt WA 150 ms 256 KB
subtask_1_14.txt WA 70 ms 256 KB
subtask_1_15.txt WA 34 ms 256 KB
subtask_1_16.txt WA 210 ms 2420 KB
subtask_1_17.txt WA 122 ms 256 KB
subtask_1_18.txt WA 97 ms 256 KB
subtask_1_19.txt WA 93 ms 256 KB
subtask_1_20.txt WA 193 ms 2420 KB
subtask_1_21.txt WA 207 ms 2420 KB
subtask_1_22.txt WA 210 ms 2420 KB
subtask_1_23.txt WA 207 ms 2420 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 WA 153 ms 384 KB
subtask_1_29.txt WA 190 ms 384 KB
subtask_1_30.txt WA 210 ms 2420 KB
subtask_1_31.txt WA 155 ms 2420 KB
subtask_1_32.txt WA 156 ms 2420 KB
subtask_1_33.txt WA 154 ms 2420 KB
subtask_1_34.txt WA 157 ms 2420 KB
subtask_1_35.txt WA 195 ms 2420 KB
subtask_1_36.txt WA 196 ms 2420 KB
subtask_1_37.txt WA 199 ms 2420 KB
subtask_1_38.txt WA 196 ms 2420 KB
subtask_1_39.txt WA 199 ms 2420 KB
subtask_1_40.txt WA 195 ms 2420 KB
subtask_1_41.txt WA 199 ms 2420 KB