Submission #485136

---

Source Code Expand

<?php

function roundTime($time, $is_back = true)
{
    if ($time % 5 == 0) {
        return $time;
    }

    $min  = (int)$time % 100;
    $hour = floor((int)$time / 100);

    if ($is_back) {
        $min -= $min % 5;
    } else {
        $min = ceil($min / 5) * 5;
        if ($min >= 60) {
            $hour++;
            $min = 0;
        }
    }

    return sprintf('%02d', $hour) . sprintf('%02d', $min);
}

fscanf(STDIN, '%d', $n);

$rains = array();
for ($i = 0; $i < $n; $i++) {
    $times = explode('-', trim(fgets(STDIN)));
    if (isset($rains[$times[0]]) && $rains[$times[0]] > $times[1]) {
        continue;
    }
    $rains[$times[0]] = $times[1];
}

$rounds = array();
foreach ($rains as $begin => $end) {
    $new_begin = roundTime($begin);
    $new_end   = roundTime($end, false);

    if (isset($rounds[$new_begin]) && $rounds[$new_begin] > $end) {
        continue;
    }

    $rounds[$new_begin] = $new_end;
}

ksort($rounds);

$before_begin = null;
$before_end   = null;
foreach ($rounds as $begin => $end) {
    if ($before_begin == null) {
        $before_begin = $begin;
        $before_end   = $end;
        continue;
    }

    if ($begin <= $before_end) {
        if ($end > $before_end) {
            $before_end = $end;
        }
    } else {
        echo $before_begin . '-' . $before_end . "\n";
        $before_begin = $begin;
        $before_end   = $end;
    }
}

echo $before_begin . '-' . $before_end . "\n";

Submission Info

Judge Result