結果

問題 No.1477 Lamps on Graph
ユーザー McGregorshMcGregorsh
提出日時 2022-07-19 21:58:48
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 667 ms / 2,000 ms
コード長 2,103 bytes
コンパイル時間 173 ms
コンパイル使用メモリ 82,048 KB
実行使用メモリ 134,144 KB
最終ジャッジ日時 2024-07-02 01:53:31
合計ジャッジ時間 18,991 ms
ジャッジサーバーID
(参考情報)
judge5 / judge4
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 148 ms
89,216 KB
testcase_01 AC 155 ms
89,088 KB
testcase_02 AC 147 ms
89,216 KB
testcase_03 AC 153 ms
89,088 KB
testcase_04 AC 148 ms
89,216 KB
testcase_05 AC 156 ms
89,088 KB
testcase_06 AC 151 ms
89,088 KB
testcase_07 AC 156 ms
89,088 KB
testcase_08 AC 152 ms
89,216 KB
testcase_09 AC 155 ms
89,216 KB
testcase_10 AC 146 ms
89,088 KB
testcase_11 AC 154 ms
89,088 KB
testcase_12 AC 411 ms
102,272 KB
testcase_13 AC 399 ms
106,240 KB
testcase_14 AC 456 ms
106,112 KB
testcase_15 AC 290 ms
94,976 KB
testcase_16 AC 305 ms
97,664 KB
testcase_17 AC 301 ms
97,664 KB
testcase_18 AC 539 ms
121,600 KB
testcase_19 AC 424 ms
106,352 KB
testcase_20 AC 259 ms
93,056 KB
testcase_21 AC 466 ms
115,456 KB
testcase_22 AC 232 ms
91,008 KB
testcase_23 AC 330 ms
96,128 KB
testcase_24 AC 523 ms
112,640 KB
testcase_25 AC 281 ms
94,336 KB
testcase_26 AC 544 ms
115,584 KB
testcase_27 AC 316 ms
95,872 KB
testcase_28 AC 378 ms
101,504 KB
testcase_29 AC 339 ms
98,176 KB
testcase_30 AC 333 ms
104,704 KB
testcase_31 AC 313 ms
98,944 KB
testcase_32 AC 629 ms
128,512 KB
testcase_33 AC 607 ms
128,640 KB
testcase_34 AC 334 ms
134,144 KB
testcase_35 AC 667 ms
123,904 KB
testcase_36 AC 663 ms
121,600 KB
testcase_37 AC 623 ms
118,912 KB
testcase_38 AC 652 ms
119,040 KB
testcase_39 AC 657 ms
120,576 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

import sys, re
from fractions import Fraction
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque, defaultdict
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement, permutations
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
def get_distance(x1, y1, x2, y2):
	  d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)
	  return d
def rotate(table):
   	  n_fild = []
   	  for x in zip(*table[::-1]):
   	  	  n_fild.append(x)
   	  return n_fild
sys.setrecursionlimit(10 ** 7)
INF = float('inf')
MOD = 10 ** 9 + 7
MOD2 = 998244353


###関数コピーしたか?###
def main():
   
   n, m = i_map()
   A = i_list()
   lines = []
   for i in range(n):
   	  lines.append([A[i], i])
   lines.sort()
   
   nums = [[] for i in range(n)]
   for i in range(m):
   	  a, b = i_map()
   	  a -= 1
   	  b -= 1
   	  nums[a].append(b)
   	  nums[b].append(a)
   
   k = int(input())
   B = i_list()
   
   juge = [False] * n
   for i in range(k):
   	  juge[B[i]-1] = True
   
   cou = []
   for i in range(n):
   	  score, num = lines[i]
   	  if juge[num]:
   	  	  juge[num] = False
   	  	  cou.append(num+1)
   	  	  for j in nums[num]:
   	  	  	  if A[num] < A[j]:
   	  	  	  	  juge[j] = not juge[j]
   
   if len(cou) != 0:
   	  print(len(cou))
   	  for i in cou:
   	  	  print(i)
   else:
   	  print(-1)
   
   
   
if __name__ == '__main__':
    main()


0