結果
問題 | No.2790 Athena 3 |
ユーザー |
![]() |
提出日時 | 2024-06-21 21:45:54 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 47 ms / 2,000 ms |
コード長 | 2,343 bytes |
コンパイル時間 | 256 ms |
コンパイル使用メモリ | 82,600 KB |
実行使用メモリ | 56,940 KB |
最終ジャッジ日時 | 2024-06-21 21:45:56 |
合計ジャッジ時間 | 2,116 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 44 ms
55,692 KB |
testcase_01 | AC | 45 ms
55,188 KB |
testcase_02 | AC | 47 ms
54,640 KB |
testcase_03 | AC | 44 ms
56,592 KB |
testcase_04 | AC | 42 ms
55,008 KB |
testcase_05 | AC | 44 ms
55,324 KB |
testcase_06 | AC | 44 ms
55,936 KB |
testcase_07 | AC | 44 ms
56,200 KB |
testcase_08 | AC | 44 ms
56,472 KB |
testcase_09 | AC | 43 ms
56,564 KB |
testcase_10 | AC | 44 ms
55,492 KB |
testcase_11 | AC | 44 ms
55,260 KB |
testcase_12 | AC | 43 ms
55,920 KB |
testcase_13 | AC | 44 ms
55,764 KB |
testcase_14 | AC | 45 ms
56,512 KB |
testcase_15 | AC | 44 ms
54,512 KB |
testcase_16 | AC | 44 ms
56,940 KB |
ソースコード
import sys from collections import defaultdict, deque, Counter from heapq import heapify, heappush, heappop, merge from bisect import bisect_right, bisect_left left_binser = lower_bound = bisect_left ; right_binser = upper_bound = bisect_right from itertools import permutations, combinations, accumulate # from math import lcm,gcd # from math import comb, perm # from functools import lru_cache # from types import GeneratorType MOD = 10**9 + 7 _MOD = 998244353 YES = "YES" NO = "NO" ALICE = "Alice" BOB = "Bob" def FLOOR_DIV(a, b) : return a // b def CEIL_DIV(a, b) : return (a // b) + (not(not(a % b))) def get() : return map(int, sys.stdin.readline().split()) def getone() : return int(sys.stdin.readline().strip()) def getstr() : return sys.stdin.readline().split() def getonestr() : return sys.stdin.readline().strip() def getarr() : return list(map(int, sys.stdin.readline().split())) def _3d_ARRAY_SPAWN(i, j, k) : return [[[0 for _k in range(k)] for _j in range(j)] for _i in range(i)] def _2d_ARRAY_SPAWN(i, j) : return [[0 for _j in range(j)] for _i in range(i)] """ "never doubt that u can't do this, cause it's an insult to ur determination" by @deepakgoswami0552 10/03/2024 """ def solve() : ... # Solution here! def area(x1,y1, x2,y2, x3,y3) : return 0.5 * abs(x1*(y2 - y3) + x2*(y3 - y1) + x3*(y1 - y2)) x1,y1,x2,y2,x3,y3 = get() ans = 0 for conf in range(64) : conf1 = conf & 3 conf2 = (conf >> 2) & 3 conf3 = (conf >> 4) & 3 a1,a2,b1,b2,c1,c2 = x1,y1,x2,y2,x3,y3 if conf1 == 0 : a1 += 1 if conf1 == 1 : a1 -= 1 if conf1 == 2 : a2 += 1 if conf1 == 3 : a2 -= 1 if conf2 == 0 : b1 += 1 if conf2 == 1 : b1 -= 1 if conf2 == 2 : b2 += 1 if conf2 == 3 : b2 -= 1 if conf3 == 0 : c1 += 1 if conf3 == 1 : c1 -= 1 if conf3 == 2 : c2 += 1 if conf3 == 3 : c2 -= 1 ans = max(ans, area(a1,a2, b1,b2, c1,c2)) return ans """""" testcase = "" # testcase = "multiple" # Multiple tc if testcase == "multiple" : for i in range(int(input())) : print(solve()) # solve() ... else : print(solve()) # solve() ...