結果
問題 | No.2012 Largest Triangle |
ユーザー | 👑 hos.lyric |
提出日時 | 2022-07-16 22:36:23 |
言語 | D (dmd 2.106.1) |
結果 |
AC
|
実行時間 | 189 ms / 2,500 ms |
コード長 | 3,063 bytes |
コンパイル時間 | 756 ms |
コンパイル使用メモリ | 116,888 KB |
実行使用メモリ | 19,520 KB |
最終ジャッジ日時 | 2023-09-04 17:52:18 |
合計ジャッジ時間 | 9,382 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 1 ms
4,376 KB |
testcase_02 | AC | 1 ms
4,380 KB |
testcase_03 | AC | 1 ms
4,376 KB |
testcase_04 | AC | 1 ms
4,380 KB |
testcase_05 | AC | 1 ms
4,384 KB |
testcase_06 | AC | 1 ms
4,380 KB |
testcase_07 | AC | 1 ms
4,376 KB |
testcase_08 | AC | 1 ms
4,380 KB |
testcase_09 | AC | 1 ms
4,380 KB |
testcase_10 | AC | 1 ms
4,380 KB |
testcase_11 | AC | 2 ms
4,380 KB |
testcase_12 | AC | 1 ms
4,380 KB |
testcase_13 | AC | 2 ms
4,384 KB |
testcase_14 | AC | 1 ms
4,376 KB |
testcase_15 | AC | 2 ms
4,376 KB |
testcase_16 | AC | 186 ms
18,504 KB |
testcase_17 | AC | 183 ms
11,048 KB |
testcase_18 | AC | 182 ms
11,104 KB |
testcase_19 | AC | 186 ms
18,108 KB |
testcase_20 | AC | 182 ms
10,844 KB |
testcase_21 | AC | 188 ms
18,816 KB |
testcase_22 | AC | 187 ms
18,428 KB |
testcase_23 | AC | 185 ms
18,164 KB |
testcase_24 | AC | 188 ms
18,696 KB |
testcase_25 | AC | 187 ms
18,616 KB |
testcase_26 | AC | 186 ms
18,872 KB |
testcase_27 | AC | 187 ms
17,128 KB |
testcase_28 | AC | 188 ms
18,164 KB |
testcase_29 | AC | 188 ms
17,940 KB |
testcase_30 | AC | 187 ms
19,520 KB |
testcase_31 | AC | 187 ms
19,088 KB |
testcase_32 | AC | 185 ms
18,236 KB |
testcase_33 | AC | 187 ms
19,032 KB |
testcase_34 | AC | 186 ms
18,672 KB |
testcase_35 | AC | 189 ms
18,212 KB |
testcase_36 | AC | 3 ms
4,384 KB |
testcase_37 | AC | 3 ms
4,376 KB |
testcase_38 | AC | 2 ms
4,380 KB |
testcase_39 | AC | 3 ms
4,380 KB |
testcase_40 | AC | 2 ms
4,384 KB |
testcase_41 | AC | 46 ms
5,668 KB |
ソースコード
import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } struct Point(T) { T x, y; Pt opBinary(string op)(Pt a) const { static if (op == "+") return Pt(x + a.x, y + a.y); else static if (op == "-") return Pt(x - a.x, y - a.y); else static assert(false); } Pt opBinary(string op)(T k) const { static if (op == "*") return Pt(x * k, y * k); else static if (op == "/") return Pt(x / k, y / k); else static assert(false); } T dot(Pt a) const { return x * a.x + y * a.y; } T det(Pt a) const { return x * a.y - y * a.x; } int opCmp(Pt a) const { return (x < a.x) ? -1 : (x > a.x) ? +1 : (y < a.y) ? -1 : (y > a.y) ? +1 : 0; } string toString() const { return "(" ~ x.to!string ~ ", " ~ y.to!string ~ ")"; } } alias Pt = Point!long; int sig(long r) { return cast(int)(sgn(r)); } long tri(Pt a, Pt b, Pt c) { return (b.x - a.x) * (c.y - a.y) - (b.y - a.y) * (c.x - a.x); } Pt[] convexHull(Pt[] ps) { auto qs = new Pt[ps.length + 1]; ps.sort!((a, b) => ((a.x != b.x) ? (a.x < b.x) : (a.y < b.y))); int m = 0; foreach (p; ps) { for (; m > 1 && sig(tri(qs[m - 2], qs[m - 1], p)) <= 0; --m) {} qs[m++] = p; } const r = m; foreach_reverse (p; ps) { for (; m > r && sig(tri(qs[m - 2], qs[m - 1], p)) <= 0; --m) {} qs[m++] = p; } return qs[0 .. m - 1]; } void main() { try { for (; ; ) { const N = readInt; auto P = new Pt[N]; foreach (i; 0 .. N) { P[i].x = readLong; P[i].y = readLong; } const qs = P.convexHull; const qsLen = cast(int)(qs.length); long ans; long check(int i, int j) { if (j >= qsLen) j -= qsLen; const area = abs(qs[i].det(qs[j])); chmax(ans, area); return area; } for (int i = 0, j; i < qsLen; ++i) { for (; check(i, j) < check(i, j + 1); ++j) {} } writeln(ans); } } catch (EOFException e) { } }