problem_id stringlengths 6 6 | user_id stringlengths 10 10 | time_limit float64 1k 8k | memory_limit float64 262k 1.05M | problem_description stringlengths 48 1.55k | codes stringlengths 35 98.9k | status stringlengths 28 1.7k | submission_ids stringlengths 28 1.41k | memories stringlengths 13 808 | cpu_times stringlengths 11 610 | code_sizes stringlengths 7 505 |
|---|---|---|---|---|---|---|---|---|---|---|
p02779 | u539367121 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["n=int(input())\na=list(map(int,input().split()))\nprint ('Yes' if len(a)==len(set(a)) else 'No')", "n=int(input())\na=list(map(int,input().split()))\nprint ('YES' if len(a)==len(set(a)) else 'NO')\n"] | ['Wrong Answer', 'Accepted'] | ['s386451349', 's592510555'] | [31112.0, 31220.0] | [98.0, 88.0] | [94, 95] |
p02779 | u540631540 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['n = int(input())\na = input().split()\nx = 0\nfor i in a:\n b = a.pop(0)\n if b in a:\n x += 1\n break\nif x == 1:\n print("No")\nelse:\n print("Yes")', 'n = int(input())\na = input().split()\nd = dict()\nfor i in a:\n d[i] = 0\nif len(d) == len(a):\n print("YES")\nelse:\n print("NO")'] | ['Wrong Answer', 'Accepted'] | ['s968949149', 's705201957'] | [19280.0, 38836.0] | [2104.0, 82.0] | [165, 132] |
p02779 | u541610817 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["n = int(input())\nA = [int(x) for x in input().split()]\nprint('YES' if len(A) = len(set(A)) else 'NO')", "n = int(input())\nA = [int(x) for x in input().split()]\nprint('YES' if len(A) == len(set(A)) else 'NO')\n"] | ['Runtime Error', 'Accepted'] | ['s540266994', 's557331637'] | [2940.0, 25936.0] | [17.0, 90.0] | [101, 103] |
p02779 | u541806319 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["import sys\nmsg = sys.stdin.readlines()\na = []\nfor x in msg:\n a.append(x.replace('\\n', ''))\narra = a[1].split(' ')\narra = [int(x) for x in arra]\nif arra == set(arra):\n print('YES')\nelse:\n print('NO')", "import sys\nmsg = sys.stdin.readlines()\na = []\nfor x in msg:\n a.append(x.replace('\\n', ''))\narra = a[1].split(' ')\narra = [int(x) for x in arra]\nif len(arra) == len(set(arra)):\n print('YES')\nelse:\n print('NO')"] | ['Wrong Answer', 'Accepted'] | ['s138580829', 's261936511'] | [29148.0, 29020.0] | [93.0, 100.0] | [201, 211] |
p02779 | u542774596 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['x = int(input())\na = list(map(int, input().split()))\nrslt = len(set(a))\nprint("Yes" if x == rslt else "No")', 'x = int(input())\na = list(map(int, input().split()))\nrslt = len(set(a))\nprint("YES" if x == rslt else "NO")'] | ['Wrong Answer', 'Accepted'] | ['s763625763', 's969182931'] | [31048.0, 31192.0] | [95.0, 93.0] | [107, 107] |
p02779 | u546074985 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["N = int(input())\nA = list(map(int, input().split()))\n\nd = {x:0 for x in A}\nfor x in A:\n d[x] += 1\n\nif max(d.values()) >= 2:\n print('No')\nelse:\n print('Yes')", "N = int(input())\nA = list(map(int, input().split()))\n\nd = {x:0 for x in A}\nfor x in A:\n d[x] += 1\n\nif max(d.values()) >= 2:\n print('NO')\nelse:\n print('YES')"] | ['Wrong Answer', 'Accepted'] | ['s465585983', 's904278106'] | [32948.0, 32960.0] | [129.0, 127.0] | [165, 165] |
p02779 | u546104065 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["i = int(input())\nW = list(map(int, input().split()))\n\nif i-len(set(W))==0:\n print('Yes')\nelse:\n print('No')", "i = int(input())\nW = list(map(int, input().split()))\n\nif i-len(set(W))==0:\n print('YES')\nelse:\n print('NO')"] | ['Wrong Answer', 'Accepted'] | ['s209533355', 's147865753'] | [26808.0, 26808.0] | [84.0, 83.0] | [113, 113] |
p02779 | u546338822 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["n = int(input())\na = list(map(int,input().split()))\n\ndef loop(n):\n for i in range(n):\n for j in range(i+1,n):\n if a[i]==a[j]:\n print('No')\n return\n print('Yes')\n\nloop(n)", "n = int(input())\na = list(map(int,input().split()))\n\nif len(a) == len(set(a)):\n print('Yes')\n \nelse:\n print('No')\n ", "n = int(input())\na = list(map(int,input().split()))\n\nif len(a) == len(set(a)):\n print('Yes')\n \nelse:\n print('No')", "n = int(input())\na = list(map(int,input().split()))\n\nif n == len(set(a)):\n print('YES')\nelse:\n print('NO')"] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s245098935', 's616714758', 's921983160', 's583216030'] | [26804.0, 26808.0, 26808.0, 26808.0] | [2108.0, 88.0, 88.0, 83.0] | [193, 119, 116, 112] |
p02779 | u547298813 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["S = int(input())\nA = input()\nz = ''\narr1 = [i for i in A.split(' ')]\nfor i in range(S):\n\tfor j in range(i+1, S):\n\t\tif(arr1[i]==arr1[j]):\n\t\t\tz = 'YES'\n\t\t\tbreak\nif(z=='YES'):\n\tprint(z)\nelse:\n\tprint('NO')", "S = int(input())\nA = input()\narr1 = [i for i in A.split(' ')]\nfor i in range(S):\n\tfor j in range(S):\n\t\tif(arr1[i]==arr1[j]):\n\t\t\tprint('NO')\n\t\t\tbreak\nprint('YES')", 'n = int(input())\narr = [int(n) for n in input().split()]\n_set = set()\nfor i in range(0, n):\n _set.add(arr[i])\nprint("YES") if len(_set) == len(arr) else print("NO")'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s788154189', 's890190303', 's857978553'] | [22840.0, 21716.0, 25168.0] | [2105.0, 2105.0, 125.0] | [201, 161, 167] |
p02779 | u549383771 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["import numpy as np\nn = input()\nnum_list = list(map(int,input().split()))\nnum_list = np.sort(num_list)\n\nflag = False\nfor i in range(len(num_list)):\n if i == len(num_list)-1:\n break\n \n if num_list[i] == num_list[i+1]:\n flag = True\n break\n \nif flag:\n print('No')\n\nelse:\n print('Yes')", "import numpy as np\nn = input()\nnum_list = list(map(int,input().split()))\nnum_list = np.sort(num_list)\n\nflag = False\nfor i in range(len(num_list)):\n if i == len(num_list)-1:\n break\n \n if num_list[i] == num_list[i+1]:\n flag = True\n break\n \nif flag:\n print('NO')\n\nelse:\n print('YES')"] | ['Wrong Answer', 'Accepted'] | ['s743476935', 's972425889'] | [34196.0, 34172.0] | [312.0, 332.0] | [323, 323] |
p02779 | u550146922 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['import collections\nn = int(input())\na = list(map(int,input().split()))\n\nli = collections.Counter(a)\n\nli2 = [i for i in li.values()]\n\nif max(li2)==1:\n print("Yes")\nelse:\n print("No")\n \n', 'import collections\nn = int(input())\na = list(map(int,input().split()))\n\nli = collections.Counter(a)\n\nli2 = [i for i in li.values()]\n\nif max(li2)==1:\n print("YES")\nelse:\n print("NO")\n \n'] | ['Wrong Answer', 'Accepted'] | ['s014339801', 's539199365'] | [35896.0, 35684.0] | [111.0, 104.0] | [193, 193] |
p02779 | u552143188 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["N = int(input())\nA = [int(a) for a in input().split()]\nB = list(set(A))\nif len(A) == len(B):\n print('Yes')\nelse:\n print('No')", "N = int(input())\nA = [int(a) for a in input().split()]\nB = list(set(A))\nif len(A) == len(B):\n print('YES')\nelse:\n print('NO')"] | ['Wrong Answer', 'Accepted'] | ['s139627704', 's813961705'] | [25936.0, 25172.0] | [103.0, 99.0] | [127, 127] |
p02779 | u555878443 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['n = int(input())\n\na = list(map(int, input().split()))\n\n\nx = len(set(a))\n\n\nif x == len(a):\n print("Yes")\nelse:\n print("No")', 'n = int(input())\n\na = list(map(int, input().split()))\n\n\nx = len(set(a))\n\n\nif x == len(a):\n print("YES")\nelse:\n print("NO")'] | ['Wrong Answer', 'Accepted'] | ['s313107702', 's892492157'] | [31220.0, 31180.0] | [85.0, 91.0] | [128, 128] |
p02779 | u556225812 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["N = int(input())\nlst = list(map(int, input().split()))\nsets = set(lst)\nif len(lst) == len(sets):\n print('Yes')\nelse:\n print('No')", "N = int(input())\nlst = list(map(int, input().split()))\nsets = set(lst)\nif len(lst) == len(sets):\n print('YES')\nelse:\n print('NO')\n"] | ['Wrong Answer', 'Accepted'] | ['s779639247', 's807570117'] | [25172.0, 26808.0] | [92.0, 94.0] | [131, 132] |
p02779 | u558494840 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['n = int(input())\na = list(map(int, input().split()))\ns = set(a)\n\nif len(a) == len(s):\n print("Yes")\nelse:\n print("No")\n \n', 'n = int(input())\na = list(map(int, input().split()))\ns = set(a)\n\nif len(a) == len(s):\n print("YES")\nelse:\n print("NO")\n '] | ['Wrong Answer', 'Accepted'] | ['s469723434', 's849862335'] | [26808.0, 26804.0] | [89.0, 93.0] | [124, 123] |
p02779 | u561231954 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["n=int(input())\nnum=[int(i) for i in input().split()]\n\nif len(num)==len(set(num)):\n print('Yes')\nelse:\n print('No')", "n=int(input())\nnum=[int(i) for i in input().split()]\n\nif len(num)==len(set(num)):\n print('YES')\nelse:\n print('NO')"] | ['Wrong Answer', 'Accepted'] | ['s234268402', 's559453200'] | [25168.0, 25812.0] | [92.0, 90.0] | [116, 116] |
p02779 | u561862393 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['import numpy as np\n\nn = int(input())\nA = [int(a) for a in input().split()] \nA.sort()\nA.append(-1)\n\nB = [-1] + A[:-1]\n\nA = np.array(A) \nB = np.array(B) \n\ns = A-B \nans = len(np.nonzero(s)[0])\nif ans == n+1:\n print("Yes")\nelse:\n print("No")', 'import numpy as np\nn = int(input())\nk = 0\nA =[int(a) for a in input().split()]\nA.sort()\nA = np.array(A)\nAC = [0]*n\nAC = np.array(AC)\nAC[1:] =A[:n-1]\nAA = A - AC\nif 0 in AA:\n print("NO")\nelif A[n-2] == A[n-1]:\n print("NO")\nelse:\n print("YES")\n'] | ['Wrong Answer', 'Accepted'] | ['s965552473', 's894708893'] | [34144.0, 34180.0] | [331.0, 319.0] | [239, 251] |
p02779 | u564589929 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["n = int(input())\nA = list(map(int, input().split()))\n\nif len(A) == len(set(A)):\n print('Yes')\nelse:\n print('No')", "n = int(input())\nA = list(map(int, input().split()))\n\nif len(A) == len(set(A)):\n print('YES')\nelse:\n print('NO')"] | ['Wrong Answer', 'Accepted'] | ['s208693052', 's332121416'] | [26808.0, 26804.0] | [85.0, 83.0] | [114, 114] |
p02779 | u564770050 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["n = int(input())\na = list(map(int, input().split()))\n\ncnt = [0] * 10**9\nfor i in a:\n cnt[i-1] += 1\nif n == a.count(1):\n print('YES')\nelse:\n print('NO')", "n = int(input())\na = list(map(int, input().split()))\n\ncnt = [0] * 10**9\nfor i in a:\n cnt[i-1] += 1\nif n == a.count(1):\n print('Yes')\nelse:\n print('No')", "n = int(input())\na = list(map(int, input().split()))\na.sort()\nfor i in range(n-1):\n if a[i] == a[i+1]:\n print('NO')\n exit()\nprint('YES')"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s582579254', 's831315851', 's220507229'] | [26808.0, 25936.0, 26808.0] | [66.0, 66.0, 182.0] | [160, 160, 153] |
p02779 | u565476466 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['import sys\n\nN = int(input())\nA = list(map(int, input().split()))\nA.sort()\n\nfor i in range(0, N, 1):\n\tif A[i] == A[i + 1]:\n\t\tprint("NO")\n\t\tsys.exit(0)\n\nprint("YES")', 'import sys\n\nN = int(input())\nA = list(map(int, input().split()))\nA.sort()\n\nfor i in range(0, N - 1, 1):\n\tif A[i] == A[i + 1]:\n\t\tprint("NO")\n\t\tsys.exit(0)\n\nprint("YES")\n'] | ['Runtime Error', 'Accepted'] | ['s935073486', 's466078709'] | [26808.0, 26808.0] | [184.0, 178.0] | [163, 168] |
p02779 | u566297428 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['n = input()\ns = input().split()\nif len(set(s)) == n:\n print(YES)\nelse:\n print(NO)', 'n = input()\na = list(input().split())\n\nb = set(a)\n\nif len(a) == len(b):\n print(YES)\nelse:\n print(NO)', 'n = input()\na = list(input().split())\n\nb = set(a)\n\nif len(a) == len(b):\n print(YES)\nelse:\n print(NO)\n', 'n = input()\ns = set(input().split())\nif len(s) == n:\n print(YES)\nelse:\n print(NO)\n', 'n = input()\na = list(input().split())\n\nb = set(a)\n\nif len(a) == len(b):\n print("YES")\nelse:\n print("NO")\n'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s026060026', 's139603575', 's795103580', 's864761143', 's931145611'] | [30412.0, 32688.0, 31944.0, 31156.0, 32692.0] | [63.0, 74.0, 82.0, 72.0, 74.0] | [83, 102, 103, 84, 107] |
p02779 | u566574814 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["n=int(input())\na=list(map(int,input().split()))\n\ndef has_duplicates(seq):\n return len(seq) != len(set(seq))\n\nif has_duplicates(a) == True:\n print('No')\nelse:\n print('Yes')\n", "n=int(input())\na=list(map(int,input().split()))\n\ndef has_duplicates(seq):\n return len(seq) != len(set(seq))\n\nif has_duplicates(a) == True:\n print('No')\nelif has_duplicates(a) == False:\n print('Yes')\n", "n=int(input())\na=list(map(int,input().split()))\n\ns=set(a)\nprint('Yes' if len(s)==len(a) else 'No')\n\n# def has_duplicates(seq):\n\n\n# if has_duplicates(a) == True:\n# print('No')\n# elif has_duplicates(a) == False:\n# print('Yes')\n\n\n# # if a[i] == a[i+1]:\n# # print('No')\n# # exit()\n\n# # print('Yes')\n", "n=int(input())\na=list(map(int,input().split()))\n\ndef has_duplicates(seq):\n return len(seq) != len(set(seq))\n\nif has_duplicates(a) == True:\n print('No')\nelse:\n print('Yes')\n", "n=int(input())\na=list(map(int,input().split()))\ns=set(a)\nprint('YES' if len(s)==len(a) else 'NO')\n# def has_duplicates(seq):\n\n\n# if has_duplicates(a) == True:\n# print('No')\n# elif has_duplicates(a) == False:\n# print('Yes')\n\n\n# # if a[i] == a[i+1]:\n# # print('No')\n# # exit()\n\n# # print('Yes')\n"] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s629393491', 's713031532', 's881644624', 's905712239', 's166977583'] | [26808.0, 27204.0, 26800.0, 26808.0, 26808.0] | [84.0, 100.0, 91.0, 86.0, 93.0] | [175, 202, 369, 175, 367] |
p02779 | u570944601 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['input();a=list(map(int,input().split()));print("YNEOS"[len(A)>len(set(A))::2])', 'input();A=list(map(int,input().split()));print("YNEOS"[len(A)>len(set(A))::2])'] | ['Runtime Error', 'Accepted'] | ['s279782901', 's185747375'] | [26808.0, 26800.0] | [67.0, 82.0] | [78, 78] |
p02779 | u572122511 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["N = int(input())\nA = list(map(int, input().split()))\nprint('Yes' if len(set(A)) == len(A) else 'No')", "N = int(input())\nA = list(map(int, input().split()))\nprint('YES' if len(set(A)) == N else 'NO')"] | ['Wrong Answer', 'Accepted'] | ['s202961647', 's992070723'] | [25168.0, 25172.0] | [84.0, 86.0] | [100, 95] |
p02779 | u572138437 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['import sys\ninput = sys.stdin.readline\n\nn = int(input())\na = list(map(int, input().split()))\n\ncur = set(a)\nif len(cur) == len(a):\n print("Yes")\nelse:\n print("No")', 'import sys\ninput = sys.stdin.readline\n\nn = int(input())\na = list(map(int, input().split()))\n\ncur = set(a)\nif len(cur) == len(a):\n print("YES")\nelse:\n print("NO")'] | ['Wrong Answer', 'Accepted'] | ['s398808246', 's095646074'] | [26816.0, 26812.0] | [90.0, 92.0] | [167, 167] |
p02779 | u572425901 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['import sys\nN = int(input())\nA = list(input().split())\ndef has(s):\n return len(s) != len(set(s))\nB = has(A)\n\nif B == False:\n print("NO")\n sys.stdout.flush\nelse:\n print("YES")\n sys.stdout.flush', 'import sys\nN = int(input())\nA = list(input().split())\ndef has(s):\n return len(s) != len(set(s))\nB = A\nB = has(A) \nif B == False:\n print("NO")\n sys.stdout.flush\nelse:\n print("YES")\n sys.stdout.flush', 'import sys\nN = int(input())\nA = list(input().split())\ndef has(s):\n return len(s) != len(set(s))\nB = A\nB = has(A) \nif B == False:\n print("YES")\n sys.stdout.flush\nelse:\n print("NO")\n sys.stdout.flush'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s095732664', 's253499114', 's051002406'] | [31056.0, 32692.0, 32692.0] | [67.0, 71.0, 65.0] | [206, 212, 212] |
p02779 | u573234244 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['n = int(input())\n\na = list(map(int,input().split()))\n\nset_a = list(set(a))\n\nif len(set_a) == n:\n print("Yes")\nelse:\n print("No")', 'n = int(input())\n \na = list(map(int,input().split()))\n \nset_a = list(set(a))\n \nif len(set_a) == n:\n print("YES")\nelse:\n print("NO")'] | ['Wrong Answer', 'Accepted'] | ['s401940032', 's429053725'] | [25936.0, 25936.0] | [102.0, 95.0] | [134, 137] |
p02779 | u573900545 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["import collections\nN = int(input())\nA = list(map(int, input().split()))\nc = collections.Counter(A)\nif c.most_common()[0][1] > 1:\n print('No')\nelse:\n print('Yes')", "import collections\nN = int(input())\nA = list(map(int, input().split()))\nc = collections.Counter(A)\nif c.most_common()[0][1] > 1:\n print('NO')\nelse:\n print('YES')"] | ['Wrong Answer', 'Accepted'] | ['s656100598', 's755941721'] | [43444.0, 43436.0] | [134.0, 130.0] | [167, 167] |
p02779 | u574053975 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["a=int(input())\nb=list(map(int,input().split()))\nc=set(b)\nout=''\nif len(c)==len(b):\n out='Yes'\nelse:\n out='No'\nprint(out)", "a=int(input())\nb=list(map(int,input().split()))\nc=set(b)\nout=''\nif len(c)==len(b):\n out='YES'\nelse:\n out='NO'\nprint(out)"] | ['Wrong Answer', 'Accepted'] | ['s995545810', 's540814589'] | [26800.0, 26808.0] | [89.0, 90.0] | [122, 122] |
p02779 | u574779290 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['N = int(input())\nA = list(map(int, input().split()))\n\nflag = True\nfor i in range(N):\n for j in range(i+1, N):\n if A[i] == A[j]:\n flag = False\nif flag:\n print("Yes")\nelse:\n print("No")', 'N = int(input())\nA = list(map(int, input().split()))\n\nflag = True\nA = sorted(A)\nprint(A)\nfor i in range(N-1):\n if A[i] == A[i+1]:\n flag = False\nif flag:\n print("YES")\nelse:\n print("NO")', 'N = int(input())\nA = list(map(int, input().split()))\n\nflag = True\nA = sorted(A)\nfor i in range(N-1):\n if A[i] == A[i+1]:\n flag = False\nif flag:\n print("YES")\nelse:\n print("NO")'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s744950404', 's952251260', 's042111823'] | [30888.0, 31048.0, 30988.0] | [2206.0, 160.0, 144.0] | [194, 191, 182] |
p02779 | u576917603 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["n=int(input())\na=list(map(int,input().split()))\nb=len(set(a))\nif n==b:\n print('Yes')\nelse:\n print('No')", "n=int(input())\na=list(map(int,input().split()))\nb=len(set(a))\nif n==b:\n print('YES')\nelse:\n print('NO')"] | ['Wrong Answer', 'Accepted'] | ['s464236652', 's165396698'] | [26808.0, 26804.0] | [94.0, 85.0] | [109, 109] |
p02779 | u577902321 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['def main():\n N = int(input())\n A = set(map(int, input().split()))\n print(A)\n print(N, len(A))\n\n if N == len(A):\n print("YES")\n else:\n print("NO")\n\n\nif __name__ == "__main__":\n main()\n', 'def main():\n N = int(input())\n A = set(map(int, input().split()))\n\n if N == len(A):\n print("YES")\n else:\n print("NO")\n\n\nif __name__ == "__main__":\n main()\n'] | ['Wrong Answer', 'Accepted'] | ['s394208574', 's510512455'] | [36660.0, 35916.0] | [120.0, 95.0] | [218, 184] |
p02779 | u579832365 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['\nN = int(input())\nA = list(map(int, input().split()))\n\ndef has_duplicates(seq):\n return len(seq) != len(set(seq))\n\nl = A\nif has_duplicates(l):\n print("No")\nelse:\n print("Yes")\n', '\nN = int(input())\nA = list(map(int, input().split()))\n\ndef has_duplicates(seq):\n return len(seq) != len(set(seq))\n\nl = A\nif has_duplicates(l):\n print("NO")\nelse:\n print("YES")\n'] | ['Wrong Answer', 'Accepted'] | ['s762918855', 's278087809'] | [26800.0, 25172.0] | [85.0, 85.0] | [185, 185] |
p02779 | u580372796 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["n = int(input())\na = list(map(int, input().split()))\nans = None\nfor i in a:\n if a.find(i) != -1:\n ans = 'NO'\n break\nelse:\n ans = 'YES'\nprint(ans)\n ", "n = int(input())\na = input().replace(' ', '')\nans = None\nfor i in a:\n if a.find(i) != -1:\n ans = 'NO'\n break\nelse:\n ans = 'YES'\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\na.sort()\nans = None\nfor i in range(len(a) - 1):\n if a[i] == a[i + 1]:\n ans = 'NO'\n break\nelse:\n ans = 'YES'\nprint(ans)"] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s204576609', 's448640389', 's815074283'] | [26808.0, 8640.0, 26808.0] | [66.0, 27.0, 179.0] | [156, 146, 179] |
p02779 | u582415761 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["N = int(input())\nA = [int(i) for i in input().split()]\n\nif len(A) == len(set(A)):\n print('Yes')\nelse:\n print('No') ", "N = int(input())\nA = [int(i) for i in input().split()]\n\nif len(A) == len(set(A)):\n print('YES')\nelse:\n print('NO') "] | ['Wrong Answer', 'Accepted'] | ['s048933898', 's051481322'] | [25324.0, 25172.0] | [92.0, 90.0] | [121, 121] |
p02779 | u583455650 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["n = int(input())\na = set(input().split())\nprint('Yes' if len(a) == n else 'No')", "n = int(input())\na = set(input().split())\nprint('YES' if len(a) == n else 'NO')"] | ['Wrong Answer', 'Accepted'] | ['s076912959', 's487842195'] | [31156.0, 31152.0] | [75.0, 77.0] | [79, 79] |
p02779 | u583507988 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["import collections\nn = int(input())\na = list(map(int, input().split()))\n\nc = collections.Counter(a)\nans = 0\nfor i in a:\n if c[i] == 1 :\n ans += 1\nif ans == len(a):\n print('Yes')\nelse:\n print('No')", "import collections\nn = int(input())\na = list(map(int, input().split()))\n\nc = collections.Counter(a)\nv = c.values()\nans = 0\nfor i in v:\n if i == 1:\n ans += 1\nif ans == n:\n print('Yes')\nelse:\n print('No')", "n = int(input())\na = list(map(int, input().split()))\n\nans = set(a)\nprint(len(ans))\nif len(ans) == n:\n print('YES')\nelse:\n print('NO')", "n = int(input())\na = list(map(int, input().split()))\nres = 0\nfor i in a:\n if a.count(i) >= 2:\n res += 1\n \nif res == 0:\n print('Yes')\nelse:\n print('No')", "import collections\nn = int(input())\na = list(map(int, input().split()))\n\nans = set(a)\nif len(ans) == n:\n print('Yes')\nelse:\n print('No')", "import collections\nn = int(input())\na = list(map(int, input().split()))\n\nc = collections.Counter(a)\nv = c.values()\nans = 0\nfor i in v:\n if i == 1:\n ans += 1\nif ans == n:\n print('YES')\nelse:\n print('NO')\n"] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s381923802', 's550128172', 's642028596', 's662512066', 's818026258', 's407737061'] | [33996.0, 33996.0, 26808.0, 26808.0, 26320.0, 33996.0] | [169.0, 132.0, 89.0, 2104.0, 94.0, 139.0] | [202, 209, 135, 160, 138, 210] |
p02779 | u585498238 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['N = int(input())\nA = list(map(int,input().split()))\ncount = 0\n\nA = sorted(A)\n\nfor i in range(N-1):\n if A[i] == A[i+1]:\n count += 1\n \nif count == 0:\n print("Yes")\n \nelse:\n print("No")', 'N = int(input())\nA = list(map(int,input().split()))\ncount = 0\n\nfor i in range(N-1):\n for j in range(i+1, N):\n if A[i] == A[j]:\n count += 1\n \nif count == 0:\n print("Yes")\n \nelse:\n print("No")', 'N = int(input())\nA = list(map(int,input().split()))\ncount = 0\n\nA = sorted(A)\n\nfor i in range(N-1):\n if A[i] == A[i+1]:\n count += 1\n \nif count == 0:\n print("YES")\n \nelse:\n print("NO")'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s401060572', 's866473341', 's198543059'] | [25172.0, 26808.0, 26812.0] | [201.0, 2104.0, 183.0] | [212, 231, 212] |
p02779 | u588558668 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["n=int(input())\na=list(map(int,input().split()))\nc=0\nfor i in range(n):\n for j in range(i,n):\n if a[i]==a[j]:\n c+=1\n\nif c==0:\n print('YES')\nelse:\n print('NO')\n\n", "n=int(input())\na=list(map(int,input().split()))\n\nif len(a)==len(set(a)):\n print('YES')\nelse:\n print('NO')\n"] | ['Wrong Answer', 'Accepted'] | ['s500314009', 's901635581'] | [25168.0, 25936.0] | [2108.0, 83.0] | [186, 112] |
p02779 | u588749694 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["N = int(input())\nA = list(map(int, input().split()))\n\nA.sort()\n\nisSame = False\n\nfor i in range(N - 1):\n if A[i] == A[i + 1]:\n isSame = True\n break\nif isSame:\n print('YES')\nelse:\n print('NO')", "N = int(input())\nA = list(map(int, input().split()))\n\nA.sort()\n\nisSame = False\n\nfor i in range(N - 1):\n if A[i] == A[i + 1]:\n isSame = True\n break\nif isSame:\n print('NO')\nelse:\n print('YES')"] | ['Wrong Answer', 'Accepted'] | ['s829335897', 's413695870'] | [26808.0, 26804.0] | [184.0, 179.0] | [199, 199] |
p02779 | u589969467 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["n = int(input())\na = list(map(int,input().split()))\na.sort()\ntmp = 0\nfor i in range(n-1):\n if a[i]==a[i+1]:\n tmp = 1\n break\nif tmp == 1:\n print('No')\nelse:\n print('Yes')\n ", "n = int(input())\na = list(map(int,input().split()))\na.sort()\ntmp = 0\nfor i in range(n-1):\n if a[i]==a[i+1]:\n tmp = 1\n break\nif tmp == 1:\n print('NO')\nelse:\n print('YES')\n "] | ['Wrong Answer', 'Accepted'] | ['s190351369', 's629403017'] | [30876.0, 30912.0] | [129.0, 133.0] | [197, 197] |
p02779 | u590825760 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['n = int(input())\nli = [int(x) for x in input().split()]\n\nnozoki = list(set(li)).sort()\nli.sort()\nif (nozoki == li):\n print("YES")\nelse:\n print("NO")', 'n = int(input())\nli = [int(x) for x in input().split()]\n\nsub = list()\nfor i in li:\n if i in sub:\n print("No")\n break\n sub.append(i)\nelse:\n print("Yes")', 'n = int(input())\nli = [int(x) for x in input().split()]\na = len(li)\nse = set(li)\nb = len(se)\nif (a==b):\n print("YES")\nelse:\n print("NO")'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s361173565', 's479588194', 's141605121'] | [25172.0, 25144.0, 25172.0] | [261.0, 2104.0, 100.0] | [154, 174, 142] |
p02779 | u591143370 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["N = int(input())\nList = list(map(str, input().split()))\nimport collections\nc = collections.Counter(List)\nprint(c)\nif len(c)==N:\n print('YES')\nelse:\n print('NO')", "N = int(input())\nList = list(map(str, input().split()))\nimport collections\nc = collections.Counter(List)\n#print(c)\nif len(c)==N:\n print('Yes')\nelse:\n print('No')", "N = int(input())\nList = list(map(str, input().split()))\nimport collections\nc = collections.Counter(List)\n#print(c)\nif len(c)==N:\n print('YES')\nelse:\n print('NO')"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s150323455', 's792233893', 's784457533'] | [63888.0, 41396.0, 41428.0] | [196.0, 101.0, 103.0] | [166, 167, 167] |
p02779 | u591503175 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["N = int(input())\nA_list = [int(item) for item in input().split()]\nA_set = set(A_list)\n\nif len(A_list) == len(A_set):\n print('Yes')\nelse:\n print('No')", "N = int(input())\nA_list = [int(item) for item in input().split()]\nA_set = set(A_list)\n\nif len(A_list) == len(A_set):\n print('YES')\nelse:\n print('NO')\n"] | ['Wrong Answer', 'Accepted'] | ['s942438418', 's696252829'] | [25168.0, 25168.0] | [101.0, 95.0] | [155, 156] |
p02779 | u592035627 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['n = int(input())\ns = list(map(int,input().split()))\n\ndef count(x):\n if len(s) != len(set(x)):\n return print("NO")\n else:\n return print("YES")', 'n = int(input())\ns = list(map(int,input().split()))\n\na = 0\nfor i in range(len(s)):\n if s.count(s[i]) == 1:\n a = 1\n break\n\nif a == 0:\n print("YES")\nelse:\n print("NO")', 'n = int(input())\ns = list(map(int,input().split()))\na = 0\nfor i in range(len(s)):\n for j in range(i,len(s)):\n if s[i] == s[j]:\n a = a + 1\nif a >= 1:\n print("NO")\nelse:\n print("YES")', 'n = int(input())\ns = list(map(int,input().split()))\n \ndef count(x):\n if len(s) != len(set(x)):\n return "NO"\n else:\n return "YES"\nprint(count(s))'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s273286935', 's353566795', 's864318898', 's419240174'] | [26808.0, 26808.0, 25172.0, 25172.0] | [67.0, 71.0, 2104.0, 84.0] | [161, 188, 208, 164] |
p02779 | u597443755 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["def main():\n\tn=int(input())\n\ta=list(map(int, input().split()))\n\tcount=[1]*n\n\twhile sum(count)==n:\n\t\tfor i in range(n):\n\t\t\tcount[i] = a.count(a[i])\n\tif sum(count)==n:\n\t\tprint('YES')\n\telse:\n\t\tprint('NO')\nmain()", "def main():\n\tn=int(input())\n\ta=list(map(int, input().split()))\n\tcount = 0\n\twhile count==0:\n\t\tfor i in range(n):\n\t\t\tif a.count(a[i])> 1:\n\t\t\t\tcount+=1\n\t\t\t\tbreak\n\t\t\telse:\n\t\t\t\tcontinue\n\tif count==0:\n\t\tprint('YES')\n\telse:\n\t\tprint('NO')\nmain()", "def main():\n\tn=int(input())\n\ta=list(map(int, input().split()))\n\ta.sort()\n\tc=0\n\tfor i in range(n):\n\t\tfor j in range(n):\n\t\t\tif a[i] == a[j]:\n\t\t\t\tprint('NO')\n\t\t\t\tc+=1\n\t\t\t\tbreak\n\t\t\tbreak\n\tif c==0:\n\t\tprint('YES')\nmain()", "def main():\n\tn=int(input())\n\ta=list(map(int, input().split()))\n\tcount=[0]*n\n\twhile sum(count)==0:\n\t\tfor i in range(n):\n\t\t\tcount[i] = a.count(a[i])-1\n\tif sum(count)==0:\n\t\tprint('YES')\n\telse:\n\t\tprint('NO')\nmain()", "def main():\n\tn=int(input())\n\ta=list(map(int, input().split()))\n\tcount=[0]*n\n\tfor i in range(n):\n\t\tcount[i] = a.count(a[i])\n\tif sum(count)==0:\n\t\tprint('YES')\n\telse:\n\t\tprint('NO')\nmain()", "def main():\n\tn=int(input())\n\ta=list(map(int, input().split()))\n\tcount=[0]*n\n\twhile sum(count)==n:\n\t\tfor i in range(n):\n\t\t\tcount[i] = a.count(a[i])\n\tif sum(count)==n:\n\t\tprint('YES')\n\telse:\n\t\tprint('NO')\nmain()", "def main():\n\tn=int(input())\n\ta=list(map(int, input().split()))\n\tcount = 0\n\twhile count==0:\n\t\tfor i in range(n):\n\t\t\tif a.count(a[i])> 1:\n\t\t\t\tcount+=1\n\t\t\t\tprint('NO')\n\t\t\t\tbreak\n\t\t\telse:\n\t\t\t\tcontinue\n\tif count==0:\n\t\tprint('YES')\nmain()", "def main():\n\tn=int(input())\n\ta=list(map(int, input().split()))\n\tcount = 0\n\twhile count==0:\n\t\tfor i in range(n):\n\t\t\tif a.count(a[i])> 1:\n\t\t\t\tcount+=1\n\t\t\t\tprint('NO')\n\t\t\t\tbreak\n\tif count==0:\n\t\tprint('YES')\nmain()", "def main():\n\tn=int(input())\n\ta=list(map(int, input().split()))\n\ta.sort()\n\tc=0\n\tfor i in range(n-1):\n\t\tif a[i] == a[i+1]:\n\t\t\tprint('NO')\n\t\t\tc+=1\n\t\t\tbreak\n\tif c==0:\n\t\tprint('YES')\nmain()"] | ['Time Limit Exceeded', 'Time Limit Exceeded', 'Wrong Answer', 'Time Limit Exceeded', 'Wrong Answer', 'Wrong Answer', 'Time Limit Exceeded', 'Time Limit Exceeded', 'Accepted'] | ['s024395880', 's213875091', 's362792637', 's448367916', 's496749650', 's505826174', 's567049647', 's765125051', 's206568187'] | [25932.0, 25172.0, 26804.0, 26808.0, 26804.0, 26676.0, 26812.0, 26808.0, 26804.0] | [2104.0, 2104.0, 221.0, 2104.0, 2104.0, 68.0, 2104.0, 2104.0, 163.0] | [208, 238, 215, 210, 184, 208, 233, 211, 184] |
p02779 | u597626771 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["N = int(input())\nA = [int(x) for x in input().split()]\nans = 'Yes' \nfor i in range(N):\n if A.count(A[i]) > 1:\n ans = 'No'\n break\nprint(ans)\n", "N = int(input())\nA = [int(x) for x in input().split()]\nA.sort()\n\nans = 'YES'\n\nfor i in range(N-1):\n if A[i] == A[i+1]:\n ans = 'NO'\n break\nprint(ans)"] | ['Wrong Answer', 'Accepted'] | ['s725740249', 's908289163'] | [25172.0, 25812.0] | [2104.0, 188.0] | [157, 165] |
p02779 | u598696606 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['N=int(input())\nA=input().split()\n \nfor i in range(N)\n if A.count(A[i]) >1:\n print("NO")\n exit(0)\nprint("YES")', 'N=int(input())\nA=list(map(int,input().split()))\n\nfor i in range(N):\n if A.count(A[i]) !=0:\n print("NO")\n exit(0)\nprint("YES")', 'N=int(input())\nA=list(map(int,input().split()))\ncount=0\n\nfor i in range(N):\n if A.count(A[i]) !=0:\n count=count+1\nif count==0:\n print("YES")\nelse:\n print("NO")', 'N=int(input())\nA=list(map(int,input().split()))\n\nwhile(len(A)!=0):\n if A.count(A[0]) !=0:\n print("NO")\n exit(0)\n A.pop(0)\n \nprint("YES")', 'N=int(input())\nA=list(map(int,input().split()))\n\nfor i in range(N+1):\n if A.count(A[i]) != 0:\n print("NO")\n exit(0)\nprint("YES")', 'N=int(input())\nA=list(map(int, input().split()))\n\nA=sorted(A)\n\nfor i in range(0,N):\n if len(A) > i+1:\n if A[i] == A[i+1]:\n print("NO")\n exit(0)\nprint("YES")'] | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s048079647', 's120826478', 's195369203', 's286069582', 's504511056', 's165196577'] | [2940.0, 26676.0, 26676.0, 26808.0, 26808.0, 25172.0] | [17.0, 71.0, 2104.0, 71.0, 71.0, 210.0] | [116, 132, 165, 145, 135, 170] |
p02779 | u600402037 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["# coding: utf-8\nimport sys\n\nsr = lambda: sys.stdin.readline().rstrip()\nir = lambda: int(sr())\nlr = lambda: list(map(int, sr().split()))\n\nN = ir()\nA = lr()\nbl = len(set(A)) == N\nprint('Yes' if bl else 'No')\n", "# coding: utf-8\nimport sys\n\nsr = lambda: sys.stdin.readline().rstrip()\nir = lambda: int(sr())\nlr = lambda: list(map(int, sr().split()))\n\nN = ir()\nA = lr()\nbl = len(set(A)) == N\nprint('YES' if bl else 'NO')\n"] | ['Wrong Answer', 'Accepted'] | ['s429254020', 's696581607'] | [25676.0, 25932.0] | [84.0, 85.0] | [206, 206] |
p02779 | u602500004 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["import bisect,collections,copy,heapq,itertools,math,numpy,string\nimport sys\nsys.setrecursionlimit(10**7)\n\nread = sys.stdin.buffer.read\nreadline = sys.stdin.buffer.readline\nreadlines = sys.stdin.buffer.readlines\n\ndef _S(): return sys.stdin.readline().rstrip()\ndef I(): return int(sys.stdin.readline().rstrip())\ndef LI(): return list(map(int,sys.stdin.readline().rstrip().split()))\ndef LS(): return list(sys.stdin.readline().rstrip().split())\n\n# b,r = map(str, readline().split())\n# A,B = map(int, readline().split())\nN = I()\nA = LI()\n\n\ndef main():\n judge=False\n if len(set(A))==N:\n judge=True\n if judge:\n return 'Yes'\n else:\n return 'No'\nprint(main())\n", "import bisect,collections,copy,heapq,itertools,math,numpy,string\nimport sys\nsys.setrecursionlimit(10**7)\n\nread = sys.stdin.buffer.read\nreadline = sys.stdin.buffer.readline\nreadlines = sys.stdin.buffer.readlines\n\ndef _S(): return sys.stdin.readline().rstrip()\ndef I(): return int(sys.stdin.readline().rstrip())\ndef LI(): return list(map(int,sys.stdin.readline().rstrip().split()))\ndef LS(): return list(sys.stdin.readline().rstrip().split())\n\n# b,r = map(str, readline().split())\n# A,B = map(int, readline().split())\nN = I()\nA = LI()\n\ndef main():\n judge=False\n if len(set(A))==N:\n judge=True\n if judge:\n return 'YES'\n else:\n return 'NO'\nprint(main())\n"] | ['Wrong Answer', 'Accepted'] | ['s297459058', 's192461281'] | [49160.0, 49100.0] | [169.0, 183.0] | [684, 683] |
p02779 | u602773379 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['from collections import Counter\n\nN=int(input())\nA=list(map(str,input().split()))\n\nd=Counter(A)\nif len(d)==len(A):\n\tprint("Yes")\nelse:\n\tprint("No")', 'from collections import Counter\n\nN=int(input())\nA=list(map(str,input().split()))\n\nd=Counter(A)\nif len(d)==len(A):\n\tprint("YES")\nelse:\n\tprint("NO")'] | ['Wrong Answer', 'Accepted'] | ['s178773186', 's130214150'] | [39884.0, 39884.0] | [96.0, 97.0] | [146, 146] |
p02779 | u607558942 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["n = int(input())\na = sorted(map(int, input().split()))\n\nx = 0\n\nfor i in range(n-1):\n if a[i] == a[i+1]:\n x += 1\n break\n else:\n x += 0\n \nif x == 0:\n print('Yes')\nelse:\n print('No')", "n = int(input())\na = sorted(map(int, input().split()))\n\nx = 0\n\nfor i in range(n-1):\n if a[i] == a[i+1]:\n x += 1\n break\n else:\n x += 0\n \nif x == 0:\n print('YES')\nelse:\n print('NO')"] | ['Wrong Answer', 'Accepted'] | ['s836356596', 's011216654'] | [26804.0, 26804.0] | [191.0, 190.0] | [219, 219] |
p02779 | u607729897 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["import sys\nread = sys.stdin.buffer.read\nreadline = sys.stdin.buffer.readline\n\ndef main():\n N, *A = map(int, read().split())\n for a in A:\n if A.count(a)==1:\n continue\n else:\n result = 'NO'\n return result\n else:\n result = 'Yes'\n return result\n\nif __name__ == '__main__':\n print(main())\n\n", "import sys\nread = sys.stdin.buffer.read\nreadline = sys.stdin.buffer.readline\n\ndef main():\n N, *A = read().split()\n for a in A:\n if A.count(a)==1:\n continue\n else:\n result = 'NO'\n return result\n else:\n result = 'Yes'\n return result\n\nif __name__ == '__main__':\n print(main())\n\n", "import sys\nfrom collections import defaultdict\nread = sys.stdin.buffer.read\nreadline = sys.stdin.buffer.readline\n\ndef main():\n N, *A = map(int,read().split())\n d = defaultdict(int)\n for a in A:\n d[a] +=1\n if len(A)==len(d):\n result = 'YES'\n else:\n result = 'NO'\n\n return result\n\nif __name__ == '__main__':\n print(main())\n\n"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s807293324', 's976067783', 's917963686'] | [21920.0, 16036.0, 33616.0] | [2104.0, 2104.0, 132.0] | [354, 344, 364] |
p02779 | u609814378 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['import sys\nA = list(map(int, input().split()))\nN = int(input())\n\nif len(A) == len(set(A)):\n print("YES")\nelse:\n print("NO")\n', 'import sys\nA = list(map(int, input().split()))\nn = int(input())\n\nif len(A) == len(set(A)):\n print("YES")\nelse:\n print("NO")', 'import sys\nN = int(input())\nA = list(map(int, input().split()))\nif len(A) == len(set(A)):\n print("YES")\nelse:\n print("NO")'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s140271167', 's831158685', 's843688475'] | [8636.0, 8636.0, 26808.0] | [29.0, 29.0, 84.0] | [130, 129, 128] |
p02779 | u612975321 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["n = int(input())\na = list(map(int, input().split()))\n\ncnt = [0]*(10**9+1)\n\nfor i in a:\n cnt[i] += 1\n if cnt[i] > 1:\n print('NO')\n exit()\nprint('YES')", "n = int(input())\na = list(map(int, input().split()))\n\na.sort()\nfor i in range(n-1):\n if a[i] == a[i+1]:\n print('NO')\n exit()\nprint('YES')\n"] | ['Runtime Error', 'Accepted'] | ['s809168420', 's112809772'] | [30864.0, 31132.0] | [72.0, 132.0] | [169, 155] |
p02779 | u613922299 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['a = int(input())\nb = list(map(int,input().split()))\nc = set(b)\n\nif len(b) == len(c):\n print("Yes")\nelse:\n print("No")', 'a = int(input())\nb = list(map(int,input().split()))\nc = set(b)\n\nif len(b) == len(c):\n print("YES")\nelse:\n print("NO")\n'] | ['Wrong Answer', 'Accepted'] | ['s579863903', 's445463859'] | [26800.0, 26808.0] | [90.0, 90.0] | [119, 120] |
p02779 | u616542081 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["N = int(input())\nA = list(map(int, input().split()))\nans = 'NO'\nif N == len(set(A)):\n ans = 'Yes'\n\nprint(ans)", "N = int(input())\nA = list(map(int, input().split()))\nans = 'NO'\nif N == len(set(A)):\n ans = 'YES'\n\nprint(ans)"] | ['Wrong Answer', 'Accepted'] | ['s660887954', 's532573223'] | [31088.0, 31136.0] | [90.0, 87.0] | [110, 110] |
p02779 | u617659131 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['n = int(input())\na = list(map(int, input(),split()))\nsa = set(a)\nif len(a) == len(sa):\n print("YES")\nelse:\n print("NO")', 'n = int(input())\na = list(map, int(input().split()))\nyn = ["YES","NO"]\nflag = 0\nfor i in range(n-1):\n for j in range(i+1, n):\n if i == j: \n flag = 1\nprint(yn[flag])', 'n = int(input())\na = list(map(int, input().split()))\nsa = set(a)\nif len(a) == len(sa):\n print("YES")\nelse:\n print("NO")'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s873478390', 's941587810', 's078479151'] | [8512.0, 20796.0, 26804.0] | [21.0, 37.0, 92.0] | [121, 173, 121] |
p02779 | u619144316 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["N = int(input())\nA = [int(i) for i in input().split()]\nprint('Yes' if len(set(A)) == N else 'No')", "N = int(input())\nA = [int(i) for i in input().split()]\nprint('YES' if len(set(A)) == N else 'NO')"] | ['Wrong Answer', 'Accepted'] | ['s971836469', 's044263217'] | [25452.0, 25936.0] | [90.0, 94.0] | [97, 97] |
p02779 | u620238824 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['N = int(input())\nA = list(map(int, input().split()))\n\nif len(set(A)) == len(A):\n print("Yes")\nelse:print("No")', 'N = int(input())\nA = list(map(int, input().split()))\n\nif len(set(A)) == len(A):\n print("YES")\nelse:print("NO")'] | ['Wrong Answer', 'Accepted'] | ['s735097309', 's937807692'] | [26812.0, 26808.0] | [84.0, 84.0] | [113, 113] |
p02779 | u620549327 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['n = int(input())\na = list(map(int, input().split()))\na.sort()\nif a[n-1]>=a[n-2] + a[n-3]:\n print("YES")\nelse:\n print("NO")', 'n = int(input())\na = list(map(int, input().split()))\na.sort()\nfor i in range(n-1):\n if a[i]==a[i+1]: \n print("NO")\n exit()\n \nprint("YES")'] | ['Wrong Answer', 'Accepted'] | ['s663239456', 's145266132'] | [26808.0, 26808.0] | [145.0, 180.0] | [128, 157] |
p02779 | u621998662 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["def has_duplicates(seq):\n return len(seq) != len(set(seq))\n\nN = int(input())\nA = list(map(int, input().split()))\n\nif has_duplicates(A) == True:\n print('Yes')\nelse:\n print('No')", "def has_duplicates(seq):\n return len(seq) != len(set(seq))\n\nN = int(input())\nA = list(map(int, input().split()))\n\nif has_duplicates(A) == True:\n print('YES')\nelse:\n print('NO')\n", 'def has_duplicates(seq):\n return len(seq) != len(set(seq))\n\nN = int(input())\nA = list(map(int, input().split()))\n\nif has_duplicates(A) == True:\n print("NO")\nelse:\n print("YES")\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s214345685', 's393561181', 's107646410'] | [26804.0, 25172.0, 26808.0] | [95.0, 85.0, 85.0] | [181, 182, 182] |
p02779 | u622570247 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['n = int(input())\naa = tuple(map(int, input().strip()))\nif len(set(aa)) == n:\n print("YES")\nelse:\n print("NO")', 'n = int(input())\naa = tuple(map(int, input().split()))\nif len(set(aa)) == n:\n print("YES")\nelse:\n print("NO")'] | ['Runtime Error', 'Accepted'] | ['s370929457', 's783542874'] | [8636.0, 25300.0] | [21.0, 84.0] | [115, 115] |
p02779 | u622847899 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["n=int(input())\na=list(map(int,input().split()))\n\nif len(a) == len(set(a)):\n print('Yes')\nelse:\n print('No')", "n=int(input())\na=list(map(int,input().split()))\n\nif len(a) != len(set(a)):\n print('No')\nelse:\n print('Yes')\n\n \n", "n=int(input())\na=list(map(int,input().split()))\n\nif len(a) == len(set(a)):\n print('Yes')\nelse:\n print('No')\n", "n=int(input())\na=list(map(int,input().split()))\n\nif len(a) == len(set(a)):\n print('YES')\nelse:\n print('NO')"] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s617865629', 's687830744', 's882379158', 's382495092'] | [26808.0, 26808.0, 26932.0, 26808.0] | [84.0, 86.0, 84.0, 86.0] | [113, 120, 114, 113] |
p02779 | u623814058 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["N=int(input())\nA=input().split()\nl=len(set(A))\nprint('Yes' if N==l else 'No')", "N=int(input())\nA=input().split()\nl=len(set(A))\nprint('YES' if N==l else 'NO')"] | ['Wrong Answer', 'Accepted'] | ['s793930597', 's360473206'] | [36080.0, 36056.0] | [74.0, 72.0] | [77, 77] |
p02779 | u624617831 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["import collections\ndef main():\n n = int(input())\n \n a_list = list(map(int, input().split()))\n\n c = collections.Counter(a_list) \n\n ans = c.most_common(1)\n\n if ans[0][1] >= 2:\n print('No')\n else:\n print('Yes')\n\nif __name__ == '__main__':\n main()\n\n", "import collections\ndef main():\n n = int(input())\n \n a_list = list(map(int, input().split()))\n\n c = collections.Counter(a_list) \n\n ans = c.most_common(1)\n\n if ans[0][1] >= 2:\n print('NO')\n else:\n print('YES')\n\nif __name__ == '__main__':\n main()\n\n"] | ['Wrong Answer', 'Accepted'] | ['s787809686', 's813206151'] | [33996.0, 33996.0] | [125.0, 124.0] | [286, 286] |
p02779 | u626684023 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['N = int(input())\nA = list(map(int, input().split()))\nprint("{}".format("Yes" if len(A) == len(set(A)) else "No"))', 'N = int(input())\nA = list(map(int, input().split()))\nprint("{}".format("Yes" if len(A) == len(set(A)) else "No"))', 'N = int(input())\nA = list(map(int, input().split()))\nprint("{}".format("YES" if len(A) == len(set(A)) else "NO"))'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s301588391', 's349969652', 's627815786'] | [25172.0, 26808.0, 26804.0] | [83.0, 84.0, 85.0] | [113, 113, 113] |
p02779 | u627530854 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['from collections import Counter\n\nn = int(input())\nc = Counter(map(int, input().split()))\n\nprint("YES" if c.most_common(1)[1] <= 1 else "NO")', 'from collections import Counter\n\nn = int(input())\nc = Counter(map(int, input().split()))\n\nprint("YES" if c.most_common(1)[0][1] <= 1 else "NO")\n'] | ['Runtime Error', 'Accepted'] | ['s941877571', 's083630729'] | [44624.0, 44748.0] | [136.0, 136.0] | [140, 144] |
p02779 | u628335443 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["n = int(input())\na = list(input().split())\n\nif len(a) == len(set(a)):\n print('Yes')\nelse:\n print('No')\n", "n = int(input())\na = list(input().split())\n\nif len(a) == len(set(a)):\n print('YES')\nelse:\n print('NO')\n"] | ['Wrong Answer', 'Accepted'] | ['s151290246', 's021680618'] | [32688.0, 32692.0] | [65.0, 63.0] | [109, 109] |
p02779 | u628581330 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["from collections import Counter\nn = int(input())\na = list(map(int,input().strip().split()))\nif Counter(a).most_common(1)[0][1] != 1:\n print('No')\nelse:\n print('Yes')", "from collections import Counter\nn = int(input())\na = list(map(int,input().strip().split()))\nif Counter(a).most_common(1)[0][1] != 1:\n print('NO')\nelse:\n print('YES')"] | ['Wrong Answer', 'Accepted'] | ['s369713607', 's250604181'] | [33996.0, 33996.0] | [124.0, 134.0] | [171, 171] |
p02779 | u629607744 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["n=int(input())\na=[int() for i in input().split()]\nb=0\nfor j in range(n):\n for k in range(n):\n if a[j]==a[k]:\n b+=1\n break\nif b==0:\n print('Yes')\nelse:\n print('No')", "n=int(input())\na=[int(i) for i in input().split()]\na.sort()\nflag=False\nfor j in range(n):\n if j<n-1:\n if a[j]==a[j+1]:\n flag=True\nif flag:\n print('No')\nelse:\n print('Yes')", "n=int(input())\na=[int(i) for i in input().split()]\na.sort()\nflag=False\nfor j in range(n):\n if j<n-1:\n if a[j]==a[j+1]:\n flag=True\n break\nif flag:\n print('No')\nelse:\n print('Yes')\n", "n=int(input())\na=[int() for i in input().split()]\nb=0\nfor j in range(n):\n for k in range(n):\n if a[j]==a[k] and j!=k:\n b+=1\nif b==0:\n print('YES')\nelse:\n print('NO')", "n=int(input())\na=[int() for i in input().split()]\nb=0\nfor j in range(n):\n for k in range(n):\n if a[j]==a[k] and j!=k:\n b+=1\n\u3000\u3000break\nif b==0:\n print('YES')\nelse:\n print('NO')", "n=int(input())\na=[int(i) for i in input().split()]\na.sort()\nfor j in range(n-1):\n\tif a[j]<a[j+1]:\n\t\tpass\n\telse:\n\t\tprint('NO')\n\t\texit()\nprint('YES')"] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s065409691', 's089475343', 's318715083', 's322401877', 's913424503', 's483159568'] | [20796.0, 25936.0, 25168.0, 20796.0, 2940.0, 25168.0] | [161.0, 202.0, 207.0, 2104.0, 17.0, 194.0] | [179, 182, 195, 176, 188, 147] |
p02779 | u643679148 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['n = int(input())\nA = list(map(int, input().split()))\nd = {}\n\nfor i in A:\n if i in d:\n print("No")\n exit(0)\n else:\n d[i] = 1\n\nprint("Yes")\n', 'n = int(input())\nA = list(map(int, input().split()))\nd = {}\n\nfor i in A:\n if i in d:\n print("NO")\n exit(0)\n else:\n d[i] = 1\n\nprint("YES")\n'] | ['Wrong Answer', 'Accepted'] | ['s681731189', 's575468766'] | [35212.0, 35180.0] | [113.0, 115.0] | [165, 165] |
p02779 | u644360640 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["n = int(input())\na = list(map(int,input().split()))\nflag = True\na.sort()\nfor i,j in zip(a[0:len(a)-1],a[1:len(a)]):\n if i == j:\n flag = False\n break\nif flag == True:\n print('Yes')\nelse:\n print('No')\n", "n = int(input())\na = list(map(int,input().split()))\nflag = True\na.sort()\nfor i,j in zip(a[0:len(a)-1],a[1:len(a)]):\n if i == j:\n flag = False\n break\nif flag == True:\n print('YES')\nelse:\n print('NO')\n"] | ['Wrong Answer', 'Accepted'] | ['s938598144', 's279017443'] | [25168.0, 26808.0] | [191.0, 193.0] | [222, 222] |
p02779 | u645487439 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["n = int(input())\na_list = sorted(map(int, input().split()))\n\nif len(set(a_list)) == len(a_list):\n print('Yes')\nelse:\n print('No')\n", 'n, k = map(int, input().split())\np_list = list(map(int, input().split()))\nindex = 0\nvalue = 0\n\nfor i in range(n - k):\n if p_list[i] < p_list[i + k]:\n index = i + 1\n\nfor i in range(k):\n value += (1 + p_list[index + i])/ 2 \n\nprint(value)\n', "n = int(input())\na_list = list(map(int, input().split()))\n\nif len(set(a_list)) == n:\n print('YES')\nelse:\n print('NO')\n"] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s592768416', 's828253528', 's606809475'] | [25324.0, 3060.0, 26808.0] | [170.0, 17.0, 86.0] | [136, 249, 124] |
p02779 | u645538982 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['N=int(input())\nA=list(map(int,input().split()))\n\ndef has_duplicates(seq):\n return len(seq) != len(set(seq))\nif has_duplicates(A):\n print("No")\nelse:\n print("Yes")\n', 'N=int(input())\nA=list(map(int,input().split()))\n\ndef has_duplicates(seq):\n return len(seq) != len(set(seq))\nif has_duplicates(A):\n print("NO")\nelse:\n print("YES")\n'] | ['Wrong Answer', 'Accepted'] | ['s435846549', 's095506872'] | [26800.0, 26812.0] | [85.0, 90.0] | [172, 172] |
p02779 | u645855527 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["from collections import Counter\nn = int(input())\nc = Counter(list(map(int, input().split())))\nif len(c) == n:\n print('Yes')\nelse:\n print('No')", "from collections import Counter\nn = int(input())\nc = Counter(list(map(int, input().split())))\nif len(c) == n:\n print('YES')\nelse:\n print('NO')"] | ['Wrong Answer', 'Accepted'] | ['s974087305', 's244052600'] | [33996.0, 33996.0] | [103.0, 106.0] | [148, 148] |
p02779 | u646083276 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['n = int(input())\na = input().split(" ")\nb = set(a)\nif len(b)<len(a):\n answer = "NO"\nelse:\n answer = "Yes"\nprint(answer)', 'N = input()\nA = [x for x in input().split()]\nif len(A) == len(set(A)):\n print("YES")\nelse:\n print("NO")'] | ['Wrong Answer', 'Accepted'] | ['s932461077', 's330052353'] | [31156.0, 31056.0] | [69.0, 66.0] | [121, 109] |
p02779 | u651109406 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["n = int(input())\na = set(map(int, input().split()))\nif len(list(a)) == n:\n print('Yes')\nelse:\n print('No')\n", "n = int(input())\na = list(map(int, input().split()))\nif len(set(a)) == len(a):\n print('Yes')\nelse:\n print('No')\n", "n = int(input())\na = list(map(int, input().split()))\nif len(set(a)) == n:\n print('Yes')\nelse:\n print('No')\n", "n = int(input())\na = list(input().split())\nif len(set(a)) == len(a):\n print('Yes')\nelse:\n print('No')", "n = int(input())\na = list(map(int, input().split()))\nif len(set(a)) == n:\n print('No')\nelse:\n print('Yes')\n", "n = int(input())\na = set(map(int, input().split()))\nif len(a) == n:\n print('Yes')\nelse:\n print('No')", "n = int(input())\na = set(map(int, input().split()))\nprint('YES' if len(a) == n else 'NO')"] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s009017642', 's131126059', 's197088257', 's421146020', 's510168241', 's861224724', 's546483780'] | [36660.0, 26808.0, 25172.0, 32820.0, 25684.0, 35788.0, 36660.0] | [96.0, 83.0, 83.0, 65.0, 84.0, 92.0, 93.0] | [113, 118, 113, 107, 113, 106, 89] |
p02779 | u652445326 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['N = int(input())\nA = list(map(int,input().split()))\nif len(A) != len(set(A)):\n print("No")\nelse:\n print("Yes")', 'N = int(input())\nA = list(map(int,input().split()))\nif len(A) != len(set(A)):\n print("NO")\nelse:\n print("YES")'] | ['Wrong Answer', 'Accepted'] | ['s538288163', 's877835325'] | [26808.0, 26800.0] | [84.0, 87.0] | [116, 116] |
p02779 | u655048024 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['N = int(input())\na = list(map(int,input().split()))\nans = "Yes"\njudge = 0\nfor i in range(N-1):\n for j in range(i+1,N):\n if(a[i]==a[j]):\n judge += 1\n ans = "No"\n break\n if(judge>0):\n break\nprint(ans)\n\n \n ', 'n = int(input())\na = list(map(int,input().split()))\nif(n!=len(list(set(a)))):\n print("No")\nelse:\n print("Yes")', 'n = int(input())\na = list(map(int,input().split()))\na.sort()\nans = "YES"\nfor i in range(1,n):\n if(a[i-1]==a[i]):\n ans = "NO"\n break\nprint(ans)'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s080693316', 's103382381', 's093273324'] | [25936.0, 31016.0, 30860.0] | [2104.0, 102.0, 145.0] | [230, 112, 149] |
p02779 | u656341025 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['N = int(input())\nset_1 = set()\nlist_1 = list(map(int, input().split(\' \')))\n\nfor item in list_1:\n set_1.add(item)\n\nif len(list_1) == len(set_1):\n print("Yes")\nelse:\n print("No")', 'N = int(input())\nset_1 = set()\nlist_1 = list(map(int, input().split(\' \')))\n\nfor item in list_1:\n set_1.add(item)\n\nif len(list_1) == len(set_1):\n print("Yes", end="")\nelse:\n print("No", end="")', "def solve():\n N = int(input())\n A = list(map(int, input().split()))\n A.sort()\n for i in range(1, N):\n if A[i - 1] == A[i]:\n print('NO')\n return\n print('YES')\n return\nsolve()"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s076636289', 's916948428', 's495954985'] | [25172.0, 26808.0, 26808.0] | [111.0, 107.0, 167.0] | [179, 195, 192] |
p02779 | u656391577 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['N = int(input())\nA = list(map(int, input().split()))\nprint(A)\n\ncount = 0\nfor i in A:\n for j in A[count+1:]:\n if i == j:\n print("Yes")\n break\n else:\n count += 1\n continue\n break\nelse:\n print("No")\n', 'N = int(input())\nA = list(map(int, input().split()))\nA.sort()\nfor i in range(N-1):\n if A[i] == A[i+1]:\n print("NO")\n break\nelse:\n print("YES")'] | ['Wrong Answer', 'Accepted'] | ['s365633493', 's246543203'] | [25936.0, 26808.0] | [2104.0, 181.0] | [251, 162] |
p02779 | u656919695 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["n=int(input())\na=[i for i in input().split()]\n\nprint('YES' if len(set(a)==n) else 'NO')", "n=int(input())\na=[i for i in input().split()]\nprint(len(set(a)))\nprint('YES' if len(set(a)==n) else 'NO')", "n=int(input())\na=[i for i in input().split()]\n\nprint('YES' if len(set(a))==n else 'NO')"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s854401292', 's976649024', 's610918591'] | [31948.0, 33988.0, 31156.0] | [69.0, 93.0, 66.0] | [87, 105, 87] |
p02779 | u657065743 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['n = int(input())\na = input().split(" ")\n\nflag = False\nfor i in range(n-1):\n for j in range(i, n):\n if a[i] == a[j]:\n flag = True\n break\n if flag:\n break\n\nprint(\'NO\' if flag else \'YES\')\n', 'n = int(input())\na = input().split(" ")\n\na.sort()\nflag = False\nfor i in range(n-1):\n if a[i] == a[i+1]:\n flag = True\n break\n\nprint(\'NO\' if flag else \'YES\')\n'] | ['Wrong Answer', 'Accepted'] | ['s435347909', 's526909759'] | [19924.0, 19160.0] | [39.0, 216.0] | [227, 173] |
p02779 | u657719194 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['N = int(input())\nA = list(map(int, input().split()))\nAns = "Yes"\nList = []\n\nfor e in A:\n if e in List:\n Ans = "No"\n break\n else:\n List.append(e)\n\nprint(Ans)', 'N = int(input())\nA = list(map(int, input().split()))\nA.sort()\nAns = "YES"\nList = []\nbefore_n = 0\nfor e in A:\n if e == before_n:\n Ans = "NO"\n break\n else:\n before_n=e\nprint(Ans)'] | ['Wrong Answer', 'Accepted'] | ['s430729175', 's044591803'] | [30980.0, 31048.0] | [2206.0, 124.0] | [183, 203] |
p02779 | u657786757 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['import sys\nimport math\nfrom collections import deque\nfrom collections import defaultdict\n\ndef main():\n n = int(sys.stdin.readline())\n A = list(map(int,sys.stdin.readline().split()))\n num_dict = {}\n flag = True\n for x in A:\n if not x-1 in num_dict:\n num_dict[x-1] = x-1\n else:\n flag = False\n break\n print("Yes") if flag else print("No")\n return 0\n\nif __name__ == "__main__":\n main()', 'import sys\nimport math\nfrom collections import deque\nfrom collections import defaultdict\n\ndef main():\n n = int(sys.stdin.readline())\n A = list(map(int,sys.stdin.readline().split()))\n num_dict = {}\n flag = True\n for x in A:\n if not x-1 in num_dict:\n num_dict[x-1] = x-1\n else:\n flag = False\n break\n print("YES") if flag else print("NO")\n return 0\n\nif __name__ == "__main__":\n main()'] | ['Wrong Answer', 'Accepted'] | ['s086520797', 's960922894'] | [44036.0, 44036.0] | [138.0, 138.0] | [452, 452] |
p02779 | u658987783 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['n=int(input())\nb=input().split()\n\nif len(set(b))==n:\n print("Yes")\nelse:\n print("NO")\n\n \n ', 'n=int(input())\nb=input().split()\n\nif len(set(b))==n:\n print("YES")\nelse:\n print("NO")\n\n \n '] | ['Wrong Answer', 'Accepted'] | ['s627704138', 's933344274'] | [31156.0, 31156.0] | [63.0, 65.0] | [98, 98] |
p02779 | u659302753 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["from sys import stdin\n\n\ndef get_result(data):\n N, A = data[0], data[1]\n return 'Yes' if len(list(set(A))) == N[0] else 'NO'\n\nif __name__ == '__main__':\n raw_data = [val.rstrip('\\n') for val in stdin.readlines()]\n data = [list(map(int, val.split(' '))) for val in raw_data]\n result = get_result(data)\n print(result)\n", "from sys import stdin\n\n\ndef get_result(data):\n N, A = data[0], data[1]\n return 'Yes' if len(list(set(A))) == len(A) else 'NO'\n\nif __name__ == '__main__':\n raw_data = [val.rstrip('\\n') for val in stdin.readlines()]\n data = [list(map(int, val.split(' '))) for val in raw_data]\n result = get_result(data)\n print(result)\n", "from sys import stdin\n\n\ndef get_result(data):\n N, A = data[0], data[1]\n return 'YES' if len(set(A)) == N[0] else 'NO'\n\nif __name__ == '__main__':\n raw_data = [val.rstrip('\\n') for val in stdin.readlines()]\n data = [list(map(int, val.split(' '))) for val in raw_data]\n result = get_result(data)\n print(result)\n"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s336483510', 's821562695', 's235914477'] | [27096.0, 27096.0, 27096.0] | [88.0, 90.0, 90.0] | [333, 335, 327] |
p02779 | u661347997 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["n = int(input())\na = input().split(' ')\n\nif len(set(a)) == n:\n print('YES')\nelse\n print('NO')", "n = int(input())\na = input().split(' ')\n \nif len(set(a)) == n:\n print('YES')\nelse:\n print('NO')"] | ['Runtime Error', 'Accepted'] | ['s961413058', 's517242163'] | [2940.0, 31156.0] | [17.0, 61.0] | [95, 97] |
p02779 | u661439250 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["from collections import Counter\nn = int(input())\na_ = [int(x) for x in input().split()]\na = Counter(a_)\nprint(a)\nprint('NO') if a.most_common()[0][1]>1 else print('YES')", "from collections import Counter\nn = int(input())\na = Counter([int(x) for x in input().split()])\nprint('NO') if len(a)!=n else print('YES')"] | ['Wrong Answer', 'Accepted'] | ['s027637335', 's334052499'] | [53064.0, 33996.0] | [311.0, 114.0] | [170, 139] |
p02779 | u661902454 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["n = int(input())\nla = list(map(int, input().split())\nd = {}\nret = 'NO'\nfor a in la:\n if a in d:\n ret = 'YSE'\n break\n d[a] = ''\nprint(ret)\n", "aaa = int(input())\nla = list(map(int, input().split()))\nd = {}\nret = 'YES'\nfor a in la:\n if a in d:\n ret = 'NO'\n break\n d[a] = ''\nprint(ret)\n"] | ['Runtime Error', 'Accepted'] | ['s293183880', 's667750708'] | [2940.0, 32944.0] | [17.0, 117.0] | [158, 161] |
p02779 | u664907598 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["n=int(input())\na=sorted(list(map(int,input().split())))\nunt=False\nfor i in range(0,n-1):\n if a[i]==a[i+1]:\n unt=True\nif unt:\n print('No')\nelse:\n print('Yes')", "n=int(input())\na=list(map(int,input().split()))\n\naa = sorted(a)\nflag=True\nfor i in range(n-1):\n if aa[i]==aa[i+1]:\n flag=False\nif flag:\n print('YES')\nelse:\n print('NO')\n"] | ['Wrong Answer', 'Accepted'] | ['s551977698', 's771587120'] | [25172.0, 26808.0] | [187.0, 185.0] | [173, 185] |
p02779 | u666844906 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["N = int(input())\nA = list(map(int, input().split()))\n\nflag = 0\nfor i in range(N-1):\n if A[i] != A[i+1]:\n flag = 0\n else:\n flag = 1\n\nif flag == 0:\n print('Yes')\nelse:\n print('No')", "N = int(input())\nA = list(map(int, input().split()))\n\nif len(set(A)) == len(A):\n print('Yes')\nelse:\n print('No')", "N = int(input())\nA = list(map(int, input().split()))\n\nif len(set(A)) == len(A):\n print('YES')\nelse:\n print('NO')"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s094774055', 's679962975', 's592547708'] | [26808.0, 26808.0, 26804.0] | [102.0, 88.0, 83.0] | [204, 118, 118] |
p02779 | u670838922 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['N=int(input())\nA=list(map(int,input().split()))\nflag=0\nfor i in range(N):\n for j in range(i+1,N):\n if(A[i]==A[j]):\n flag=1\n break\n if(flag==1):\n break\n\nif(flag==1):\n print("YES")\nif(flag==0):\n print("NO")\n ', 'N=int(input())\nA=list(map(int,input().split()))\nans={}\nflag=0\n\nfor i in A:\n if(ans.get(i)!=None):\n flag=1\n break\n else:\n ans[i]=1\n \nif(flag==0):\n print("YES")\nelse:\n print("NO")'] | ['Wrong Answer', 'Accepted'] | ['s706704138', 's714947649'] | [26808.0, 32848.0] | [2104.0, 127.0] | [261, 217] |
p02779 | u671252250 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["# coding: utf-8\n# Your code here!\n\nN = int(input())\nA = list(map(int, input().split()))\nif len(A) == len(set(A)):\n print('Yes')\nelse:\n print('No')", "# coding: utf-8\n# Your code here!\n\nN = int(input())\nA = list(map(int, input().split()))\nif len(A) == len(set(A)):\n print('YES')\nelse:\n print('NO')"] | ['Wrong Answer', 'Accepted'] | ['s955438245', 's308074446'] | [25448.0, 26808.0] | [83.0, 82.0] | [152, 152] |
p02779 | u671446913 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["# A = input()\n# A = int(input())\n# A = map(int, input().split())\n# A = list(map(int, input().split()))\n\n#\n# c = collections.Counter()\n\nimport collections\n\nN = int(input())\nA = list(map(int, input().split()))\nc = collections.Counter(A)\n\nif c.most_common()[0][1] == 1:\n print('Yes')\nelse:\n print('No')\n\n", "# A = input()\n# A = int(input())\n# A = map(int, input().split())\n# A = list(map(int, input().split()))\n\n#\n# c = collections.Counter()\n\nimport collections\n\nN = int(input())\nA = list(map(int, input().split()))\nc = collections.Counter(A)\n\nif c.most_common()[0][1] == 1:\n print('YES')\nelse:\n print('NO')\n\n"] | ['Wrong Answer', 'Accepted'] | ['s214173687', 's715981324'] | [40136.0, 40136.0] | [258.0, 190.0] | [345, 345] |
p02779 | u671889550 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["n = int(input())\na = list(map(int, input().split()))\na.sort()\n\nfor i in range(n):\n if a[i - 1] == a[i]:\n print('No')\n exit()\nprint('Yes')", "n = int(input())\na = sorted(list(map(int, input().split())))\n\nb = [-1] + a\n\nl = []\nfor i in range(n):\n l.append(a[i] - b[i])\n \nif l.count(0) == 0:\n print('YES')\nelse:\n print('NO')"] | ['Wrong Answer', 'Accepted'] | ['s591652195', 's717099996'] | [30896.0, 30968.0] | [135.0, 163.0] | [144, 183] |
p02779 | u672220554 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['import collections\n\nN = int(input())\n\nA = list(map(int, input().split()))\n\nC = collections.Counter(A)\nif C.most_common()[0][1] == 1:\n print("Yes")\nelse:\n print("No")\n', 'import collections\n\nN = int(input())\n\nA = list(map(int, input().split()))\n\nC = collections.Counter(A)\nif C.most_common()[0][1] == 1:\n print("YES")\nelse:\n print("NO")\n'] | ['Wrong Answer', 'Accepted'] | ['s538398398', 's559847050'] | [40136.0, 40136.0] | [198.0, 175.0] | [172, 172] |
p02779 | u672882146 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['n=int(input()) \na=list(map(int, input().split()))\ndef func(a):\n return len(a) == len(set(a))\nif func(a):\n print("Yes")\nelse:\n print(\'No\')', 'n=int(input()) \na=list(map(int, input().split()))\ndef func(a):\n return len(a) == len(set(a))\nif func(a):\n print("YES")\nelse:\n print(\'NO\')'] | ['Wrong Answer', 'Accepted'] | ['s789370154', 's578721457'] | [26800.0, 26808.0] | [84.0, 93.0] | [146, 146] |
p02779 | u673101577 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["import collections\n\nN = int(input())\nA = input().split(' ')\n\nc = collections.Counter(A)\n\nans = all([True for k, v in c.items() if v == 1])\n\nif ans:\n print('Yes')\nelse:\n print('No')\n", "import collections\n\nN = int(input())\nA = input().split(' ')\n\nc = collections.Counter(A)\n\nans = all([True if v == 1 else False for k, v in c.items()])\n\nif ans:\n print('Yes')\nelse:\n print('No')", "import collections\n\nN = int(input())\nA = input().split(' ')\n\nc = collections.Counter(A)\n\nans = any([1 for k, v in c.items() if v > 1])\n\nif ans:\n print('No')\nelse:\n print('Yes')\n", "import collections\n\nN = int(input())\nA = input().split(' ')\n\nc = collections.Counter(A)\n\nans = all([True if v == 1 else False for k, v in c.items()])\n\nif ans:\n print('YES')\nelse:\n print('NO')\n"] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s355562608', 's801672854', 's914392695', 's475903825'] | [39116.0, 39116.0, 39116.0, 39116.0] | [138.0, 117.0, 130.0, 114.0] | [187, 197, 184, 198] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.