提出 #73387304

ソースコード 拡げる

l_1 = input().split(" ")
board_size = int(l_1[0])
a = int(l_1[1])
b = int(l_1[2])

t_ad = []
for _ in range(a):
  board = input().split(" ")
  for i in range(int(board[0]), int(board[2])-int(board[0])+2):
    for j in range(int(board[1]), int(board[3])-int(board[1])+2):
      t_ad.append([i, j])

a_ad = []
for _ in range(b):
  board = input().split(" ")
  for i in range(int(board[0]), int(board[2])-int(board[0])+2):
    for j in range(int(board[1]), int(board[3])-int(board[1])+2):
      if [i, j] not in a_ad:
        a_ad.append([i, j])
    
overlap = 0
for square in a_ad:
  if square in t_ad:
    overlap += 1
    
print(overlap)

提出情報

提出日時
問題 D - 広告エリアの重複調査
ユーザ henryzh
言語 Python (PyPy 3.11-v7.3.20)
得点 0
コード長 664 Byte
結果 WA
実行時間 > 2000 ms
メモリ > 1048576 KiB

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 0 / 400
結果
AC × 1
WA × 2
AC × 26
WA × 19
TLE × 17
MLE × 14
セット名 テストケース
Sample sample01.txt, sample02.txt, sample03.txt
All sample01.txt, sample02.txt, sample03.txt, in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in40.txt, in41.txt, in42.txt, in43.txt, in44.txt, in45.txt, in46.txt, in47.txt, in48.txt, in49.txt, in50.txt, in51.txt, in52.txt, in53.txt, in54.txt, in55.txt, in56.txt, in57.txt, in58.txt, in59.txt, in60.txt, in61.txt, in62.txt, in63.txt, in64.txt, in65.txt, in66.txt, in67.txt, in68.txt, in69.txt, in70.txt, in71.txt, in72.txt, in73.txt
ケース名 結果 実行時間 メモリ
in01.txt AC 55 ms 79940 KiB
in02.txt AC 56 ms 79860 KiB
in03.txt TLE > 2000 ms 146316 KiB
in04.txt WA 56 ms 79996 KiB
in05.txt AC 55 ms 79988 KiB
in06.txt TLE > 2000 ms 114568 KiB
in07.txt TLE > 2000 ms 114176 KiB
in08.txt WA 56 ms 80084 KiB
in09.txt TLE > 2000 ms 115364 KiB
in10.txt TLE > 2000 ms 811720 KiB
in11.txt TLE > 2000 ms 237396 KiB
in12.txt TLE > 2000 ms 366512 KiB
in13.txt TLE > 2000 ms 146520 KiB
in14.txt TLE > 2000 ms 237620 KiB
in15.txt TLE > 2000 ms 127304 KiB
in16.txt WA 57 ms 80580 KiB
in17.txt MLE 1670 ms > 1048576 KiB
in18.txt AC 207 ms 143712 KiB
in19.txt AC 57 ms 80760 KiB
in20.txt TLE > 2000 ms 178032 KiB
in21.txt TLE > 2000 ms 332224 KiB
in22.txt MLE 1632 ms > 1048576 KiB
in23.txt MLE 1654 ms > 1048576 KiB
in24.txt WA 375 ms 108936 KiB
in25.txt MLE 1632 ms > 1048576 KiB
in26.txt TLE > 2000 ms 110380 KiB
in27.txt WA 57 ms 80460 KiB
in28.txt AC 104 ms 107532 KiB
in29.txt AC 56 ms 79960 KiB
in30.txt WA 60 ms 87892 KiB
in31.txt AC 56 ms 79840 KiB
in32.txt AC 59 ms 86420 KiB
in33.txt WA 56 ms 79712 KiB
in34.txt TLE > 2000 ms 110592 KiB
in35.txt AC 56 ms 80064 KiB
in36.txt WA 59 ms 86100 KiB
in37.txt MLE 1628 ms > 1048576 KiB
in38.txt AC 56 ms 79700 KiB
in39.txt AC 96 ms 107260 KiB
in40.txt AC 57 ms 79696 KiB
in41.txt AC 62 ms 90568 KiB
in42.txt AC 56 ms 79676 KiB
in43.txt WA 56 ms 79840 KiB
in44.txt MLE 1626 ms > 1048576 KiB
in45.txt MLE 1630 ms > 1048576 KiB
in46.txt MLE 1628 ms > 1048576 KiB
in47.txt TLE > 2000 ms 111612 KiB
in48.txt WA 58 ms 80852 KiB
in49.txt AC 57 ms 80856 KiB
in50.txt MLE 1629 ms > 1048576 KiB
in51.txt TLE > 2000 ms 299708 KiB
in52.txt MLE 1634 ms > 1048576 KiB
in53.txt TLE > 2000 ms 135848 KiB
in54.txt AC 100 ms 146736 KiB
in55.txt WA 99 ms 146524 KiB
in56.txt AC 56 ms 79956 KiB
in57.txt WA 56 ms 79712 KiB
in58.txt AC 56 ms 79944 KiB
in59.txt WA 56 ms 79864 KiB
in60.txt AC 56 ms 79776 KiB
in61.txt WA 56 ms 79840 KiB
in62.txt AC 56 ms 80000 KiB
in63.txt MLE 1637 ms > 1048576 KiB
in64.txt MLE 1632 ms > 1048576 KiB
in65.txt AC 56 ms 79816 KiB
in66.txt AC 56 ms 79840 KiB
in67.txt MLE 1626 ms > 1048576 KiB
in68.txt MLE 1629 ms > 1048576 KiB
in69.txt AC 57 ms 79560 KiB
in70.txt WA 57 ms 79840 KiB
in71.txt WA 57 ms 79788 KiB
in72.txt WA 57 ms 79912 KiB
in73.txt AC 57 ms 80856 KiB
sample01.txt AC 56 ms 79772 KiB
sample02.txt WA 55 ms 79984 KiB
sample03.txt WA 65 ms 98720 KiB