Submission #4222722

---

Source Code Expand

#include<string>
#include<stdio.h>
#include<iostream>
#include<iomanip>
#include<ios>
#include<algorithm>
#include<stack>
#include<queue>

using namespace std;

	

	

int main()
{
  	int N;

	cin >> N;

	char Time[9*N]; 
  	int n[N][9];
	int bound[N][2];

	for(int i=0;i<9*N;i++)
	{
  	cin >> Time[i];
	}


	for(int k=0;k<N;k++)
	 {
		for(int j=0;j<9;j++)
		{
 		n[k][j] = Time[9*k+j] - '0';
		
		}


			if(n[k][3]<5)
			{		
			n[k][3] = 0;
			}
			else if(4<n[k][3])
			{
			n[k][3] = 5;
			}
			

			if(n[k][8]<6 and n[k][8]>0)
			{
			n[k][8] = 5;
			}
			else if(n[k][8]==0)
			{
			n[k][8] = 0;
			}
			else if(n[k][7]<5)
			{
			n[k][8] = 0;
			n[k][7] = n[k][7] + 1;
			}
			else if(n[k][6]<9)
			{
			n[k][8] = 0;
			n[k][7] = 0;
			n[k][6] = n[k][6] + 1;
			}
			else
			{
			n[k][8] = 0;
			n[k][7] = 0;
			n[k][6] = 0;
			n[k][5] = n[k][5] + 1;
			}
		
	bound[k][0] = 1000*n[k][0] + 100*n[k][1] + 10*n[k][2] + n[k][3];
	bound[k][1] = 1000*n[k][5] + 100*n[k][6] + 10*n[k][7] + n[k][8];

			
		
 	}
	
	bool q[2401]; 

	for(int l=0;l<2401;l++)
	{
	int determin = 0;
	for(int m=0;determin<1 and m<N;m++)
		{
		int A = bound[m][0];
		int B = bound[m][1];
		if(A<=l and l<=B)
			{
			q[l] = 1;
			determin = 1;
			}
			else if(A>l or B<l)
			{
			q[l] = 0;
			determin = 0;
			}
		}
	}
	
	
	queue<int> result;
	int v = q[0];
	if(v>0)
	{
		result.push(0);
	}

	for(int a=0;a<2400;a++)
	{	
		int u = q[a+1]-q[a];
		if(u==1)
		{
		result.push(a+1);
		}
		else if(u==-1)
		{
		result.push(a);
		}
	}
	
	int w = q[2400];

	if(w>0)
	{
		result.push(2400);
	}
	
	bool r = result.empty();
	
	for(int c;r==0;c++)
	{
		cout << setfill('0') << right << setw(4) << result.front();
		result.pop();
		cout << "-" << setfill('0') << right << setw(4) <<result.front() << endl;
		result.pop();
		r = result.empty();
	}

return 0;

} 

Submission Info

Judge Result