結果

問題 No.281 門松と魔法(1)
コンテスト
ユーザー 紙ぺーぱー
提出日時 2015-09-18 20:40:55
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 29 ms / 1,000 ms
コード長 5,995 bytes
コンパイル時間 1,000 ms
コンパイル使用メモリ 118,088 KB
実行使用メモリ 18,944 KB
最終ジャッジ日時 2024-11-06 20:26:25
合計ジャッジ時間 4,136 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 57
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff # 

using System;
using System.Linq;
using System.Diagnostics;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;

namespace Program
{

    public class Solver
    {
        public void Solve()
        {
            var d = sc.Integer();
            var a = sc.Integer(3);
            var min = int.MaxValue;
            var cnt = 0;
            if (d == 0)//高さを変えられない
            {
                //門松かどうか
                if (a.Distinct().Count() == 3 && ((a[0] < a[1] && a[1] > a[2]) || (a[0] > a[1] && a[1] < a[2])))
                    IO.Printer.Out.WriteLine(0);
                else IO.Printer.Out.WriteLine(-1);
                return;
            }
            //左右が同じなら魔法を使う
            if (a[0] == a[2]) { a[0] = Math.Max(0, a[0] - d); cnt++; }
            //両端を低くする
            {
                var t = 0;
                var b = a.Clone() as int[];
                var dx = b[0] - b[1];
                if (dx >= 0) t += (dx + d) / d;
                b[0] = Math.Max(0, b[0] - t * d);
                var dy = b[2] - b[1];
                var u = 0;
                if (dy >= 0) u += (dy + d) / d;
                b[2] = Math.Max(0, b[2] - u * d);
                if (b[0] == b[2]) { b[0] = Math.Max(0, b[0] - d); t++; }

                if (b.Distinct().Count() == 3 && b[0] < b[1] && b[1] > b[2])
                    min = Math.Min(min, cnt + t + u);

            }
            //真ん中を低くする
            {
                var t = 0;
                var b = a.Clone() as int[];
                var dx = b[1] - Math.Min(b[0], b[2]);
                if (dx >= 0) t += (dx + d) / d;
                b[1] = Math.Max(0, b[1] - t * d);
                if (b.Distinct().Count() == 3 && b[0] > b[1] && b[1] < b[2])
                    min = Math.Min(min, cnt + t);
            }
            if (min == int.MaxValue)
                min = -1;
            IO.Printer.Out.WriteLine(min);
        }
        public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());
        static T[] Enumerate<T>(int n, Func<int, T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; }
        static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }
    }
}

#region main
static class Ex
{
    static public string AsString(this IEnumerable<char> ie) { return new string(System.Linq.Enumerable.ToArray(ie)); }
    static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") { return string.Join(st, ie); }
    static public void Main()
    {
        var solver = new Program.Solver();
        solver.Solve();
        Program.IO.Printer.Out.Flush();
    }
}
#endregion
#region Ex
namespace Program.IO
{
    using System.IO;
    using System.Text;
    using System.Globalization;
    public class Printer : StreamWriter
    {
        static Printer() { Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false }; }
        public static Printer Out { get; set; }
        public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
        public Printer(System.IO.Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
        public Printer(System.IO.Stream stream, Encoding encoding) : base(stream, encoding) { }
        public void Write<T>(string format, T[] source) { base.Write(format, source.OfType<object>().ToArray()); }
        public void WriteLine<T>(string format, T[] source) { base.WriteLine(format, source.OfType<object>().ToArray()); }
    }
    public class StreamScanner
    {
        public StreamScanner(Stream stream) { str = stream; }
        public readonly Stream str;
        private readonly byte[] buf = new byte[1024];
        private int len, ptr;
        public bool isEof = false;
        public bool IsEndOfStream { get { return isEof; } }
        private byte read()
        {
            if (isEof) return 0;
            if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } }
            return buf[ptr++];
        }
        public char Char() { byte b = 0; do b = read(); while ((b < 33 || 126 < b) && !isEof); return (char)b; }

        public string Scan()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b >= 33 && b <= 126; b = (char)read())
                sb.Append(b);
            return sb.ToString();
        }
        public string ScanLine()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b != '\n'; b = (char)read())
                if (b == 0) break;
                else if (b != '\r') sb.Append(b);
            return sb.ToString();
        }
        public long Long()
        {
            if (isEof) return long.MinValue;
            long ret = 0; byte b = 0; var ng = false;
            do b = read();
            while (b != '-' && (b < '0' || '9' < b));
            if (b == '-') { ng = true; b = read(); }
            for (; true; b = read())
            {
                if (b < '0' || '9' < b)
                    return ng ? -ret : ret;
                else ret = ret * 10 + b - '0';
            }
        }
        public int Integer() { return (isEof) ? int.MinValue : (int)Long(); }
        public double Double() { return double.Parse(Scan(), CultureInfo.InvariantCulture); }
        private T[] enumerate<T>(int n, Func<T> f)
        {
            var a = new T[n];
            for (int i = 0; i < n; ++i) a[i] = f();
            return a;
        }

        public char[] Char(int n) { return enumerate(n, Char); }
        public string[] Scan(int n) { return enumerate(n, Scan); }
        public double[] Double(int n) { return enumerate(n, Double); }
        public int[] Integer(int n) { return enumerate(n, Integer); }
        public long[] Long(int n) { return enumerate(n, Long); }
    }
}
#endregion
0