Submission #277173

---

Source Code Expand

#include <algorithm>
#include <iostream>
#include <sstream>
#include <cstdio>
using namespace std;

int main()
{
  cout.setf(ios::fixed); cout.precision(10);//小数点以下10桁まで表示
  int n;
  string str[30000], tmp="32";
  pair<int, int> p[60000];

  cin >> n;
  for(int i = 0; i < n; i++)
    {
      cin >> str[i];
      int tmp;
      tmp = atoi(str[i].substr(0,4).c_str());
      tmp = tmp/100*60 + tmp%100;
      tmp -= tmp%5;
      p[2*i].first = tmp;
      p[2*i].second = 0;
      tmp = atoi(str[i].substr(5).c_str());
      tmp = tmp/100*60 + tmp%100;
      if(tmp%5 != 0) tmp += 5 - tmp%5;
      p[2*i+1].first = tmp;
      p[2*i+1].second = 1;
      
    }
  sort(p, p+2*n);

  int cnt = 0;
  int start;
  for(int i = 0; i < 2*n; i++)
    {
      if(p[i].second == 0)
	{
	  if(cnt == 0)
	    {
	      start = p[i].first;
	    }
	  cnt++;
	}
      if(p[i].second == 1)
	{
	  cnt--;
	  if(cnt == 0)
	    {
	      printf("%02d%02d-",start/60,start%60);
	      printf("%02d%02d\n",p[i].first/60,p[i].first%60);
	      //	      cout << start/60 << start%60 << "-";
	      //	      cout << p[i].first/60 << p[i].first%60 << endl;
	    }
	}
    }
  
  
  
  
  return 0;
}

Submission Info

Judge Result