結果

問題 No.461 三角形はいくつ？
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2016-12-12 01:31:10
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 1,473 ms / 5,000 ms
コード長 10,046 bytes
コンパイル時間 1,273 ms
コンパイル使用メモリ 114,668 KB
実行使用メモリ 26,224 KB
最終ジャッジ日時 2024-11-29 05:53:40
合計ジャッジ時間 13,896 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 27 ms
24,232 KB
testcase_01 AC 29 ms
26,076 KB
testcase_02 AC 27 ms
24,032 KB
testcase_03 AC 26 ms
23,648 KB
testcase_04 AC 30 ms
23,856 KB
testcase_05 AC 426 ms
25,840 KB
testcase_06 AC 255 ms
26,072 KB
testcase_07 AC 294 ms
24,236 KB
testcase_08 AC 210 ms
24,008 KB
testcase_09 AC 30 ms
21,812 KB
testcase_10 AC 85 ms
24,036 KB
testcase_11 AC 344 ms
23,984 KB
testcase_12 AC 169 ms
24,036 KB
testcase_13 AC 482 ms
25,916 KB
testcase_14 AC 489 ms
23,868 KB
testcase_15 AC 486 ms
23,740 KB
testcase_16 AC 33 ms
22,152 KB
testcase_17 AC 33 ms
25,908 KB
testcase_18 AC 758 ms
21,948 KB
testcase_19 AC 723 ms
23,872 KB
testcase_20 AC 474 ms
23,740 KB
testcase_21 AC 494 ms
23,876 KB
testcase_22 AC 491 ms
23,868 KB
testcase_23 AC 115 ms
23,996 KB
testcase_24 AC 119 ms
23,808 KB
testcase_25 AC 32 ms
26,224 KB
testcase_26 AC 31 ms
24,000 KB
testcase_27 AC 1,473 ms
23,868 KB
testcase_28 AC 33 ms
24,244 KB
testcase_29 AC 177 ms
23,864 KB
testcase_30 AC 99 ms
24,372 KB
testcase_31 AC 320 ms
23,744 KB
testcase_32 AC 405 ms
22,076 KB
testcase_33 AC 31 ms
23,856 KB
testcase_34 AC 31 ms
24,240 KB
testcase_35 AC 31 ms
24,112 KB
testcase_36 AC 162 ms
24,312 KB
testcase_37 AC 169 ms
24,192 KB
testcase_38 AC 171 ms
25,984 KB
testcase_39 AC 161 ms
24,000 KB
testcase_40 AC 177 ms
23,932 KB
testcase_41 AC 172 ms
24,004 KB
testcase_42 AC 373 ms
24,196 KB
testcase_43 AC 379 ms
23,936 KB
testcase_44 AC 375 ms
24,056 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.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;
using Point = System.Numerics.Complex;
using Number = System.Int64;
using C = System.Int32;
namespace Program
{
    public class Solver
    {
        public void Solve()
        {
            var n = sc.Integer();
            var a = Enumerate(3, x => new List<KeyValuePair<long, long>>());
            var ans = 1L;
            for (int i = 0; i < n; i++)
            {
                var p = sc.Integer();
                var u = sc.Long();
                var v = sc.Long();
                var gcd = MathEx.GCD(u, v);
                u /= gcd; v /= gcd;
                a[p].Add(new KeyValuePair<long, long>(u, u + v));
                ans++;
            }
            for (int i = 0; i < 3; i++)
                a[i].Sort((l, r) => (l.Key * r.Value).CompareTo(l.Value * r.Key));
            for (int i = 1; i < 3; i++)
            {

                foreach (var p in a[i])
                {
                    var u = p.Key;
                    var d = p.Value;
                    u = d - u;
                    ans += a[0].Count - a[0].UpperBound(new KeyValuePair<long, long>(u, d), (l, r) =>
                            (l.Key * r.Value).CompareTo(l.Value * r.Key));
                }
            }
            Debug.WriteLine(ans);
            for (int i = 1; i < 3; i++)
                a[i].Reverse();
            foreach (var p in a[1])
            {
                var u = p.Key;
                var d = p.Value;
                u = d - u;
                var L = 0; var lR = 0; var R = 0;

                foreach (var q in a[2])
                {
                    var x = q.Key;
                    var y = q.Value;
                    x = y - x;
                    var nu = u * y + x * d;
                    var nd = d * y;
                    var gcd = MathEx.GCD(nu, nd);
                    nu /= gcd;
                    nd /= gcd;
                    if (nu > nd) break;
                    if (nu < nd) ans++;
                    while (R < a[0].Count)
                    {
                        if (nu * a[0][R].Value < a[0][R].Key * nd) break;
                        else R++;
                    }
                    while (lR < a[0].Count)
                    {
                        if (nu * a[0][lR].Value <= a[0][lR].Key * nd) break;
                        else lR++;
                    }

                    ans += a[0].Count - R;
                    ans += lR;
                    if (u * y > x * d)
                    {
                        while (L < a[0].Count)
                        {
                            if (u * a[0][L].Value <= a[0][L].Key * d) break;
                            else L++;
                        }
                        ans -= L;
                    }
                    else
                    {

                        while (L < a[0].Count)
                        {
                            if (x * a[0][L].Value <= a[0][L].Key * y) break;
                            else L++;
                        }
                        ans -= L;
                    }

                }
            }
            IO.Printer.Out.WriteLine(ans);
        }

        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 != 0 && b != '-' && (b < '0' || '9' < b));
            if (b == 0) return long.MinValue;
            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() { var s = Scan(); return s != "" ? double.Parse(s, CultureInfo.InvariantCulture) : double.NaN; }
        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

#region gcd,lcm
static public partial class MathEx
{

    static public Number GCD(Number n, Number m)
    {
        bool f = true;
        for (; n != 0 && m != 0; f ^= true)
        {
            if (f)
                m %= n;
            else n %= m;
        }
        return n == 0 ? m : n;
    }
    static public Number LCM(Number n, Number m)
    {
        return (n / GCD(n, m)) * m;
    }
    static public Number GCD(params Number[] a)
    {
        var gcd = a[0];
        foreach (var x in a)
            gcd = GCD(gcd, x);
        return gcd;
    }

}
#endregion

#region BinarySearch for List
static public partial class Algorithm
{

    static private int binarySearch<T>(this IList<T> a, int idx, int len, T v, Comparison<T> cmp, bool islb)
    {
        int l = idx;
        int h = idx + len - 1;
        while (l <= h)
        {
            int i = l + ((h - l) >> 1);
            int ord;
            if (a[i] == null || v == null) return -1;
            else ord = cmp(a[i], v);
            if (ord < 0) l = i + 1;
            else if (ord == 0)
            {
                if (!islb) l = i + 1;
                else h = i - 1;
            }
            else h = i - 1;
        }

        return l;
    }
    static public int UpperBound<T>(this IList<T> a, int idx, int len, T v, Comparison<T> cmp) { return binarySearch(a, idx, len, v, cmp, false); }
    static public int UpperBound<T>(this IList<T> a, int idx, int len, T v) where T : IComparable<T> { return UpperBound(a, idx, len, v, Comparer<T>.Default.Compare); }
    static public int UpperBound<T>(this IList<T> a, T v) where T : IComparable<T> { return UpperBound(a, 0, a.Count, v, Comparer<T>.Default.Compare); }
    static public int UpperBound<T>(this IList<T> a, T v, IComparer<T> cmp) { return UpperBound(a, 0, a.Count, v, cmp.Compare); }
    static public int UpperBound<T>(this IList<T> a, T v, Comparison<T> cmp) { return UpperBound(a, 0, a.Count, v, cmp); }

    static public int LowerBound<T>(this IList<T> a, int idx, int len, T value, Comparison<T> cmp) { return binarySearch(a, idx, len, value, cmp, true); }
    static public int LowerBound<T>(this IList<T> a, int idx, int len, T value) where T : IComparable<T> { return LowerBound(a, idx, len, value, Comparer<T>.Default.Compare); }
    static public int LowerBound<T>(this IList<T> a, T val) where T : IComparable<T> { return LowerBound(a, 0, a.Count, val, Comparer<T>.Default.Compare); }
    static public int LowerBound<T>(this IList<T> a, T val, IComparer<T> cmp) { return LowerBound(a, 0, a.Count, val, cmp.Compare); }
    static public int LowerBound<T>(this IList<T> a, T v, Comparison<T> cmp) { return LowerBound(a, 0, a.Count, v, cmp); }
}
#endregion
0