結果
問題 | No.635 自然門松列 |
ユーザー | tottoripaper |
提出日時 | 2018-01-20 01:29:26 |
言語 | Haskell (9.8.2) |
結果 |
AC
|
実行時間 | 7 ms / 650 ms |
コード長 | 1,635 bytes |
コンパイル時間 | 8,498 ms |
コンパイル使用メモリ | 177,708 KB |
実行使用メモリ | 11,264 KB |
最終ジャッジ日時 | 2023-09-05 13:10:56 |
合計ジャッジ時間 | 2,223 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
7,040 KB |
testcase_01 | AC | 3 ms
7,244 KB |
testcase_02 | AC | 4 ms
7,752 KB |
testcase_03 | AC | 3 ms
7,948 KB |
testcase_04 | AC | 3 ms
7,568 KB |
testcase_05 | AC | 7 ms
11,136 KB |
testcase_06 | AC | 7 ms
11,116 KB |
testcase_07 | AC | 7 ms
11,140 KB |
testcase_08 | AC | 3 ms
7,904 KB |
testcase_09 | AC | 3 ms
7,880 KB |
testcase_10 | AC | 7 ms
11,156 KB |
testcase_11 | AC | 7 ms
11,148 KB |
testcase_12 | AC | 7 ms
11,040 KB |
testcase_13 | AC | 7 ms
11,052 KB |
testcase_14 | AC | 7 ms
11,264 KB |
testcase_15 | AC | 2 ms
7,272 KB |
testcase_16 | AC | 3 ms
7,228 KB |
testcase_17 | AC | 7 ms
11,156 KB |
testcase_18 | AC | 7 ms
11,108 KB |
testcase_19 | AC | 7 ms
11,108 KB |
testcase_20 | AC | 7 ms
11,220 KB |
testcase_21 | AC | 7 ms
11,156 KB |
testcase_22 | AC | 7 ms
11,216 KB |
testcase_23 | AC | 7 ms
11,136 KB |
コンパイルメッセージ
Loaded package environment from /home/judge/.ghc/x86_64-linux-9.6.1/environments/default [1 of 2] Compiling Main ( Main.hs, Main.o ) [2 of 2] Linking a.out
ソースコード
import Control.Monad (replicateM) import Data.List (nub) data Length = Short | Long deriving (Eq, Show) f x y x1 y1 | x < x1 = if y <= y1 then (Short, (0, 10000), Long, (10000, 10000)) else (Short, (0, t), Long, (t, 10000)) | x == x1 = if y < y1 then (Long, (0, 0), Short, (0, 10000)) else if y == y1 then (Short, (0, 0), Long, (0, 0)) else (Short, (0, 0), Long, (0, 10000)) | otherwise = if y < y1 then (Long, (0, t), Short, (t, 10000)) else (Long, (0, 10000), Short, (10000, 10000)) where t = - (x - x1) / (y - y1) -- [-, -)同士 intersect (a1, b1) (a2, b2) = a1 /= b1 && a2 /= b2 && not (b2 <= a1 || b1 <= a2) -- [-, -)と(-, -] intersect' (a1, b1) (a2, b2) = a1 /= b1 && a2 /= b2 && not (b2 < a1 || b1 <= a2) main = do n <- readLn replicateM n $ do [x2, x1, x3, y2, y1, y3] <- fmap (map ((fromIntegral :: Int -> Double) . read) . words) getLine let (l1, r1, l2, r2) = f x2 y2 x1 y1 (l1', r1', l2', r2') = f x3 y3 x1 y1 can = (maximum [ x1, x2, x3 ] == x1 || minimum [ x1, x2, x3 ] == x1) && length (nub [ x1, x2, x3 ]) == length [ x1, x2, x3 ] || (maximum [ y1, y2, y3 ] == y1 || minimum [ y1, y2, y3 ] == y1) && length (nub [ y1, y2, y3 ]) == length [ y1, y2, y3 ] || (x2 - x1) * (y3 - y1) /= (x3 - x1) * (y2 - y1) && (if l1 == l1' then intersect r1 r1' || intersect r2 r2' else intersect' r1 r2' || intersect' r1' r2) putStrLn $ if can then "YES" else "NO"