#19125 (C#(csc)) No.139 交差点

• 問題: No.139 交差点
• ユーザー: femto
• 提出日時: 2015-04-07 18:21:58
• 言語: C#(csc) (csc 3.9.0)
• 結果: AC
• 実行時間: 29 ms / 5,000 ms
• コード長: 4,070 bytes
• コンパイル時間: 967 ms
• コンパイル使用メモリ: 112,084 KB
• 実行使用メモリ: 27,388 KB
• 最終ジャッジ日時: 2024-07-04 10:48:46
• 合計ジャッジ時間: 2,794 ms
• ジャッジサーバーID （参考情報）: judge5 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	28 ms; 27,028 KB
testcase_01	AC	28 ms; 24,880 KB
testcase_02	AC	28 ms; 26,996 KB
testcase_03	AC	28 ms; 25,216 KB
testcase_04	AC	28 ms; 25,120 KB
testcase_05	AC	28 ms; 25,120 KB
testcase_06	AC	28 ms; 25,120 KB
testcase_07	AC	28 ms; 24,860 KB
testcase_08	AC	29 ms; 27,004 KB
testcase_09	AC	29 ms; 25,112 KB
testcase_10	AC	28 ms; 24,992 KB
testcase_11	AC	28 ms; 24,860 KB
testcase_12	AC	28 ms; 25,088 KB
testcase_13	AC	27 ms; 25,084 KB
testcase_14	AC	27 ms; 22,960 KB
testcase_15	AC	28 ms; 26,992 KB
testcase_16	AC	29 ms; 25,088 KB
testcase_17	AC	28 ms; 24,732 KB
testcase_18	AC	28 ms; 27,028 KB
testcase_19	AC	27 ms; 24,988 KB
testcase_20	AC	27 ms; 26,904 KB
testcase_21	AC	26 ms; 24,988 KB
testcase_22	AC	28 ms; 26,872 KB
testcase_23	AC	28 ms; 24,704 KB
testcase_24	AC	29 ms; 27,388 KB
testcase_25	AC	27 ms; 27,000 KB
testcase_26	AC	27 ms; 22,836 KB
testcase_27	AC	28 ms; 22,708 KB
testcase_28	AC	27 ms; 24,976 KB
testcase_29	AC	27 ms; 25,008 KB
testcase_30	AC	27 ms; 24,988 KB

コンパイルメッセージ

Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

using System;
using System.Diagnostics;
using System.Collections.Generic;
using System.Linq;
using Enu = System.Linq.Enumerable;

class Solution {
    long N, L, x, w, t;
    void calc() {
        rlo(out N, out L);

        long now = 0, time = 0;

        for (int i = 0; i < N; i++) {
            rlo(out x, out w, out t);

            time += x - now;
            now = x;

            bool blue = (time / t) % 2 == 0;
            if (blue) {
                if (t - (time % t) < w)
                    time += (t - (time % t)) + t;
            }
            else {
                time += t - (time % t);
            }
            time += w;
            now += w;
        }

        time += L - now;

        Console.WriteLine(time);
    }

    static void Main(string[] args) {
        new Solution().calc();
    }

    #region
    static int ri() { return int.Parse(Console.ReadLine()); }
    static int[] ria(int n) {
        if (n <= 0) { Console.ReadLine(); return new int[0]; }
        else return Console.ReadLine().Trim().Split(' ').Select(int.Parse).ToArray();
    }
    static void rio(out int p1) { p1 = ri(); }
    static void rio(out int p1, out int p2) { var r = ria(2); p1 = r[0]; p2 = r[1]; }
    static void rio(out int p1, out int p2, out int p3) { var r = ria(3); p1 = r[0]; p2 = r[1]; p3 = r[2]; }
    static void rio(out int p1, out int p2, out int p3, out int p4) { var r = ria(4); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; }
    static void rio(out int p1, out int p2, out int p3, out int p4, out int p5) { var r = ria(5); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; p5 = r[4]; }
    static long rl() { return long.Parse(Console.ReadLine()); }
    static long[] rla(int n) {
        if (n <= 0) { Console.ReadLine(); return new long[0]; }
        else return Console.ReadLine().Trim().Split(' ').Select(long.Parse).ToArray();
    }
    static void rlo(out long p1) { p1 = rl(); }
    static void rlo(out long p1, out long p2) { var r = rla(2); p1 = r[0]; p2 = r[1]; }
    static void rlo(out long p1, out long p2, out long p3) { var r = rla(3); p1 = r[0]; p2 = r[1]; p3 = r[2]; }
    static void rlo(out long p1, out long p2, out long p3, out long p4) { var r = rla(4); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; }
    static void rlo(out long p1, out long p2, out long p3, out long p4, out long p5) { var r = rla(5); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; p5 = r[4]; }
    static double rd() { return double.Parse(Console.ReadLine()); }
    static double[] rda(int n) {
        if (n <= 0) { Console.ReadLine(); return new double[0]; }
        else return Console.ReadLine().Trim().Split(' ').Select(double.Parse).ToArray();
    }
    static void rdo(out double p1) { p1 = rd(); }
    static void rdo(out double p1, out double p2) { var r = rda(2); p1 = r[0]; p2 = r[1]; }
    static void rdo(out double p1, out double p2, out double p3) { var r = rda(3); p1 = r[0]; p2 = r[1]; p3 = r[2]; }
    static void rdo(out double p1, out double p2, out double p3, out double p4) { var r = rda(4); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; }
    static void rdo(out double p1, out double p2, out double p3, out double p4, out double p5) { var r = rda(5); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; p5 = r[4]; }
    static void swap<T>(ref T x, ref T y) { T temp = x; x = y; y = temp; }
    static void wa1<T>(T[] a) { Debug.WriteLine(string.Join(" ", a)); }
    static void wa2<T>(T[][] a) {
        foreach (var row in a) {
            Debug.WriteLine(String.Join(" ", row));
        }
    }
    [DebuggerDisplay("{x} , {y}")]
    class point {
        public int x, y;
        public point(int x, int y) {
            this.x = x; this.y = y;
        }
    }
    #endregion
}

static class Extention {
    public static T[][] ToJagArray<T>(this T[,] a) {
        int n = a.GetLength(0), m = a.GetLength(1);
        var ret = new T[n][];
        for (int i = 0; i < n; i++) {
            ret[i] = new T[m];
            for (int j = 0; j < m; j++) {
                ret[i][j] = a[i, j];
            }
        }
        return ret;
    }
}