Submission #505256

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<functional>
#include<string>
#include<cstring>
#include<cmath>
#include<set>
#include<map>
#include<sstream>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
string input;
string in1,in2;
int in11,in22;
bool b;
string out1,out2;
bool tim[1441];
int n;
int cnt(string s)
{
	int tmp=0;
	for(int i=0;i<2;i++)
	{
		if(s[i]!=0)
		{
			tmp+=(s[i]-'0')*60*pow(10,1-i);
		}
	}
	for(int i=2;i<4;i++)
	{
		if(s[i]!=0)
		{
			tmp+=(s[i]-'0')*pow(10,3-i);
		}
		else
		{
			tmp+=pow(10,3-i);
		}
	}
	return tmp;
}
string rcnt(int i)
{
	string s;
	if(i<10)
	{
		stringstream ss;
		ss<<"000"<<i;
		return ss.str();
	}
	else if(i<60)
	{
		stringstream ss;
		ss<<"00"<<i;
		return ss.str();
	}
	else if(i<600)
	{
		int h,m;
		h=i/60;
		m=i-h*60;
		if(m<10)
		{
			stringstream ss;
			ss<<"0"<<h<<"0"<<m;
			return ss.str();
		}
		else
		{
			stringstream ss;
			ss<<"0"<<h<<m;
			return ss.str();
		}
	}
	else
	{
		int h,m;
		h=i/60;
		m=i-h*60;
		stringstream ss;
		if(m>=10)
		{
			ss<<h<<m;
			return ss.str();
		}
		else
		{
			ss<<h<<"0"<<m;
			return ss.str();
		}
	}
}
string henkan1(string s)
{
	if(s[3]=='0')return s;
	else if(s[3]=='5')return s;
	else if(s[3]-'0'<5)
	{
		s.replace(3,1,"5");
	}
	else if(s[3]-'0'<=9)
	{
	//	else
		{
			int t=(s[2]-'0');
			t++;
			stringstream ss;
			ss<<t;
			s.replace(2,1,ss.str());
			s.replace(3,1,"0");
		}
	}
	return s;
}
string henkan2(string s)
{
	if(s[3]=='0')return s;
	else if(s[3]=='5')return s;
	else if(s[3]-'0'>5)
	{
		s.replace(3,1,"5");
	}
	else if(s[3]-'0'>=1)
	{
	//	else
		{
			s.replace(3,1,"0");
		}
	}
	return s;
}
int main()
{
	cin>>n;
	vector<P> s;
	for(int i=0;i<1441;i++)
	{
		tim[i]=false;
	}
	while(n--)
	{
		cin>>input;
		in1=input.substr(0,4);
		in2=input.substr(5);
		//cout<<in1<<" "<<in2<<endl;
		in1=henkan2(in1);
		in2=henkan1(in2);
		//cout<<in1<<" "<<in2<<endl;
		in11=cnt(in1);
		in22=cnt(in2);
		//cout<<in11<<" "<<in22<<endl;
		s.push_back(P(in11,in22));
	}
	sort(s.begin(),s.end());
	for(int i=0;i<s.size();i++)
	{
		b=false;
		for(int j=0;j<1441;j++)
		{
			if(s[i].first==j||b)
			{
				tim[j]=true;
				b=true;
			}
			if(s[i].second==j+1)
			{
				//b=false;
				//tim[j+1]=false;
				break;
			}
		}
	}
	b=false;
	for(int i=0;i<1441;i++)
	{
		if(tim[i]==true&&!b)
		{
			cout<<rcnt(i)<<"-";
			b=true;
		}
		else if(tim[i]==false&&b)
		{
			cout<<rcnt(i)<<endl;
			b=false;
		}
	}
	return 0;
}

Submission Info

Judge Result