K13443 [饭卡(card)](答案)

#include <iostream>
#include <cstdio>
using namespace std;
double d[1005];
int main(){
	double n,m,e=0,sum=0,cnt=0;
	cin>>n>>m;
	double f=m,f1=m,f3=m;
	string w;
	for(int i=1;i<=n;i++){
		int a1,b1,c1,a2,b2,c2;
		char a,b,c;
		cin>>a1>>a>>b1>>b>>c1;
		cin>>a2>>c>>b2;
		cin>>d[i];
		sum+=f1-d[i];
		f1=d[i];
	}
	for(int i=1;i<=n;i++){
		if(f-d[i]>=20){
			w="Yes";
			e++;
			break;
		}
		f=d[i];
	}
	if(e==0){
		cout<<"No"<<endl;
		w="No";
	}
	else{
		cout<<w<<endl;
	}
	if(w=="No"){
		printf("%.1lf",sum/n);
	}
	f=m;
	for(int i=1;i<=n;i++){
		if(w=="Yes"){
			if(f-d[i]>=20){
				printf("%.1lf\n",f-d[i]);
			}
			cnt++;
		}
		f=d[i];
	}
	return 0;
}