結果

問題 No.180 美しいWhitespace (2)
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2015-04-06 01:14:49
言語 C#(csc)
(csc 3.9.0)
結果
WA  
実行時間 -
コード長 8,118 bytes
コンパイル時間 1,086 ms
コンパイル使用メモリ 111,360 KB
実行使用メモリ 58,248 KB
最終ジャッジ日時 2024-07-04 03:03:07
合計ジャッジ時間 17,543 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 23 ms
19,200 KB
testcase_01 AC 23 ms
19,200 KB
testcase_02 AC 24 ms
19,200 KB
testcase_03 AC 24 ms
19,456 KB
testcase_04 AC 29 ms
19,148 KB
testcase_05 AC 55 ms
19,968 KB
testcase_06 AC 147 ms
23,424 KB
testcase_07 AC 309 ms
24,448 KB
testcase_08 AC 522 ms
29,184 KB
testcase_09 AC 66 ms
19,072 KB
testcase_10 AC 64 ms
19,456 KB
testcase_11 AC 3,931 ms
57,100 KB
testcase_12 AC 4,308 ms
58,248 KB
testcase_13 AC 3,194 ms
44,288 KB
testcase_14 AC 1,304 ms
29,824 KB
testcase_15 AC 390 ms
21,504 KB
testcase_16 AC 203 ms
20,352 KB
testcase_17 AC 135 ms
19,408 KB
testcase_18 AC 108 ms
19,584 KB
testcase_19 AC 70 ms
19,584 KB
testcase_20 AC 21 ms
18,944 KB
testcase_21 AC 22 ms
19,072 KB
testcase_22 AC 21 ms
18,944 KB
testcase_23 AC 21 ms
19,200 KB
testcase_24 AC 22 ms
19,072 KB
testcase_25 WA -
testcase_26 WA -
testcase_27 AC 23 ms
19,584 KB
testcase_28 AC 24 ms
18,944 KB
testcase_29 AC 24 ms
19,456 KB
testcase_30 AC 98 ms
19,072 KB
testcase_31 AC 100 ms
19,200 KB
testcase_32 AC 25 ms
19,328 KB
testcase_33 AC 65 ms
19,200 KB
testcase_34 AC 61 ms
19,456 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
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.Text.RegularExpressions;
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 n = sc.Integer();
            var a = new long[n];
            var b = new long[n];
            for (int i = 0; i < n; i++)
            {
                b[i] = sc.Long();
                a[i] = sc.Long();
            }
            var set = new HashSet<long>();

            for (int i = 0; i < n; i++)
                for (int j = 0; j < n; j++)
                {
                    if (a[i] == a[j])
                        continue;
                    var ap = a[i] - a[j];
                    var qb = b[j] - b[i];
                    if (qb / ap < 1)
                        continue;
                    set.Add(qb / ap);
                    set.Add(1 + (qb / ap));
                }
            var ans = long.MaxValue;
            long ansX = 0;
            foreach (var x in set)
            {
                var max = long.MinValue;
                var min = long.MaxValue;
                for (int i = 0; i < n; i++)
                {
                    max = Math.Max(a[i] * x + b[i], max);
                    min = Math.Min(a[i] * x + b[i], min);
                }
                if (ans > max - min)
                {
                    ans = max - min;
                    ansX = x;
                }
                else if (ans == max - min && ansX > x)
                {
                    ansX = x;
                }
            }
            if (ans == long.MaxValue)
            {
                IO.Printer.Out.WriteLine(1);
            }
            else
                IO.Printer.Out.WriteLine(ansX);
        }
        public long f(long a, long b, long x)
        {
            return a + b * x;
        }


        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; }


    }
}

#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, IEnumerable<T> source) { base.Write(format, source.OfType<object>().ToArray()); }
        public void WriteLine<T>(string format, IEnumerable<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); 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 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); }
    }
}
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 Deque

public class Deque<T>
{
    T[] buf;
    int offset;
    int count;
    int capacity;
    public int Count { get { return count; } }
    public Deque(int cap) { buf = new T[capacity = cap]; }
    public Deque() { buf = new T[capacity = 8]; }
    public T this[int index]
    {
        get { return buf[getIndex(index)]; }
        set { buf[getIndex(index)] = value; }
    }
    private int getIndex(int index)
    {
        if (index >= capacity)
            throw new IndexOutOfRangeException("out of range");
        var ret = index + offset;
        if (ret >= capacity)
            ret -= capacity;
        return ret;
    }
    public void PushFront(T item)
    {
        if (count == capacity) Extend();
        if (--offset < 0) offset += buf.Length;
        buf[offset] = item;
        ++count;
    }
    public T PopFront()
    {
        if (count == 0)
            throw new InvalidOperationException("collection is empty");
        --count;
        var ret = buf[offset++];
        if (offset >= capacity) offset -= capacity;
        return ret;
    }
    public void PushBack(T item)
    {
        if (count == capacity) Extend();
        var id = count++ + offset;
        if (id >= capacity) id -= capacity;
        buf[id] = item;
    }
    public T PopBack()
    {
        if (count == 0)
            throw new InvalidOperationException("collection is empty");
        return buf[getIndex(--count)];
    }
    public void Insert(T item, int index)
    {
        if (index > count) throw new IndexOutOfRangeException();
        this.PushFront(item);
        for (int i = 0; i < index; i++)
            this[i] = this[i + 1];
        this[index] = item;
    }
    public T RemoveAt(int index)
    {
        if (index < 0 || index >= count) throw new IndexOutOfRangeException();
        var ret = this[index];
        for (int i = index; i > 0; i--)
            this[i] = this[i - 1];
        this.PopFront();
        return ret;
    }
    private void Extend()
    {
        T[] newBuffer = new T[capacity << 1];
        if (offset > capacity - count)
        {
            var len = buf.Length - offset;
            Array.Copy(buf, offset, newBuffer, 0, len);
            Array.Copy(buf, 0, newBuffer, len, count - len);
        }
        else Array.Copy(buf, offset, newBuffer, 0, count);
        buf = newBuffer;
        offset = 0;
        capacity <<= 1;
    }
    public T[] Items
    {
        get
        {
            var a = new T[count];
            for (int i = 0; i < count; i++)
                a[i] = this[i];
            return a;
        }
    }
}

#endregion
0