Submission #6977969

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;

#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define test cout<<"test"<<endl;
#define fi first
#define se second
#define MP make_pair
#define rep(i,n,m) for(ll i = n; i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = n - 1; i >= (ll)(m); i--)
typedef long long ll;
typedef long double ld;
const ll MOD = 1e9+7;
//const ll MOD = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T>
void chmin(T &a,T b){if(a>b)a=b;}
template<typename T>
void chmax(T &a,T b){if(a<b)a=b;}
void pmod(ll &a,ll b){a=(a+b)%MOD;}
void pmod(ll &a,ll b,ll c){a=(b+c)%MOD;}
void qmod(ll &a,ll b){a=(a*b)%MOD;}
void qmod(ll &a,ll b,ll c){a=(b*c)%MOD;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>
void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T>
void debug(vector<vector<T>>v,ll h,ll w){for(ll i=0;i<h;i++)
{cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};
void debug(vector<string>v,ll h,ll w){for(ll i=0;i<h;i++)
{for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};
template<typename T>
void debug(vector<T>v,ll n){cout<<v[0];
for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};
template<typename T>
vector<vector<T>>vec(ll x, ll y, T w){
  vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
//m.emplace(x,0).fi->se++;

int main(){
  cin.tie(NULL);
  ios_base::sync_with_stdio(false);
  ll res=0,res1=INF,res2=-INF,buf=0;
  bool judge = true;
  ll n;cin>>n;
  vector<string>s(n);
  rep(i,0,n)cin>>s[i];
  vector<ll>a(290,0);
  rep(i,0,n){
    ll lh=stoll(s[i].substr(0,2));
    ll lm=stoll(s[i].substr(2,2));
    ll rh=stoll(s[i].substr(5,2));
    ll rm=stoll(s[i].substr(7,2));
    a[lh*12+lm/5]++;
    a[rh*12+(rm+4)/5]--;
  }
  rep(i,1,290){
    a[i]+=a[i-1];
  }
  ll sw=0;
  string ret;
  rep(i,0,290){
    if(a[i]>0&&sw==0){
      sw=1;
      ll x=i/12;
      ll y=(i%12)*5;
      ret=to_string(x);
      if(x<=9)ret="0"+ret;
      if(y<=9)ret+="0"+to_string(y);
      else ret+=to_string(y);
    }
    else if(a[i]==0&&sw==1){
      sw=0;
      ret+="-";
      ll x=i/12;
      ll y=(i%12)*5;
      if(x<=9)ret+="0"+to_string(x);
      else ret+=to_string(x);
      if(y<=9)ret+="0"+to_string(y);
      else ret+=to_string(y);
      cout<<ret<<endl;
    }
  }
  
  return 0;
}

Submission Info

Judge Result