結果
問題 | No.759 悪くない忘年会にしような! |
ユーザー | matsu7874 |
提出日時 | 2018-12-02 16:53:25 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 1,281 bytes |
コンパイル時間 | 303 ms |
コンパイル使用メモリ | 12,672 KB |
実行使用メモリ | 31,772 KB |
最終ジャッジ日時 | 2024-09-13 11:58:23 |
合計ジャッジ時間 | 18,938 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 32 ms
17,820 KB |
testcase_01 | AC | 31 ms
10,880 KB |
testcase_02 | AC | 30 ms
10,880 KB |
testcase_03 | AC | 30 ms
10,880 KB |
testcase_04 | AC | 31 ms
10,880 KB |
testcase_05 | AC | 31 ms
10,880 KB |
testcase_06 | AC | 31 ms
10,880 KB |
testcase_07 | AC | 31 ms
10,880 KB |
testcase_08 | AC | 31 ms
10,880 KB |
testcase_09 | AC | 31 ms
10,880 KB |
testcase_10 | AC | 31 ms
10,880 KB |
testcase_11 | AC | 30 ms
10,880 KB |
testcase_12 | AC | 30 ms
10,880 KB |
testcase_13 | AC | 30 ms
10,880 KB |
testcase_14 | AC | 30 ms
10,880 KB |
testcase_15 | AC | 31 ms
10,880 KB |
testcase_16 | AC | 30 ms
10,880 KB |
testcase_17 | AC | 31 ms
10,752 KB |
testcase_18 | AC | 30 ms
10,880 KB |
testcase_19 | AC | 31 ms
10,880 KB |
testcase_20 | AC | 30 ms
10,752 KB |
testcase_21 | AC | 31 ms
10,752 KB |
testcase_22 | AC | 31 ms
10,752 KB |
testcase_23 | AC | 30 ms
10,880 KB |
testcase_24 | AC | 30 ms
10,880 KB |
testcase_25 | AC | 30 ms
10,752 KB |
testcase_26 | AC | 30 ms
10,880 KB |
testcase_27 | AC | 30 ms
10,752 KB |
testcase_28 | AC | 31 ms
10,880 KB |
testcase_29 | AC | 30 ms
10,880 KB |
testcase_30 | AC | 30 ms
10,752 KB |
testcase_31 | AC | 30 ms
10,880 KB |
testcase_32 | AC | 30 ms
10,880 KB |
testcase_33 | AC | 100 ms
12,160 KB |
testcase_34 | AC | 39 ms
11,008 KB |
testcase_35 | AC | 61 ms
11,392 KB |
testcase_36 | AC | 81 ms
12,160 KB |
testcase_37 | AC | 43 ms
11,264 KB |
testcase_38 | AC | 100 ms
12,160 KB |
testcase_39 | AC | 41 ms
11,136 KB |
testcase_40 | AC | 69 ms
11,904 KB |
testcase_41 | AC | 83 ms
12,032 KB |
testcase_42 | AC | 96 ms
12,416 KB |
testcase_43 | AC | 108 ms
12,416 KB |
testcase_44 | AC | 694 ms
27,904 KB |
testcase_45 | AC | 852 ms
27,904 KB |
testcase_46 | AC | 768 ms
27,776 KB |
testcase_47 | AC | 870 ms
27,904 KB |
testcase_48 | AC | 838 ms
27,776 KB |
testcase_49 | AC | 106 ms
12,416 KB |
testcase_50 | AC | 112 ms
12,544 KB |
testcase_51 | AC | 118 ms
12,416 KB |
testcase_52 | AC | 102 ms
12,544 KB |
testcase_53 | AC | 752 ms
27,776 KB |
testcase_54 | AC | 826 ms
27,904 KB |
testcase_55 | AC | 742 ms
27,904 KB |
testcase_56 | AC | 733 ms
27,776 KB |
testcase_57 | AC | 842 ms
27,776 KB |
testcase_58 | AC | 747 ms
27,776 KB |
testcase_59 | AC | 774 ms
27,776 KB |
testcase_60 | AC | 750 ms
27,776 KB |
testcase_61 | AC | 753 ms
28,032 KB |
testcase_62 | AC | 680 ms
27,904 KB |
testcase_63 | TLE | - |
testcase_64 | -- | - |
testcase_65 | -- | - |
testcase_66 | -- | - |
ソースコード
def main(): n = int(input()) points = [tuple(map(int, input().split())) for i in range(n)] is_efficient = [True for i in range(n)] for i in range(n - 1): if not is_efficient[i]: continue for j in range(i + 1, n): if not is_efficient[j]: continue if any([ points[i][0] > points[j][0] and points[i][1] >= points[j][1] and points[i][2] >= points[j][2], points[i][0] >= points[j][0] and points[i][1] > points[j][1] and points[i][2] >= points[j][2], points[i][0] >= points[j][0] and points[i][1] >= points[j][1] and points[i][2] > points[j][2], ]): is_efficient[j] = False elif any([ points[i][0] < points[j][0] and points[i][1] <= points[j][1] and points[i][2] <= points[j][2], points[i][0] <= points[j][0] and points[i][1] < points[j][1] and points[i][2] <= points[j][2], points[i][0] <= points[j][0] and points[i][1] <= points[j][1] and points[i][2] < points[j][2], ]): is_efficient[i] = False break for i in range(n): if is_efficient[i]: print(i + 1) if __name__ == '__main__': main()