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
|
|---|---|---|---|---|---|---|---|---|---|---|
p02707
|
u141152123
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['N = int(input())\nb = list(map(int,input().split()))\nfor i in range(1,N):\n a = b.count(i)\n print(a)\n', 'N = int(input())\nb = list(map(int,input().split()))\nc= list()\n\nfor i in range( N - 1):\n c.append(0)\n \nfor i in b:\n c[i - 1] += 1\nfor i in c:\n print(c[i - 1])\n', 'N = int(input())\nb = list(map(int,input().split()))\nprint(b)\nfor i in range(N + 1):\n a = b.count(i)\n print(a)\n', 'N = int(input())\nb = list(map(int,input().split()))\nc = list()\n\nfor i in range( N ):\n c.append(0)\nfor i in b:\n c[i - 1] += 1\n#print(c)\nfor i in range(N):\n print(c[i])\n\n ']
|
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
|
['s252935906', 's484690702', 's633923314', 's466819526']
|
[32296.0, 32364.0, 32372.0, 32308.0]
|
[2206.0, 159.0, 2206.0, 156.0]
|
[105, 170, 116, 181]
|
p02707
|
u141786930
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['# C - management\n\nimport collections\n\nn = int(input())\nA = list(int(x) for x in input().split())\n\nc = collections.Counter(A)\n\nprint(c)\n\nfor i in range(1, n+1):\n print(c[i])', '# C - management\n\nimport collections\n\nn = int(input())\nA = list(int(x) for x in input().split())\n\nc = collections.Counter(A)\n\nfor i in range(1, n+1):\n print(c[i])']
|
['Wrong Answer', 'Accepted']
|
['s190645383', 's385311299']
|
[57104.0, 34052.0]
|
[256.0, 204.0]
|
[175, 165]
|
p02707
|
u143903328
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['# from fractions import gcd\n# mod = 10 ** 9 + 7\n# N = int(input())\n# a = list(map(int,input().split()))\n# a,b,c = map(int,input().split())\n# ans = [0] * N\n\n\n# dp = [[[0] * 2 for i in range(3)] for j in range(5)]\n\nimport math\nimport numpy as np\nimport statistics\nimport string\nimport sys\nfrom array import array\nfrom collections import deque\nfrom functools import wraps\nimport time\n\ndef intinput():\n return int(input())\ndef listintinput():\n return list(map(int, input().split()))\ndef splitintinput():\n return map(int, input().split())\ndef factorialsurplus(x, y, z): \n ret = 1\n for i in range(x, y + 1):\n ret = (ret * i) % z\n return (ret)\ndef isprime(x):\n if x == 1:\n return False\n if x == 2:\n return True\n sq = int(math.sqrt(x))\n for i in range(2,sq+1):\n if x % i == 0:\n return False\n return True\ndef hcfnaive(a,b):\n if(b==0):\n return a\n else:\n return hcfnaive(b,a%b)\n\nN = intinput()\nA = listintinput()\n\njoushi = [0] * N\nfor i in range(N-1):\n joushi[A[i]] += 1\nfor w in joushi:\n print(w)\n', '# from fractions import gcd\n# mod = 10 ** 9 + 7\n# N = int(input())\n# a = list(map(int,input().split()))\n# a,b,c = map(int,input().split())\n# ans = [0] * N\n\n\n# dp = [[[0] * 2 for i in range(3)] for j in range(5)]\n\nimport math\nimport numpy as np\nimport statistics\nimport string\nimport sys\nfrom array import array\nfrom collections import deque\nfrom functools import wraps\nimport time\n\ndef intinput():\n return int(input())\ndef listintinput():\n return list(map(int, input().split()))\ndef splitintinput():\n return map(int, input().split())\ndef factorialsurplus(x, y, z): \n ret = 1\n for i in range(x, y + 1):\n ret = (ret * i) % z\n return (ret)\ndef isprime(x):\n if x == 1:\n return False\n if x == 2:\n return True\n sq = int(math.sqrt(x))\n for i in range(2,sq+1):\n if x % i == 0:\n return False\n return True\ndef hcfnaive(a,b):\n if(b==0):\n return a\n else:\n return hcfnaive(b,a%b)\n\nN = intinput()\nA = listintinput()\n\njoushi = [0] * N\nfor i in range(N-1):\n joushi[A[i]-1] += 1\nfor w in joushi:\n print(w)\n']
|
['Wrong Answer', 'Accepted']
|
['s062895862', 's562159866']
|
[51124.0, 50972.0]
|
[247.0, 237.0]
|
[1392, 1394]
|
p02707
|
u144072139
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['N=int(input())\nA=list(map(int,input().split()))\n\nAA=[0]*N\nfor j in A:\n AA[j-1]+=1\n\nprint(i for i in AA)', 'N=int(input())\nA=list(map(int,input().split()))\n\nAA=[0]*N\nfor j in A:\n AA[j-1]+=1\n\nfor i in AA:\n print(i)']
|
['Wrong Answer', 'Accepted']
|
['s653218822', 's790116542']
|
[32196.0, 32304.0]
|
[90.0, 148.0]
|
[106, 111]
|
p02707
|
u144304718
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
["社員数 = int(input())\n\n上司 = list(map(int, input.split(' ')))\n\nfor 社員番号 in range(1, 社員数+1):\n print(上司.count(社員番号))\n", "社員数 = int(input())\n部下数 = [0] * (社員数 + 1)\n\nfor 上司 in map(int, input().split(' ')):\n 部下数[上司] += 1\n\nprint('\\n'.join(map(str, 部下数[1:])))\n"]
|
['Runtime Error', 'Accepted']
|
['s982015546', 's351882717']
|
[9176.0, 27004.0]
|
[20.0, 109.0]
|
[150, 174]
|
p02707
|
u150985282
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['N = int(input())\nA = list(map(int, input().split()))\nc = [0 for _ in range(N+1)]\n\nfor i in A:\n c[i-1] += 1\nfor i in c:\n print(i)', 'N = int(input())\nA = list(map(int, input().split()))\nc = [0 for _ in range(N)]\n\nfor i in A:\n c[i-1] += 1\nfor i in c:\n print(i)']
|
['Wrong Answer', 'Accepted']
|
['s017212220', 's207138350']
|
[32312.0, 32236.0]
|
[142.0, 141.0]
|
[130, 128]
|
p02707
|
u152402277
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['N = input()\na = list(map(int,input().split()))\nprint(N,a)\nfor i in range(int(N)-1):\n\tprint(a.count(i+1))', 'N = input()\nN = int(N)\na = list(map(int,input().split()))\ns =[0]*N\nfor i in range(N-1):\n\ts[a[i]-1]+=1\n \nfor i in range(N):\n\tprint(s[i])\n ']
|
['Wrong Answer', 'Accepted']
|
['s059202084', 's398129011']
|
[32128.0, 32088.0]
|
[2206.0, 160.0]
|
[104, 143]
|
p02707
|
u153427406
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['N=int(input())\nA=[int(x) for x in input().split()]\nM=[0 for i in range(N)]\n\nfor i in range(len(A)):\n M[A[i]-1]+=1\nprint(M)', 'N=int(input())\nA=[int(x) for x in input().split()]\nM=[0 for i in range(N)]\n\nfor i in range(len(A)):\n M[A[i]-1]+=1\nfor i in M:\n print(i)']
|
['Wrong Answer', 'Accepted']
|
['s738414657', 's454129746']
|
[32152.0, 32308.0]
|
[119.0, 167.0]
|
[125, 141]
|
p02707
|
u155757809
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['n = int(input())\na = set([ int(x) for x in input().split() ])\n\nfor i in range(n-1):\n print(len(list(a & set([i+1]))))\n\nprint(0)\n', 'n = int(input())\na = [ int(x) for x in input().split() ]\nans = [0] * n\n\nfor i in range(n-1):\n ans[a[i]] += 1\n\nfor i in range(1, n):\n print(ans[i])\n\nprint(0)']
|
['Wrong Answer', 'Accepted']
|
['s065784675', 's743729650']
|
[32224.0, 32072.0]
|
[239.0, 165.0]
|
[131, 162]
|
p02707
|
u159335277
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['n = int(input())\na = list(map(int, input().split()))\nc = [] * n\nfor x in a:\n c[x-1] += 1\nfor x in c:\n print(x)', 'n = int(input())\na = list(map(int, input().split()))\nc = [0] * n\n\nfor x in a:\n c[x-1] += 1\nfor x in c:\n print(x)\n']
|
['Runtime Error', 'Accepted']
|
['s769392746', 's318971368']
|
[32172.0, 32240.0]
|
[68.0, 147.0]
|
[112, 115]
|
p02707
|
u161693347
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
["import sys, re, os\nfrom collections import deque, defaultdict, Counter\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians\n# from fractions import gcd\nfrom itertools import permutations, combinations, product, accumulate\nfrom operator import itemgetter, mul\nfrom copy import deepcopy\nfrom string import ascii_lowercase, ascii_uppercase, digits\nfrom functools import reduce\nfrom bisect import bisect_left, insort_left\nfrom heapq import heapify, heappush, heappop\n\nINPUT = lambda: sys.stdin.readline().rstrip()\nINT = lambda: int(INPUT())\nMAP = lambda: map(int, INPUT().split())\nS_MAP = lambda: map(str, INPUT().split())\nLIST = lambda: list(map(int, INPUT().split()))\nS_LIST = lambda: list(map(str, INPUT().split()))\n\nsys.setrecursionlimit(10 ** 9)\nINF = float('inf')\nmod = 10 ** 9 + 7\n\n\ndef main():\n N = INT()\n A = LIST()\n\n ans = [0] * (N - 1)\n for a in A:\n ans[a-1] += 1\n\n print(*ans, sep='\\n')\n\n\nif __name__ == '__main__':\n main()\n", "import sys, re, os\nfrom collections import deque, defaultdict, Counter\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians\n# from fractions import gcd\nfrom itertools import permutations, combinations, product, accumulate\nfrom operator import itemgetter, mul\nfrom copy import deepcopy\nfrom string import ascii_lowercase, ascii_uppercase, digits\nfrom functools import reduce\nfrom bisect import bisect_left, insort_left\nfrom heapq import heapify, heappush, heappop\n\nINPUT = lambda: sys.stdin.readline().rstrip()\nINT = lambda: int(INPUT())\nMAP = lambda: map(int, INPUT().split())\nS_MAP = lambda: map(str, INPUT().split())\nLIST = lambda: list(map(int, INPUT().split()))\nS_LIST = lambda: list(map(str, INPUT().split()))\n\nsys.setrecursionlimit(10 ** 9)\nINF = float('inf')\nmod = 10 ** 9 + 7\n\n\ndef main():\n N = INT()\n A = LIST()\n\n ans = [0] * (N - 1)\n for a in A:\n ans[a-1] += 1\n\n ans.append(0)\n print(*ans, sep='\\n')\n\n\nif __name__ == '__main__':\n main()\n"]
|
['Wrong Answer', 'Accepted']
|
['s195770702', 's755941542']
|
[33972.0, 33836.0]
|
[122.0, 128.0]
|
[974, 992]
|
p02707
|
u165114979
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['n = int(input())\na = list(map(int, input().split()))\nb = [0]*(n+1)\n\nfor i in range(1, n+1):\n print(a.count[i])\n\t', 'n = int(input())\na = list(map(int, input().split()))\nb = [0]*(n+1)\n\nfor i in range(n-1):\n b[a[i]] += 1\n\nfor i in range(1,n+1):\n print(b[i])\n\n']
|
['Runtime Error', 'Accepted']
|
['s438278302', 's237462251']
|
[32220.0, 32352.0]
|
[72.0, 162.0]
|
[113, 143]
|
p02707
|
u165368960
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['n = int(input())\na = list(map(int, input().split()))\nlst = []\n\nfor i in range(1,max(a)+1):\n count = a.count(i)\n lst.append(count)\nlst.append(0)\n\nfor i in range(n):\n print(lst[i])', 'n = int(input())\na = list(map(int, input().split()))\nans = [0] * n\n\nfor i in range(n-1):\n ans[a[i]-1] += 1\n\nfor i in range(n):\n print(ans[i])']
|
['Runtime Error', 'Accepted']
|
['s025205240', 's802059158']
|
[32368.0, 32372.0]
|
[2206.0, 164.0]
|
[181, 143]
|
p02707
|
u166849422
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['N = int(input())\nList = list(map(int,input().split()))\nList2 = [0]*N\nfor i in range(N-1):\n List2[List[i-1]-1] += 1\nprint(List2)', 'N = int(input())\nList = list(map(int,input().split()))\nList2 = [0]*N\nfor i in range(N-1):\n List2[List[i-1]-1] += 1 \nfor j in List2:\n print(j)']
|
['Wrong Answer', 'Accepted']
|
['s555207718', 's673465035']
|
[32380.0, 32216.0]
|
[112.0, 159.0]
|
[130, 147]
|
p02707
|
u169350228
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['import numpy as np\nn = int(input())\na = np.array(input().split())\nbuka = [0 for i in range(n)]\n\nfor i in a:\n buka[i] += 1\n\nfor i in buka:\n print(i)\n', 'import numpy as np\nn = int(input())\na = np.array(input().split(),dtype=int)\nbuka = [0 for i in range(n)]\n\nfor i in a:\n buka[i] += 1\n\nfor i in buka:\n print(i)\n', 'import numpy as np\nn = int(input())\na = np.array(input().split(),dtype=int)\nbuka = [0 for i in range(n)]\n\nfor i in a:\n buka[i-1] += 1\n\nfor i in buka:\n print(i)\n']
|
['Runtime Error', 'Wrong Answer', 'Accepted']
|
['s227661785', 's278315288', 's155381426']
|
[53984.0, 49564.0, 49644.0]
|
[141.0, 245.0, 304.0]
|
[154, 164, 166]
|
p02707
|
u181159654
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['n = int(input())\nai = list(map(int, input().split()))\n\nans = [0]*n\nfor i in range(len(ai)):\n ans[ai[i]] += 1\nfor i in range(len(ans)):\n print(ans[i])', 'n = int(input())\nai = list(map(int, input().split()))\n\nans = [0]*n\nfor i in range(len(ai)):\n ans[ai[i]-1] += 1\nfor i in range(len(ans)):\n print(ans[i])']
|
['Wrong Answer', 'Accepted']
|
['s037761027', 's790540321']
|
[32196.0, 32228.0]
|
[156.0, 164.0]
|
[155, 157]
|
p02707
|
u185405877
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['n=int(input())\ns = list(map(int, input().split()))\nz=[]*n\nfor i in range(len(s)):\n z[s[i]-1]+=1\nfor j in range(n):\n print(z[j])', 'n=int(input())\ns = list(map(int, input().split()))\nz=[0]*n\nfor i in range(len(s)):\n k=s[i]-1\n z[k]+=1\nfor j in range(n):\n print(z[j])']
|
['Runtime Error', 'Accepted']
|
['s530002860', 's487382997']
|
[32312.0, 32240.0]
|
[65.0, 166.0]
|
[134, 143]
|
p02707
|
u186121428
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['from collections import Counter\nn = int(input())\nAl = list(input().split())\ncount = Counter(Al)\nprint(count)\nfor i in range(n):\n if str(i + 1) in Al:\n print(count[str(i+1)])\n else:\n print(0)', 'from collections import Counter\nn = int(input())\nAl = list(input().split())\ncdict = Counter(Al)\nfor i in range(n):\n print(cdict[str(i+1)])']
|
['Wrong Answer', 'Accepted']
|
['s907430811', 's586968980']
|
[63500.0, 41508.0]
|
[2209.0, 217.0]
|
[210, 141]
|
p02707
|
u189516107
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['N = int(input())\nA = [0]\nB = list(map(int, input().split()))\nA += B\n#print(A)\n\nsig = [0] * N\n\nfor i in range(N-1):\n sig[A[i+1]] += 1\n#print(sig)\n\nprint(sig)\nfor i in sig:\n print(i)', 'N = int(input())\nA = [0]\nB = list(map(int, input().split()))\nA += B\n#print(A)\n\nsig = [0] * N\n\nfor i in range(N-1):\n sig[A[i+1]] += 1\n#print(sig)\n\n#print(sig)\nfor i in sig:\n print(i)', 'N = int(input())\nA = [0]\nB = list(map(int, input().split()))\nA += B\n#print(A)\n\nsig = [0] * N\n\nfor i in range(N-1):\n sig[A[i+1]-1] += 1\n#print(sig)\n\n#print(sig)\nfor i in sig:\n print(i)']
|
['Wrong Answer', 'Wrong Answer', 'Accepted']
|
['s225815902', 's572515804', 's096967963']
|
[32232.0, 32360.0, 32228.0]
|
[170.0, 163.0, 160.0]
|
[182, 183, 185]
|
p02707
|
u190905976
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['n = int(input())\na = [int(x) for x in input().split()]\nfor i in range(1,n+1):\n print(a.count[i])', 'n = int(input())\na = [int(x) for x in input().split()]\nfor i in range(1,n+1):\n print(a.count[i])', 'import collections\nn = int(input())\na = [int(x) for x in input().split()]\na = collections.Counter(a)\nfor i in range(n):\n print(a[i+1])']
|
['Runtime Error', 'Runtime Error', 'Accepted']
|
['s200729361', 's759222610', 's574510122']
|
[32120.0, 32168.0, 35488.0]
|
[65.0, 66.0, 176.0]
|
[97, 99, 137]
|
p02707
|
u192058345
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['#!/usr/bin/env python3\nfrom sys import stdin\n\n\ndef solve(tc):\n n = int(stdin.readline().strip())\n ai = list(map(int, stdin.readline().split()))\n\n adj = [[] for i in range(n)]\n for i in range(n - 1):\n adj[ai[i] - 1].append(i + 1)\n\n for children in adj:\n print(len(children))\n\n\n\nLOCAL_TEST = not __debug__\nif LOCAL_TEST:\n infile = __file__.split(\'.\')[0] + "-test.in"\n stdin = open(infile, \'r\')\n\ntcs = int(stdin.readline().strip())\ntc = 1\nwhile tc <= tcs:\n solve(tc)\n tc += 1', '#!/usr/bin/env python3\nfrom sys import stdin\n\n\ndef solve(tc):\n n = int(stdin.readline().strip())\n ai = list(map(int, stdin.readline().split()))\n\n adj = [[] for i in range(n)]\n for i in range(n - 1):\n adj[ai[i] - 1].append(i + 1)\n\n for children in adj:\n print(len(children))\n\n\n\nLOCAL_TEST = not __debug__\nif LOCAL_TEST:\n infile = __file__.split(\'.\')[0] + "-test.in"\n stdin = open(infile, \'r\')\n\ntcs = 1\ntc = 1\nwhile tc <= tcs:\n solve(tc)\n tc += 1']
|
['Runtime Error', 'Accepted']
|
['s180481176', 's288994786']
|
[11648.0, 44192.0]
|
[31.0, 211.0]
|
[513, 485]
|
p02707
|
u193597115
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['def management(N,array):\n\tres = []\n\tfor i in range(N):\n res[array[i]] += 1\n for j in range(len(res)):\n print(res[j])\n \n \n \nN = int(input())\narray = list(map(int,input().split())\nmanagememt(N,array))', 'def management(N,array):\n\tres = []\n\tfor i in range(N):\n res[array[i]] += 1\n for j in range(len(res)):\n print(res[j])\n \n \n \nN = int(input())\narray = list(map(int,input().split())\nmamagememt(N,array))', "def management(N,array):\n res = [0]*N\n for i in range(len(array)):\n res[array[i]-1] += 1\n for j in range(len(res)):\n print(res[j])\n\nif __name__ == '__main__':\n N = int(input())\n array = list(map(int,input().split()))\n management(N,array)"]
|
['Runtime Error', 'Runtime Error', 'Accepted']
|
['s225856991', 's497983025', 's156053885']
|
[9012.0, 9016.0, 32372.0]
|
[22.0, 22.0, 133.0]
|
[221, 221, 249]
|
p02707
|
u196297781
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['n=int(input())\na=[0]*n\nfor i in input().split(" "):\n a[int(i)-1]+=1\nprint(a)\n', 'n=int(input())\na=[0]*n\nfor i in input().split(" "):\n a[int(i)-1]+=1\nfor i in a:\n print(i) \n']
|
['Wrong Answer', 'Accepted']
|
['s388558255', 's381660952']
|
[25900.0, 26012.0]
|
[98.0, 155.0]
|
[80, 97]
|
p02707
|
u197955752
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['N = int(input())\nA = [0, 0] + [int(x) for x in input().split()]\n\nbuka = [0] * (N + 1)\n\nfor i in range(2, N + 1):\n buka[A[i]] += 1\n print("A[{}] = {}".format(i, A[i]))\n\nfor i in range(1, N + 1):\n print(buka[i])', 'N = int(input())\nA = [0, 0] + [int(x) for x in input().split()]\n\nbuka = [0] * (N + 1)\n\nfor i in range(2, N + 1):\n buka[A[i]] += 1\n print("A[{}] = {}".format(i, A[i]))\n\nfor i in range(1, N + 1):\n print(buka[i])', 'N = int(input())\nA = [0, 0] + [int(x) for x in input().split()]\n\nbuka = [0] * (N + 1)\n\nfor i in range(2, N + 1):\n buka[A[i]] += 1\n\nfor i in range(1, N + 1):\n print(buka[i])']
|
['Wrong Answer', 'Wrong Answer', 'Accepted']
|
['s034548640', 's368772075', 's999772081']
|
[32204.0, 32260.0, 32244.0]
|
[276.0, 280.0, 165.0]
|
[218, 218, 178]
|
p02707
|
u201986772
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['N=int(input())\nA_lis=list(map(int,input().split()))\np=[0]*N\nfor i in A_lis:\n p[i-1]+=1\n\nfor _ in p:\n print(p[_])', 'N=int(input())\nA_lis=list(map(int,input().split()))\np={i:0 for i in range(1,N+1)} \nfor j in A_lis:\n p[j]+=1\n \nfor i in range(1,N+1):\n print(p[i])']
|
['Wrong Answer', 'Accepted']
|
['s903355642', 's676099845']
|
[32360.0, 38920.0]
|
[152.0, 186.0]
|
[114, 151]
|
p02707
|
u201993393
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['import collection\nN = int(input())\nA = list(map(int, input().split()))\ncount = collections.Counter(A)\nfor n in range(N):\n print(count[n + 1])\n ', 'import collections\nN = int(input())\nA = list(map(int, input().split()))\ncount = collections.Counter(A)\nfor i in range(N):\n print(count[i+1])']
|
['Runtime Error', 'Accepted']
|
['s531946225', 's595747071']
|
[8988.0, 34036.0]
|
[22.0, 187.0]
|
[145, 141]
|
p02707
|
u202406075
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['import numpy as np\n\nN = int(input())\nA = np.array(list(map(int, input().split())))\n\nsub = np.bincount(A, weights=None, minlength=N+1)\nsub1 = sub.reshape(N+1, 1)\n\nprint(sub1[1:])\n', 'N = int(input())\nA = list(map(int, input().split()))\n\nsub = [A.count(i) for i in range(N)]\n\n[print(j) for j in sub]', 'N = int(input())\nA = list(map(int, input().split()))\nsub = []\n\nfor i in range(N):\n sub.append(A.count(i+1))\n\nfor j in range(len(sub)):\n print(sub[i])', 'import numpy as np\n\nN = int(input())\nA = np.array(list(map(int, input().split())))\n\nsub = np.bincount(A, weights=None, minlength=N+1)\n\nprint(sub[1:])', 'import numpy as np\n\nN = int(input())\nA = np.array(list(map(int, input().split())))\n\nsub = np.bincount(A, weights=None, minlength=N+1)\n\nfor i in range(N):\n print(sub[i+1])']
|
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
|
['s409528180', 's589103448', 's820108536', 's863719706', 's921793743']
|
[50944.0, 32316.0, 32252.0, 50916.0, 50728.0]
|
[160.0, 2206.0, 2206.0, 159.0, 322.0]
|
[178, 115, 155, 149, 173]
|
p02707
|
u203843959
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['N=int(input())\nalist=list(map(int,input().split()))\n\nanswer_dic={}\nfor a in alist:\n if a in answer_dic:\n answer_dic[a]+=1\n else:\n answer_dic[a]=1\nprint(answer_dic)\n\nfor i in range(1,N+1):\n if i in answer_dic:\n print(answer_dic[i])\n else:\n print(0)', 'N=int(input())\nalist=list(map(int,input().split()))\n\nanswer_dic={}\nfor a in alist:\n if a in answer_dic:\n answer_dic[a]+=1\n else:\n answer_dic[a]=1\n#print(answer_dic)\n\nfor i in range(1,N+1):\n if i in answer_dic:\n print(answer_dic[i])\n else:\n print(0)']
|
['Wrong Answer', 'Accepted']
|
['s001876312', 's761139256']
|
[33516.0, 33576.0]
|
[222.0, 193.0]
|
[263, 264]
|
p02707
|
u204616996
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['N=int(input())\nX=[0]*N\nfor a in map(int,input().split()):\n X[a-1]+=1\nfor i in range(N-1):\n print(X[i])', 'N=int(input())\nX=[0]*N\nfor a in map(int,input().split()):\n X[a-1]+=1\nfor i in range(N):\n print(X[i])\n\n']
|
['Wrong Answer', 'Accepted']
|
['s678368898', 's536782099']
|
[26012.0, 25908.0]
|
[155.0, 153.0]
|
[104, 104]
|
p02707
|
u208309047
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['N = int(input())\nA = list(map(int, input().split()))\nB = []\n\nfor i in range(1,N+1):\n B[i] = 0\nfor j in A:\n B[j] += 1\nfor k in B.values():\n print(k)', 'B = {}\nN = int(input())\nA = list(map(int, input().split()))\n\n\nfor i in range(N):\n #B[i+1] = 0\nprint(B)\nfor j in A:\n #B[j] += 1\nprint(B)\nfor k in B.values():\n print(k)\n', 'N = int(input())\nA = list(map(int, input().split()))\nB = []\n\nfor i in range(N):\n B[i] = 0\nfor j in A:\n B[j] += 1\nfor k in B.values():\n print(k)', 'N = int(input())\nA = list(map(int, input().split()))\n\nfor i in range(N):\n B[i] = 0\nfor j in A:\n B[j] += 1\nfor k in B.values():\n print(k)', 'N = int(input())\nA = list(map(int, input().split()))\nB = []\n\nfor i in range(N):\n B[i+1] = 0\nfor j in A:\n B[j] += 1\nfor k in B.values():\n print(k)', 'B = {}\nN = int(input())\nA = list(map(int, input().split()))\n\n\nfor i in range(N):\n B[i+1] = 0\n\nfor j in A:\n B[j] += 1\n\nfor k in B.values():\n print(k)\n\n']
|
['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted']
|
['s058966557', 's160796460', 's331555617', 's767255659', 's935161482', 's573824491']
|
[32184.0, 8960.0, 32280.0, 32372.0, 32376.0, 38768.0]
|
[65.0, 23.0, 65.0, 69.0, 63.0, 197.0]
|
[156, 189, 152, 145, 154, 190]
|
p02707
|
u210369205
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['N = int(input())\nA = list(map(int,input().split()))\nB = [0] * (N - 1)\nfor i in range(N - 1):\n B[A[i] - 1] += 1\nfor i in B:\n print(i)', 'N = int(input())\nA = list(map(int,input().split()))\nB = [0] * (N - 1)\nfor i in range(N - 1):\n B[A[i] - 1] += 1\nfor i in B:\n print(i)\nprint("0")']
|
['Wrong Answer', 'Accepted']
|
['s132512044', 's956386158']
|
[32304.0, 32296.0]
|
[153.0, 155.0]
|
[138, 149]
|
p02707
|
u215753631
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['n = int(input())\nboss_list = list(map(int, input().split(" ")))\n\nboss_list = sorted(boss_list)\n\n\nfor i in range(n):\n boss_num = boss_list.count(i + 1)\n boss_list = boss_list[:boss_num]\n\n if i == 0:\n boss_num -= 1\n\n print(boss_num)', 'n = int(input())\nboss_list = list(map(int, input().split(" ")))\n\nboss_list = sorted(boss_list)\n\n\nfor i in range(n):\n boss_num = 0\n boss_num = boss_list.count(i + 1)\n boss_list = boss_list[boss_num:]\n\n if i == 0:\n boss_num -= 1\n\n print(boss_num)', 'n = int(input())\nboss_list = list(map(int, input().split(" ")))\n\n\n\n# buf_counter = boss_list.count(i + 1)\n\n\n\n\n\n# for val in buka_list:\n# print(val)\n\nfor i in range(n):\n boss_num = boss_list.count(i + 1)\n\n if i == 0:\n boss_num -= 1\n\n print(boss_num)\n', '# n = int("5")\n\nn = int(input())\nboss_list = list(map(int, input().split(" ")))\n\nboss_list = sorted(boss_list)\n\n\nfor i in range(n):\n boss_num = 0\n boss_num = boss_list.count(i + 1)\n \n del boss_list[:boss_num]\n\n if i == 0:\n boss_num -= 1\n\n print(boss_num)\n', 'n = int(input())\nboss_list = list(map(int, input().split(" ")))\n\nboss_list = sorted(boss_list)\n\n\nfor i in range(1, n+1):\n \n boss_count = 0\n while (True):\n index = 0\n if boss_list[index] == i:\n boss_count += 1\n else:\n break\n\n del boss_list[:boss_count]\n print(boss_count)', 'n = int(input())\nboss_list = list(map(int, input().split(" ")))\n\nboss_list = sorted(boss_list, reverse=True)\n\n\nfor i in range(n, 0, -1):\n boss_num = 0\n boss_num = boss_list.index(i-1)\n \n del boss_list[:boss_num]\n\n if i == 0:\n boss_num -= 1\n\n print(boss_num)', 'n = int(input())\nboss_list = list(map(int, input().split(" ")))\n\n\nbuka_list = []\n\nfor i in range(n):\n buf_counter = boss_list.count(i + 1)\n if i == 0:\n buf_counter -= 1\n\n buka_list.append(buf_counter)\n\nfor val in buka_list:\n print(val)\n', 'n = int(input())\nboss_list = list(map(int, input().split(" ")))\n\nboss_count_list = [0] * n\n\n\nfor val in boss_list:\n boss_count_list[val - 1] += 1\n\nfor val in boss_count_list:\n print(val)']
|
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Time Limit Exceeded', 'Runtime Error', 'Wrong Answer', 'Accepted']
|
['s138719360', 's260681959', 's329843282', 's417095810', 's612226743', 's644045297', 's970184263', 's662462172']
|
[32372.0, 32296.0, 32252.0, 32384.0, 32236.0, 32376.0, 32368.0, 32376.0]
|
[193.0, 2206.0, 2206.0, 2206.0, 2206.0, 2206.0, 2206.0, 148.0]
|
[249, 266, 370, 364, 361, 316, 255, 188]
|
p02707
|
u218341628
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['employeeCount = int(input())\nDirectBosses = list(map(int, input().split()))\n\nfor em in range(employeeCount):\n directJuniorCount = 0\n\n \n for bo in DirectBosses:\n if em == bo :\n directJuniorCount += 1\n\n print(directJuniorCount)', 'employeeCount = int(input())\ndirectBosses = list(map(int, input().split()))\ndirectJuniorCounts = [0] * employeeCount\n\nfor boss in directBosses:\n directJuniorCounts[boss - 1] += 1\n\nfor jc in directJuniorCounts:\n print(jc)']
|
['Wrong Answer', 'Accepted']
|
['s564271676', 's224507416']
|
[32300.0, 32228.0]
|
[2206.0, 144.0]
|
[326, 226]
|
p02707
|
u218838821
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['N = int(input())\nA = list(map(int,input().split()))\n\nans = [0]*N\nfor i in range(N-1):\n ans[A[i]] += 1\nfor i in range(1,N):\n print(ans[i])', 'N = int(input())\nA = list(map(int,input().split()))\n\nans = [0]*N\nfor i in range(N-1):\n ans[A[i]-1] += 1\nfor i in range(0,N):\n print(ans[i])']
|
['Wrong Answer', 'Accepted']
|
['s155592866', 's152755561']
|
[32236.0, 32368.0]
|
[154.0, 168.0]
|
[143, 145]
|
p02707
|
u220499476
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['n =int(input())\ns = list(map(int,input().split()))\nl =[0]*n\nwhile i < n-2 :\n l[s[i]-1] += 1\n i += 1\nfor _ in range(n):\n print(l[_])', 'n, m =map(int,input().split())\ns = list(map(int,input().split()))\na = [input() for __ in range(n)]\n\nn =int(input())\ns = list(map(int,input().split()))\nl =[0]*n\nprint(l)\nwhile i < n-2 :\n l[s[i]-1] += 1\n i += 1\nfor _ in range(n):\n print(l[_])', 'n =int(input())\ns = list(map(int,input().split()))\nl =[0]*n\nfor i in range(n-1) :\n l[s[i]-1] += 1\nfor _ in range(n):\n print(l[_])']
|
['Runtime Error', 'Runtime Error', 'Accepted']
|
['s554702757', 's696651419', 's335274997']
|
[32352.0, 9120.0, 32368.0]
|
[68.0, 23.0, 161.0]
|
[143, 252, 137]
|
p02707
|
u221264296
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['n=int(input())\nt= [0]*(n+1)\nl=[int(i) for i in input().split()]\nfor i in range(2, n+1):\n t[l[i]]+=1\nfor i in range(1,n+1):\n print(t[i])', 'n=int(input())\nt= [0]*(n+1)\nl=[int(i) for i in input().split()]\nfor i in l:\n t[i]+=1\nfor i in range(1,n+1):\n print(t[i])']
|
['Runtime Error', 'Accepted']
|
['s645876669', 's338638119']
|
[33880.0, 33892.0]
|
[98.0, 159.0]
|
[137, 122]
|
p02707
|
u221537793
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['N = int(input())\nA = list(map(int, input().split()))\nans = [0] * N\nfor i in A:\n ans[i] += 1\nfor a in ans[1:]:\n print(a)', 'N = int(input())\nA = list(map(int, input().split()))\nans = [0] * (N+1)\nfor i in A:\n ans[i] += 1\nfor a in ans[1:]:\n print(a)']
|
['Wrong Answer', 'Accepted']
|
['s591994996', 's044720381']
|
[32208.0, 32252.0]
|
[144.0, 142.0]
|
[125, 129]
|
p02707
|
u221766194
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['N = int(input())\nA = list(map(int,input().split()))\nm = [0]*N #0~N-1\nprint(m)\nfor i in A:\n m[i-1] += 1\nfor i in range(N):\n print(m[i])\n', 'N = int(input())\nA = list(map(int,input().split()))\n\nfor i in range(1,N):\n print(sum(x == i for x in A))\n', 'N = int(input())\nA = list(map(int,input().split()))\nm = [0]*N #0~N-1\n\nfor i in A:\n m[i-1] += 1\n# print(m)\nfor i in range(N):\n print(m[i])\n']
|
['Wrong Answer', 'Wrong Answer', 'Accepted']
|
['s465757452', 's945953836', 's787657860']
|
[32324.0, 32376.0, 32368.0]
|
[164.0, 2206.0, 153.0]
|
[141, 108, 144]
|
p02707
|
u229518917
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['N=int(input())\nA=[int(i) for i in input().split()]\nlis=[0 for i in range(N)]\nfor i in A:\n lis[i-1]+=1\nprint(lis)', 'N=int(input())\nA=[int(i) for i in input().split()]\nlis=[0 for i in range(N)]\nfor i in A:\n lis[i-1]+=1\nfor t in lis:\n print(t)']
|
['Wrong Answer', 'Accepted']
|
['s417717165', 's679573649']
|
[32320.0, 32324.0]
|
[120.0, 157.0]
|
[115, 131]
|
p02707
|
u229833930
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['n = int(input())\na = list(map(int, input().split()))\nb = [0 for i in range(n)]\n\nfor i in range(n-1):\n b[a[i]-1] += 1\n\nfor j in range(n-1):\n print(b[j])\n ', 'n = int(input())\na = list(map(int, input().split()))\nb = [0 for i in range(n)]\n\nfor i in range(n-1):\n b[a[i]-1] += 1\n\nfor j in range(n):\n print(b[j])\n ']
|
['Wrong Answer', 'Accepted']
|
['s316731945', 's952123222']
|
[32376.0, 32304.0]
|
[166.0, 164.0]
|
[156, 154]
|
p02707
|
u231959533
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['n = int(input())\na = list(map(int, input().split()))\nans = [0]*n\nfor i in range(n-1):\n ans[a[i]-1] += 1\nprint(a)\n[print(i) for i in ans]', 'n = int(input())\na = list(map(int, input().split()))\nans = [0]*n\nfor i in range(n-1):\n ans[a[i]-1] += 1\n[print(i) for i in ans]']
|
['Wrong Answer', 'Accepted']
|
['s363723288', 's043055101']
|
[32236.0, 32376.0]
|
[165.0, 149.0]
|
[137, 128]
|
p02707
|
u236536206
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['import collections\nn=int(input())\na=list(map(int,input().split()))\n\nb=collections.Counter(a)\nfor i in range(n+1):\n print(b[i])\n', 'import collections\nn=int(input())\na=list(map(int,input().split()))\n\nb=collections.Counter(a)\nfor i in range(1,n+1):\n print(b[i])\n']
|
['Wrong Answer', 'Accepted']
|
['s449121396', 's564579375']
|
[34044.0, 34088.0]
|
[184.0, 174.0]
|
[130, 132]
|
p02707
|
u237299453
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['n = int(input())\n\na = list(map(int,input().split()))\n\nfor i in range(1, n):\n print(a.count(i))', 'n = int(input())\n\na = list(map(int,input().split()))\n \nres = [0] * n\n \nfor i in a:\n res[i - 1] += 1\n \nfor i in res:\n print(i)']
|
['Wrong Answer', 'Accepted']
|
['s653670380', 's253391426']
|
[32204.0, 32216.0]
|
[2206.0, 151.0]
|
[95, 128]
|
p02707
|
u239917977
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
["def main():\n N = int(input())\n A = list(map(int, input().split()))\n\n import collections\n\n C = collections.Counter(A)\n for a in A:\n try:\n print(C[a+1])\n except:\n print(0)\n\n\nif __name__ == '__main__':\n main()\n", "def main():\n N = int(input())\n A = list(map(int, input().split()))\n\n import collections\n\n C = collections.Counter(A)\n print(C[1])\n for a in A:\n try:\n print(C[a+1])\n except:\n print(0)\n\n\nif __name__ == '__main__':\n main()\n", "def main():\n N = int(input())\n A = list(map(int, input().split()))\n\n import collections\n\n C = collections.Counter(A)\n m = max(A)\n for i in range(m):\n print(C[i+1])\n\n for _ in range(N-m):\n print(0)\n\n\nif __name__ == '__main__':\n main()\n"]
|
['Wrong Answer', 'Wrong Answer', 'Accepted']
|
['s618598739', 's721636852', 's728896551']
|
[33684.0, 33680.0, 33504.0]
|
[195.0, 171.0, 171.0]
|
[261, 277, 272]
|
p02707
|
u243714267
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['n = int(input())\na = list(map(int, input()))\n\nout = [0]*n\n\nfor aa in a:\n out[a] += 1\n\nfor o in range(len(out)):\n print(o)', 'n = int(input())\na = list(map(int, input().split()))\n\nout = [0]*n\n\nfor aa in a:\n out[aa-1] += 1\n\nfor i in range(len(out)):\n print(out[i])']
|
['Runtime Error', 'Accepted']
|
['s226980968', 's877430977']
|
[11460.0, 32376.0]
|
[25.0, 154.0]
|
[123, 139]
|
p02707
|
u244466744
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['N = int(input())\nA = list(map(int, input()))\n\nresult = [0] * N\n\nfor a in A:\n result[a-1] += 1\n \nfor i in range(N):\n print(result[i])', 'N = int(input())\nA = list(map(int, input().split()))\n\nresult = [0] * N\n\nfor a in A:\n result[a-1] += 1\n \nfor i in range(N):\n print(result[i])\n']
|
['Runtime Error', 'Accepted']
|
['s303847008', 's144446940']
|
[11540.0, 32176.0]
|
[26.0, 160.0]
|
[135, 144]
|
p02707
|
u245960901
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['s = input().split()\nn = int(s[0])\ns = input().split()\nd = [0]*n\nprint(d)\nfor i in s:\n d[int(i)-1]+=1\n\nfor i in range(n):\n print(d[i])', 's = input().split()\nn = int(s[0])\ns = input().split()\nd = [0]*n\nfor i in s:\n d[int(i)-1]+=1\n\nfor i in range(n):\n print(d[i])\n']
|
['Wrong Answer', 'Accepted']
|
['s261778012', 's444293112']
|
[26204.0, 25164.0]
|
[173.0, 164.0]
|
[139, 131]
|
p02707
|
u246809151
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['N = int(input())\nA = list(map(int,input().split()))\n\nfor i in range(1,N):\n print(A.count(i))', 'N = int(input())\nA = list(map(int,input().split()))\n\n\n# print(A.count(i))\n\nans = [0]*N \n#print(ans)\nfor i in A:\n ans[i-1] += 1\n\n\nfor i in ans:\n print(i)\n']
|
['Wrong Answer', 'Accepted']
|
['s487165302', 's520764881']
|
[32236.0, 32200.0]
|
[2206.0, 149.0]
|
[95, 223]
|
p02707
|
u247680229
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['N=int(input())\n\nA=list(map(int, input().split()))\n\nB=[0]*len(A)\n\nfor i in A:\n B[i-1]+=1\n \nprint([i for i in B])', 'N=int(input())\n\nA=list(map(int, input().split()))\n\nB=[0]*len(A)\n\nfor i in A:\n B[i-1]+=1\n \nprint([i for i in B])', 'N=int(input())\n\nA=list(map(int, input().split()))\n\nB=[0]*len(A)\n\nfor i in A:\n B[i-1]+=1\n \nfor i in B:\n print(i)', 'N=int(input())\n\nA=list(map(int, input().split()))\n\nB=[0]*(len(A)+1)\n\nfor i in A:\n B[i-1]+=1\n \nfor i in B:\n print(i)']
|
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
|
['s069980898', 's124554792', 's617635778', 's696441211']
|
[32360.0, 32248.0, 32176.0, 32372.0]
|
[108.0, 102.0, 150.0, 140.0]
|
[113, 113, 114, 118]
|
p02707
|
u250554058
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['n = int(input())\na = list(int(i) for i in input().split())\n\np = [0] * n\n\nfor i in p:\n for j in a:\n if(i == j - 1):\n p[i] += 1\n\nfor i in p:\n print(i)\n', 'n = int(input())\na = list(int(i) for i in input().split())\n\np = [0] * n\n\nfor i in a:\n p[i - 1] += 1\n\nfor i in p:\n print(i)\n']
|
['Wrong Answer', 'Accepted']
|
['s581973364', 's284768185']
|
[32296.0, 32300.0]
|
[2206.0, 150.0]
|
[159, 127]
|
p02707
|
u251515715
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['import collections\nn=int(input())\na=list(map(int,input().split()))\nb=list(collections.Counter(a).values())\nfor i in b:\n print(i)', 'import collections\nn=int(input())\nc=collections.Counter(list(map(int,input().split())))\nfor i in range(1,n+1):\n print(c[i])']
|
['Wrong Answer', 'Accepted']
|
['s294566031', 's093623383']
|
[34188.0, 34164.0]
|
[147.0, 183.0]
|
[129, 124]
|
p02707
|
u252964975
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['N=int(input())\nA=list(map(int, input().split()))\nfor i in [1:N+1]:\n print(len([1 for x in A if x==i]))', "import numpy as np\nN=int(input())\nA_np = np.zeros(N)\nA=list(map(int, input().split()))\nfor Ai in A:\n A_np[Ai-1] = A_np[Ai-1] + 1\nfor i in range(N):\n print('{:.0f}'.format(A_np[i]))"]
|
['Runtime Error', 'Accepted']
|
['s880948801', 's912763916']
|
[8888.0, 50940.0]
|
[22.0, 415.0]
|
[103, 182]
|
p02707
|
u254871849
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
["import sys\n\nn, *a = map(int, sys.stdin.read().split())\nprint(a)\ngraph = [[] for _ in range(n)]\nfor i in range(n - 1):\n graph[a[i]-1].append(i)\ndef main():\n for i in range(n):\n print(len(graph[i]))\n\n\nif __name__ == '__main__':\n main()", "import sys\n\nn, *a = map(int, sys.stdin.read().split())\ngraph = [[] for _ in range(n)]\nfor i in range(n - 1):\n graph[a[i]-1].append(i)\ndef main():\n for i in range(n):\n print(len(graph[i]))\n\n\nif __name__ == '__main__':\n main()"]
|
['Wrong Answer', 'Accepted']
|
['s421205157', 's929893079']
|
[45356.0, 44040.0]
|
[318.0, 334.0]
|
[249, 240]
|
p02707
|
u255943004
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['N = int(input())\nA = [int(i) for i in input().split()]\nfrom collections import defaultdict as ddict\nfor n in range(N-1):\n A.append(int(input()))\n\nB = ddict(int)\nfor a in A:\n B[a-1] += 1\nfor n in range(N):\n print(B[n])\n', 'N = int(input())\nA = []\nfrom collections import defaultdict as ddict\nfor n in range(N-1):\n A.append(int(input()))\n\nB = ddict(int)\nfor a in A:\n B[a-1] += 1\nfor n in range(N):\n print(B[n])\n', 'N = int(input())\nA = []\nfrom collections import defaultdict as ddict\nfor n in range(N):\n A.append(int(input()))\n\nB = ddict(int)\nfor a in A:\n B[a] += 1\nfor n in range(N):\n print(B[n])', 'N = int(input())\nA = [int(i) for i in input().split()]\nfrom collections import defaultdict as ddict\n\nB = ddict(int)\nfor a in A:\n B[a-1] += 1\nfor n in range(N):\n print(B[n])\n']
|
['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted']
|
['s189231735', 's270552575', 's284229546', 's786313208']
|
[32320.0, 11616.0, 11564.0, 39512.0]
|
[72.0, 31.0, 31.0, 242.0]
|
[221, 190, 185, 175]
|
p02707
|
u257442624
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['N = int(input())\nA = list(map(int, input().split()))\nx = [0]*(2*10**5)\nfor i in range(2, N):\n x[A[i]] += 1\nfor i in range(N):\n print(x[i])\n', 'N = int(input())\nA = list(map(input().split()))\n\nfor i in range(N):\n print(A.count(i+1))', 'N = int(input())\nA = list(map(int, input().split()))\nx = [0]**(2*10**5)\nfor i in range(N):\n x[A[i]] += 1\n\nfor i in range(N):\n print(x[i])', 'N = int(input())\nA = list(map(int, input().split()))\nx = [0]*(2*10**5+1)\nfor i in range(N-1):\n x[A[i]] += 1\nfor i in range(1,N+1):\n print(x[i])']
|
['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted']
|
['s503022956', 's637482768', 's684244234', 's598198091']
|
[32240.0, 24248.0, 32196.0, 32228.0]
|
[94.0, 37.0, 62.0, 159.0]
|
[141, 89, 139, 149]
|
p02707
|
u264988409
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
["N = int(input())\nA = list(map(int, input().split()))\nD = [0 for i in range(N)]\n\nfor i in A:\n D[i] += 1\n\nprint(*D, sep='\\n')", 'N = int(input())\nA = list(map(int, input().split()))\nD = [0 for i in range(N)]\n\nfor i in A:\n D[i-1] += 1\n\nfor i in range(len(D)):\n print(D[i])']
|
['Wrong Answer', 'Accepted']
|
['s019916210', 's900362374']
|
[32384.0, 32380.0]
|
[130.0, 155.0]
|
[126, 148]
|
p02707
|
u268724304
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
[' -*- coding: utf-8 -*-\n\nN = int(input())\nA = list(map(int, input().split()))\nsheet = [0]*(N)\nfor i in range(N-1):\n sheet[A[i]-1]=sheet[A[i]-1]+1\n\n\nfor i in range(N):\n print("{}".format(sheet[i]))\n', '# -*- coding: utf-8 -*-\n\nN = int(input())\nA = list(map(int, input().split()))\nsheet = [0]*(N)\nfor i in range(N-1):\n sheet[A[i]-1]=sheet[A[i]-1]+1\n\n\nfor i in range(N):\n print("{}".format(sheet[i]))\n']
|
['Runtime Error', 'Accepted']
|
['s216256596', 's067088582']
|
[8904.0, 32356.0]
|
[23.0, 197.0]
|
[202, 203]
|
p02707
|
u275212209
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['N = int(input())\nA = [int(elem) for elem in input().split()]\ncount = [0]*N\nfor i in A:\n count[i-1] = count[i-1]+1 \nprint(count)', 'import math\nif __name__ == \'__main__\':\n N = int(input())\n A = [int(elem) for elem in input().split()]\n count = [0]*N\n for i in A:\n # print("i", i)\n # print("A",A[i-1])\n count[i-1] = count[i-1]+1\n \n [print (i) for i in count]']
|
['Wrong Answer', 'Accepted']
|
['s568046355', 's880432946']
|
[32248.0, 33540.0]
|
[114.0, 143.0]
|
[132, 261]
|
p02707
|
u277641173
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['n=int(input())\na=list(map(int,input().split()))\n\njyoshi=[0]*n\nfor i in range(n-1):\n jyo=a[i]\n jyoshi[jyo-1]=jyoshi[jyo-1]+1\n \nfor k in jyoshi:\n print k\n', 'n=int(input())\na=list(map(int,input().split()))\n\njyoshi=[0]*n\nfor i in range(n-1):\n jyo=a[i]\n jyoshi[jyo-1]=jyoshi[jyo-1]+1\n \nfor k in jyoshi:\n print(k)\n']
|
['Runtime Error', 'Accepted']
|
['s293457793', 's365773823']
|
[9032.0, 32224.0]
|
[22.0, 168.0]
|
[156, 157]
|
p02707
|
u278296307
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['n = int(input())\na_list = map(int, input().split())\nnl = [0] * n\nfor a in a_list:\n nl[a] += 1\nfor v in nl:\n print("{}".format(v))', 'n = int(input())\na_list = [int(i) for i in input().split()]\n\nnl = [0 for i in range(n)]\nprint(nl)\nfor a in a_list:\n nl[a-1] += 1\n\nfor i in nl:\n print("{}".format(i))', 'n = int(input())\na_list = map(int input().split())\nnl = {str(i):0 for i in range(n)}\nfor a in a_list:\n nl[str(a-1)] += 1\nfor v in nl.values():\n print("{}".format(v))', 'n = int(input())\na_list = [int(i) for i in input().split()]\nnl = [0] * n\nfor a in a_list:\n nl[a-1] += 1\nfor v in nl:\n print("{}".format(v))']
|
['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted']
|
['s103445018', 's744228900', 's769394010', 's496942727']
|
[24556.0, 32324.0, 8948.0, 32328.0]
|
[147.0, 183.0, 22.0, 169.0]
|
[135, 171, 171, 145]
|
p02707
|
u278353498
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['n = int(input())\na1 = list(map(int, input().split())) \na2 = [0] * n\n\nfor i in range(n) :\n print(i)\n for j in range(n-1) :\n if i+1 == a1[j] :\n a2[i] += 1\n print(a2[i])\n ', 'n = int(input())\na1 = list(map(int, input().split())) \na2 = [0] * n\n\nfor i in range(n -1) :\n a2[a1[i]-1] += 1\nfor j in range(n) :\n print(a2[j])\n']
|
['Wrong Answer', 'Accepted']
|
['s884407979', 's535861843']
|
[32364.0, 32240.0]
|
[2206.0, 166.0]
|
[198, 150]
|
p02707
|
u279266699
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
["a = int(input())\nl = list(map(int, input().split()))\nl_2 = list(set(l))\nl_2.sort()\nif l_2[0] == 1:\n for i in range(len(l_2) - 1):\n print(l.count(l_2[i]))\n word = '0\\n' * (l_2[i + 1] - l_2[i])\n if l_2[i + 1] - l_2[i] - 1 > 0:\n print(word[:-3])\n print(l.count(l_2[-1]))\n word = '0\\n' * (a - max(l_2))\n print(word[:3 * (a - max(l_2) - 1) + 1])", 'import collections\na = int(input())\nl = list(map(int, input().split()))\nl_2 = collections.Counter(l)\nfor i in range(a):\n print(l_2[i + 1])\n']
|
['Time Limit Exceeded', 'Accepted']
|
['s931450061', 's746949057']
|
[32236.0, 34176.0]
|
[2206.0, 170.0]
|
[384, 142]
|
p02707
|
u280329066
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['\nfor i in range(1):\n\tn=int(input());\n\tl=list(map(int,input().split()))\n\td=dict();\n\tfor j in range(n):\n\t\td[j]=0;\n\tfor j in range(len(l)):\n\t\tif(d[j]==0):\n\t\t\td[j]+=1;\n\t\telse:\n\t\t\td[j]+=1;\n\tfor j in d.values():\n\t\tprint(j,sep="\\n")', '\ndef CountFrequency(my_list,n): \n \n # Creating an empty dictionary \n freq = {}\n for i in range(1,n+1):\n \tfreq[i]=0\n\n for item in my_list: \n if (item in freq): \n freq[item] += 1\n else: \n freq[item] = 1\n \n for key, value in freq.items(): \n print (value)\n \n# Driver function \nif __name__ == "__main__": \n n=int(input())\n l=list(map(int,input().split())) \n \n CountFrequency(l,n) \n']
|
['Wrong Answer', 'Accepted']
|
['s739774595', 's026152235']
|
[38932.0, 38800.0]
|
[209.0, 196.0]
|
[225, 453]
|
p02707
|
u284167015
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['N = int(input())\n\nA = []\n\nfor i in range(N-1):\n A.append(int(input()))\n\nB = []\n\nfor j in range(N-1):\n temp = 0\n for i in A:\n if i-2 == j:\n temp += 1\n B.append(temp) \nfor j in range(N-1):\n print(B[j])', 'N = int(input())\n\nA = []\n\nfor i in range(N-1):\n A.append(int(input()))\n\nB = []\n\nfor j in range(N-1):\n temp = 0\n for i in A:\n if i-2 == j:\n temp += 1\n B.append(temp) \nfor j in range(N-1):\n print(B[j])', 'N = int(input())\n\nA = []\n\nfor i in range(N-1):\n A.append(int(input()))\n\nB = []\n\nfor j in range(N-1):\n temp = 0\n for i in A:\n if i-2 == j:\n temp += 1\n B.append(temp) \nfor j in range(N-1):\n print(B[j])', 'import collections\n\nN = int(input())\n\nA = [int(i) for i in input().split()]\n\nc = collections.Counter(A)\n\nfor i in range(1, N+1):\n print(c[i])\n ']
|
['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted']
|
['s098895126', 's173752358', 's303815764', 's891593202']
|
[11648.0, 11488.0, 11480.0, 35424.0]
|
[30.0, 27.0, 29.0, 186.0]
|
[239, 239, 239, 149]
|
p02707
|
u285891772
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
["import sys, re\nfrom collections import deque, defaultdict, Counter\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd\nfrom itertools import accumulate, permutations, combinations, product, groupby\nfrom operator import itemgetter, mul\nfrom copy import deepcopy\nfrom string import ascii_lowercase, ascii_uppercase, digits\nfrom bisect import bisect, bisect_left\nfrom heapq import heappush, heappop\nfrom functools import reduce\ndef input(): return sys.stdin.readline().strip()\ndef INT(): return int(input())\ndef MAP(): return map(int, input().split())\ndef LIST(): return list(map(int, input().split()))\ndef ZIP(n): return zip(*(MAP() for _ in range(n)))\nsys.setrecursionlimit(10 ** 9)\nINF = float('inf')\nmod = 10 ** 9 + 7\n \nN = INT()\nA = LIST()\nCNT = [0]*N\n\nfor i in range(N-1):\n\tCNT[A[i]-1] += 1\n\nfor i in range(N-1):\n\tprint(CNT[i])", "import sys, re\nfrom collections import deque, defaultdict, Counter\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd\nfrom itertools import accumulate, permutations, combinations, product, groupby\nfrom operator import itemgetter, mul\nfrom copy import deepcopy\nfrom string import ascii_lowercase, ascii_uppercase, digits\nfrom bisect import bisect, bisect_left\nfrom heapq import heappush, heappop\nfrom functools import reduce\ndef input(): return sys.stdin.readline().strip()\ndef INT(): return int(input())\ndef MAP(): return map(int, input().split())\ndef LIST(): return list(map(int, input().split()))\ndef ZIP(n): return zip(*(MAP() for _ in range(n)))\nsys.setrecursionlimit(10 ** 9)\nINF = float('inf')\nmod = 10 ** 9 + 7\n \nN = INT()\nA = LIST()\nCNT = [0]*N\n\nfor i in range(N-1):\n\tCNT[A[i]-1] += 1\n\nfor i in range(N):\n\tprint(CNT[i])"]
|
['Wrong Answer', 'Accepted']
|
['s872583167', 's785933555']
|
[33768.0, 33828.0]
|
[176.0, 172.0]
|
[852, 850]
|
p02707
|
u289162337
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['n = int(input())\nl = [int(i) for i in input().split()]\nd = {i: 0 for i in range(n)}\nfor i in l:\n d[i] += 1\nfor i in d:\n print(d[i])\n', 'n = int(input())\nl = [int(i) for i in input().split()]\nd = [0]*n\nfor i in l:\n d[i-1] += 1\nfor i in d:\n print(i)']
|
['Wrong Answer', 'Accepted']
|
['s337199125', 's303592978']
|
[38804.0, 32232.0]
|
[206.0, 152.0]
|
[134, 113]
|
p02707
|
u290160862
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['\nN = int(input())\nA = np.array(list(map(int, input().split())))\nans = np.zeros(N)\nfor a in A:\n ans[a-1] += 1\nfor o in ans:\n print(int(o))', 'import numpy as np\nN = int(input())\nA = np.array(list(map(int, input().split())))\nans = np.zeros(N)\nfor a in A:\n ans[a-1] += 1\nfor o in ans:\n print(int(o))']
|
['Runtime Error', 'Accepted']
|
['s376044437', 's020535869']
|
[9188.0, 50984.0]
|
[22.0, 423.0]
|
[143, 161]
|
p02707
|
u290784570
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['n = int(input())\na = list(map(int, input().split()))\nsub = []\nfor i in range(0, n):\n sub.append(0)\nfor j in a :\n sub[j - 1] += 1\nprint(sub)', 'n = int(input())\na = list(map(int, input().split()))\n\nsub = []\nfor i in range(1, n):\n x = 0\n for j in a :\n if i == j:\n x += 1\n sub.append(x)\nsub.append(0)\nprint(sub)', 'n = int(input())\na = list(map(int, input().split()))\nsub = []\nfor i in range(0, n):\n sub.append(0)\nfor j in a :\n sub[j - 1] += 1\nfor i in sub:\n print(i)']
|
['Wrong Answer', 'Wrong Answer', 'Accepted']
|
['s198736491', 's584867321', 's185662681']
|
[32300.0, 32372.0, 32232.0]
|
[106.0, 2206.0, 161.0]
|
[145, 192, 161]
|
p02707
|
u291766461
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['N = int(input())\nA = list(map(int, input().split()))\nans = [0] * (N - 1)\nfor a in A:\n ans[a-1] += 1\nfor x in ans:\n print(ans)', 'N = int(input())\nA = list(map(int, input().split()))\nans = [0] * N\nfor a in A:\n ans[a-1] += 1\nfor x in ans:\n print(x)']
|
['Wrong Answer', 'Accepted']
|
['s135169781', 's571340801']
|
[134248.0, 32296.0]
|
[2834.0, 148.0]
|
[131, 123]
|
p02707
|
u293326264
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['n = int(input())\na = [int(n) for n in input().split()]\n\nb = [0] * n\n\nfor i in a:\n b[i-1] += 1\n print(b)\n \nfor i in b:\n print(i)', 'n = int(input())\na = [int(n) for n in input().split()]\n\nboss = 1\nli = []\n\nk = 0\nfor i in a:\n if i == boss:\n k += 1\nli.append(k)\ndel(k)\n\nfor i in a:\n k = 0\n for j in a:\n if j > i:\n k += 1\n li.append(k)\n\nfor sth in li:\n print(sth)', 'n = int(input())\na = [int(n) for n in input().split()]\n\nb = [0] * n\n\nfor i in a:\n b[i-1] += 1\n print(b)\n \nfor i in b:\n print(i)', 'n = int(input())\na = [int(n) for n in input().split()]\n\nb = [0] * n\n\nfor i in a:\n b[i-1] += 1\n \nfor i in b:\n print(i)']
|
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
|
['s253228369', 's645672672', 's758635584', 's759153498']
|
[141056.0, 32232.0, 140844.0, 32320.0]
|
[3002.0, 2206.0, 2603.0, 146.0]
|
[136, 268, 136, 123]
|
p02707
|
u295585689
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['n = int(input())\na = [int(i) for i in input().split()]\nA = [0 for i in range(n)]\nprint(A)\nfor aa in a:\n A[int(aa)-1]+=1\nfor aaa in A:\n print(aaa)', 'n = int(input())\na = [int(i) for i in input().split()]\nA = [0 for i in range(n)]\nfor aa in a:\n A[a]+=1\nfor aa in A:\n print(aa)', 'n = int(input())\na = [int(i) for i in input().split()]\nA = [0 for i in range(n)]\nfor aa in a:\n A[a]+=1\nfor aa in A:\n print(aa)', 'n = int(input())\na = [int(i) for i in input().split()]\nA = [0 for i in range(n)]\nfor aa in a:\n A[a]+=1\nfor aa in A:\n print(aa)', 'n = int(input())\na = [int(i) for i in input().split()]\nA = [0 for i in range(n)]\nfor aa in a:\n A[int(aa)-1]+=1\nfor aaa in A:\n print(aaa)']
|
['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted']
|
['s138402033', 's237995304', 's294793982', 's583663116', 's939845668']
|
[32124.0, 32236.0, 32320.0, 32252.0, 32192.0]
|
[179.0, 75.0, 75.0, 75.0, 182.0]
|
[151, 132, 132, 132, 142]
|
p02707
|
u302292660
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['n = int(input())\nL = list(map(int,input().split()))\nM = [0]*n\nfor i in range(n-1):\n M[L[i]-1] +=1\nprint(M)', 'n = int(input())\nL = list(map(int,input().split()))\nM = [0]*n\nfor i in range(n-1):\n M[L[i]-1] +=1\nfor j in range(n):\n print(M[j])']
|
['Wrong Answer', 'Accepted']
|
['s755501502', 's103293622']
|
[32316.0, 32212.0]
|
[106.0, 159.0]
|
[109, 135]
|
p02707
|
u307622233
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['\nn = int(input())\na = list(int(i) for i in input().split())\nl = [0] * (n - 1)\n\nfor i in a:\n l[i - 1] += 1\n\nfor i in l:\n print(i)\n', '\nn = int(input())\na = list(int(i) for i in input().split())\nlst = [0] * (n + 1)\n\nfor i in a:\n lst[i] += 1\n\nfor i in range(1, n):\n print(lst[i])\n', 'from collections import deque as dq\n\nn = int(input())\na = dq(int(i) for i in input().split())\nl = [0] * n\n\nfor i in a:\n l[i] += 1\n\nfor i in l:\n print(i)\n', 'from collections import deque as dq\n\nn = int(input())\na = dq(int(i) for i in input().split())\nl = [0] * (n - 1)\n\nfor i in a:\n l[i - 1] += 1\n\nfor i in l:\n print(i)\n', '\nn = int(input())\na = list(int(i) for i in input().split())\nlst = [0] * (n + 1)\n\nfor i in a:\n lst[i] += 1\n\nfor i in range(1, n + 1):\n print(lst[i])\n']
|
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
|
['s129098545', 's217160194', 's811429217', 's989089998', 's556615018']
|
[32308.0, 32240.0, 31960.0, 32016.0, 32228.0]
|
[145.0, 153.0, 145.0, 158.0, 160.0]
|
[135, 150, 159, 169, 154]
|
p02707
|
u312784236
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
["n=int(input())\na=list(map(int, input().split()))\n\nans=''\nfor i in range(n):\n ans+=str(a.count(i+1))+'\\r\\n'\n\nprint(ans)", 'n=int(input())\na=list(map(int, input().split()))\n\nans=[0]*(n)\nfor i in a:\n ans[i-1]+=1\n\nfor i in ans:\n print(i)']
|
['Time Limit Exceeded', 'Accepted']
|
['s882777622', 's286584800']
|
[32412.0, 32236.0]
|
[2206.0, 150.0]
|
[121, 117]
|
p02707
|
u314050667
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['import numpy as np\nimport sys\nread = sys.stdin.read\nreadline = sys.stdin.readline\nreadlines = sys.stdin.readlines\n\nN, M = map(int, input().split())\nA = np.array(list(map(int, input().split())))\ntot = np.sum(A)\n\nif tot > N:\n\tprint(-1)\nelse:\n\tprint(N-tot)', 'import numpy as np\nimport sys\nread = sys.stdin.read\nreadline = sys.stdin.readline\nreadlines = sys.stdin.readlines\n\nN = int(input())\nA = np.array(list(map(int, input().split())))\nB = np.zeros(N+1, dtype = np.int64)\n\nfor a in A:\n\tB[a] += 1\n\nfor b in B[1:]:\n\tprint(b)\n']
|
['Runtime Error', 'Accepted']
|
['s592735482', 's501738039']
|
[27200.0, 51012.0]
|
[105.0, 389.0]
|
[253, 265]
|
p02707
|
u316649390
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['n = int(input())\nA = list(map(int,input().split()))\n\ndef main(i):\n a = 0\n for j in A:\n if i = j:\n a = a+1\n print(a)\n \n\nfor i in range(1,n+1):\n main(i)', 'n = int(input())\nA = list(map(int,input().split()))\n\ndef main(i):\n a = A.count(i)\n b = A.pop(0)\n print(a)\n\n\nfor i in range(1,n+1):\n main(i)', 'n = int(input())\nA = list(map(int,input().split()))\n\ndef main(i):\n a = count(A.count(i))\n print(a)\n\n\nfor i in range(1,n+1):\n main(i)', 'from collections import Counter\nn = int(input())\nA = list(map(int,input().split()))\n\nmycounter = Counter(A)\n\nfor i in range(1,n+1):\n print(mycounter[i])']
|
['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted']
|
['s353338750', 's414647546', 's745404310', 's588021954']
|
[9020.0, 32380.0, 32376.0, 33972.0]
|
[25.0, 2206.0, 63.0, 184.0]
|
[163, 143, 135, 153]
|
p02707
|
u316733945
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['n = int(input())\na = list(map(int, input().split()))\nl = [0] * n\n\nfor i in range(n-1):\n l[a[i] - 1] += 1\n\nprint(l)\n', 'n = int(input())\na = list(map(int, input().split()))\nl = [0] * n\n\nfor i in range(n-1):\n l[a[i] - 1] += 1\n\nfor j in l:\n print(j)']
|
['Wrong Answer', 'Accepted']
|
['s990758049', 's620229251']
|
[32364.0, 32160.0]
|
[109.0, 158.0]
|
[118, 133]
|
p02707
|
u318182140
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['n = int(input())\na = list(map(int, input().split()))\nl = []\nfor i in range(n):\n l.append(0)\nfor j in a:\n l[j-1] += 1\nfor k in l:\n print(s)', 'n = int(input())\na = list(map(int, input().split()))\nsub = []\nfor i in range(0, n):\n sub.append(0)\nfor j in a :\n sub[j - 1] += 1\nprint(sub)', 'n = int(input())\na = list(map(int, input().split()))\nl = []\nfor i in range(0, n):\n l.append(0)\nfor j in a:\n l[j-1] += 1\nprint(l)', 'n = int(input())\na = list(map(int, input().split()))\nsub = []\nfor i in range(0, n):\n sub.append(0)\nfor j in a :\n sub[j - 1] += 1\nfor i in sub:\n print(i)']
|
['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted']
|
['s252646984', 's643413810', 's688162794', 's082125774']
|
[32368.0, 32228.0, 32332.0, 32240.0]
|
[100.0, 121.0, 116.0, 161.0]
|
[147, 145, 134, 161]
|
p02707
|
u319085410
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['worker_num=int(input())\nnum_director=input().split()\nprint(num_director)\ncount_director=[]\nfor j in range(len(num_director)+1):\n count_director.append(int(0))\n\nfor i in num_director:\n count_director[int(i)-1] +=1\n\nfor out in num_director:\n print(out)', 'worker_num=int(input())\nnum_director=input().split()\ncount_director=[]\nfor j in range(len(num_director)+1):\n count_director.append(int(0))\n\nfor i in num_director:\n count_director[int(i)-1] +=1\n\nfor out in count_director:\n print(out)']
|
['Wrong Answer', 'Accepted']
|
['s722501887', 's850908646']
|
[28304.0, 26100.0]
|
[192.0, 185.0]
|
[259, 241]
|
p02707
|
u320098990
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['N = int(input())\nrel_list = map(int, input().split())\n\nmember_list = [0]*N\nfor rel in rel_list:\n member_list[rel-1] += 1\n\nprint([i for i in member_list])', 'N = int(input())\nrel_list = map(int, input().split())\n\nmember_list = [0]*N\nfor rel in rel_list:\n member_list[rel-1] += 1\n\n[print(i) for i in member_list]']
|
['Wrong Answer', 'Accepted']
|
['s749725658', 's941068648']
|
[24516.0, 24604.0]
|
[106.0, 136.0]
|
[156, 156]
|
p02707
|
u321648532
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['N = int(input())\n\nA = [int(i) for i in input().split()]\n\nS = [0] * N\n\nfor i in A:\n S[i] += 1 \n\nfor s in S[1:]:\n print(s)\n', 'N = int(input())\n\nA = [int(i) for i in input().split()]\n\nS = [0] * (N+1)\n\nfor i in A:\n S[i] += 1 \n\nfor s in S[1:]:\n print(s)\n']
|
['Wrong Answer', 'Accepted']
|
['s396401483', 's837435980']
|
[32168.0, 32140.0]
|
[152.0, 144.0]
|
[127, 131]
|
p02707
|
u322229918
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['N = int(input())\nAs = np.array(list(map(int, input().split())))\n\nres = [0] * N\nfor a in As:\n res[a-1] += 1\nfor r in res:\n print(r)', 'N = int(input())\nAs = map(int, input().split())\n\nres = [0] * N\nfor a in As:\n res[a-1] += 1\nfor r in res:\n print(r)']
|
['Runtime Error', 'Accepted']
|
['s769088701', 's661274783']
|
[9180.0, 24524.0]
|
[23.0, 135.0]
|
[136, 120]
|
p02707
|
u329753128
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['import numpy as np\n\nn = input()\na = np.array([int(i) for i in input().split()])\nfor i in range(int(n)):\n print(a.count(i+1))', 'n = input()\na = list(map(int, input().split()))\n\nprint(0)\nfor i in range(len(a)):\n print(a.count(i))\n', 'n = input()\na = np.array([int(i) for i in input().split()])\n\nfor i in range(int(n)):\n print(a.count(i+1))\n', 'import numpy as np\n \ndef calculate_num_boss(num_person, boss):\n boss_count = np.zeros([num_person])\n result, num = np.unique(boss, return_counts=True)\n for idx in range(result.shape[0]):\n ids = result[idx]\n boss_count[ids-1] = num[idx]\n \n return boss_count\n \n \nif __name__ == "__main__":\n num_person = int(input().split()[0])\n bosses = np.array([int(i) for i in input().split()])', 'n = input()\na = list(int, input().split()))\n\nprint(0)\nfor i in range(len(a)):\n print(a.count(i))\n', 'n = map(int, input().split())\na = list(map(int, input().split()))\n\nprint(0)\nfor i in range(len(a)):\n print(a.count(i))\n', 'n = input()\n#a = list(map(int, input().split()))\na = np.array([int(i) for i in input().split()])\nfor i in range(int(n)):\n print(a.count(i+1))\n', 'num = int(input())\nh_numbers = list(map(int, input().split()))\ns = [0] * num\nfor i in h_numbers:\n s[i-1] += 1\n[print(i) for i in s]']
|
['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted']
|
['s067513467', 's118396663', 's428265433', 's477295923', 's605213695', 's701793140', 's856984086', 's174202349']
|
[51080.0, 32312.0, 9100.0, 50872.0, 9020.0, 32260.0, 9092.0, 32264.0]
|
[168.0, 2206.0, 26.0, 163.0, 20.0, 2206.0, 22.0, 140.0]
|
[127, 104, 109, 411, 100, 122, 145, 134]
|
p02707
|
u331330867
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['N=input()\nA=list(input().split(" "))\nfor n in range(1,int(N)):\n print(A.count(n))', 'N=int(input())\nA=input().split(" ")\nfor n in range(1,N):\n print(A.count(str(n)))', 'N=int(input())\nA=list(input().split(" "))\nfor n in range(1,N):\n print(A.count(str(n)))', 'N,A=int(input()),input().split(" ")\nfor n in range(1,N):\n print(A.count(str(n)))', 'N=input()\nA=list(input().split(" "))\ncount=[0]*int(N)\nfor a in A:\n idx=int(a)-1\n count[idx]= count[idx]+1\nfor c in count:\n print(c)']
|
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
|
['s190523561', 's274413780', 's647511426', 's730830795', 's747794614']
|
[24756.0, 24256.0, 24856.0, 24308.0, 24916.0]
|
[2206.0, 2206.0, 2206.0, 2206.0, 166.0]
|
[84, 83, 89, 83, 140]
|
p02707
|
u331997680
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
["import collections\nN = int(input())\nA = list(map(int, input().split()))\nB = collections.Counter(A)\nprint(B)\nfor i in range(1,N):\n print(B[i])\nprint('0')", "import collections\nN = int(input())\nA = list(map(int, input().split()))\nB = collections.Counter(A)\nfor i in range(1,N):\n print(B[i])\nprint('0')"]
|
['Wrong Answer', 'Accepted']
|
['s414019992', 's462907057']
|
[57168.0, 34104.0]
|
[235.0, 173.0]
|
[154, 145]
|
p02707
|
u341810759
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['n=int(input())\nA=[int(y) for y in input().split()]\n\ndic={}\n\nfor e in A:\n if e in dic:\n dic[e]+=1\n else:\n dic[e]=1\n \nfor r in A:\n if (r+1) in dic:\n print(dic[r+1])\n else:\n print(0)\n', 'N=int(input())\n\n\nA=[int(c) for c in input().split()]\n\ndic={}\nfor e in A:\n if e in dic:\n dic[e]+=1\n else:\n dic[e]=1\n \nfor i in range(1,N+1):\n if i in dic:\n print(dic[i])\n else:\n print(0)']
|
['Wrong Answer', 'Accepted']
|
['s746298032', 's142256493']
|
[33516.0, 33664.0]
|
[223.0, 206.0]
|
[227, 232]
|
p02707
|
u346207191
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['N=int(input())\nA=list(map(int, input().split()))\n\ni=1\nfor j in range(N-1):\n print(A.count(i))\n i+=1', 'import collections\n\nN=int(input())\nA=list(map(int, input().split()))\n\nc = collections.Counter(A)\n\ni=1\n\nfor j in range(N):\n print(c[i])\n i+=1\n']
|
['Wrong Answer', 'Accepted']
|
['s747327465', 's209603272']
|
[32372.0, 34000.0]
|
[2206.0, 186.0]
|
[101, 143]
|
p02707
|
u346375263
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['import numpy as np\nN = int(input())\nA = list(map(int,input().split()))\nans = np.zeros(N)\nfor i in A:\n ans[i-1] =+1\nfor i in ans:\n print(int(i))', 'import numpy as np\nN = int(input())\nA = list(map(int,input().split()))\nans = np.zeros(N)\nfor i in A:\n ans[i-1] +=1\nfor i in ans:\n print(int(i))']
|
['Wrong Answer', 'Accepted']
|
['s364021789', 's653824376']
|
[50860.0, 50964.0]
|
[271.0, 338.0]
|
[149, 149]
|
p02707
|
u347640436
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
["N = int(input())\nA = list(map(int, input().split()))\n\nresult = [0] * N\nfor a in A:\n result[a - 1] += 1\nprint('\\n'.join(result))\n", "N = int(input())\nA = list(map(int, input().split()))\n\nresult = [0] * N\nfor a in A:\n result[a - 1] += 1\n#print('\\n'.join(map(str, result)))\nprint(*result, sep='\\n')\n"]
|
['Runtime Error', 'Accepted']
|
['s320227284', 's704389075']
|
[32288.0, 32224.0]
|
[85.0, 126.0]
|
[131, 167]
|
p02707
|
u350093546
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['n=int(input())\na=list(map(int,input().split()))\nb=list(set(a))\nfor i in range(1,n+1):\n if i in b:\n print(0)\n else:\n print(a.count(i))\n', 'n=int(input())\na=list(map(int,input().split()))\nx=[0]*n\nfor i in a:\n x[i-1]+=1\nfor i in x:\n print(i)']
|
['Wrong Answer', 'Accepted']
|
['s393026935', 's385002005']
|
[32256.0, 32280.0]
|
[2206.0, 149.0]
|
[142, 102]
|
p02707
|
u350412774
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
["from collections import Counter\n\nn = int(input())\nAs = list(map(int, input().split()))\n\nct = Counter(As)\n\nfor i in range(n):\n\tif i in ct.keys():\n\t\tprint(ct[i])\n\telse:\n\t\tprint('0')", "from collections import Counter\n\nn = int(input())\nAs = list(map(int, input().split()))\n\nct = Counter(As)\n\nfor i in range(1,n+1):\n\tif i in ct.keys():\n\t\tprint(ct[i])\n\telse:\n\t\tprint('0')"]
|
['Wrong Answer', 'Accepted']
|
['s334075818', 's781693084']
|
[34180.0, 34044.0]
|
[178.0, 186.0]
|
[179, 183]
|
p02707
|
u353919145
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['n=int(input())\nlist1=list(map(int, input().split()))\nlist2=[0]*n\nfor i in list1:\n list2[i-1]=list1.count(i)\nfor j in list2:\n print(j,"\\n")', 'n = int(input())\nboss_array = list(input().split())\nsubordinates_count = [0] * (n + 1)\nfor i in range(n - 1):\n subordinates_count[int(boss_array[i])] += 1\nfor i in range(1, n + 1):\n print(subordinates_count[i])\n']
|
['Time Limit Exceeded', 'Accepted']
|
['s460607346', 's514395292']
|
[30368.0, 23604.0]
|
[2206.0, 177.0]
|
[148, 217]
|
p02707
|
u355371431
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['N = int(input())\nX = [0]*N\nA = list(map(int,input().split()))\nfor i in A:\n X[i] +=1\nprint(X,sep="\\n")', 'N = int(input())\nX = [0]*N\nA = list(map(int,input().split()))\nfor i in A:\n X[i] +=1\nprint(*X,sep="\\n")', 'N = int(input())\nX = [0]*N\nA = list(map(int,input().split()))\nfor i in A:\n X[i-1] +=1\nprint(*X,sep="\\n")']
|
['Wrong Answer', 'Wrong Answer', 'Accepted']
|
['s044971823', 's569162007', 's007065538']
|
[33936.0, 33916.0, 33936.0]
|
[97.0, 118.0, 123.0]
|
[104, 105, 107]
|
p02707
|
u363421241
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['n = int(input())\na = list(map(int, input().split()))\n\nfor i in range(1, n+1):\n print(a.count(i))\n a.remove(i)', 'n = int(input())\na = list(map(int, input().split()))\n\nans = [0]*n\nfor i in a:\n ans[i-1] += 1\nfor i in range(n):\n print(ans[i])']
|
['Runtime Error', 'Accepted']
|
['s745421859', 's595543261']
|
[32280.0, 32332.0]
|
[2206.0, 162.0]
|
[115, 132]
|
p02707
|
u364555831
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['N = int(input())\nA = list(map(int, input().split())) # <- note that this has (N - 1) elements\nprint(A)\nA_0 = [x - 1 for x in A]\nprint(A_0)\nans = [0] * N # <- represents number of immediate subordinates of each person\n\nfor i in range(0, N - 1):\n ans[A_0[i]] += 1\n\nfor i in range(0, N):\n print(ans[i])\n', 'N = int(input())\nA = list(map(int, input().split())) # <- note that this has (N - 1) elements\n#print(A)\nA_0 = [x - 1 for x in A]\n#print(A_0)\nans = [0] * N # <- represents number of immediate subordinates of each person\n\nfor i in range(0, N - 1):\n ans[A_0[i]] += 1\n\nfor i in range(0, N):\n print(ans[i])\n']
|
['Wrong Answer', 'Accepted']
|
['s142592256', 's074545410']
|
[32360.0, 32384.0]
|
[203.0, 167.0]
|
[306, 308]
|
p02707
|
u373594825
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['N = int(input())\n# print(N)\nList = list(map(int, input().split()))\nprint(List)\n\nfor i in range(N-1):\n j = i + 1\n print(List.count(j))\n\nprint(0)', 'from collections import defaultdict\nimport collections\n\nN = int(input())\nList = list(map(int, input().split()))\n# print(List)\n\n\n# print(List.count(i+1))\n# print(0)\n\nc = collections.Counter(List)\n# print(c)\nfor i in range(1,N+1):\n # print(i)\n print(c[i])\n # print()']
|
['Wrong Answer', 'Accepted']
|
['s162893972', 's572935729']
|
[32184.0, 34028.0]
|
[2206.0, 184.0]
|
[145, 291]
|
p02707
|
u374551537
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['N = int(input())\nnums = [int(e) for e in input().split()]\nnums.sort()\n\nfor i in range (1,N+1):\n j = 0\n c = 0\n while j < len(nums) and nums[j] == i:\n c = c + 1\n del nums[:c]\n print(c)', 'import collections as col\n\nn = int(input())\nList = list(map(int, input().split()))\n\nList = col.Counter(List)\nCount_List = [0]*n\nfor i in List:\n Count_List[i-1] = List[i]\n\nfor i in Count_List:\n print(i)']
|
['Time Limit Exceeded', 'Accepted']
|
['s572334652', 's101434998']
|
[32184.0, 33940.0]
|
[2206.0, 173.0]
|
[204, 207]
|
p02707
|
u375193358
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['N = int(input())\nA = list(map(int,input.split()))\n\nans = [0]*N\n\nfor i in A:\n ans[i-1] += 1\n\nfor j in ans:\n print(j)\n', 'N = int(input())\nA = list(map(int,input().split()))\n\nans = [0 for _ in range(N)]\n\nfor i in A:\n ans[i-1] += 1\n\nfor j in ans:\n print(j)\n']
|
['Runtime Error', 'Accepted']
|
['s081029724', 's167138996']
|
[9140.0, 32292.0]
|
[22.0, 151.0]
|
[122, 140]
|
p02707
|
u382407432
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['N = int(input())\na = list(map(int,input().split()))\nbuka_num=[]\nfor i in range(1,len(a)):\n buka_num.append(str(a.count(i)))\nbuka_num.append("0")\njoined = "\\n".join(buka_num)\nprint(joined)', 'N = int(input())\na = list(map(int,input().split()))\nbuka_num=[]\nfor i in range(1,len(a)):\n buka_num.append(a.count(i))\nbuka_num.append(0)\nprint(buka_num)', 'N = int(input())\na = list(map(int,input().split()))\nfor i in range(1,len(a)):\n print(a.count(i))\nprint(0)', 'N = int(input())\na = list(map(int,input().split()))\nbuka_num=[0 for _ in range(N+1)]\n\nfor i in a:\n buka_num[i]+=1\nbuka_num.pop(0)\nbuka_num.append(0)\nfor j in buka_num:\n print(j)', 'N = int(input())\na = list(map(int,input().split()))\nbuka_num=[0 for _ in range(N+1)]\n\nfor i in a:\n buka_num[i]+=1\nbuka_num.pop(0)\nfor j in buka_num:\n print(j)']
|
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
|
['s025923724', 's855257579', 's892277776', 's937019031', 's054868650']
|
[32360.0, 32372.0, 32372.0, 32364.0, 32364.0]
|
[2206.0, 2206.0, 2206.0, 141.0, 147.0]
|
[188, 154, 106, 179, 160]
|
p02707
|
u382639013
| 2,000
| 1,048,576
|
A company has N members, who are assigned ID numbers 1, ..., N. Every member, except the member numbered 1, has exactly one immediate boss with a smaller ID number. When a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X. You are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.
|
['N = int(input())\n\nA = list(map(int, input().split())) \n\nfor i in range(N-1):\n print(A.count(i+1))', 'N = int(input())\nA = list(map(int, input().split())) \n\nc = [0] * N\n\nfor i in range(N-1):\n c[A[i]-1] = c[A[i]-1] + 1\n \nfor j in c:\n print(j)']
|
['Wrong Answer', 'Accepted']
|
['s161685834', 's202496392']
|
[32328.0, 32236.0]
|
[2206.0, 170.0]
|
[100, 147]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.