結果
問題 | No.325 マンハッタン距離2 |
ユーザー |
![]() |
提出日時 | 2025-03-26 15:55:12 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 40 ms / 1,000 ms |
コード長 | 3,737 bytes |
コンパイル時間 | 216 ms |
コンパイル使用メモリ | 82,776 KB |
実行使用メモリ | 54,456 KB |
最終ジャッジ日時 | 2025-03-26 15:56:03 |
合計ジャッジ時間 | 2,145 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 24 |
ソースコード
def count_quadrant1(x1, x2, y1, y2, d):a = max(x1, 0)b = min(x2, d)if a > b:return 0c = max(y1, 0)y2_upper = y2x_end_new = min(b, d - c)if a > x_end_new:return 0split_point = d - y2_upperpart1_start = apart1_end = min(x_end_new, split_point)part2_start = max(a, split_point + 1)part2_end = x_end_newtotal = 0if part1_start <= part1_end:count_y = max(0, y2_upper - c + 1)if count_y > 0:num_x = part1_end - part1_start + 1total += num_x * count_yif part2_start <= part2_end:s = part2_startt = part2_endfirst = d - c + 1 - slast = d - c + 1 - tcount = (first + last) * (t - s + 1) // 2if count > 0:total += countreturn totaldef count_quadrant2(x1, x2, y1, y2, d):a = max(x1, -d)b = min(x2, -1)if a > b:return 0c = max(y1, 0)y2_upper = y2x_start = max(a, c - d)x_end = bif x_start > x_end:return 0split_point = y2_upper - dpart1_start = x_startpart1_end = min(x_end, split_point)part2_start = max(x_start, split_point + 1)part2_end = x_endtotal = 0if part1_start <= part1_end:s = part1_startt = part1_endfirst = (d - c + 1) + slast = (d - c + 1) + tcount = (first + last) * (t - s + 1) // 2total += countif part2_start <= part2_end:count_y = max(0, y2_upper - c + 1)if count_y > 0:num_x = part2_end - part2_start + 1total += num_x * count_yreturn totaldef count_quadrant3(x1, x2, y1, y2, d):a = max(x1, -d)b = min(x2, -1)if a > b:return 0y_lower = y1y_upper = min(y2, -1)if y_lower > y_upper:return 0x_start = max(a, -d - y_upper)x_end = bif x_start > x_end:return 0split_point = -d - y_lowerpart1_start = x_startpart1_end = min(x_end, split_point)part2_start = max(x_start, split_point + 1)part2_end = x_endtotal = 0if part1_start <= part1_end:s = part1_startt = part1_endfirst = y_upper + d + s + 1last = y_upper + d + t + 1count = (first + last) * (t - s + 1) // 2total += countif part2_start <= part2_end:count_y = y_upper - y_lower + 1if count_y > 0:num_x = part2_end - part2_start + 1total += num_x * count_yreturn totaldef count_quadrant4(x1, x2, y1, y2, d):a = max(x1, 0)b = min(x2, d)if a > b:return 0y_lower = y1y_upper = min(y2, -1)if y_lower > y_upper:return 0x_end = min(b, d + y_upper)if a > x_end:return 0split_point = d + y_lowerpart1_start = apart1_end = min(x_end, split_point - 1)part2_start = max(a, split_point)part2_end = x_endtotal = 0if part1_start <= part1_end:count_y = max(0, y_upper - y_lower + 1)if count_y > 0:num_x = part1_end - part1_start + 1total += num_x * count_yif part2_start <= part2_end:s = part2_startt = part2_endfirst = y_upper + d - s + 1last = y_upper + d - t + 1count = (first + last) * (t - s + 1) // 2total += countreturn totaldef main():x1, y1, x2, y2, d = map(int, input().split())total = 0total += count_quadrant1(x1, x2, y1, y2, d)total += count_quadrant2(x1, x2, y1, y2, d)total += count_quadrant3(x1, x2, y1, y2, d)total += count_quadrant4(x1, x2, y1, y2, d)print(total)if __name__ == "__main__":main()