Submission #296081


Source Code Expand

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

class Program
{
    static void Main(string[] args)
    {
        Solver solver = new Solver();
        solver.solve();
        return;
    }
}

class Solver
{
    public void solve()
    {
        int n = ri();
        List<Tuple<int, int>> RT = new List<Tuple<int, int>>();
        List<Tuple<int, int>> result = new List<Tuple<int, int>>();
        
        for (int i = 0; i < n; i++)
        {
            var tmp = ria('-');
            RT.Add(new Tuple<int, int>(timeDowner(tmp[0]), timeUpper(tmp[1])));
        }

        if (n == 1)
        {
            Console.WriteLine("{0:D4}" + "-" + "{1:D4}", RT[0].Item1, RT[0].Item2);
            return;
        }

        var  minOrder = RT.OrderBy(x => x.Item1).ToArray();

        int startTime = 0;
        int endTime = 0;

        foreach (var obj in minOrder)
        {
            if (Math.Max(obj.Item1, endTime) == endTime)
            {
                endTime = Math.Max(obj.Item2, endTime);
            }
            else
            {
                result.Add(new Tuple<int, int>(startTime, endTime));
                startTime = obj.Item1;
                endTime = obj.Item2;
            }
        }
        result.Add(new Tuple<int, int>(startTime, endTime));

        var ar = result.Skip(1).ToArray();

        foreach (var obj in ar)
            Console.WriteLine("{0:D4}" + "-" + "{1:D4}",obj.Item1 ,obj.Item2);
    }

    private int timeUpper(int num)
    {
        int tmp = (num % 10) - 5;
        if (tmp == 0 || tmp == -5)
        {
            return num;
        }
        else if (tmp > 0)
        {
            num += (5 - tmp);
            if (num % 100 == 60)
            {
                num += 100 - 60;
            }
        }
        else
        {
            return num -= tmp;
        }
        return num;
    }

    private int timeDowner(int num)
    {
        int tmp = (num % 10) - 5;
        if (tmp == -5)
        {
            return num;
        }
        else
        {
            if (tmp > 0)
                return num - tmp;
            else
                return num - (5 + tmp);
        }
    }

    static String rs() { return Console.ReadLine(); }
    static int ri() { return int.Parse(Console.ReadLine()); }
    static long rl() { return long.Parse(Console.ReadLine()); }
    static double rd() { return double.Parse(Console.ReadLine()); }
    static String[] rsa() { return Console.ReadLine().Split(' '); }
    static int[] ria() { return Array.ConvertAll(Console.ReadLine().Split(' '), e => int.Parse(e)); }
    static int[] ria(char split) { return Array.ConvertAll(Console.ReadLine().Split(split), e => int.Parse(e)); }
    static long[] rla() { return Array.ConvertAll(Console.ReadLine().Split(' '), e => long.Parse(e)); }
    static double[] rda() { return Array.ConvertAll(Console.ReadLine().Split(' '), e => double.Parse(e)); }
    static double rounding(double target, int rank) { return Math.Round(target, rank, MidpointRounding.AwayFromZero); }
}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User yamachuco
Language C# (Mono 2.10.8.1)
Score 0
Code Size 3173 Byte
Status WA
Exec Time 222 ms
Memory 9380 KB

Judge Result

Set Name all
Score / Max Score 0 / 100
Status
AC × 12
WA × 36
Set Name Test Cases
all 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, cho_cho_chokudai.txt, chokudai_ga_cho.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt, test_40.txt, test_41.txt, test_42.txt, test_43.txt
Case Name Status Exec Time Memory
00_sample_01.txt AC 143 ms 6748 KB
00_sample_02.txt AC 122 ms 6100 KB
00_sample_03.txt WA 145 ms 6748 KB
cho_cho_chokudai.txt WA 191 ms 9064 KB
chokudai_ga_cho.txt WA 195 ms 9084 KB
test_01.txt WA 149 ms 6740 KB
test_02.txt WA 147 ms 6744 KB
test_03.txt WA 150 ms 6756 KB
test_04.txt WA 149 ms 6752 KB
test_05.txt WA 149 ms 6740 KB
test_06.txt WA 134 ms 6512 KB
test_07.txt WA 128 ms 6396 KB
test_08.txt WA 130 ms 6388 KB
test_09.txt WA 133 ms 6564 KB
test_10.txt WA 133 ms 6520 KB
test_11.txt WA 147 ms 6856 KB
test_12.txt WA 131 ms 6512 KB
test_13.txt WA 133 ms 6388 KB
test_14.txt WA 132 ms 6520 KB
test_15.txt WA 132 ms 6512 KB
test_16.txt AC 143 ms 6752 KB
test_17.txt AC 146 ms 6752 KB
test_18.txt AC 146 ms 6728 KB
test_19.txt AC 148 ms 6820 KB
test_20.txt AC 143 ms 6852 KB
test_21.txt WA 193 ms 9140 KB
test_22.txt WA 199 ms 9136 KB
test_23.txt WA 199 ms 9128 KB
test_24.txt WA 199 ms 9068 KB
test_25.txt WA 198 ms 9120 KB
test_26.txt WA 196 ms 9124 KB
test_27.txt AC 207 ms 9380 KB
test_28.txt WA 213 ms 9368 KB
test_29.txt AC 121 ms 6100 KB
test_30.txt WA 145 ms 6752 KB
test_31.txt WA 155 ms 7256 KB
test_32.txt WA 143 ms 6752 KB
test_33.txt WA 189 ms 8788 KB
test_34.txt AC 143 ms 6676 KB
test_35.txt WA 146 ms 6784 KB
test_36.txt AC 222 ms 9268 KB
test_37.txt WA 214 ms 9276 KB
test_38.txt WA 212 ms 9280 KB
test_39.txt AC 205 ms 9304 KB
test_40.txt WA 212 ms 9288 KB
test_41.txt WA 188 ms 9132 KB
test_42.txt WA 196 ms 9128 KB
test_43.txt WA 192 ms 9080 KB