結果
問題 | No.461 三角形はいくつ? |
ユーザー | りあん |
提出日時 | 2016-12-08 02:00:48 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 3,132 bytes |
コンパイル時間 | 1,187 ms |
コンパイル使用メモリ | 109,440 KB |
実行使用メモリ | 41,344 KB |
最終ジャッジ日時 | 2024-11-29 03:15:36 |
合計ジャッジ時間 | 172,840 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 30 ms
36,864 KB |
testcase_01 | AC | 29 ms
24,448 KB |
testcase_02 | AC | 29 ms
38,784 KB |
testcase_03 | AC | 24 ms
22,784 KB |
testcase_04 | TLE | - |
testcase_05 | TLE | - |
testcase_06 | TLE | - |
testcase_07 | TLE | - |
testcase_08 | TLE | - |
testcase_09 | TLE | - |
testcase_10 | TLE | - |
testcase_11 | TLE | - |
testcase_12 | TLE | - |
testcase_13 | TLE | - |
testcase_14 | TLE | - |
testcase_15 | TLE | - |
testcase_16 | AC | 63 ms
40,832 KB |
testcase_17 | AC | 64 ms
26,112 KB |
testcase_18 | AC | 1,205 ms
40,832 KB |
testcase_19 | AC | 1,210 ms
40,960 KB |
testcase_20 | TLE | - |
testcase_21 | TLE | - |
testcase_22 | TLE | - |
testcase_23 | TLE | - |
testcase_24 | TLE | - |
testcase_25 | AC | 1,575 ms
41,216 KB |
testcase_26 | AC | 1,584 ms
40,832 KB |
testcase_27 | AC | 39 ms
41,344 KB |
testcase_28 | AC | 39 ms
21,120 KB |
testcase_29 | AC | 2,082 ms
21,248 KB |
testcase_30 | AC | 2,110 ms
21,248 KB |
testcase_31 | AC | 1,949 ms
21,248 KB |
testcase_32 | AC | 1,875 ms
21,120 KB |
testcase_33 | AC | 39 ms
20,864 KB |
testcase_34 | AC | 40 ms
20,864 KB |
testcase_35 | AC | 40 ms
21,120 KB |
testcase_36 | TLE | - |
testcase_37 | TLE | - |
testcase_38 | TLE | - |
testcase_39 | TLE | - |
testcase_40 | TLE | - |
testcase_41 | TLE | - |
testcase_42 | TLE | - |
testcase_43 | TLE | - |
testcase_44 | TLE | - |
コンパイルメッセージ
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.Linq.Expressions; using System.IO; class Program { static StreamWriter sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false }; static Scan sc = new Scan(); static void Main() { int n = sc.Int; var lines = new List<long[]>[3]; for (int i = 0; i < 3; i++) { lines[i] = new List<long[]>(); lines[i].Add(new long[]{ 0, 1 }); } for (int i = 0; i < n; i++) { var a = sc.IntArr; var g = mymath.gcd(a[1], a[2]); lines[a[0]].Add(new long[]{ a[2] / g, (a[1] + a[2]) / g }); } for (int i = 0; i < 3; i++) lines[i].Sort((x, y) => (x[0] * y[1]).CompareTo(y[0] * x[1])); long ans = 0; foreach (var a in lines[0]) { foreach (var b in lines[1]) { if (!okay(a, b)) continue; long s = a[0] * b[1] + a[1] * b[0], t = a[1] * b[1]; var g = mymath.gcd(s, t); s /= g; t /= g; int ok = 0, ng = lines[2].Count; while (ok < ng - 1) { int m = (ok + ng) >> 1; var c = lines[2][m]; if (okay(a, c) && okay(b, c)) ok = m; else ng = m; } ans += ok + 1; long u = t - s; int l = 0, r = lines[2].Count - 1; while (true) { int m = (l + r) >> 1; var c = lines[2][m]; if (t * c[0] == u * c[1]) { --ans; break; } if (l == r) break; if (t * c[0] < u * c[1]) l = m + 1; else r = m - 1; } } } sw.WriteLine(ans); sw.Flush(); } static bool okay(long[] a, long[] b) => a[0] * b[1] + a[1] * b[0] <= a[1] * b[1]; } class Scan { public int Int => int.Parse(Str); public long Long => long.Parse(Str); public double Double => double.Parse(Str); public string Str => Console.ReadLine().Trim(); public int[] IntArr => StrArr.Select(int.Parse).ToArray(); public long[] LongArr => StrArr.Select(long.Parse).ToArray(); public double[] DoubleArr => StrArr.Select(double.Parse).ToArray(); public string[] StrArr => Str.Split(); } class mymath { public static long gcd(long a, long b) { while (b > 0) { var t = a % b; a = b; b = t; } return a; } // a x + b y = gcd(a, b) public static long extgcd(long a, long b, out long x, out long y) { long g = a; x = 1; y = 0; if (b > 0) { g = extgcd(b, a % b, out y, out x); y -= a / b * x; } return g; } public static long lcm(long a, long b) => a / gcd(a, b) * b; }