結果
問題 | No.1468 Colourful Pastel |
ユーザー | Renoirryou |
提出日時 | 2021-04-04 12:44:52 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,067 bytes |
コンパイル時間 | 98 ms |
コンパイル使用メモリ | 11,160 KB |
実行使用メモリ | 47,180 KB |
最終ジャッジ日時 | 2023-08-27 18:04:39 |
合計ジャッジ時間 | 6,124 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | WA | - |
testcase_02 | AC | 154 ms
31,580 KB |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | AC | 148 ms
31,540 KB |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | AC | 150 ms
31,720 KB |
testcase_24 | AC | 151 ms
31,476 KB |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | AC | 182 ms
46,932 KB |
ソースコード
import pprint, bisect, time, functools, collections, copy, heapq, math, string, sys, re from typing import List, Any import itertools as it import numpy as np import scipy as sc ts = time.time() # --end--# class Funcinput: def __init__(self): pass def InputStrList(self, N): li = [input() for _ in range(N)] return li def InputStrMultiple(self): return sys.stdin.readline().rstrip().split() def InputIntMultiple(self): return map(int, input().split()) def InputIntList(self): return list(map(int, input().split())) def InputIntListCycle(self, N): li = [list(map(int, input().split())) for _ in range(N)] return (li) def InputStrListCycle(self, N): li = [input().split() for _ in range(N)] return li def InputStrColumn(self): x = input() li = [] for i in range(len(x)): li.append(x[i]) return li class ListFunc: def __init__(self): pass def UniqueListInt(self, R): li = [list(map(int, input().split())) for _ in range(R)] li_uniq = list(set(li)) return li_uniq def UniqueListStrSingle(self, R): li = [input() for _ in range(R)] li_uniq = list(set(li)) return li_uniq def UniqueListStrMultiple(self, R): li = [sys.stdin.readline().rstrip().split() for _ in range(R)] li_uniq = list(set(li)) return li_uniq def DoubledList(self, l): l1 = l.copy() ret = [None] * (len(l) + len(l1)) ret[::2] = l ret[1::2] = l1 return ret def SplitListDouble(self, l): x, y = [], [] x = l[::2] y = l[1::2] return x, y def str_to_int_sort(str_, x): # 0 = normal, 1 = reverse. unaccept alphabet if x == 0: st = sorted(str_) st = ''.join(map(str, st)) return int(st) elif x == 1: st = list(str_) st.sort(reverse=True) st = ''.join(map(str, st)) return int(st) else: print(-1) def make_divisors(x): l_div, u_div = [], [] i = 1 while i * i <= x: if x % i == 0: l_div.append(i) if i != x // i: u_div.append((x // 1)) i += 1 return l_div + u_div[::-1] def reverse(S): X = [] str = "" for i in range(len(S)): i += 1 X.append(S[-i]) return str.join(X) def permutation(l): return list(it.permutations(l)) def combination(l, p): return list(it.combinations(l, p)) def getNearestNum(l, n): idx = np.abs(np.asarray(l) - n).argmin() return l[idx] def ketanowa(n): x = sum(list(map(int, str(n)))) return x # --instance--# fni = Funcinput() fnl = ListFunc() out = print # --solve--# def solve(): n = int(input()) a = list(input().split()) b = list(input().split()) for i in a: if i in b: continue else: print(i) exit() solve() # te = time.time() # print(te-ts)