• 欢迎光临~

# 题目链接

## 1123. 铲雪车

### 输出格式

(−10^6≤x,y≤10^6)

#### 输入样例：

``````0 0
0 0 10000 10000
5000 -10000 5000 10000
5000 10000 10000 10000
``````

#### 输出样例：

``````3:55
``````

• 时间复杂度：(O(m))

## 代码

``````// Problem: 铲雪车
// Contest: AcWing
// URL: https://www.acwing.com/problem/content/1125/
// Memory Limit: 64 MB
// Time Limit: 1000 ms

// %%%Skyqwq
#include <bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define mp make_pair
using namespace std;

typedef long long LL;
typedef pair<int, int> PII;

template <typename T> bool chkMax(T &x, T y) { return (y > x) ? x = y, 1 : 0; }
template <typename T> bool chkMin(T &x, T y) { return (y < x) ? x = y, 1 : 0; }

template <typename T> void inline read(T &x) {
int f = 1; x = 0; char s = getchar();
while (s < '0' || s > '9') { if (s == '-') f = -1; s = getchar(); }
while (s <= '9' && s >= '0') x = x * 10 + (s ^ 48), s = getchar();
x *= f;
}

double res=0,a,b,c,d;
int main()
{
scanf("%*lf%*lf");
while(~scanf("%lf%lf%lf%lf",&a,&b,&c,&d))res+=sqrt((a-c)*(a-c)+(b-d)*(b-d));
res=2*res/1000/20*60;
int ans=int(res+0.5);
printf("%d:%0.2d",ans/60,ans%60);
return 0;
}
``````