Submission #58710377

---

Source Code Expand

#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e6;
int n;
double sum=0;
struct node{
	int x,y;
}a[N];
double dst(int x,int xx,int y,int yy){
	return sqrt((x-xx)*(x-xx)+(y-yy)*(y-yy));
}
signed main()
{
	cin>>n;
	sum+=dst(0,a[1].x,0,a[1].y);
	for(int i=1;i<=n;i++){
		cin>>a[i].x>>a[i].y;
		sum+=dst(a[i].x,a[i-1].x,a[i].y,a[i-1].y);
	}
	sum+=dst(0,a[n].x,0,a[n].y);
	printf("%.7lf\n",sum);
	return 0;
}

Submission Info

Judge Result