結果
問題 | No.325 マンハッタン距離2 |
ユーザー |
👑 |
提出日時 | 2019-05-29 04:49:39 |
言語 | D (dmd 2.109.1) |
結果 |
AC
|
実行時間 | 2 ms / 1,000 ms |
コード長 | 2,364 bytes |
コンパイル時間 | 676 ms |
コンパイル使用メモリ | 119,756 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-06-22 01:27:45 |
合計ジャッジ時間 | 1,552 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 24 |
ソースコード
import std.conv, std.functional, std.range, std.stdio, std.string;import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, 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)); }// #{(x, y) | 0 <= x < X, 0 <= y < Y, x + y < D}long solve(long D, long X, long Y) {long ret;ret += D * (D + 1) / 2;if (D - X >= 0) ret -= (D - X) * (D - X + 1) / 2;if (D - Y >= 0) ret -= (D - Y) * (D - Y + 1) / 2;if (D - X - Y >= 0) ret += (D - X - Y) * (D - X - Y + 1) / 2;return ret;}void main() {try {for (; ; ) {const X1 = readLong();const Y1 = readLong();const X2 = readLong();const Y2 = readLong();const D = readLong();long ans;foreach (a; 0 .. 2) foreach (b; 0 .. 2) {long x1 = X1, y1 = Y1, x2 = X2, y2 = Y2;if (a == 0) {chmax(x1, 0);} else {chmin(x2, -1);x1 *= -1;x2 *= -1;swap(x1, x2);}if (b == 0) {chmax(y1, 0);} else {chmin(y2, -1);y1 *= -1;y2 *= -1;swap(y1, y2);}if (x1 <= x2 && y1 <= y2) {ans += solve(D + 1, x1, y1);ans -= solve(D + 1, x2 + 1, y1);ans -= solve(D + 1, x1, y2 + 1);ans += solve(D + 1, x2 + 1, y2 + 1);}}writeln(ans);}} catch (EOFException e) {}}