Submission #2446340

---

Source Code Expand

#include <iostream>
#include <math.h>
#include <sstream>
#include <string>
#include <cstddef>
#include <ios> // std::left, std::right
#include <iomanip> // std::setw(int), std::setfill(char)

using namespace std;

void time_sorting(int n, int *time_s, int *time_e);
void time_shrinking(int n, int *time_s_in, int *time_e_in, int *time_s_out, int *time_e_out);
void show_time(int n, int *s, int *e);

int main()
{
    // get input
    int n;
    cin >> n;
    int *time_s, *time_e;
    time_s = new int[n];
    time_e = new int[n];

    for(int i = 0; i < n; i++)
    {
        string line, s, e;
        cin >> line;
        istringstream stream(line);
        getline(stream, s, '-');
        getline(stream, e, '-');
        
        time_s[i] = (((atoi(s.c_str()))+0)/5)*5;
        time_e[i] = (((atoi(e.c_str()))+4)/5)*5;
        if((time_e[i]%100)==60) time_e[i]+=40;
    }

    
    time_sorting(n, time_s, time_e);
    
    int *time_s_out, *time_e_out;
    time_s_out = new int[n];
    time_e_out = new int[n];
    for(int i = 0; i < n; i++)
    {
        time_s_out[i] = -1;
        time_e_out[i] = -1;
    }

    time_shrinking(n, time_s, time_e, time_s_out, time_e_out);
    show_time(n, time_s_out, time_e_out);
    
    delete[] time_s;
    delete[] time_e;
    delete[] time_s_out;
    delete[] time_e_out;
    
    return 0;
}


void time_sorting(int n, int *time_s, int *time_e)
{
    int i, j, tmp;
    for (i = 0; i < n-1; i++)
    {
        for (j = i+1; j < n; j++)
        {
            if(time_s[j] < time_s[i])
            {
                // sorting start
                tmp = time_s[i];
                time_s[i] = time_s[j];
                time_s[j] = tmp;
                // sorting end
                tmp = time_e[i];
                time_e[i] = time_e[j];
                time_e[j] = tmp;
                }
        }
    }
}


void time_shrinking(int n, int *time_s_in, int *time_e_in, int *time_s_out, int *time_e_out)
{
    time_s_out[0] = time_s_in[0];
    time_e_out[0] = time_e_in[0];
    
    int current_pos = 0;
    for(int i = 1; i < n; i++)
    {
        if(time_e_out[current_pos] < time_s_in[i])
        {
            current_pos++;
            time_s_out[current_pos] = time_s_in[i];
            time_e_out[current_pos] = time_e_in[i];
        }
        else
        {
            if(time_e_out[current_pos] < time_e_in[i])
            {
                time_e_out[current_pos] = time_e_in[i];
            }
        }
    }
}


void show_time(int n, int *s, int *e)
{
    for(int i=0; i<n; i++)
    {
        if(s[i] == -1) break;
        cout << std::setfill('0') << std::right << std::setw(4) << s[i] << "-" << std::setfill('0') << std::right << std::setw(4) << e[i] << endl;
    }
}

Submission Info

Judge Result