結果

問題 No.947 ABC包囲網
ユーザー EmKjpEmKjp
提出日時 2020-01-05 09:39:22
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 36 ms / 2,000 ms
コード長 7,202 bytes
コンパイル時間 1,184 ms
コンパイル使用メモリ 110,848 KB
実行使用メモリ 19,164 KB
最終ジャッジ日時 2024-11-22 21:56:32
合計ジャッジ時間 4,225 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 27 ms
17,920 KB
testcase_01 AC 27 ms
17,920 KB
testcase_02 AC 27 ms
17,792 KB
testcase_03 AC 27 ms
17,920 KB
testcase_04 AC 29 ms
18,048 KB
testcase_05 AC 29 ms
18,176 KB
testcase_06 AC 28 ms
18,048 KB
testcase_07 AC 27 ms
18,048 KB
testcase_08 AC 27 ms
17,792 KB
testcase_09 AC 27 ms
17,920 KB
testcase_10 AC 27 ms
17,920 KB
testcase_11 AC 27 ms
17,920 KB
testcase_12 AC 27 ms
17,792 KB
testcase_13 AC 27 ms
17,920 KB
testcase_14 AC 27 ms
18,176 KB
testcase_15 AC 28 ms
17,920 KB
testcase_16 AC 27 ms
17,920 KB
testcase_17 AC 28 ms
18,048 KB
testcase_18 AC 28 ms
17,920 KB
testcase_19 AC 28 ms
18,176 KB
testcase_20 AC 27 ms
18,176 KB
testcase_21 AC 27 ms
18,048 KB
testcase_22 AC 28 ms
18,176 KB
testcase_23 AC 28 ms
17,920 KB
testcase_24 AC 28 ms
17,920 KB
testcase_25 AC 27 ms
18,176 KB
testcase_26 AC 27 ms
17,792 KB
testcase_27 AC 28 ms
18,048 KB
testcase_28 AC 34 ms
18,924 KB
testcase_29 AC 36 ms
19,024 KB
testcase_30 AC 35 ms
19,036 KB
testcase_31 AC 35 ms
19,028 KB
testcase_32 AC 34 ms
19,028 KB
testcase_33 AC 34 ms
18,904 KB
testcase_34 AC 33 ms
18,900 KB
testcase_35 AC 34 ms
18,900 KB
testcase_36 AC 34 ms
19,036 KB
testcase_37 AC 34 ms
19,164 KB
testcase_38 AC 34 ms
18,772 KB
testcase_39 AC 34 ms
18,900 KB
testcase_40 AC 34 ms
18,560 KB
testcase_41 AC 33 ms
19,072 KB
testcase_42 AC 33 ms
18,768 KB
testcase_43 AC 34 ms
18,944 KB
testcase_44 AC 34 ms
18,944 KB
testcase_45 AC 33 ms
18,944 KB
testcase_46 AC 32 ms
18,944 KB
testcase_47 AC 33 ms
18,688 KB
testcase_48 AC 35 ms
18,944 KB
testcase_49 AC 34 ms
18,900 KB
testcase_50 AC 33 ms
18,816 KB
testcase_51 AC 27 ms
17,792 KB
testcase_52 AC 27 ms
17,920 KB
testcase_53 AC 27 ms
17,792 KB
testcase_54 AC 28 ms
18,176 KB
testcase_55 AC 27 ms
17,792 KB
testcase_56 AC 27 ms
17,920 KB
testcase_57 AC 27 ms
18,048 KB
testcase_58 AC 28 ms
18,176 KB
testcase_59 AC 28 ms
18,048 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.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.Globalization;
using System.IO;
using System.Text;
using System.Linq;

using E = System.Linq.Enumerable;

internal partial class Solver {
    public void Run() {
        var n = ni();
        var x = new int[n];
        var y = new int[n];
        for (int i = 0; i < n; i++) {
            x[i] = ni();
            y[i] = ni();
        }

        long ans = Solve(n, x, y);
        cout.WriteLine(ans);
    }

    class Angle : IComparable<Angle> {
        public long X { get; private set; }
        public long Y { get; private set; }

        private readonly long _a;
        private readonly long _b;
        public int Quadrant { get; private set; }

        public Angle(long x, long y) {
            _a = X = x;
            _b = Y = y;
            if (x == 0 && y == 0) throw new ArgumentException();
            while (!(_a > 0 && _b >= 0)) {
                var t = _a; _a = _b; _b = -t;
                Quadrant++;
            }
        }

        public int CompareTo(Angle other) {
            var cmp = Quadrant.CompareTo(other.Quadrant);
            if (cmp != 0) return cmp;
            // b1/a1 < b2/a2
            // b1*a2 < a1*b2
            cmp = (_b * other._a).CompareTo(other._b * _a);
            if (cmp != 0) return cmp;
            return (_a + _b).CompareTo(other._a + other._b);
        }
    }

    private long Solve(int n, int[] x, int[] y) {
        var angles = new List<Angle>();
        for (int j = 0; j < n; j++) {
            var dx = x[j];
            var dy = y[j];
            angles.Add(new Angle(dx, dy));
        }
        angles.Sort();
        angles.AddRange(angles);
        //angles.Dump();

        int right = 0;
        int right2 = 0;
        long ans = 1L * n * (n - 1) * (n - 2) / 6;
        long line = 0;
        for (int j = 0; j < n; j++) {
            var angle1 = angles[j];
            while (
                right + 1 < j + n &&
                angle1.X * angles[right + 1].Y - angle1.Y * angles[right + 1].X >= 0) {
                right++;
            }
            while (
                right2 + 1 < j + n &&
                (
                    angle1.X * angles[right2 + 1].Y - angle1.Y * angles[right2 + 1].X > 0 ||
                    (angle1.X * angles[right2 + 1].Y - angle1.Y * angles[right2 + 1].X == 0 &&
                    angle1.X * angles[right2 + 1].X + angle1.Y * angles[right2 + 1].Y >= 0
                    )
                )) {
                right2++;
            }

            var zero = right - right2;
            var lower = right2 - j;
            if (lower == n - 1 && right >= n) continue;
            ans -= 1L * zero * lower;
            ans -= 1L * lower * (lower - 1) / 2;
        }

        //if (ans < 0) return 0;
        //new { ans, line }.Dump();

        ans += line;
        return ans;
    }

    public static Tuple<long, long> Normalize(long x, long y) {
        var g = Gcd(Math.Abs(x), Math.Abs(y));
        x /= g;
        y /= g;
        return Tuple.Create(x, y);
    }

    public static long Gcd(long s, long t) {
        return t != 0 ? Gcd(t, s % t) : s;
    }
}

// PREWRITEN CODE BEGINS FROM HERE
internal partial class Solver : Scanner {
    public static void Main(string[] args) {
#if LOCAL
        byte[] inputBuffer = new byte[1000000];
        var inputStream = Console.OpenStandardInput(inputBuffer.Length);
        using (var reader = new StreamReader(inputStream, Console.InputEncoding, false, inputBuffer.Length)) {
            Console.SetIn(reader);
            new Solver(Console.In, Console.Out).Run();
        }
#else
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver(Console.In, Console.Out).Run();
        Console.Out.Flush();
#endif
    }

#pragma warning disable IDE0052
    private readonly TextReader cin;
    private readonly TextWriter cout;
#pragma warning restore IDE0052

    public Solver(TextReader reader, TextWriter writer)
        : base(reader) {
        cin = reader;
        cout = writer;
    }
    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer) {
    }

#pragma warning disable IDE1006
#pragma warning disable IDE0051
    private int ni() { return NextInt(); }
    private int[] ni(int n) { return NextIntArray(n); }
    private long nl() { return NextLong(); }
    private long[] nl(int n) { return NextLongArray(n); }
    private double nd() { return NextDouble(); }
    private double[] nd(int n) { return NextDoubleArray(n); }
    private string ns() { return Next(); }
    private string[] ns(int n) { return NextArray(n); }
#pragma warning restore IDE1006
#pragma warning restore IDE0051
}

internal static class LinqPadExtension {
    [Conditional("DEBUG")]
    public static void Dump<T>(this T obj) {
#if DEBUG
        LINQPad.Extensions.Dump(obj);
#endif
    }
}

public class Scanner {
    private readonly TextReader Reader;
    private readonly Queue<string> TokenQueue = new Queue<string>();
    private readonly CultureInfo ci = CultureInfo.InvariantCulture;

    public Scanner()
        : this(Console.In) {
    }

    public Scanner(TextReader reader) {
        Reader = reader;
    }

    public int NextInt() { return int.Parse(Next(), ci); }
    public long NextLong() { return long.Parse(Next(), ci); }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size) {
        string[] array = new string[size];
        for (int i = 0; i < size; i++) {
            array[i] = Next();
        }

        return array;
    }
    public int[] NextIntArray(int size) {
        int[] array = new int[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextInt();
        }

        return array;
    }

    public long[] NextLongArray(int size) {
        long[] array = new long[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextLong();
        }

        return array;
    }

    public double[] NextDoubleArray(int size) {
        double[] array = new double[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextDouble();
        }

        return array;
    }

    public string Next() {
        if (TokenQueue.Count == 0) {
            if (!StockTokens()) {
                throw new InvalidOperationException();
            }
        }
        return TokenQueue.Dequeue();
    }

    public bool HasNext() {
        if (TokenQueue.Count > 0) {
            return true;
        }

        return StockTokens();
    }

    private static readonly char[] _separator = new[] { ' ', '\t' };
    private bool StockTokens() {
        while (true) {
            string line = Reader.ReadLine();
            if (line == null) {
                return false;
            }

            string[] tokens = line.Split(_separator, StringSplitOptions.RemoveEmptyEntries);
            if (tokens.Length == 0) {
                continue;
            }

            foreach (string token in tokens) {
                TokenQueue.Enqueue(token);
            }

            return true;
        }
    }
}
0