#75836 (C#(csc)) No.343 手抜き工事のプロ

• 問題: No.343 手抜き工事のプロ
• ユーザー: りあん
• 提出日時: 2016-02-12 23:48:45
• 言語: C#(csc) (csc 3.9.0)
• 結果: AC
• 実行時間: 59 ms / 2,000 ms
• コード長: 5,354 bytes
• コンパイル時間: 924 ms
• コンパイル使用メモリ: 118,384 KB
• 実行使用メモリ: 28,184 KB
• 最終ジャッジ日時: 2024-09-22 05:06:25
• 合計ジャッジ時間: 2,557 ms
• ジャッジサーバーID （参考情報）: judge3 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	23 ms; 23,724 KB
testcase_01	AC	23 ms; 23,652 KB
testcase_02	AC	23 ms; 23,936 KB
testcase_03	AC	22 ms; 23,984 KB
testcase_04	AC	23 ms; 26,188 KB
testcase_05	AC	23 ms; 23,556 KB
testcase_06	AC	23 ms; 23,880 KB
testcase_07	AC	23 ms; 23,552 KB
testcase_08	AC	23 ms; 23,936 KB
testcase_09	AC	22 ms; 23,808 KB
testcase_10	AC	23 ms; 23,756 KB
testcase_11	AC	23 ms; 25,984 KB
testcase_12	AC	23 ms; 23,692 KB
testcase_13	AC	27 ms; 25,856 KB
testcase_14	AC	23 ms; 24,116 KB
testcase_15	AC	24 ms; 25,944 KB
testcase_16	AC	23 ms; 23,852 KB
testcase_17	AC	23 ms; 25,852 KB
testcase_18	AC	23 ms; 23,808 KB
testcase_19	AC	23 ms; 24,112 KB
testcase_20	AC	26 ms; 23,812 KB
testcase_21	AC	35 ms; 25,820 KB
testcase_22	AC	38 ms; 25,832 KB
testcase_23	AC	46 ms; 27,800 KB
testcase_24	AC	53 ms; 25,888 KB
testcase_25	AC	58 ms; 26,016 KB
testcase_26	AC	59 ms; 28,184 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.Collections.Generic;
using System.Linq;
using System.IO;
using System.IO.Compression;
using System.Text;

namespace Solver
{
    class Program
    {
        const int M = 1000000007;
        const double eps = 1e-9;
        static int[] dd = { 0, 1, 0, -1, 0 };
        static void Main()
        {
            var sw = new System.IO.StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
            var sc = new Scan();
            var n = sc.Int;
            var l = sc.Int;
            var x = new int[n];
            for (int i = 1; i < n; i++)
            {
                x[i] = sc.Int;
            }
            double g = x[n - 1];
            int ans = 0;
            for (int i = 2; i <= n; i++)
            {
                if (Math.Abs(x[n - i] - x[n - i + 1]) >= l)
                {
                    Console.WriteLine(-1);
                    return;
                }
                if (Math.Abs((g - x[n - i + 1]) * 2) - l > -eps || Math.Abs((g - x[n - i]) * 2) - l > -eps)
                    ++ans;
                    
                g = (g * (i - 1) + x[n - i]) / i;
            }
            sw.WriteLine(ans);
            sw.Flush();
        }
 
        static void swap<T>(ref T a, ref T b)
        {
            var t = a;
            a = b;
            b = t;
        }
 
        static bool isprime(long n)
        {
            if (n == 1) return false;
 
            for (long i = 2; i * i <= n; i++)
                if (n % i == 0)
                    return false;
 
            return true;
        }
 
        static string strsort(string s)
        {
            var c = s.ToCharArray();
            Array.Sort(c);
            return string.Join("", c);
        }
        static string strswap(string s, int i, int j)
        {
            var c = s.ToCharArray();
            c[i] = s[j];
            c[j] = s[i];
            return string.Join("", c);
        }
 
        static T[] copy<T>(T[] a)
        {
            var ret = new T[a.Length];
            for (int i = 0; i < a.Length; i++) ret[i] = a[i];
            return ret;
        }
    }
    class Scan
    {
        public int Int { get { return int.Parse(Console.ReadLine().Trim()); } }
        public long Long { get { return long.Parse(Console.ReadLine().Trim()); } }
        public string Str { get { return Console.ReadLine().Trim(); } }
        public int[] IntArr { get { return Console.ReadLine().Trim().Split().Select(int.Parse).ToArray(); } }
        public int[] IntArrWithSep(char sep) { return Console.ReadLine().Trim().Split(sep).Select(int.Parse).ToArray(); }
        public long[] LongArr { get { return Console.ReadLine().Trim().Split().Select(long.Parse).ToArray(); } }
        public double[] DoubleArr { get { return Console.ReadLine().Split().Select(double.Parse).ToArray(); } }
        public string[] StrArr { get { return Console.ReadLine().Trim().Split(); } }
        public List<int> IntList { get { return Console.ReadLine().Trim().Split().Select(int.Parse).ToList(); } }
        public List<long> LongList { get { return Console.ReadLine().Trim().Split().Select(long.Parse).ToList(); } }
        public void Multi(out int a, out int b) { var arr = IntArr; a = arr[0]; b = arr[1]; }
        public void Multi(out int a, out int b, out int c) { var arr = IntArr; a = arr[0]; b = arr[1]; c = arr[2]; }
        public void Multi(out int a, out int b, out int c, out int d) { var arr = IntArr; a = arr[0]; b = arr[1]; c = arr[2]; d = arr[3]; }
        public void Multi(out int a, out string b) { var arr = StrArr; a = int.Parse(arr[0]); b = arr[1]; }
        public void Multi(out string a, out int b) { var arr = StrArr; a = arr[0]; b = int.Parse(arr[1]); }
        public void Multi(out int a, out int b, out string c) { var arr = StrArr; a = int.Parse(arr[0]); b = int.Parse(arr[1]); c = arr[2]; }
        public void Multi(out int a, out char b) { var arr = StrArr; a = int.Parse(arr[0]); b = arr[1][0]; }
        public void Multi(out char a, out int b) { var arr = StrArr; a = arr[0][0]; b = int.Parse(arr[1]); }
        public void Multi(out long a, out long b) { var arr = LongArr; a = arr[0]; b = arr[1]; }
        public void Multi(out long a, out int b) { var arr = LongArr; a = arr[0]; b = (int)arr[1]; }
        public void Multi(out int a, out long b) { var arr = LongArr; a = (int)arr[0]; b = arr[1]; }
        public void Multi(out string a, out string b) { var arr = StrArr; a = arr[0]; b = arr[1]; }
    }
    class mymath
    {
        public bool isprime(long a)
        {
            if (a < 2) return false;
            for (long i = 2; i * i <= a; i++)
                if (a % i == 0)
                    return false;
 
            return true;
        }
        public long powmod(long a, long b, long M)
        {
            if (a == 0) return 0;
            if (b == 0) return 1;
            if (b == 1) return a % M;
 
            var t = powmod(a, b / 2, M);
 
            if ((b & 1) == 0) return t * t % M;
            else return t * t % M * a % M;
        }
        public long gcd(long a, long b)
        {
            while (b != 0)
            {
                var t = a % b;
                a = b;
                b = t;
            }
            return a;
        }
        public long lcm(int a, int b) { return a * (long)b / gcd(a, b); }
    }
}