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 |
|---|---|---|---|---|---|---|---|---|---|---|
p02761 | u381877079 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["n,m=map(int,input().split())\na=[-1]*n\nv=[0]*n\nf=0\nfor _ in range(m):\n\ts,c=map(int,input().split())\n\tif(v[s-1]==0 or a[s-1]==c):\n\t\tv[s-1]=1\n\t\ta[s-1]=c\n\telse:\n\t\tf=1\ns1='a'\nif n!=1 and a[0]==-1:\n\ta[0]=1\nfor x in a:\n\ts1+=str(x)\nif f==1 or (n!=1 and s1[1]=='0'):\n\tprint(-1)\nelse:\n\tprint(s1[1:])\n", "n,m=map(int,input().split())\na=[-1]*n\nv=[0]*n\nf=0\nfor _ in range(m):\n\ts,c=map(int,input().split())\n\tif(v[s-1]==0 or a[s-1]==c):\n\t\tv[s-1]=1\n\t\ta[s-1]=c\n\telse:\n\t\tf=1\ns1='a'\nif n!=1 and a[0]==-1:\n\ta[0]=1\nfor x in a:\n\tif x==-1:\n\t\tx=0\n\ts1+=str(x)\nif f==1 or (n!=1 and s1[1]=='0'):\n\tprint(-1)\nelse:\n\tprint(s1[1:])\n"] | ['Wrong Answer', 'Accepted'] | ['s857057800', 's154636596'] | [3064.0, 3064.0] | [17.0, 17.0] | [290, 307] |
p02761 | u382407432 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['n,m=map(int,input().split(" "))\ng=[]\nt=[]\nsac=0\nfor i in range(n):\n g.append("0")\n t.append("")\nfor j in range(m):\n s,c=map(int,input().split(" "))\n if(g[s-1]!=str(c) and t[s-1]==""):\n g[s-1]=str(c)\n t[s-1]="T"\n if(g[s-1]!=str(c) and t[s-1]!=""):\n sac=1\n if(s==1 and c==0):\n sac=1\nif(t[0]=="" and len(g)!=1 and sac==0):\n g[0]="1"\n\nstr_g = "".join(g)\n\nif(sac==0 and g[0]!="0"):\n print(str_g)\n print(t)\nelif(sac==0 and len(g)==1):\n print("0")\nelse:\n print("-1")', 'n,m=map(int,input().split(" "))\ng=[]\nt=[]\nsac=0\nfor i in range(n):\n g.append("0")\n t.append("")\nfor j in range(m):\n s,c=map(int,input().split(" "))\n if(g[s-1]!=str(c) and t[s-1]==""):\n g[s-1]=str(c)\n t[s-1]="T"\n if(g[s-1]!=str(c) and t[s-1]!=""):\n sac=1\n if(s==1 and c==0):\n sac=1\n op=1\nif(t[0]=="" and len(g)!=1 and sac==0):\n g[0]="1"\nif(op==1):\n sac=0\nstr_g = "".join(g)\n\nif(sac==0 and g[0]!="0"):\n print(str_g)\n\nelif(sac==0 and len(g)==1):\n print("0")\nelse:\n print("-1")', 'n,m=map(int,input().split(" "))\ng=[]\nt=[]\nsac=0\nop=0\nfor i in range(n):\n g.append("0")\n t.append("")\nfor j in range(m):\n s,c=map(int,input().split(" "))\n if(g[s-1]!=str(c) and t[s-1]==""):\n g[s-1]=str(c)\n t[s-1]="T"\n if(g[s-1]!=str(c) and t[s-1]!=""):\n sac=1\n if(s==1 and c==0):\n sac=1\n op=1\nif(t[0]=="" and len(g)!=1 and sac==0):\n g[0]="1"\nif(op==1):\n sac=0\nstr_g = "".join(g)\n\nif(sac==0 and g[0]!="0"):\n print(str_g)\n\nelif(sac==0 and len(g)==1):\n print("0")\nelse:\n print("-1")'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s381780181', 's485188809', 's602344092'] | [3064.0, 3064.0, 3064.0] | [18.0, 17.0, 17.0] | [482, 499, 504] |
p02761 | u382639013 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["N, M = map(int,input().split())\nA = [list(map(int,input().split())) for _ in range(M)]\n\nb = [0]*N\n\nans = 0\nfor i in range(M):\n if b[A[i][0]-1] ==0:\n b[A[i][0]-1] = A[i][1]\n elif b[A[i][0]-1] == A[i][1]:\n pass\n else:\n ans = -1\n break\n\ns = ''.join([str(N) for N in b])\n\nif int(s) == 0:\n ans = -1\nelse:\n pass\n\nif (s[0]==0 and s[1] != 0) or (s[0]==0 and s[1] ==0):\n ans = -1\n\nprint(ans)", "N, M = map(int,input().split())\nA = [list(map(int,input().split())) for _ in range(m)]\n\nb = [0]*N\n\nans = 0\nfor i in range(N):\n print(A[i][0])\n if b[A[i][0]-1] ==0:\n b[A[i][0]-1] = A[i][1]\n elif b[A[i][0]-1] == A[i][1]:\n pass\n else:\n ans = -1\n break\n\ns = ''.join([str(N) for N in b])\n\nif ans == 0:\n print(s)\nelse:\n print(s)", 'n,m = map(int, input().split())\nsc = [list(map(int, input().split())) for _ in range(m)]\nfor i in range(1000):\n num = str(i)\n if len(num) == n and all(num[s-1]==str(c) for s,c in sc):\n print(i)\n break\nelse:\n print(-1) '] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s033444097', 's880784461', 's826500023'] | [3064.0, 3064.0, 3060.0] | [18.0, 18.0, 18.0] | [428, 368, 241] |
p02761 | u383450070 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['n,m=map(int,input().split())\nS,C=[], []\nfor i in range(m):\n a,b=map(int,input().split())\n S.append(a)\n C.append(b)\nfor j in range(10**n):\n if len(j)==n and all(str(j)[x-1]==str(y) for x,y in zip(S,C)):\n print(j)\n break;\nelse:\n print(-1)', 'n,m=map(int,input().split())\nS,C=[], []\nfor i in range(m):\n a,b=map(int,input().split())\n S.append(a)\n C.append(b)\nfor j in range(10**n):\n if len(str(j))==n and all(str(j)[x-1]==str(y) for x,y in zip(S,C)):\n print(j)\n break;\nelse:\n print(-1)'] | ['Runtime Error', 'Accepted'] | ['s222773700', 's027898527'] | [3064.0, 3064.0] | [25.0, 18.0] | [247, 252] |
p02761 | u386944085 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['c=-1\nd=0\nf=0\ng=0\nN, M = map(int, input().split())\nlist = []\nfor i in range(M):\n a,b=input().split()\n list.append((int(a), int(b)))\n\nfor i in range(M):\n\t\n\tif list[i][0]>N or (list[i][0]+list[i][1]==1 and N!=1):\n\t\tprint(c)\n\t\tf=1\n\t\tbreak\n\tfor j in range(i+1,M):\n\t\tif list[i][0]==list[j][0]:\n\t\t\tg=1\n\t\t\tif list[i][1]!=list[j][1]:\n\t\t\t\tprint(c)\n\t\t\t\tf=1\n\t\t\t\tbreak\n\tif f==1:\n\t\tbreak\n\tif g==0:\n\t\td+=list[i][1]*(10**(N-list[i][0]))\n\tg=0\nif f==0:\n\tif d-10**(N-1)<0 or (d==0 and N!=1)\n\t\tprint(d+10**(N-1))\n\telse:\n\t\tprint(d)', 'c=0\nf=0\nN, M = map(int, input().split())\nlist = []\nfor i in range(M):\n a,b=input().split()\n list.append((int(a), int(b)))\n\nfor j in range(M):\n\tif list[j][0]+list[j][1]==1 and N==1:\n\t\tf=2\n\t\tc+=1\nif c==M:\n\tprint(0)\nelif c<M:\n\tprint(-1)\n\t\t\t\nif f!=2:\n\tfor i in range(1000):\n\t\tf=0\n\t\tfor j in range(M):\n\t\t\tif int(i/(10**(N-list[j][0])))%10 != list[j][1]:\n\t\t\t\tf=1\n\t\t\t\tbreak\n\t\tif f==0 and i>=10**(N-1):\n\t\t\tprint(i)\n\t\t\tbreak\n\t\t\nif f==1:\n\tprint(-1)', 'c=0\nf=0\nN, M = map(int, input().split())\nlist = []\nfor i in range(M):\n a,b=input().split()\n list.append((int(a), int(b)))\n \nif M+N==1:\n\tprint(0)\n\tf=3\nelse:\n\tfor j in range(M):\n\t\tif list[j][0]+list[j][1]==1:\n\t\t\tf=2\n\t\t\tc+=1\t\t\n\tif c==M and N==1:\n\t\tprint(0)\n\telif c>0:\n\t\tprint(-1)\n\t\t\t\nif f<2:\n\tfor i in range(1,10**N):\n\t\tf=0\n\t\tfor j in range(M):\n\t\t\tif int(i/(10**(N-list[j][0])))%10 != list[j][1]:\n\t\t\t\tf=1\n\t\t\t\tbreak\n\t\tif f==0 and i>=10**(N-1):\n\t\t\tprint(i)\n\t\t\tbreak\n\t\t\nif f==1:\n\tprint(-1)'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s731479449', 's821304574', 's435931669'] | [3064.0, 3064.0, 3064.0] | [17.0, 18.0, 19.0] | [516, 444, 489] |
p02761 | u389910364 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['import bisect\nimport cmath\nimport heapq\nimport itertools\nimport math\nimport operator\nimport os\nimport random\nimport re\nimport string\nimport sys\nfrom collections import Counter, deque, defaultdict\nfrom copy import deepcopy\nfrom decimal import Decimal\nfrom fractions import gcd\nfrom functools import lru_cache, reduce\nfrom operator import itemgetter, mul, add, xor\n\nimport numpy as np\n\nif os.getenv("LOCAL"):\n sys.stdin = open("_in.txt", "r")\n\nsys.setrecursionlimit(10 ** 9)\nINF = float("inf")\nIINF = 10 ** 18\nMOD = 10 ** 9 + 7\n# MOD = 998244353\n\nN, M = list(map(int, sys.stdin.buffer.readline().split()))\nSC = [list(map(int, sys.stdin.buffer.readline().split())) for _ in range(M)]\n\nans = 10 ** (N - 1)\nE = 10 ** N\n\n\ndef test(n):\n ok = True\n ok &= len(str(n)) == N\n for s, c in SC:\n ok &= str(n)[s - 1] == str(c)\n return ok\n\n\ni = 0\nfor i in range(10 ** (N - 1), 10 ** N):\n if test(i):\n print(i)\n exit()\nprint(-1)\n', 'import os\nimport sys\n\nif os.getenv("LOCAL"):\n sys.stdin = open("_in.txt", "r")\n\nsys.setrecursionlimit(10 ** 9)\nINF = float("inf")\nIINF = 10 ** 18\nMOD = 10 ** 9 + 7\n# MOD = 998244353\n\nN, M = list(map(int, sys.stdin.buffer.readline().split()))\nSC = [list(map(int, sys.stdin.buffer.readline().split())) for _ in range(M)]\n\nans = 10 ** (N - 1)\nE = 10 ** N\n\n\ndef test(n):\n if len(str(n)) != N:\n return False\n ok = True\n for s, c in SC:\n ok &= str(n)[s - 1] == str(c)\n return ok\n\n\ni = 0\nfor i in range( 10 ** N):\n if test(i):\n print(i)\n break\nelse:\n print(-1)\n'] | ['Wrong Answer', 'Accepted'] | ['s488527547', 's511175239'] | [15652.0, 3064.0] | [224.0, 18.0] | [951, 603] |
p02761 | u391675400 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['N,M = map(int,input().split())\nSC = [tuple(map(int,input().split())) for i in range(M)]\n\nif N==1:\n r = range(10)\nelif N==2:\n r = range(10,100)\nelse:\n r = range(100,1000)\nfor n in r:\n print(n)\n n = str(n)\n for s,c in SC:\n #print("s=",s,"c",c)\n if n[s-1] != str(c):\n break\n else:\n print(n)\n exit()\nprint(-1)\n', 'N,M = map(int,input().split())\nSC = [tuple(map(int,input().split())) for i in range(M)]\n\nif N==1:\n r = range(10)\nelif N==2:\n r = range(10,100)\nelse:\n r = range(100,1000)\nfor n in r:\n #print(n)\n n = str(n)\n for s,c in SC:\n #print("s=",s,"c",c)\n if n[s-1] != str(c):\n break\n else:\n print(n)\n exit()\nprint(-1)\n'] | ['Wrong Answer', 'Accepted'] | ['s744046522', 's670869844'] | [3188.0, 3064.0] | [20.0, 18.0] | [365, 366] |
p02761 | u392441504 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['n,m = map(int, input().split())\nsc = [map(int, input().split()) for _ in range(m)]\ns, c = [list(i) for i in zip(*sc)]\n\n\n\nfor i in range(10**n):\n ans = str(i)\n if len(i) == n and all([i[s[j]-1] == str(c[j]) for j in range(m)]):\n print(ans)\n exit()\n\n\nprint(-1)', 'n,m = map(int, input().split())\nsc= [map(int, input().split()) for _ in range(m)]\ns, c = [list(i) for i in zip(*sc)]\n\n\n\nfor i in range(10**n):\n ans = str(i)\n if len(i) == n and all([i[s[j]-1] == str(c[j]) for j in range(m)]):\n print(ans)\n exit()\nprint(-1)', '# n,m = map(int, input().split())\n# sc = [map(int, input().split()) for _ in range(m)]\n\n#\n#\n#\n\n# ans = str(i)\n# if len(i) == n and all([i[s[j]-1] == str(c[j]) for j in range(m)]):\n# print(ans)\n# exit()\n#\n#\n# print(-1)\n\nn, m = map(int, input().split())\n\ns, c = [], []\nfor _ in range(m):\n s_, c_ = map(int, input().split())\n s.append(s_)\n c.append(c_)\n\nfor i in range(10 ** n):\n ans = str(i)\n if len(ans) == n and all([ans[s[j] - 1] == str(c[j]) for j in range(m)]):\n print(ans)\n exit()\n\nprint(-1)\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s298699771', 's817486307', 's441677921'] | [9196.0, 9080.0, 8956.0] | [22.0, 21.0, 35.0] | [278, 275, 609] |
p02761 | u395202850 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['n = int(input())\ns = list(input())\nq = int(input())\n\nfor _ in range(q):\n a1, a2, a3 = input().split()\n\n \n if a1 == "1" and s[int(a2) - 1] != a3:\n s[int(a2) - 1] = a3\n\n \n else:\n print(len(set(s[int(a2) - 1:int(a3)])))\n', 'n = int(input())\ns = list(input())\nq = int(input())\n\nfor _ in range(q):\n a1, a2, a3 = input().split()\n\n \n if a1 == "1":\n if s[int(a2) - 1] != a3:\n s[int(a2) - 1] = a3\n\n \n else:\n print(len(set(s[int(a2) - 1:int(a3)])))\n', 'n, m = map(int, input().split())\nans = 0\nnum = ["a"] * n\nfor _ in range(m):\n s, c = map(int, input().split())\n if s == 1 and c == 0:\n ans = -1\n break\n if num[s - 1] != "a" and num[s - 1] != c:\n ans = -1\n break\n num[s - 1] = c\n\nnumStr = ""\n\nif n == 1 and num[0] == "a":\n numStr = ""\n ans = 0\n\nelif num[0] == "a":\n num[0] = "1"\n\nfor l in range(n):\n if num[l] == "a":\n numStr += "0"\n else:\n numStr += str(num[l])\n\nprint(ans if ans == -1 else numStr)\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s305886246', 's814176754', 's175532389'] | [2940.0, 2940.0, 3064.0] | [17.0, 18.0, 17.0] | [274, 286, 516] |
p02761 | u396518935 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["N, M = map(int, input().split())\nrslt = [-1]*N\nfor m in range(M):\n s, c = map(int, input().split())\n if s == 1 and c == 0:\n print(-1)\n exit()\n elif s >= N:\n print(-1)\n exit()\n elif rslt[s-1] != -1 and rslt[s-1] != c:\n print(-1)\n exit()\n else:\n rslt[s-1] = c\n\nif rslt[0] == -1:\n rslt[0] = 1\nrslt = ['0' if i == -1 else str(i) for i in rslt]\nif rslt == [1]:\n print(0)\nelse:\n print(''.join(rslt))", "N, M = map(int, input().split())\nrslt = [-1]*N\nfor m in range(M):\n s, c = map(int, input().split())\n if s == 1 and c == 0 and N>1:\n print(-1)\n exit()\n elif s > N:\n print(-1)\n exit()\n elif rslt[s-1] != -1 and rslt[s-1] != c:\n print(-1)\n exit()\n else:\n rslt[s-1] = c\n\nif N>1 and rslt[0] == -1:\n rslt[0] = 1\nrslt = ['0' if i == -1 else str(i) for i in rslt]\nprint(''.join(rslt))\n"] | ['Wrong Answer', 'Accepted'] | ['s759666433', 's178073973'] | [3064.0, 3064.0] | [18.0, 17.0] | [422, 403] |
p02761 | u396553339 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['n, m = map(int, input().split())\n\nlistans = [0] * n\nans = 0\n\nfor i in range(m):\n s, c = map(int, input().split())\n if s == 1 and c == 0:\n ans = -1\n if listans[int(s)-1] != c:\n if listans[int(s)-1] == "0":\n listans[int(s)-1] = c\n else :\n ans = -1\n\nif ans == 0:\n if n > 1 and listans[0] == "0":\n listans[0] = "1"\n ans = int("".join([str(li) for li in listans]))\n\nprint(ans)', 'n, m = map(int, input().split())\n\nlistans = [-1] * n\nans = 0\n\nfor i in range(m):\n s, c = map(int, input().split())\n if s == 1 and c == 0:\n ans = -1\n if listans[int(s)-1] != c:\n if listans[int(s)-1] == "0":\n listans[int(s)-1] = c\n else :\n ans = -1\n\nif ans == 0:\n if n > 1 and listans[0] == "0":\n listans[0] = "1"\n ans = int("".join([str(li) for li in listans]))\n\nprint(ans)', 'n, m = map(int, input().split())\n\nlistans = [0] * n\nans = 0\n\nfor i in range(m):\n s, c = map(str, input().split())\n if listans[int(s)-1] == 0:\n listans[int(s)-1] = int(c)\n elif listans[int(s)-1] != int(c):\n ans = -1\n\nif listans[0] == 0:\n ans = -1\nelse :\n if ans == 0:\n ans = int("".join(listans))\n\nprint(ans)', 'n, m = map(int, input().split())\n\nlistans = [0] * n\nans = 0\n\nfor i in range(m):\n s, c = map(int, input().split())\n if s == 1 and c == 0:\n ans = -1\n if listans[int(s)-1] != c:\n if listans[int(s)-1] == "0":\n listans[int(s)-1] = c\n else :\n ans = -1\n\nif ans == 0:\n if n > 1 and listans[0] == "0":\n listans[0] = "1"\n ans = int("".join([str(li) for li in listans]))\n\nprint(ans)', 'n, m = map(int, input().split())\n\nlistans = [0] * n\nans = 0\n\nfor i in range(m):\n s, c = map(int, input().split())\n s -= 1\n if listans[s] == 0:\n listans[s] = c\n elif listans[s] != c:\n ans = -1\n if n > 1 and s == 0 and c == 0:\n ans = -1\n\nif n > 1 and listans[0] == 0:\n listans[0] = 1\n\nif ans == 0:\n ans = "".join([str(li) for li in listans])\n\nprint(ans)'] | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s165688728', 's198438811', 's534525552', 's696826869', 's983208263'] | [3064.0, 3188.0, 3064.0, 3064.0, 3064.0] | [17.0, 19.0, 18.0, 17.0, 17.0] | [436, 437, 343, 436, 393] |
p02761 | u397496203 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["import sys\ninput = sys.stdin.readline\n\n\ndef main():\n N, M = map(int, input().split())\n S = [list(map(int, input().split())) for _ in range(M)]\n ans = [0 for _ in range(N)]\n if N > 1:\n ans[0] = 1\n for i, s in enumerate(S):\n if s[0] == 1 and s[1] == 0:\n if N > 1:\n print(-1)\n return\n for i2, s2 in enumerate(S):\n if i == i2:\n continue\n if s[0] == s2[0]:\n if s[1] != s2[1]:\n print(-1)\n return\n ANS[s[0] - 1] = s[1]\n ans = int(''.join([str(n) for n in ANS]))\n print(ans)\n return\n \n \nif __name__ == '__main__':\n main()", 'import sys\ninput = sys.stdin.readline\n\n\n\ndef main():\n N, M = [int(i) for i in input().strip().split()]\n conditions = [[int(i) for i in input().strip().split()] for _ in range(M)]\n table = [None] * N\n\n for condition in conditions:\n s, c = condition\n if table[s - 1] == c:\n continue\n elif table[s-1] != None:\n return -1\n else:\n table[s-1] = c\n ans = ""\n\n for n in table:\n if n == None:\n ans += "0"\n else:\n ans += str(n)\n print(table)\n ans = int(ans)\n if len(str(ans)) != N:\n return -1\n\n return ans\n', "import sys\ninput = sys.stdin.readline\n\n\n\ndef main():\n N, M = map(int, input().split())\n S = [list(map(int, input().split())) for _ in range(M)]\n ans = [0 for _ in range(N)]\n if N > 1:\n ans[0] = 1\n for i, s in enumerate(S):\n if s[0] == 1 and s[1] == 0:\n if N > 1:\n print(-1)\n return\n for i2, s2 in enumerate(S):\n if i == i2:\n continue\n if s[0] == s2[0]:\n if s[1] != s2[1]:\n print(-1)\n return\n ans[s[0] - 1] = s[1]\n ans = int(''.join([str(n) for n in ans]))\n print(ans)\n return\n\n\nif __name__ == '__main__':\n main()\n"] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s745975928', 's931670770', 's553646189'] | [3064.0, 3064.0, 3064.0] | [18.0, 18.0, 18.0] | [730, 661, 730] |
p02761 | u398355880 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['n,m = map(int,input().split())\na=[]\ns=[]\nc=[]\nans=0\nfor i in range(n):\n a.append(0)\nfor j in range(m):\n s,c= map(int,input().split())\n if a[s-1]==0 & a[s-1]==c:\n #print(str(j)+"e")\n a[s-1]=c\n else:\n ans=-1\nif a[0]==0:\n ans=-1\nif ans!=-1:\n ans=0\n for k in range(n):\n ans+=a[k]*(10**(n-1-k))\nprint(ans)', 'n,m = map(int,input().split())\na=[]\ns=[]\nc=[]\nans=0\nfor i in range(n):\n a.append(0)\nfor j in range(m):\n s,c= map(int,input().split())\n if n>1 and s==1 and c==0:\n ans=-1\n if a[s-1]==0 or a[s-1]==c:\n #print(str(j)+"e")\n a[s-1]=c\n else:\n ans=-1\nif n>1 and a[0]==0:\n a[0]=1\nif ans!=-1:\n ans=0\n for k in range(n):\n ans+=a[k]*(10**(n-1-k))\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s804114087', 's107100485'] | [3064.0, 3064.0] | [18.0, 19.0] | [319, 367] |
p02761 | u402629484 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["import sys\nsys.setrecursionlimit(1000000000)\nimport math\nfrom fractions import gcd\ndef lcm(a, b): return a * b // gcd(a, b)\nfrom itertools import count, permutations\nfrom functools import lru_cache\nfrom collections import deque, defaultdict\nfrom pprint import pprint\nii = lambda: int(input())\nmis = lambda: map(int, input().split())\nlmis = lambda: list(mis())\nINF = float('inf')\nN1097 = 10**9 + 7\n\ndef meg(f, ok, ng):\n while abs(ok-ng)>1:\n mid = (ok+ng)//2\n if f(mid):\n ok=mid\n else:\n ng=mid\n return ok\n\ndef get_inv(n, modp):\n return pow(n, modp-2, modp)\n\ndef factorials_list(n, modp): # 10**6\n fs = [1]\n for i in range(1, n+1):\n fs.append(fs[-1] * i % modp)\n return fs\n\ndef invs_list(n, fs, modp): # 10**6\n invs = [get_inv(fs[-1], modp)]\n for i in range(n, 1-1, -1):\n invs.append(invs[-1] * i % modp)\n invs.reverse()\n return invs\n\ndef comb(n, k, modp):\n num = 1\n for i in range(n, n-k, -1):\n num = num * i % modp\n den = 1\n for i in range(2, k+1):\n den = den * i % modp\n return num * get_inv(den, modp) % modp\n\ndef comb_from_list(n, k, modp, fs, invs): \n return fs[n] * invs[n-k] * invs[k] % modp\n\n#\n\ndef main():\n N,M=mis()\n sc = [lmis() for _ in range(M)]\n for i in map(str, range(10**(N-1), 10**N)):\n if all(len(i) >= s and i[s-1] == str(c) for s, c in sc):\n print(i)\n return\n print(-1)\n\n\nmain()\n\n\n\n\n\n", 'def main():\n N, M = map(int, input().split())\n sc = [tuple(map(int, input().split())) for _ in range(M)]\n i_from = 10**(N-1) if N > 1 else 0\n i_to = 10**N\n for i_str in map(str, range(i_from, i_to)):\n if all(len(i_str) >= s and i_str[s-1] == str(c) for s, c in sc):\n print(i_str)\n return\n print(-1)\n\nmain()\n'] | ['Wrong Answer', 'Accepted'] | ['s928674517', 's758301175'] | [5812.0, 3064.0] | [56.0, 18.0] | [1472, 354] |
p02761 | u405256066 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['from sys import stdin\nN,M = [int(x) for x in stdin.readline().rstrip().split()]\ndata = []\nS = []\nfor i in range(M):\n s,c = [int(x) for x in stdin.readline().rstrip().split()]\n S.append(s)\n data.append((s,c))\nans = ["1"]+["0"]*(N-1)\n \nfor i,j in sorted(data)[::-1]:\n ans[i-1] = str(j)\n\nif len(S) != len(set(S)):\n print(-1)\nelse:\n if M == 0:\n if N == 1:\n print(0)\n elif N == 2:\n print(10)\n elif N == 3:\n print(100)\n else:\n if ans[0] == "0" and N != 1:\n print(-1)\n\n elif ans[0] == "0" and N == 1:\n print(0)\n\n else:\n print("".join(ans))', 'from sys import stdin\nN,M = [int(x) for x in stdin.readline().rstrip().split()]\ndata = []\nS = []\nfor i in range(M):\n s,c = [int(x) for x in stdin.readline().rstrip().split()]\n data.append((s,c))\n S.append(s)\nans = ["1"]+["0"]*(N-1)\n \nfor i,j in sorted(data)[::-1]:\n ans[i-1] = str(j)\n\nif len(data) == len(set(data)) and len(data) != len(set(S)):\n print(-1)\nelse:\n if M == 0:\n if N == 1:\n print(0)\n elif N == 2:\n print(10)\n elif N == 3:\n print(100)\n else:\n if ans[0] == "0" and N != 1:\n print(-1)\n\n elif ans[0] == "0" and N == 1:\n print(0)\n\n else:\n print("".join(ans))'] | ['Wrong Answer', 'Accepted'] | ['s947767311', 's775272956'] | [3064.0, 3064.0] | [17.0, 18.0] | [661, 696] |
p02761 | u408375121 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["N, M = map(int, input().split())\nif M == 0:\n if N == 1:\n print(0)\n else:\n m = 10 ** (N - 1)\n print(m)\nelse:\n dic = {}\n t = ''\n for _ in range(M):\n s, c = map(int, input().split())\n if s not in dic:\n dic[s] = c\n else:\n print(-1)\n break\n if 1 in dic:\n if dic[1] == 0:\n print(-1)\n else:\n t += str(dic[1])\n for j in range(2, 10):\n if j in dic:\n t += str(dic[j])\n else:\n t += '0'\n print(int(t))\n", "N, M = map(int, input().split())\nif M == 0:\n if N == 1:\n print(0)\n else:\n m = 10 ** (N - 1)\n print(m)\nelse:\n dic = {}\n t = ''\n flg = True\n flg2 = True\n for _ in range(M):\n s, c = map(int, input().split())\n if s not in dic:\n dic[s] = c\n else:\n flg = False\n break\n if flg:\n if N == 1:\n if dic[1] == 0:\n print(0)\n else:\n print(dic[1])\n else:\n if 1 in dic:\n if dic[1] == 0:\n flg2 = False\n else:\n t += str(dic[1])\n for j in range(2, N + 1):\n if j in dic:\n t += str(dic[j])\n else:\n t += '0'\n if flg2:\n print(int(t))\n else:\n print(-1)\n else:\n print(-1)\n\n", "N, M = map(int, input().split())\nif M == 0:\n if N == 1:\n print(0)\n else:\n m = 10 ** (N - 1)\n print(m)\nelse:\n dic = {}\n t = ''\n for _ in range(M):\n s, c = map(int, input().split())\n if s not in dic:\n dic[s] = c\n else:\n print(-1)\n break\n if N == 1:\n if dic[1] == 0:\n print(0)\n else:\n print(dic[1])\n else:\n t = ''\n if 1 in dic:\n if dic[1] == 0:\n print(-1)\n else:\n t += str(dic[1])\n for j in range(2, N + 1):\n if j in dic:\n t += str(dic[j])\n else:\n t += '0'\n print(int(t))\n \n", "N, M = map(int, input().split())\nif M == 0:\n if N == 1:\n print('0')\n else:\n m = 10 ** (N - 1)\n print(str(m))\nelse:\n dic = {}\n t = ''\n for _ in range(M):\n s, c = map(int, input().split())\n if s not in dic:\n dic[s] = c\n else:\n print(-1)\n break\n if 1 in dic:\n if dic[1] == 0:\n print(-1)\n else:\n t += str(dic[1])\n for j in range(2, 10):\n if j in dic:\n t += str(dic[j])\n else:\n t += '0'\n print(t)", "N, M = map(int, input().split())\nif M == 0:\n if N == 1:\n print(0)\n else:\n m = 10 ** (N - 1)\n print(m)\nelse:\n dic = {}\n t = ''\n flg = True\n for _ in range(M):\n s, c = map(int, input().split())\n if s not in dic:\n dic[s] = c\n else:\n flg = False\n break\n if N == 1:\n if dic[1] == 0:\n ans = 0\n else:\n ans = dic[1]\n else:\n if 1 in dic:\n if dic[1] == 0:\n flg = False\n else:\n t += str(dic[1])\n for j in range(2, N + 1):\n if j in dic:\n t += str(dic[j])\n else:\n t += '0'\n ans = int(t)\n if flg:\n print(ans)\n else:\n print(-1)", "N, M = map(int, input().split())\nif M == 0:\n if N == 1:\n print(0)\n else:\n m = 10 ** (N - 1)\n print(m)\nelse:\n dic = {}\n t = ''\n flg = True\n for _ in range(M):\n s, c = map(int, input().split())\n if s not in dic:\n dic[s] = c\n else:\n if dic[s] != c:\n flg = False\n break\n if N == 1:\n if dic[1] == 0:\n ans = 0\n else:\n ans = dic[1]\n else:\n if 1 in dic:\n if dic[1] == 0:\n flg = False\n else:\n t += str(dic[1])\n else:\n t += '1'\n for j in range(2, N + 1):\n if j in dic:\n t += str(dic[j])\n else:\n t += '0'\n ans = int(t)\n if flg:\n print(ans)\n else:\n print(-1)\n"] | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s030778080', 's714901775', 's874872914', 's894365888', 's900923557', 's265763928'] | [3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [463, 712, 588, 464, 634, 686] |
p02761 | u408620326 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["import sys\nsys.setrecursionlimit(10 ** 6)\ninput = sys.stdin.readline\nN, M = [int(x) for x in input().strip().split()]\nD = [-1] * N\n\nfor m in range(M):\n s, c = [int(x) for x in input().strip().split()]\n if D[s-1] == -1:\n D[s-1] = c\n continue\n if D[s-1] == c:\n continue\n print(-1)\n exit()\n\nif N > 1:\n if D[0] == 0:\n print(-1)\n exit()\n for n in range(1, N):\n if D[n] == -1:\n D[n] = 0\n\nprint(D)\nans = ''\nfor i in range(N):\n ans += str(D[i])\n\nprint(int(ans))\n", "import sys\nsys.setrecursionlimit(10 ** 6)\ninput = sys.stdin.readline\nN, M = [int(x) for x in input().strip().split()]\nD = [-1] * N\n\nfor m in range(M):\n s, c = [int(x) for x in input().strip().split()]\n if D[s-1] == -1:\n D[s-1] = c\n continue\n if D[s-1] == c:\n continue\n print(-1)\n exit()\n\nif N > 1:\n if D[0] == -1:\n D[0] = 1\n if D[0] == 0:\n print(-1)\n exit()\n for n in range(1, N):\n if D[n] == -1:\n D[n] = 0\nif N == 1:\n if D[0] == -1:\n print(0)\n exit()\n\nans = ''\nfor i in range(N):\n ans += str(D[i])\n\nprint(int(ans))\n"] | ['Wrong Answer', 'Accepted'] | ['s004641261', 's686020229'] | [3064.0, 3064.0] | [17.0, 17.0] | [531, 620] |
p02761 | u409542115 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['\nN,M=map(int,input().split())\ns=[]\nc=[]\nfor i in range(M):\n a, b = map(int,input().split())\n s.append(a)\n c.append(b)\n\nokflag = True\n\nfor i in range(M):\n\n if not okflag:\n break\n for j in range(M):\n if not okflag:\n break\n if not (i==j):\n\n if s[i]==s[j] and c[i]!=c[j]:\n\n okflag = False\n print("No")\n\nif okflag:\n answer = ["0"] * N\n for i in range(M):\n answer[s[i]] = str(c[i])\n if not N == 1 and answer[0] == "0":\n answer[0] = "1"\n result = \'\'.join(answer)\n print(result)\n \n', 'import math\n\nN,M=map(int,input().split())\ns=[]\nc=[]\nfor i in range(M):\n a, b = map(int,input().split())\n s.append(a)\n c.append(b)\n\nfound = False\n\nfor i in range(pow(10,2), pow(10,3)):\n \n i_str = str(i)\n\n passed = True\n for j in range(M):\n if not i_str[s[j]-1] == c[j]:\n passed = False\n break\n if passed:\n found = True\n print(i)\n\nif not found:\n print("-1")\n\nimport math', 'import math\n\nN,M=map(int,input().split())\ns=[]\nc=[]\nfor i in range(M):\n a, b = map(int,input().split())\n s.append(a)\n c.append(b)\n\nfound = False\n\nfor i in range(pow(10,N-1), pow(10,N)):\n \n i_str = str(i)\n\n passed = True\n for j in range(M):\n if not i_str[s[j]-1] == c[j]:\n passed = False\n break\n if passed:\n found = True\n print(i)\n\nif not found:\n print("-1")', 'import math\n\n# AtCoder Beginner Contest 157 - C - Guess The Number\n\n\n\n\n\nN,M=map(int,input().split())\ns=[]\nc=[]\nfor i in range(M):\n \n \n \n \n a, b = map(int,input().split())\n s.append(a)\n c.append(b)\n\n\n\n\n\n\n\n\nfound = False\n\nfor i in range(pow(10,N-1), pow(10,N)):\n \n \n i_str = str(i)\n\n passed = True\n for j in range(M):\n if not i_str[s[j]-1] == c[j]:\n passed = False\n break\n if passed:\n found = True\n print(i)\n break\n\nif not found:\n print("-1")\n', 'import math\n\nN,M=map(int,input().split())\ns=[]\nc=[]\nfor i in range(M):\n a, b = map(int,input().split())\n s.append(a)\n c.append(b)\n\nfound = False\n\nfor i in range(pow(10,2), pow(10,3)):\n \n i_str = str(i)\n\n passed = True\n for j in range(M):\n if not i_str[s[j]] == c[j]:\n passed = False\n break\n if passed:\n found = True\n print(i)\n\nif not found:\n print("-1")', 'import math\n\nN,M=map(int,input().split())\ns=[]\nc=[]\nfor i in range(M):\n a, b = map(int,input().split())\n s.append(a)\n c.append(b)\n\nfound = False\n\nfor i in range(pow(10,N-1), pow(10,N)):\n \n i_str = str(i)\n\n passed = True\n for j in range(M):\n if not i_str[s[j]-1] == c[j]:\n passed = False\n break\n if passed:\n found = True\n print(i)\n\nif not found:\n print("-1")', 'import math\n\nN,M=map(int,input().split())\ns=[]\nc=[]\nfor i in range(M):\n a, b = map(int,input().split())\n s.append(a)\n c.append(b)\n\nfound = False\n\nfor i in range(pow(10,N-1), pow(10,N)):\n \n i_str = str(i)\n\n passed = True\n for j in range(M):\n if not i_str[s[j]-1] == c[j]:\n passed = False\n break\n if passed:\n found = True\n print(i)\n break\n\nif not found:\n print("-1")', 'n,m = map(int,input().split())\ns,c = [0]*m,[0]*m\nfor i in range(m):\n s[i],c[i] = map(int,input().split())\na = [0]*n\n\nflag = True\n \nfor i in range(m):\n if s[i]==1 and c[i]==0:\n flag = False\n \nif n==1:\n flag = True\n\nif flag == True: \n for i in range(m):\n for j in range(i,m):\n if s[i]==s[j]:\n if c[i]!=c[j]:\n flag = False\n \nif flag == True:\n for i in range(m):\n a[s[i]-1] = c[i]\n if n!=1 and a[0]==0:\n a[0]=1\n print(*a,sep="")\nelse:\n print("-1")'] | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s147896856', 's151455163', 's212192421', 's266110782', 's755916357', 's847042910', 's992019855', 's560949732'] | [3064.0, 3188.0, 3188.0, 3064.0, 3188.0, 3188.0, 3064.0, 3064.0] | [17.0, 18.0, 18.0, 18.0, 19.0, 18.0, 18.0, 18.0] | [573, 437, 426, 1906, 422, 427, 440, 592] |
p02761 | u410118019 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["n,m = map(int,input().split())\nl = [-1] * n\nfor i in range(m):\n s,c = map(int,input().split())\n if n != 1 and [s,c] == [1,0]:\n print(-1)\n exit()\n if l[s-1] == -1 or l[s-1] == c:\n l[s-1] = c\n else:\n print(-1)\n exit()\nif l[0] == -1 and n != 1:\n l[0] = 1\nelse:\n l[0] = 0\nprint(*[i if i != -1 else 0 for i in l],sep='')", "n,m = map(int,input().split())\nl = [-1] * n\nfor i in range(m):\n s,c = map(int,input().split())\n if n != 1 and [s,c] == [1,0]:\n print(-1)\n exit()\n if l[s-1] == -1 or l[s-1] == c:\n l[s-1] = c\n else:\n print(-1)\n exit()\nif l[0] == -1 and n != 1:\n l[0] = 1\nelif l[0] == -1:\n l[0] = 0\nprint(*[i if i != -1 else 0 for i in l],sep='')"] | ['Wrong Answer', 'Accepted'] | ['s422997338', 's738276907'] | [3064.0, 3064.0] | [18.0, 18.0] | [336, 347] |
p02761 | u411302151 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['N, M = map(int,input().split())\n\nans = [None] * N\nflag = 1\nfor i in range(M):\n s,c = map(int,input().split())\n\n if (c == 0 and s < N) or ans[s-1]:\n flag = 0\n print(-1)\n break\n ans[s-1] = c\n\nfor i in range(N):\n if not ans[i]:\n ans[i] = 0\n\nif flag:\n print("".join([str(x) for x in ans]))\n\n', 'N, M = map(int,input().split())\n\nd = dict([ (i,set()) for i in range(1, N+1)])\n\nfor i in range(M):\n s,c = map(int,input().split())\n d[s].add(c)\n\nflag = 1\n\n\n# if ((0 in d[1]) or (len(d[1]) > 1)) :\n# if 0 in d[1] and N == 1:\n# ans = "0"\n# else:\n\n# else:\n# ans = str(list(d[1])[0]) if len(d[1]) else "1"\n\n# if len(d[i]) > 1:\n\n# break\n# elif len(d[i]) == 0:\n# ans += "0"\n# else:\n# ans += str(list(d[1])[0])\n\nans = ""\n\nfor i in range(1, N+1):\n\n if len(d[i]) > 1:\n flag = 0\n break\n elif len(d[i]) == 1:\n el = str(list(d[i])[0])\n if el =="0" and i == 1:\n if N == 1:\n ans ="0"\n else:\n flag = 0\n break\n else:\n ans += el\n elif len(d[i]) == 0:\n ans += "1" if i == 1 else "0"\n else:\n print("PROBLEMS!")\n\nif flag:\n if N == 1 and M == 0:\n print(0)\n else:\n print(ans)\nelse:\n print(-1)\n'] | ['Wrong Answer', 'Accepted'] | ['s250599319', 's223301030'] | [3064.0, 3064.0] | [17.0, 18.0] | [330, 1087] |
p02761 | u411858517 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["N, M = map(int, input().split())\nq = [list(map(int, input().split())) for i in range(M)]\nchange = [0 for i in range(N)]\n\nans = list('0' * N)\nfor i in range(M):\n if change[q[i][0]-1] == 0:\n \tans[q[i][0] - 1] = q[i][1]\n \tchange[q[i][0]-1] = 1\n else:\n if ans[q[i][0] - 1] != q[i][1]:\n ans = -1\n break\n \ntry:\n res = ''\n for i in range(len(ans)):\n res += ans[i]\n print(int(res))\nexcept:\n print(-1)\n", 'N, M = map(int, input().split())\nq = [list(map(int, input().split())) for i in range(M)]\nchange = [0 for i in range(N)]\n\nans = -1\nfor i in range(10 ** 3):\n flag = True\n for j in range(M):\n if str(i)[q[i][0] - 1] != q[i][1]:\n flag = False\n \n if flag:\n ans = i\n break\n \nprint(ans)', "N, M = map(int, input().split())\nq = [list(map(int, input().split())) for i in range(M)]\nchange = [0 for i in range(N)]\n\nans = list('0' * N)\nfor i in range(M):\n if change[q[i][0]-1] == 0:\n \tans[q[i][0] - 1] = q[i][1]\n change[q[i][0]-1] = 1\n else:\n if ans[q[i][0] - 1] != q[i][1]:\n ans = -1\n break\n \ntry:\n print(int(ans))\nexcept:\n print(-1)\n", "N, M = map(int, input().split())\nq = [list(map(int, input().split())) for i in range(M)]\nchange = [0 for i in range(N)]\n\nans = list('0' * N)\nfor i in range(M):\n if change[q[i][0]-1] == 0:\n \tans[q[i][0] - 1] = q[i][1]\n \tchange[q[i][0]-1] = 1\n else:\n if ans[q[i][0] - 1] != q[i][1]:\n ans = -1\n break\n \ntry:\n print(int(ans))\nexcept:\n print(-1)\n", "N, M = map(int, input().split())\nq = [list(map(int, input().split())) for i in range(M)]\nchange = [0 for i in range(N)]\n\nans = list('0' * N)\nfor i in range(M):\n if change[q[i][0]-1] == 0: \n \tans[q[i][0] - 1] = q[i][1]\n else:\n if ans[q[i][0] - 1] != q[i][1]:\n ans = -1\n break\n \ntry:\n print(int(ans))\nexcept:\n print(-1)", 'N, M = map(int, input().split())\nq = [list(map(int, input().split())) for i in range(M)]\n\nans = -1\nfor i in range(10 ** (N-1), 10 ** N + 1):\n flag = True\n for j in range(M):\n try:\n if str(i)[q[j][0] - 1] != q[j][1]:\n flag = False\n except:\n flag = False\n break\n \n if flag:\n ans = i\n break\n \nprint(ans)\n', 'N, M = map(int, input().split())\nq = [list(map(int, input().split())) for i in range(M)]\nchange = [0 for i in range(N)]\n\nans = -1\nfor i in range(10 ** 3):\n flag = True\n for j in range(M):\n try:\n if str(i)[q[i][0] - 1] != q[i][1]:\n flag = False\n except:\n flag = False\n break\n \n if flag:\n ans = i\n break\n \nprint(ans)\n', 'N, M = map(int, input().split())\nq = [list(map(int, input().split())) for i in range(M)]\nchange = [0 for i in range(N)]\n\nans = -1\nfor i in range(10 ** 3):\n flag = True\n for j in range(M):\n try:\n if str(i)[q[j][0] - 1] != q[j][1]:\n flag = False\n except:\n flag = False\n break\n \n if flag:\n ans = i\n break\n \nprint(ans)\n', "N, M = map(int, input().split())\nq = [list(map(int, input().split())) for i in range(M)]\nchange = [0 for i in range(N)]\n\nans = list('0' * N)\nfor i in range(M):\n if change[q[i][0]-1] == 0: \n \tans[q[i][0] - 1] = q[i][1]\n change[q[i][0]-1] = 1\n else:\n if ans[q[i][0] - 1] != q[i][1]:\n ans = -1\n break\n \ntry:\n print(int(ans))\nexcept:\n print(-1)\n", 'N, M = map(int, input().split())\nq = [list(map(int, input().split())) for i in range(M)]\n\nans = -1\nif N == 1:\n s = 0\nelse:\n s = 10 ** (N - 1)\nfor i in range(s, 10 ** N + 1):\n\n flag = True\n for j in range(M):\n try:\n if str(i)[q[j][0] - 1] != str(q[j][1]):\n flag = False\n except:\n flag = False\n break\n \n if flag:\n ans = i\n break\n \nprint(ans)\n'] | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s040892040', 's143497397', 's225599367', 's225775816', 's487398463', 's536709289', 's790086637', 's816066740', 's948646952', 's185293192'] | [3064.0, 3064.0, 2940.0, 3064.0, 3064.0, 3060.0, 3060.0, 3060.0, 2940.0, 3064.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 19.0, 18.0, 19.0, 17.0, 19.0] | [422, 303, 366, 365, 343, 346, 360, 360, 370, 387] |
p02761 | u415716267 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['NM = list(map(int,input().split()))\nN = NM[0]\nM = NM[1]\nSC = []\ntemp = [0] * N\ntemp2 = [True] * 9\ntest = True\ntest2 = True\nfor i in range(M):\n SC.append(list(map(int,input().split())))\n Ldigit = SC[i][0]\n Lnum = SC[i][1]\n if temp2[Ldigit-1]:\n temp[Ldigit-1] = Lnum\n temp2[Ldigit-1] = False\n else:\n test2 = False\nif N > 0 and temp[0] == 0:\n temp[0] = 1\ntempS = "".join(map(str,temp))\nprint(tempS)\nif test2:\n for i in range(999):\n if str(i) == tempS:\n print(i)\n test = False\nif test or not test2:\n print(-1)', 'NM = list(map(int,input().split()))\nN = NM[0]\nM = NM[1]\nSC = []\ntemp = [0] * N\ntest = True\nfor i in range(M):\n SC.append(list(map(int,input().split())))\n Ldigit = SC[i][0]\n Lnum = SC[i][1]\n temp[Ldigit-1] = Lnum\nprint(SC)\nprint(temp)\ntempS = "".join(map(str,temp))\nfor i in range(999):\n if str(i) == tempS:\n print(i)\n test = False\nif test:\n print(-1)', 'NM = list(map(int,input().split()))\nN = NM[0]\nM = NM[1]\nSC = []\ntemp = [0] * N\ntemp2 = [True] * 9\ntest = True\ntest2 = True\nfor i in range(M):\n SC.append(list(map(int,input().split())))\n Ldigit = SC[i][0]\n Lnum = SC[i][1]\n if temp2[Ldigit-1]:\n temp[Ldigit-1] = Lnum\n temp2[Ldigit-1] = False\n else:\n test2 = False\nif N > 0 and temp[0] == 0:\n temp[0] = 1\ntempS = "".join(map(str,temp))\nif test2:\n for i in range(999):\n if str(i) == tempS:\n print(i)\n test = False\nif test or not test2:\n print(-1)', 'NM = list(map(int,input().split()))\nN = NM[0]\nM = NM[1]\nSC = []\ntemp = [0] * N\ntemp2 = [True] * 9\ntemp3 = []\ntest = True\ntest2 = True\nfor i in range(M):\n SC.append(list(map(int,input().split())))\n Ldigit = SC[i][0]\n Lnum = SC[i][1]\n if temp2[Ldigit-1]:\n temp[Ldigit-1] = Lnum\n temp2[Ldigit-1] = False\n else:\n test2 = False\nfor i in SC:\n temp3.append("".join(map(str,i)))\nif len(set(temp3)) != len(temp3):\n test2 = True\nif "10" in temp3 and not N == 1:\n test2 = False\nif N > 0 and temp[0] == 0 and not N == 1:\n temp[0] = 1\ntempS = "".join(map(str,temp))\nif test2:\n for i in range(999):\n if str(i) == tempS:\n print(i)\n test = False\nif test or not test2:\n print(-1)'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s089744552', 's119687345', 's130811734', 's668698196'] | [3064.0, 3064.0, 3188.0, 3064.0] | [17.0, 18.0, 18.0, 17.0] | [579, 382, 566, 745] |
p02761 | u418502493 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["N,M = list(map(int, input().split()))\nconsumed = {}\nfor i in range(M):\n s,c = list(map(int, input().split()))\n\n if s == 1 and c == 0 and N != 1:\n print(-1)\n exit()\n\n if s in consumed:\n if consumed[s] != c:\n print(-1)\n exit()\n\n consumed[s] = c\n\nprint(int(''.join([str(consumed.get(i,1)) for i in range(1,N+1)])))\n", "N,M = list(map(int, input().split()))\n\nconsumed = {}\nfor i in range(M):\n s,c = list(map(int, input().split()))\n\n if s > N:\n print(-1)\n exit()\n if s == 1 and c == 0 and N != 1:\n print(-1)\n exit()\n\n if s in consumed:\n if consumed[s] != c:\n print(-1)\n exit()\n\n consumed[s] = c\n\nans = [str(consumed.get(i,0)) for i in range(1,N+1)]\nif ans[0] == '0':\n if len(ans) > 1:\n ans[0] = '1'\n\nprint(int(''.join(ans)))\n"] | ['Wrong Answer', 'Accepted'] | ['s732549652', 's264137871'] | [3064.0, 3064.0] | [17.0, 17.0] | [367, 486] |
p02761 | u419963262 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['N,M=map(int,input().split())\nS=["0" for i in range(N)]\nseen=[]\nfor i in range(M):\n A=input().split()\n if A not in seen:\n seen.append(A)\n if S[int(A[0])-1]=="0":\n S[int(A[0])-1]=A[1]\n else:\n W="bad"\nANS="".join(S)\nif (ANS[0]=="0" and len(ANS)!=1) or W=="bad":\n print("-1")\nelse:\n print(ANS)', 'N, M = map(int, input().split())\nsc = [list(map(int, input().split())) for _ in range(M)]\ndic = {}\n\n\nif sc == [] and N == 1:\n print(0)\n exit()\nif sc == [[1, 0]] and N == 1:\n print(0)\n exit()\n\n\nfor k in sc:\n if k[0] in dic:\n if dic[k[0]] != k[1]: \n print(-1)\n exit()\n else:\n dic[k[0]] = k[1]\nans = 0\nprint(dic)\nif 1 in dic and dic[1] == 0: \n print(-1)\n exit()\nfor k in dic:\n ans += 10**(N - k) * dic[k]\nif ans < 10**(N - 1):\n ans += 10**(N - 1)\nprint(ans)\n', 'N, M = map(int, input().split())\nsc = [list(map(int, input().split())) for _ in range(M)]\ndic = {}\n\n\nif sc == [] and N == 1:\n print(0)\n exit()\nif sc == [[1, 0]] and N == 1:\n print(0)\n exit()\n\n\nfor k in sc:\n if k[0] in dic:\n if dic[k[0]] != k[1]: \n print(-1)\n exit()\n else:\n dic[k[0]] = k[1]\nans = 0\n\nif 1 in dic and dic[1] == 0: \n print(-1)\n exit()\nfor k in dic:\n ans += 10**(N - k) * dic[k]\nif ans < 10**(N - 1):\n ans += 10**(N - 1)\nprint(ans)\n'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s153567089', 's482722797', 's445411571'] | [3064.0, 3064.0, 3064.0] | [18.0, 18.0, 17.0] | [344, 673, 663] |
p02761 | u422165425 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['import sys\n\nar = []\nx = sys.stdin.readline()\nx = x.split(\' \')\n(n,m)=[int(str) for str in x]\n\nret = 0\nchk = []\nfor i in range(m):\n x = sys.stdin.readline()\n x = x.split(\' \')\n (s,c)=[int(str) for str in x]\n if not ( s in chk):\n if(n-s>0):\n ret += c*10**(n-s)\n chk.append(s)\nif( ret == 0 and n == 1):\n print("0")\n exit(0)\nif( ret < 10**(n-1)):\n print("-1")\nelse:\n print(ret)\nsys.stdout.flush()\n', 'import sys\n\nar = []\nx = sys.stdin.readline()\nx = x.split(\' \')\n(n,m)=[int(str) for str in x]\n\nret = 0\nchk = []\nfor i in range(m):\n x = sys.stdin.readline()\n x = x.split(\' \')\n (s,c)=[int(str) for str in x]\n if not ( s in chk):\n if(n-s>=0):\n ret += c*10**(n-s)\n chk.append(s)\n else:\n if( c == int(ret/10**(n-s))):\n print("-1")\n\n\nif( ret == 0 and n == 1):\n print("0")\n exit(0)\nif( ret < 10**(n-1)):\n if not ( n-1 in chk):\n print(ret+10**(n-1))\n else:\n print("-1")\nelse:\n print(ret)\nsys.stdout.flush()\n', 'import sys\n\nar = []\nx = sys.stdin.readline()\nx = x.split(\' \')\n(n,m)=[int(str) for str in x]\n\nret = 0\nchk = []\nfor i in range(m):\n x = sys.stdin.readline()\n x = x.split(\' \')\n (s,c)=[int(str) for str in x]\n if not ( s in chk):\n if(n-s>=0):\n ret += c*10**(n-s)\n chk.append(s)\n else:\n if( c != int(ret/10**(n-s))):\n print("-1")\n exit(0)\n\nif( ret == 0 and n == 1):\n print("0")\n exit(0)\nif( ret < 10**(n-1)):\n if not ( 1 in chk):\n print(ret+10**(n-1))\n else:\n print("-1")\nelse:\n print(ret)\nsys.stdout.flush()\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s162205154', 's174963390', 's208440587'] | [3064.0, 3064.0, 3064.0] | [19.0, 18.0, 17.0] | [412, 538, 545] |
p02761 | u422886513 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['N, M = input().split(" ")\nN = int(N)\nM = int(M)\n\nif M==0:\n print(0)\n exit()\n\ns = []\nc = []\n\none_list = []\ntwo_list = []\nthree_list = []\n\nfor i in range(M):\n tmp_s, tmp_c = input().split(" ")\n tmp_s = int(tmp_s)\n tmp_c = int(tmp_c)\n s.append(tmp_s)\n c.append(tmp_c)\n if tmp_s == 1:\n one_list.append(tmp_c)\n elif tmp_s == 2:\n two_list.append(tmp_c)\n elif tmp_s == 3:\n three_list.append(tmp_c)\n else:\n print("Error")\n\nif len(set(one_list)) > 1:\n print(-1)\n exit()\n\nif len(set(two_list)) > 1:\n print(-1)\n exit()\n\nif len(set(three_list)) > 1:\n print(-1)\n exit()\n\nresult = ""\nfor i in range(N):\n result += "0"\n\nstr_list = list(result)\nfor i in range(M):\n str_list[s[i] - 1] = str(c[i])\n\nprint(str_list)\n\nif N > 1:\n if str_list[0] == "0":\n print(-1)\n exit()\n\nprint("".join(str_list))\n', 'N, M = input().split(" ")\nN = int(N)\nM = int(M)\n\nif M == 0 and N == 1:\n print(0)\n exit()\n\nif M == 0 and N != 1:\n print(-1)\n exit()\n\ns = []\nc = []\n\none_list = []\ntwo_list = []\nthree_list = []\n\nfor i in range(M):\n tmp_s, tmp_c = input().split(" ")\n tmp_s = int(tmp_s)\n tmp_c = int(tmp_c)\n s.append(tmp_s)\n c.append(tmp_c)\n if tmp_s == 1:\n one_list.append(tmp_c)\n elif tmp_s == 2:\n two_list.append(tmp_c)\n elif tmp_s == 3:\n three_list.append(tmp_c)\n else:\n print("Error")\n\nif len(set(one_list)) > 1:\n print(-1)\n exit()\n\nif len(set(two_list)) > 1:\n print(-1)\n exit()\n\nif len(set(three_list)) > 1:\n print(-1)\n exit()\n\nresult = ""\nfor i in range(N):\n result += "0"\n\nstr_list = list(result)\nfor i in range(M):\n str_list[s[i] - 1] = str(c[i])\n\nprint(str_list)\n\nif N > 1:\n if str_list[0] == "0":\n print(-1)\n exit()\n\nprint("".join(str_list))\n', 'N, M = input().split(" ")\nN = int(N)\nM = int(M)\n\nif M == 0 and N == 1:\n print(0)\n exit()\n\nif M == 0 and N != 1:\n print(-1)\n exit()\n\ns = []\nc = []\n\none_list = []\ntwo_list = []\nthree_list = []\n\nfor i in range(M):\n tmp_s, tmp_c = input().split(" ")\n tmp_s = int(tmp_s)\n tmp_c = int(tmp_c)\n s.append(tmp_s)\n c.append(tmp_c)\n if tmp_s == 1:\n one_list.append(tmp_c)\n elif tmp_s == 2:\n two_list.append(tmp_c)\n elif tmp_s == 3:\n three_list.append(tmp_c)\n else:\n print("Error")\n\n\nif len(set(one_list)) > 1:\n print(-1)\n exit()\n\nif len(set(two_list)) > 1:\n print(-1)\n exit()\n\nif len(set(three_list)) > 1:\n print(-1)\n exit()\n\nresult = ""\nfor i in range(N):\n result += "-"\n\nstr_list = list(result)\nfor i in range(M):\n str_list[s[i] - 1] = str(c[i])\n\nif N > 1:\n if str_list[0] == "0":\n print(-1)\n exit()\n\nstr_list = list("".join(str_list).replace("-", "0"))\nprint(str_list)\nif str_list[0] == "0":\n str_list[0] = "1"\n\nprint("".join(str_list))\n', 'N, M = input().split(" ")\nN = int(N)\nM = int(M)\n\ns = []\nc = []\n\none_list = []\ntwo_list = []\nthree_list = []\n\nfor i in range(M):\n tmp_s, tmp_c = input().split(" ")\n tmp_s = int(tmp_s)\n tmp_c = int(tmp_c)\n s.append(tmp_s)\n c.append(tmp_c)\n if tmp_s == 1:\n one_list.append(tmp_c)\n elif tmp_s == 2:\n two_list.append(tmp_c)\n elif tmp_s == 3:\n three_list.append(tmp_c)\n else:\n print("Error")\n\n\nif len(set(one_list)) > 1:\n print(-1)\n exit()\n\nif len(set(two_list)) > 1:\n print(-1)\n exit()\n\nif len(set(three_list)) > 1:\n print(-1)\n exit()\n\nresult = ""\nfor i in range(N):\n result += "-"\n\nstr_list = list(result)\nfor i in range(M):\n str_list[s[i] - 1] = str(c[i])\n\nif N > 1:\n if str_list[0] == "0":\n print(-1)\n exit()\n\nstr_list = list("".join(str_list).replace("-", "0"))\nif N != 1:\n if str_list[0] == "0":\n str_list[0] = "1"\n\nprint("".join(str_list))\n'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s374361841', 's493017441', 's736561415', 's085223930'] | [3064.0, 3064.0, 3064.0, 3064.0] | [18.0, 17.0, 18.0, 17.0] | [879, 940, 1039, 947] |
p02761 | u427163848 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['N,M = map(int, input().split())\ns = []\nc = []\nt_1 = []\nt_2 = []\nfor i in range(M):\n t_1,t_2 = map(int, input().split())\n s.append(t_1)\n c.append(t_2) \n\nprint(\'s={0},c={1}\'.format(s,c))\n\nans = []\nfor p in range(N):\n ans.append(-1)\nfor j in range(M):\n ans[s[j]-1:s[j]] = [c[j]]\nfor k in range(len(ans)):\n if ans[k]==-1:\n ans[k] = 0\nif ans[0] == 0:\n ans[0] = 1\nprint("".join(map(str,ans)))', 'N,M = map(int, input().split())\ns = []\nc = []\nt_1 = []\nt_2 = []\nfor i in range(M):\n t_1,t_2 = map(int, input().split())\n s.append(t_1)\n c.append(t_2) \n\nprint(\'s={0},c={1}\'.format(s,c))\n\nans = []\nfor p in range(N):\n ans.append(-1)\nfor j in range(M):\n ans[s[j]-1:s[j]] = [c[j]]\nfor k in range(len(ans)):\n if ans[k]==-1:\n ans[k] = 0\nif ans[0] == 0:\n ans[0] = 1\nprint("".join(map(str,ans)))', 'N,M = map(int, input().split())\ns = []\nc = []\nt_1 = []\nt_2 = []\nfor i in range(M):\n t_1,t_2 = map(int, input().split())\n s.append(t_1)\n c.append(t_2) \nans = []\nfor p in range(N):\n ans.append(-2)\nfor j in range(M):\n if s[j] > N:\n ans[0:N] = [-1]\n break\n ans[s[j]-1:s[j]] = [c[j]]\nif N != 1:\n if ans[0] == 0:\n ans[0:N] = [-1]\n elif ans[0] == -2:\n ans[0] = 1\nfor r in range(1,M):\n if s[r-1] == s[r]:\n if c[r-1] != c[r]:\n ans[0:N] = [-1]\n break\nfor k in range(len(ans)):\n if ans[k]==-2:\n ans[k] = 0\nprint(int("".join(map(str,ans))))'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s807282734', 's868788292', 's300729982'] | [3064.0, 3064.0, 3064.0] | [18.0, 17.0, 17.0] | [415, 415, 623] |
p02761 | u428199834 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['N,M=map(int,input().split())\nif M>=1:\n s=[0]*M\n c=[0]*M\n for i in range(M):\n s[i],c[i]=map(int,input().split())\n\n a=0\n for i in range(M-1):\n for j in range(i+1,M):\n if s[i]==s[j] and c[i]!=c[j]:\n a+=1\n if a==0:\n u_=[0,0,0]\n for i in range(M):\n u_[s[i]-1]=c[i]\n if max(s)!=3 and N==2:\n if min(s)!=1 and u_[0]==0:\n print(10+u_[1])\n elif min(s)==1 and u_[0]==0:\n print(-1)\n else:\n print(u_[0]*10+u_[1])\n elif N==3:\n if min(s)!=1 and u_[0]==0:\n print(100+u_[1]*10+u_[2])\n elif min(s)==1 and u_[0]==0:\n print(-1)\n else:\n print(100*u_[0]+10*u_[1]+u_[2])\n elif N==1 and max(s)==1 and min(s)==1:\n print(c[0])\n else:\n print(-1)\n else:\n print(-1)\nelse:\n if N==1:\n print(0)\n else:\n N>=2:\n print(10**(N-1))\n \n', 'N,M=map(int,input().split())\ns=[0]*M\nc=[0]*M\nfor i in range(M):\n s[i],c[i]=map(int,input().split())\nprint(s)\nprint(c)\na=0\nfor i in range(M-1):\n for j in range(i+1,M):\n if s[i]==s[j] and c[i]!=c[j]:\n a+=1\nif a==0:\n if N>=len(list(set(s))) and N>=2:\n \n u_=[0,0,0]\n for i in range(len(s)):\n u_[s[i]-1]=c[i]\n print(u_) \n if u_[0]==0 and N==3:\n print(-1)\n elif u_[0]==0 and u_[1]==1 and N==2:\n print(-1)\n else:\n print(u_[0]*10**2+u_[1]*10+u_[2])\n elif N==1 and len(list(set(c)))==1:\n print(c[0])\n else:\n print(-1)\nelse:\n print(-1)\n \n \n', 'N,M=map(int,input().split())\ns=[0]*M\nc=[0]*M\nfor i in range(M):\n s[i],c[i]=map(int,input().split())\nprint(s)\nprint(c)\na=0\nfor i in range(M-1):\n for j in range(i+1,M):\n if s[i]==s[j] and c[i]!=c[j]:\n a+=1\nif a==0:\n if N>=len(list(set(c))) and N>=2:\n \n u_=[0,0,0]\n for i in range(len(s)):\n u_[s[i]-1]=c[i]\n print(u_) \n if u_[0]==0 and N==3:\n print(-1)\n elif u_[0:2]==[0,0] and N==2:\n print(-1)\n else:\n print(u_[0]*10**2+u_[1]*10+u_[2])\n elif N==1 and len(list(set(c)))==1:\n print(c[0])\n else:\n print(-1)\nelse:\n print(-1)', 'N,M=map(int,input().split())\nif M>=1:\n s=[0]*M\n c=[0]*M\n for i in range(M):\n s[i],c[i]=map(int,input().split())\n\n a=0\n for i in range(M-1):\n for j in range(i+1,M):\n if s[i]==s[j] and c[i]!=c[j]:\n a+=1\n if a==0:\n u_=[0,0,0]\n for i in range(M):\n u_[s[i]-1]=c[i]\n if max(s)!=3 and N==2:\n if min(s)!=1 and u_[0]==0:\n print(10+u_[1])\n elif min(s)==1 and u_[0]==0:\n print(-1)\n else:\n print(u_[0]*10+u_[1])\n elif N==3:\n if min(s)!=1 and u_[0]==0:\n print(100+u_[1]*10+u_[2])\n elif min(s)==1 and u_[0]==0:\n print(-1)\n else:\n print(100*u_[0]+10*u_[1]+u_[2])\n elif N==1 and max(s)==1 and min(s)==1:\n print(c[0])\n else:\n print(-1)\n else:\n print(-1)\nelse:\n if N==1:\n print(0)\n else:\n print(10**(N-1))\n '] | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s136499592', 's316637599', 's968342937', 's501706120'] | [3064.0, 3064.0, 3188.0, 3064.0] | [17.0, 18.0, 20.0, 17.0] | [916, 599, 581, 905] |
p02761 | u431573188 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['import sys\n\nn, m = map(int, input().split())\n\ncond = list(list(map(int, input().split())) for i in range(m))\n\nnum = [0]*n\nif len(num) != 1:\n num[0] = 1\n\nfor i in range(m):\n digit = cond[i][0] - 1\n a = cond[i][1]\n if num[digit] == 0 or num[digit] == a:\n num[digit] = a\n else:\n print(-1)\n sys.exit()\n \nif num[0] == 0 and len(num) != 1:\n print(-1)\n sys.exit()\n\nnumber = 0\nfor i in range(n):\n d = n - i - 1\n number += pow(10,d)*num[i]\n \nprint(number)', "N, M = map(int, input().split())\nsc = list(list(map(int, input().split())) for _ in range(M))\n\ndef func(N,M,sc):\n ans = [0]*N\n for i in range(M):\n s = sc[i][0]-1\n c = sc[i][1]\n if c == 0:\n c = 'x'\n if ans[s] == 0 or ans[s] == c:\n ans[s] = c\n else:\n return -1\n if N != 1 and ans[0] == 0:\n ans[0] = 1\n for i in range(N):\n if ans[i] == 'x':\n ans[i] = 0\n if N != 1 and ans[0] == 0:\n return -1\n return int(''.join(map(str,ans)))\n\nprint(func(N,M,sc))"] | ['Wrong Answer', 'Accepted'] | ['s244793432', 's759214683'] | [3064.0, 3064.0] | [18.0, 17.0] | [504, 562] |
p02761 | u432853936 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['n,m = map(int,input().split())\nsc = [list(map(int,input().split())) for i in range(m)]\ntmp = [-1]*n\nfor j in range(m):\n if tmp[(sc[j][0]-1)] != sc[j][1]:\n if tmp[(sc[j][0]-1)] != -1:\n print(-1)\n exit()\n tmp[(sc[j][0]-1)] = sc[j][1]\nif tmp[0] == -1 and len(tmp) >= 2:\n print(-1)\n exit()\nelse:\n for k in range(n):\n if tmp[k] == -1:\n tmp[k] = 0\n print("{}".format(tmp[k]), end = "")\n', 'n,m = map(int,input().split())\nsc = [list(map(int,input().split())) for i in range(m)]\ntmp = [-1]*n\nfor j in range(m):\n if tmp[(sc[j][0]-1)] != sc[j][1]:\n if tmp[(sc[j][0]-1)] != -1:\n print(-1)\n exit()\n tmp[(sc[j][0]-1)] = sc[j][1]\nif len(tmp) == 1:\n if tmp[0] == -1:\n tmp[0] = 0\n print(tmp[0])\n exit()\nelif tmp[0] == 0:\n print(-1)\n exit()\nelse:\n if tmp[0] == -1:\n tmp[0] = 1\n for k in range(1,n):\n if tmp[k] == -1:\n tmp[k] = 0\n ans = map(str,tmp)\n answer= "".join(ans)\n print(answer)\n'] | ['Wrong Answer', 'Accepted'] | ['s858390683', 's747170848'] | [3064.0, 3064.0] | [18.0, 17.0] | [549, 727] |
p02761 | u433371341 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["import sys\n\nN, M = tuple(int(n) for n in input().split())\n\nstr_list = ['0' for n in range(N)]\nstr_state = [0 for n in range(N)] \n\n#print(str_list)\n#print(str_state)\n\nfor i in range(M):\n si, ci = tuple(int(n) for n in input().split())\n print('si: %d, ci: %d' % (si, ci))\n ci = str(ci)\n if str_state[si - 1] == 0:\n str_list[si - 1] = ci\n str_state[si - 1] = 1\n #print(str_list)\n #print(str_state)\n elif str_list[si - 1] != ci:\n #print(-1)\n sys.exit(0)\n #else:\n \n\nfor i in range(len(str_list)):\n if str_list[i] != '0':\n break\n else:\n if str_state[i] == 0:\n str_list[i] = '1'\n break\n\nnum = str(int(''.join(str_list)))\nif len(num) == N:\n print(num)\nelse:\n print(-1)\n", "import sys\n\nN, M = tuple(int(n) for n in input().split())\n\nstr_list = ['0' for n in range(N)]\nstr_state = [0 for n in range(N)] \n\n#print(str_list)\n#print(str_state)\n\n\nfor i in range(M):\n si, ci = tuple(int(n) for n in input().split())\n #print('si: %d, ci: %d' % (si, ci))\n ci = str(ci)\n if str_state[si - 1] == 0:\n str_list[si - 1] = ci\n str_state[si - 1] = 1\n #print(str_list)\n #print(str_state)\n elif str_list[si - 1] != ci:\n print(-1)\n sys.exit(0)\n #else:\n \n\nfor i in range(len(str_list)):\n if str_list[i] != '0':\n break\n else:\n if i == len(str_list) - 1:\n break\n if str_state[i] == 0:\n str_list[i] = '1'\n break\n\nnum = str(int(''.join(str_list)))\nif len(num) == N:\n print(num)\nelse:\n print(-1)\n"] | ['Wrong Answer', 'Accepted'] | ['s554305410', 's067713010'] | [3064.0, 3064.0] | [17.0, 18.0] | [816, 870] |
p02761 | u436982376 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['n, m = map(int,input().split())\nn_list = []\n\nfor i in range(m):\n s, c = map(int,input().split())\n n_list.append([s, c])\n\nn_list = list(tuple(sorted(n_list)))\n\nketa = [-1 for i in range(n)]\nflag = 0\n\nfor i in range(len(n_list)):\n if keta[n_list[i][0]-1] == -1:\n keta[n_list[i][0]-1] = n_list[i][1]\n elif keta[n_list[i][0]-1] == n_list[i][1]:\n continue\n else:\n flag = 1\n break\n\nif flag == 1 or (n == 3 and keta[0] == 0) or (n == 2 and keta[0] == 0):\n print(-1)\nelse:\n if len(keta) == 1:\n if keta[0] == -1:\n print(0)\n else:\n print(keta[0])\n elif len(keta) == 2:\n if keta[0] == -1:\n keta[0] = 1\n if keta[1] == -1:\n keta[1] = 0\n print(keta[0]*10 + keta[1])\n else:\n if keta[0] == -1:\n keta[0] = 1\n if keta[1] == -1:\n keta[1] = 0\n if keta[2] == -1:\n keta[2] = 0\n print(keta[0]*100 + keta[1]*10 + keta[0])\n', 'n, m = map(int,input().split())\nn_list = []\n\nfor i in range(m):\n s, c = map(int,input().split())\n n_list.append([s, c])\n\nn_list = list(tuple(sorted(n_list)))\n\nketa = [-1 for i in range(n)]\nflag = 0\n\nfor i in range(len(n_list)):\n if keta[n_list[i][0]-1] == -1:\n keta[n_list[i][0]-1] = n_list[i][1]\n elif keta[n_list[i][0]-1] == n_list[i][1]:\n continue\n else:\n flag = 1\n break\n\nif flag == 1 or (n == 3 and keta[0] == 0) or (n == 2 and keta[0] == 0):\n print(-1)\nelse:\n if len(keta) == 1:\n if keta[0] == -1:\n print(0)\n else:\n print(keta[0])\n elif len(keta) == 2:\n if keta[0] == -1:\n keta[0] = 1\n if keta[1] == -1:\n keta[1] = 0\n print(keta[0]*10 + keta[1])\n else:\n if keta[0] == -1:\n keta[0] = 1\n if keta[1] == -1:\n keta[1] = 0\n if keta[2] == -1:\n keta[2] = 0\n print(keta[0]*100 + keta[1]*10 + keta[2])\n'] | ['Wrong Answer', 'Accepted'] | ['s744609477', 's714913549'] | [3064.0, 3064.0] | [18.0, 18.0] | [993, 993] |
p02761 | u437351386 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['import sys\nn,m=list(map(int,input().split()))\nans=[-1 for i in range(n)]\n\nfor i in range(m):\n s,c=list(map(int,input().split()))\n if n!=1 and s==1 and c==0:\n print(-1)\n sys.exit()\n if ans[s-1]==-1 or ans[s-1]==c:\n ans[s-1]=c\n else:\n print(-1)\n sys.exit()\n\n \nif n==1 and ans[0]==0\u3000or ans[0]==-1\n print(0)\n sys.exit()\nif ans[0]==-1:\n ans[0]=1\nfor i in range(1,n):\n if ans[i]==-1:\n ans[i]=0\nans=map(str, ans)\nprint("".join(ans))\n\n ', 'import sys\nn,m=list(map(int,input().split()))\nans=[-1 for i in range(n)]\n\nfor i in range(m):\n s,c=list(map(int,input().split()))\n if n!=1 and s==1 and c==0:\n print(-1)\n sys.exit()\n if ans[s-1]==-1 or ans[s-1]==c:\n ans[s-1]=c\n else:\n print(-1)\n sys.exit()\n\n \nif n==1 and ans[0]==0\u3000or -1\n print(0)\n sys.exit()\nif ans[0]==-1:\n ans[0]=1\nfor i in range(1,n):\n if ans[i]==-1:\n ans[i]=0\nans=map(str, ans)\nprint("".join(ans))\n\n ', 'import sys\nn,m=list(map(int,input().split()))\nans=[-1 for i in range(n)]\n\nfor i in range(m):\n s,c=list(map(int,input().split()))\n if n!=1 and s==1 and c==0:\n print(-1)\n sys.exit()\n if ans[s-1]==-1 or ans[s-1]==c:\n ans[s-1]=c\n else:\n print(-1)\n sys.exit()\n\n \nif n==1 and (ans[0]==0\u3000or ans[0]==-1)\n print(0)\n sys.exit()\nif ans[0]==-1:\n ans[0]=1\nfor i in range(1,n):\n if ans[i]==-1:\n ans[i]=0\nans=map(str, ans)\nprint("".join(ans))\n\n ', 'import sys\nn,m=list(map(int,input().split()))\nans=[-1 for i in range(n)]\nnum=0\nfor i in range(m):\n s,c=list(map(int,input().split()))\n if n==1 and c==0:\n print(0)\n sys.exit()\n if s==1 and c==0:\n print(-1)\n sys.exit()\n if ans[s-1]==-1 or ans[s-1]==c:\n ans[s-1]=c\n else:\n print(-1)\n sys.exit()\n\n sys.exit()\nif ans[0]==-1:\n ans[0]=1\nfor i in range(1,n):\n if ans[i]==-1:\n ans[i]=0\nans=map(str, ans)\nprint("".join(ans))\n\n ', 'import sys\nn,m=list(map(int,input().split()))\nans=[-1 for i in range(n)]\n\nfor i in range(m):\n s,c=list(map(int,input().split()))\n if n!=1 and s==1 and c==0:\n print(-1)\n sys.exit()\n if ans[s-1]==-1 or ans[s-1]==c:\n ans[s-1]=c\n else:\n print(-1)\n sys.exit()\n\n \nif n==1 and (ans[0]==0 or ans[0]==-1):\n print(0)\n sys.exit()\nif ans[0]==-1:\n ans[0]=1\nfor i in range(1,n):\n if ans[i]==-1:\n ans[i]=0\nans=map(str, ans)\nprint("".join(ans))\n\n '] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s247708066', 's448752958', 's479563723', 's766824285', 's677104284'] | [3060.0, 3060.0, 3064.0, 3064.0, 3064.0] | [17.0, 17.0, 17.0, 18.0, 17.0] | [460, 452, 462, 450, 461] |
p02761 | u439176910 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['N, M = map(int, input().split())\narr = []\nans = [0] * N\nans[0] = 1\nfor i in range(M):\n s, c = map(int, input().split())\n print(s, c)\n if s == 1 and c == 0 and N != 1:\n print(-1)\n exit(0)\n if s in arr and ans[s-1] != c:\n print(-1)\n exit(0)\n arr.append(s)\n ans[s-1] = c\nprint("".join([str(i) for i in ans]))\n', 'N, M = map(int, input().split())\narr = []\nans = [0] * N\nfor i in range(M):\n s, c = map(int, input().split())\n print(s, c)\n if s == 1 and c == 0 and N != 1:\n print(-1)\n exit(0)\n if s in arr and ans[s-1] != c:\n print(-1)\n exit(0)\n arr.append(s)\n ans[s-1] = min(c, ans[s-1])\nprint("".join([str(i) for i in ans]))\n', 'N, M = map(int, input().split())\narr = []\nans = [0] * N\nfor i in range(M):\n s, c = map(int, input().split())\n print(s, c)\n if s == 1 and c == 0 and N != 1:\n print(-1)\n exit(0)\n if s in arr and ans[s-1] != c:\n print(-1)\n exit(0)\n arr.append(s)\n ans[s-1] = c\nprint("".join([str(i) for i in ans]))\n', 'N, M = map(int, input().split())\narr = []\nans = [0] * N\nif N > 1:\n ans[0] = 1\nfor i in range(M):\n s, c = map(int, input().split())\n if s == 1 and c == 0 and N != 1:\n print(-1)\n exit(0)\n if s in arr and ans[s-1] != c:\n print(-1)\n exit(0)\n arr.append(s)\n ans[s-1] = c\nprint("".join([str(i) for i in ans]))\n'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s435898102', 's782646010', 's898765442', 's186295282'] | [3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 19.0, 18.0, 17.0] | [352, 356, 341, 350] |
p02761 | u439619952 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['def solve():\n N,M = [int(i) for i in input().split()]\n digits = [\'0\'] * N\n targets = set([])\n for i in range(M):\n s,c = [int(num) for num in input().split()]\n target = s - 1\n if target == 0 and c == 0:\n digits = [\'-1\']\n break\n if target in targets:\n digits = [\'-1\']\n break\n else:\n digits[s-1] = str(c)\n targets.add(s-1)\n print(\'\'.join(digits))\n\nif __name__ == "__main__":\n solve()', 'def solve():\n N,M = [int(i) for i in input().split()]\n digits = [\'0\'] * N\n digits[0] = \'1\'\n targets = set([])\n for i in range(M):\n s,c = [int(num) for num in input().split()]\n target = s - 1\n if target == 0 and c == 0:\n digits = [\'-1\']\n break\n if target in targets:\n digits = [\'-1\']\n break\n else:\n digits[s-1] = str(c)\n targets.add(s-1)\n print(\'\'.join(digits))\n\nif __name__ == "__main__":\n solve()', 'def solve():\n N,M = [int(i) for i in input().split()]\n digits = [\'0\'] * N\n digits[0] = \'0\' if N == 1 else \'1\'\n targets = set([])\n for i in range(M):\n s,c = [int(num) for num in input().split()]\n target = s - 1\n if target == 0 and c == 0 and N != 1:\n digits = [\'-1\']\n break\n if target in targets and str(c) != digits[target]:\n digits = [\'-1\']\n break\n else:\n digits[s-1] = str(c)\n targets.add(s-1)\n print(\'\'.join(digits))\n\nif __name__ == "__main__":\n solve()'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s452098427', 's947124679', 's885863757'] | [9176.0, 9208.0, 9148.0] | [33.0, 27.0, 29.0] | [499, 519, 578] |
p02761 | u440129511 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["n,m=map(int,input().split())\nsc=[list(map(int,input().split())) for _ in range(m)]\nn1=[0]*n\nnc=[0]*n\nfor i in range(n):\n if n1[x[i][0]-1]==0:\n n1[x[i][0]-1]+=x[i][1]\n nc[x[i][0]-1]+=1\n elif nc[x[i][0]-1]!=0 and n1[x[i][0]-1]!=x[i][1]:\n print(-1)\n exit()\nwhile True:\n if n1[0]==0:n1.pop(0)\n if sum(n1)==0:\n print(0)\n exit()\n else:break\nprint(''.join(map(str,n1)))", 'n,m=map(int,input().split())\n \na=["0"]*n\n \nfor i in range(m):\n s,c=map(int,input().split())\n if a[s-1]=="0":\n a[s-1]=c\n elif a[s-1]!=c:\n print(-1)\n exit()\n\nif n>1 and a[0]==0:\n print(-1)\n exit()\n\nif n>1 and a[0]=="0":\n a[0]=1\n\nprint(*a,sep="")'] | ['Runtime Error', 'Accepted'] | ['s130039400', 's422370070'] | [3064.0, 3064.0] | [17.0, 17.0] | [419, 282] |
p02761 | u440161695 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['print(-1)', 'import sys\nN,M=map(int,input().split())\nd={}\nfor i in range(M):\n a,b=map(int,input().split())\n if a==1 and b==0 and N>1:\n print(-1)\n sys.exit()\n if not a in d:\n d[a]=b\n elif d[a]!=b:\n print(-1)\n sys.exit()\nA=[0]*N\nfor i in d:\n A[i-1]=d[i]\nA=[str(A[i]) for i in range(len(A))]\nif A[0]=="0" and N!=1:\n A[0]="1"\nprint("".join(A))'] | ['Wrong Answer', 'Accepted'] | ['s148474528', 's583161166'] | [2940.0, 3064.0] | [17.0, 18.0] | [9, 377] |
p02761 | u441599836 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['n, m = map(int, input().split())\ns = []\nc = []\nfor i in range(m):\n S, C = map(int, input().split())\n s.append(S-1)\n c.append(C)\n\nans = [9] * n\n\nused = []\nfor i in range(m):\n if s[i] not in used:\n ans[s[i]] = c[i]\n used.append(s[i])\n else:\n if ans[s[i]] != c[i]:\n ans = [-1]\n break\nelse:\n for i in range(1, n):\n if i not in used:\n ans[i] = 0\n\nif n != 1 and ans[0] == 0:\n ans = [-1]\nif n == 1 and m == 0:\n ans = [0]\nfor i in range(len(ans)):\n print(ans[i], end="")\n', 'n, m = map(int, input().split())\ns = []\nc = []\nfor i in range(m):\n S, C = map(int, input().split())\n s.append(S-1)\n c.append(C)\n\nans = [0] * n\n\nused = []\nfor i in range(m):\n if s[i] not in used:\n ans[s[i]] = c[i]\n used.append(s[i])\n else:\n if ans[s[i]] != c[i]:\n ans = [-1]\n break\n\nif n != 1 and ans[0] == 0:\n ans = [-1]\nif n == 1 and m == 0:\n ans = [0]\nfor i in range(len(ans)):\n print(ans[i], end="")\n', 'n, m = map(int, input().split())\ns = []\nc = []\nfor i in range(m):\n S, C = map(int, input().split())\n s.append(S-1)\n c.append(C)\n\nans = [0] * n\n\nused = []\nfor i in range(m):\n if s[i] not in used:\n ans[s[i]] = c[i]\n used.append(s[i])\n else:\n if ans[s[i]] != c[i]:\n ans = [-1]\n break\n\nif 0 not in used and ans[0] == 0:\n ans[0] == 1\nif n != 1 and m != 0 and ans[0] == 0:\n ans = [-1]\nif n != 1 and m == 0:\n ans[0] = 1\nif n == 1 and m == 0:\n ans = [0]\nfor i in range(len(ans)):\n print(ans[i], end="")\n', 'n, m = map(int, input().split())\ns = []\nc = []\nfor i in range(m):\n S, C = map(int, input().split())\n s.append(S-1)\n c.append(C)\n\nans = [9] * n\n\nused = []\nfor i in range(m):\n if s[i] not in used:\n ans[s[i]] = c[i]\n used.append(s[i])\n else:\n if ans[s[i]] != c[i]:\n ans = [-1]\n break\nelse:\n for i in range(1, n):\n if i not in used:\n ans[i] = 0\n\nif ans[0] == 0:\n ans = [-1]\nfor i in range(len(ans)):\n print(ans[i], end="")\n', 'n, m = map(int, input().split())\ns = []\nc = []\nfor i in range(m):\n S, C = map(int, input().split())\n s.append(S-1)\n c.append(C)\n\nans = [0] * n\n\nused = []\nfor i in range(m):\n if s[i] not in used:\n ans[s[i]] = c[i]\n used.append(s[i])\n else:\n if ans[s[i]] != c[i]:\n ans = [-1]\n break\n\nif n != 1 and m != 0 and ans[0] == 0:\n ans = [-1]\nif n != 1 and m == 0:\n ans[0] = 1\nif n == 1 and m == 0:\n ans = [0]\nfor i in range(len(ans)):\n print(ans[i], end="")\n', 'n, m = map(int, input().split())\ns = []\nc = []\nfor i in range(m):\n S, C = map(int, input().split())\n s.append(S-1)\n c.append(str(C))\n\nans = -1\n\nif n == 3:\n st, ed = 100, 1000\nelif n == 2:\n st, ed = 10, 100\nelse:\n st, ed = 0, 10\n\nfor i in range(st, ed):\n t = list(str(i))\n for j in range(m):\n if t[s[j]] != c[j]:\n break\n else:\n ans = i\n break\nprint(ans)'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s480602888', 's559278107', 's898875207', 's911099356', 's980316373', 's867706668'] | [3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 18.0, 17.0, 17.0, 18.0, 18.0] | [551, 470, 568, 504, 518, 411] |
p02761 | u442877951 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["N,M = map(int,input().split())\ns,c = [map(int,input()) for i in range(M)]\nl = []\nfirst = []\nsecond = []\nthird = []\nfor i in range(M):\n if s[i] == 1:\n first.append(c[i])\n elif s[i] == 2:\n second.append(c[i])\n elif s[i] == 3:\n third.append(c[i])\nif first == []:\n print(-1)\nelif second == []:\n second.append(0)\nelif third == []:\n third.append(0)\nl.append(min(first))\nl.append(min(second))\nl.append(min(third))\nl = ''.join(str(n) for n in l)\nprint(l)", 'N,M = map(int,input().split())\nsc = [list(map(int,input().split())) for _ in range(M)]\nthree = 1000\ntwo = 100\none = 10\nfor i in range(M):\n if sc[i][0]== 1:\n three = min(10**(N-1)*sc[i][1],three)\n elif sc[i][0]== 2:\n two = min((10**N)/100*sc[i][1],two)\n elif sc[i][0]== 3:\n one = min(sc[i][1],one)\nif N == 3:\n if three == 1000:\n three = 1\n elif three == 0:\n print(-1)\n exit()\nelif N == 2:\n if two == 100:\n two = 1\n elif two == 0:\n print(-1)\n exit()\nelif N == 1:\n if one == 10:\n one = 1\n elif one == 0:\n print(-1)\n exit()\nprint(three+two+one)', "N,M = map(int,input().split())\ns = [int(input()) for i in range(M)]\nc = [int(input()) for i in range(M)]\nfirst = []\nsecond = []\nthird = []\nfor i in range(M):\n if s[i] == 1:\n first.append(c[i])\n elif s[i] == 2:\n second.append(c[i])\n elif s[i] == 3:\n third.append(c[i])\nif first == []:\n print(-1)\nelif second == []:\n second.append(0)\nelif third == []:\n third.append(0)\nl.append(min(first))\nl.append(min(second))\nl.append(min(third))\nl = ''.join(str(n) for n in l)\nprint(l)", "N,M = map(int,input().split())\ns,c = [map(int,input().split()) for i in range(M)]\nl = []\nfirst = []\nsecond = []\nthird = []\nfor i in range(M):\n if s[i] == 1:\n first.append(c[i])\n elif s[i] == 2:\n second.append(c[i])\n elif s[i] == 3:\n third.append(c[i])\nif first == []:\n print(-1)\nelif second == []:\n second.append(0)\nelif third == []:\n third.append(0)\nl.append(min(first))\nl.append(min(second))\nl.append(min(third))\nl = ''.join(str(n) for n in l)\nprint(l)\n\n", "N,M = map(int,input().split())\nSC = [list(map(int, input().split())) for i in range(M)]\nl = []\nfirst = []\nsecond = []\nthird = []\nfor i in range(M):\n for s,c in SC:\n if s[i] == 1:\n first.append(c[i])\n elif s[i] == 2:\n second.append(c[i])\n elif s[i] == 3:\n third.append(c[i])\nif first == []:\n print(-1)\nelif second == []:\n second.append(0)\nelif third == []:\n third.append(0)\nl.append(min(first))\nl.append(min(second))\nl.append(min(third))\nl = ''.join(str(n) for n in l)\nprint(l)", "N,M = map(int,input().split())\ns = [int(input()) for i in range(M)]\nc = [int(input()) for i in range(M)]\nl = []\nfirst = []\nsecond = []\nthird = []\nfor i in range(M):\n if s[i] == 1:\n first.append(c[i])\n elif s[i] == 2:\n second.append(c[i])\n elif s[i] == 3:\n third.append(c[i])\nif first == []:\n print(-1)\nelif second == []:\n second.append(0)\nelif third == []:\n third.append(0)\nl.append(min(first))\nl.append(min(second))\nl.append(min(third))\nl = ''.join(str(n) for n in l)\nprint(l)\n\n", 'N,M = map(int,input().split())\nSC = [list(map(int,input().split())) for _ in range(M)]\nflag = 1\nfor i in range(1000):\n if len(str(i)) < N:\n continue\n flag = 1\n for s,c in SC:\n c = str(c)\n if str(i)[s-1] != c:\n flag = 0\n if flag == 1:\n print(i)\n exit()\n\nprint(-1)'] | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s266046877', 's274203669', 's378404062', 's465367032', 's489065307', 's944333047', 's052888155'] | [3064.0, 3188.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0] | [19.0, 18.0, 17.0, 17.0, 17.0, 18.0, 19.0] | [461, 585, 485, 471, 504, 494, 286] |
p02761 | u450904670 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['def fuga(check_dict, check_str):\n for j, num_str in enumerate(str(check_str)):\n if(not(j in check_dict)):\n continue\n if(check_dict[j] != int(num_str)):\n return False\n return True\n\nN,M = list(map(int, input().split()))\nli = [list(map(int, input().split())) for _ in range(M)]\ncheck = {}\nfor s,c in li:\n if(s-1 in check):\n if(check[s-1] != c):\n print(-1)\n exit()\n check[s-1] = c\n\nprint(check)\n\nif(N == 1):\n for i in range(9):\n if(fuga(check, i)):\n print(i)\n exit()\n print(-1)\n exit()\nfor i in range(10**(N-1), 10**(N)):\n if(fuga(check, i)):\n print(i)\n exit()\nprint(-1)\n', 'def fuga(check_dict, check_str):\n for j, num_str in enumerate(str(check_str)):\n if(not(j in check_dict)):\n continue\n if(check_dict[j] != int(num_str)):\n return False\n return True\n\nN,M = list(map(int, input().split()))\nli = [list(map(int, input().split())) for _ in range(M)]\ncheck = {}\nfor s,c in li:\n if(s-1 in check):\n if(check[s-1] != c):\n print(-1)\n exit()\n check[s-1] = c\n\nif(N == 1):\n for i in range(10):\n if(fuga(check, i)):\n print(i)\n exit()\n print(-1)\n exit()\nfor i in range(10**(N-1), 10**(N)):\n if(fuga(check, i)):\n print(i)\n exit()\nprint(-1)\n'] | ['Wrong Answer', 'Accepted'] | ['s715401245', 's297993151'] | [3064.0, 3064.0] | [18.0, 18.0] | [623, 610] |
p02761 | u452269253 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['N, M = [int(i) for i in input().split()]\nvalid = True\nans = [-1]*N\nfor a in range(M):\n s,c = [int(i) for i in input().split()]\n if ans[s-1] == -1:\n ans[s-1] = c\n else:\n valid = False\n\nfor a in range(len(ans)):\n if ans[a] == -1:\n ans[a] = 0\nif valid:\n n = "".join(map(str, ans))\n if len(n) != 0 and n[0] == "0":\n print(-1)\n else:\n print(int(n))\nelse:\n print(-1)', 'N, M = [int(i) for i in input().split()]\nvalid = True\nans = [-1]*N\nfor a in range(M):\n s,c = [int(i) for i in input().split()]\n if ans[s-1] == -1:\n ans[s-1] = c\n elif ans[s-1] != c:\n valid = False\n\nfor a in range(len(ans)):\n if ans[a] == -1:\n if a == 0:\n if len(ans) == 1:\n ans[a] = 0\n else:\n ans[a] = 1\n else:\n ans[a] = 0\nif valid:\n n = "".join(map(str, ans))\n if len(n) != 1 and n[0] == "0":\n print(-1)\n else:\n print(int(n))\nelse:\n print(-1)'] | ['Wrong Answer', 'Accepted'] | ['s021128562', 's084837544'] | [3064.0, 3064.0] | [17.0, 17.0] | [419, 572] |
p02761 | u453623947 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["N,M = map(int,input().split())\n\nans = [-1] * N\n\nfor i in range(M):\n s,c = map(int,input().split())\n if ans[s-1] != -1 and ans[s-1] != c :\n print(-1)\n exit()\n t[s-1] = c\n\nif N != 1 :\n if ans[0] == 0 :\n print(-1)\n exit()\n if ans[0] == -1 :\n ans[0] = 1\n for i in range(N):\n if ans[i] == -1:\n ans[i] = 0\nelse :\n if ans[0] == -1 :\n ans[0] = 0\n\nprint(*ans,sep='')\n", "N,M = map(int,input().split())\n\nans = [-1] * N\n\nfor i in range(M):\n s,c = map(int,input().split())\n if ans[s-1] != -1 and ans[s-1] != c :\n print(-1)\n exit()\n ans[s-1] = c\n\nif N != 1 :\n if ans[0] == 0 :\n print(-1)\n exit()\n if ans[0] == -1 :\n ans[0] = 1\n for i in range(N):\n if ans[i] == -1:\n ans[i] = 0\nelse :\n if ans[0] == -1 :\n ans[0] = 0\n\nprint(*ans,sep='')\n"] | ['Runtime Error', 'Accepted'] | ['s940654691', 's685163194'] | [9076.0, 9160.0] | [27.0, 30.0] | [439, 441] |
p02761 | u455408345 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['nm=input("").split(" ")\nn=int(nm[0])\nm=int(nm[1])\nlists=[-1]*n\nss=0\nfor i in range(m):\n sc=input("").split(" ")\n s=int(sc[0])\n c=int(sc[1])\n if(s==1 and c==0):\n ss=1\n elif(lists[s-1]==-1):\n lists[s-1]=c\n elif(lists[s-1]==c):\n None\n else:\n ss=1\nif(ss==1):\n print(-1)\nelse:\n\n pp=""\n for i in range(n):\n if(lists[i]==-1):\n pp+="1"\n else:\n pp+=str(lists[i])\n print(int(pp))\n \n', 'nm=input("").split(" ")\nn=int(nm[0])\nm=int(nm[1])\nlists=[-1]*n\nss=0\nif(n==1):\n tt=-1\n for i in range(m):\n sc=input("").split(" ")\n s=int(sc[0])\n c=int(sc[1])\n if(tt==-1):\n tt=c\n elif(tt==c):\n None\n else:\n ss=1\n if(ss==1):\n print(-1)\n elif(m==0):\n print(0)\n else:\n print(tt)\n \n\nelse:\n for i in range(m):\n sc=input("").split(" ")\n s=int(sc[0])\n c=int(sc[1])\n if(s==1 and c==0):\n ss=1\n elif(lists[s-1]==-1):\n lists[s-1]=c\n elif(lists[s-1]==c):\n None\n else:\n ss=1\n if(ss==1):\n \n \n print(-1)\n \n else:\n\n pp=""\n for i in range(n):\n if(lists[i]==-1 and i!=0):\n pp+="0"\n elif(lists[i]==-1):\n pp+="1"\n else:\n pp+=str(lists[i])\n print(int(pp))\n \n'] | ['Wrong Answer', 'Accepted'] | ['s963321674', 's491620756'] | [9148.0, 9220.0] | [28.0, 30.0] | [476, 997] |
p02761 | u460229551 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['n,m=list(map(int,input().split()))\nans=[1]+[0]*(n-1)\ncheck=0\n\nfor _ in range(m):\n s,c=list(map(int,input().split()))\n s-=1\n if s==0:\n if c==0:\n check+=1\n break\n elif ans[s]!=1:\n check+=1\n break\n else:\n ans[s]=c\n else:\n if ans[s]!=0:\n check+=1\n break\n else:\n ans[s]=c\nif check>0:\n print(str(-1))\nelse:\n ans=list(map(str,ans))\n print("".join(ans))\n', 'n,m=list(map(int,input().split()))\nif n!=1:\n ans=[1]+[0]*(n-1)\n checks=[0]*n\n check=0\n\n for _ in range(m):\n s,c=list(map(int,input().split()))\n s-=1\n if s==0:\n if c==0:\n check+=1\n break\n elif checks[s]!=0 and ans[s]!=c:\n check+=1\n break\n else:\n checks[s]+=1\n ans[s]=c\n else:\n if checks[s]!=0 and ans[s]!=c:\n check+=1\n break\n else:\n checks[s]+=1\n ans[s]=c\nelse:\n ans=[0]\n checks=[0]\n check=0\n for _ in range(m):\n s,c=list(map(int,input().split()))\n s-=1\n if checks[s]!=0 and ans[s]!=c:\n check+=1\n break\n else:\n checks[s]+=1\n ans[s]=c\n\nif check>0:\n print(str(-1))\nelse:\n ans=list(map(str,ans))\n print("".join(ans))\n'] | ['Wrong Answer', 'Accepted'] | ['s851907958', 's191374008'] | [3064.0, 3064.0] | [17.0, 17.0] | [484, 945] |
p02761 | u460375306 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['# if assignment already exists for a digit, check it is consistent.\n# no leading zeroes (except for the number zero)\n# given constraints are ok, fill other digits with zeros (and potentially 1 for lead)\n\ndef assign_digits(ans):\n flags_assigned = [0]*N\n for _ in range(M):\n new_s = int(s.pop())\n new_c = int(c.pop())\n if flags_assigned[new_s-1] == 1:\n if new_c != int(ans[new_s-1]): return -1\n else:\n flags_assigned[new_s-1] = 1\n ans[new_s-1]=str(new_c)\n if ans[0] == "0" and len(ans)>1: return -1\n return ans\n\nN, M = map(int, input().split())\ns = list()\nc = list()\nfor _ in range(M):\n row = list(map(int, input().split()))\n s.append(row[0])\n c.append(row[1])\n\nif N==1:\n ans = [str(0)]\nelif N==2:\n ans = [str(1), str(0)]\nelif N==3:\n ans = [str(1), str(0), str(0)]\n\nprint(assign_digits(ans))\n \n', '# if assignment already exists for a digit, check it is consistent.\n# no leading zeroes (except for the number zero)\n# given constraints are ok, fill other digits with zeros (and potentially 1 for lead)\n\ndef assign_digits(ans):\n for _ in range(M):\n new_s = s.pop()\n new_c = c.pop()\n if flags_assigned[new_s-1] == 1:\n if new_c != int(ans[new_s-1]): return -1\n else:\n flags_assigned[new_s-1] = 1\n ans[new_s-1]=str(new_c)\n if ans[0] == "0" and len(ans)>1: return -1\n return ans\n\nN, M = map(int, input().split())\ns = list()\nc = list()\nfor _ in range(M):\n row = list(map(int, input().split()))\n s.append(row[0])\n c.append(row[1])\n\nif N==1:\n ans = [str(0)]\nelif N==2:\n ans = [str(1), str(0)]\nelif N==3:\n ans = [str(1), str(0), str(0)]\nflags_assigned = [0]*N\n\nprint(int(assign_digits(ans)))\n', '# if assignment already exists for a digit, check it is consistent.\n# no leading zeroes (except for the number zero)\n# given constraints are ok, fill other digits with zeros (and potentially 1 for lead)\n\ndef assign_digits(ans):\n for _ in range(M):\n new_s = s.pop()\n new_c = c.pop()\n if flags_assigned[new_s-1] == 1:\n if new_c != int(ans[new_s-1]): return [str(-1)]\n else:\n flags_assigned[new_s-1] = 1\n ans[new_s-1]=str(new_c)\n if ans[0] == "0" and len(ans)>1: return [str(-1)]\n return ans\n\nN, M = map(int, input().split())\ns = list()\nc = list()\nfor _ in range(M):\n row = list(map(int, input().split()))\n s.append(row[0])\n c.append(row[1])\n\nif N==1:\n ans = [str(0)]\nelif N==2:\n ans = [str(1), str(0)]\nelif N==3:\n ans = [str(1), str(0), str(0)]\nflags_assigned = [0]*N\n\nprint(int("".join(assign_digits(ans))))\n'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s323617701', 's808902837', 's850772382'] | [3064.0, 3064.0, 3064.0] | [18.0, 18.0, 18.0] | [830, 820, 843] |
p02761 | u460737328 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['from collections import defaultdict\nN, M = map(int, input().split())\nsc = defaultdict(list)\n\nfor i in range(M):\n s, c = map(int, input().split())\n sc[s].append(c)\n\nans = [-1] * N\nres = True\nfor s, c in sc.items():\n if len(set(c)) != 1:\n res = False\n break\n else:\n ans[s - 1] = c[0]\nif ans[0] == 0 and N == 1:\n pass\nelif ans[0] == 0:\n res = False\nelse:\n if ans[0] == -1 and N == 1:\n ans[0] = 0\n elif ans[0] == -1:\n ans[0] = 1\n\n for i in range(1, N):\n if ans[i] == -1:\n ans[i] = 0\n\nprint("".join(list(map(str, ans))) if res else "-1")\n', 'from collections import defaultdict\nN, M = map(int, input().split())\nsc = defaultdict(list)\n\nfor i in range(M):\n s, c = map(int, input().split())\n sc[s].append(c)\n\nans = [-1] * N\nres = True\nfor s, c in sc.items():\n if len(set(c)) != 1:\n res = False\n break\n else:\n ans[s - 1] = c[0]\n\nif N == 1 and ans[0] == -1:\n ans[0] = 0\nelif N > 1 and ans[0] == 0:\n res = False\nelse:\n if ans[0] == -1:\n ans[0] = 1\n\n for i in range(1, N):\n if ans[i] == -1:\n ans[i] = 0\n\nprint("".join(list(map(str, ans))) if res else "-1")\n'] | ['Wrong Answer', 'Accepted'] | ['s761114596', 's019724872'] | [3316.0, 3316.0] | [20.0, 21.0] | [625, 578] |
p02761 | u461833298 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["N, M = map(int, input().split())\nSC = [[int(x) for x in input().split()] for _ in range(M)]\n\nans = [0] * N\nflg = 0\n\nfor s, c in SC:\n if (flg>>(s-1))&1:\n ans=[-1]\n break\n else:\n flg |= 1<<(s-1)\n ans[s-1] = c\n\n\nans = ''.join(map(str, ans))\nans = str(int(ans))\n\nif len(ans)!=N:\n print(-1)\nelse:\n print(ans)", 'N, M = map(int, input().split())\nSC = [[int(x) for x in input().split()] for _ in range(M)]\n\nans = []\nfor i in range(1000):\n if len(str(i)) != N:\n continue\n \n flg = True\n for s, c in SC:\n if str(i)[s-1] == str(c):\n continue\n else:\n flg = False\n break\n if flg:\n ans.append(i)\n\nif len(ans)==0:\n print(-1)\nelse:\n print(min(ans))'] | ['Wrong Answer', 'Accepted'] | ['s866756648', 's018256237'] | [3064.0, 3064.0] | [17.0, 18.0] | [343, 407] |
p02761 | u469281291 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["import sys\nn, m = map(int, input().split())\nisExist=True\nli2 = [[''] for i in range(n)]\nfor i in range(m):\n s, c = map(int, input().split())\n if (li2[s - 1][0] != '' and li2[s - 1][0] != c):\n isExist = False\n elif(s == 1 and c == 0):\n isExist = False\n else:\n li2[s - 1][0] = c\nans=''\nif (not isExist):\n print(-1)\n sys.exit()\n else:\n print(0)\n sys.exit()\nfor i in range(n):\n if (li2[0][0] == ''):\n li2[0][0]=1\n if (li2[i][0] == ''):\n li2[i][0] = 0\nfor i in range(n):\n ans += str(li2[i][0])\nif (n == 1 and m == 0):\n ans=0\nprint(int(ans))", "import sys\nn, m = map(int, input().split())\nisExist=True\nli2 = [[''] for i in range(n)]\nfor i in range(m):\n s, c = map(int, input().split())\n if (li2[s - 1][0] != '' and li2[s - 1][0] != c):\n isExist = False\n elif(s == 1 and c == 0):\n isExist = False\n else:\n li2[s - 1][0] = c\nans=''\nif (not isExist):\n print(-1)\n sys.exit()\nelse:\n print(0)\n sys.exit()\nfor i in range(n):\n if (li2[0][0] == ''):\n li2[0][0]=1\n if (li2[i][0] == ''):\n li2[i][0] = 0\nfor i in range(n):\n ans += str(li2[i][0])\nif (n == 1 and m == 0):\n ans=0\nprint(int(ans))", "import sys\nn, m = map(int, input().split())\nisExist = True\nisExist2=True\nli2 = [[''] for i in range(n)]\nfor i in range(m):\n s, c = map(int, input().split())\n if (li2[s - 1][0] != '' and li2[s - 1][0] != c):\n isExist = False\n elif(s == 1 and c == 0):\n isExist2 = False\n else:\n li2[s - 1][0] = c\nans=''\nif (not isExist):\n print(-1)\n sys.exit()\nif (not isExist2):\n if (n == 1):\n print(0)\n sys.exit()\n else:\n print(-1)\n sys.exit()\nfor i in range(n):\n if (li2[0][0] == ''):\n li2[0][0]=1\n if (li2[i][0] == ''):\n li2[i][0] = 0\nfor i in range(n):\n ans += str(li2[i][0])\nif (n == 1 and m == 0):\n ans=0\nprint(int(ans))"] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s367746052', 's430640529', 's167884220'] | [3064.0, 3064.0, 3064.0] | [17.0, 17.0, 17.0] | [629, 625, 719] |
p02761 | u469953228 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['n,m=map(int,input().split())\n# a,b,c=map(int,input().split())\n# s=input()\n# s,t=map(str,input().split())\nans=[0]*n\nanss=""\nl=[]\nL=[]\nfor i in range(m):\n s,c=map(int,input().split())\n l.append(str(s)+str(c))\n\nl=list(set(l))\nfor x in l:\n L.append([x[0],x[1]])\nX=[]\n\nfor i in range(len(L)):\n\n ans[int(L[i][0])-1] = int(L[i][1])\n if L[i][0] in X:\n print(-1)\n exit()\n else:\n X.append(L[i][0])\nprint(ans)\nif ans[0]==0:\n if n!=1:\n ans[0]="1"\n for x in ans:\n anss+=str(x)\n print(anss)\n else:\n print(0)\nelse:\n for x in ans:\n anss+=str(x)\n print(anss)', 'n,m=map(int,input().split())\n# a,b,c=map(int,input().split())\n# s=input()\n# s,t=map(str,input().split())\nans=[0]*n\nanss=""\nl=[]\nL=[]\nfor i in range(m):\n s,c=map(int,input().split())\n l.append(str(s)+str(c))\n if s==1 and c==0:\n print(-1)\n exit()\n\nl=list(set(l))\nfor x in l:\n L.append([x[0],x[1]])\nX=[]\n\nfor i in range(len(L)):\n\n ans[int(L[i][0])-1] = int(L[i][1])\n if L[i][0] in X:\n print(-1)\n exit()\n else:\n X.append(L[i][0])\nprint(ans)\nif ans[0]==0:\n if n!=1:\n ans[0]="1"\n for x in ans:\n anss+=str(x)\n print(anss)\n else:\n print(0)\nelse:\n for x in ans:\n anss+=str(x)\n print(anss)', 'n,m=map(int,input().split())\n# a,b,c=map(int,input().split())\n# s=input()\n# s,t=map(str,input().split())\n\nans=[-1]*n\nanss=""\nfor i in range(m):\n s,c=map(int,input().split())\n if ans[s-1] != -1 and ans[s-1] != c :\n print(-1)\n exit()\n if n!=1 and s==1 and c==0:\n print(-1)\n exit()\n ans[s-1]=c\n\nif m==0:\n if n==1:\n print(0)\n else:\n print(10**(n-1))\n exit()\n\nif ans[0]==-1:\n ans[0]="1"\n\n\n\nfor x in ans:\n if x==-1:\n x=0\n anss+=str(x)\nprint(anss)\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s616700558', 's618731855', 's685993639'] | [3064.0, 3192.0, 3064.0] | [17.0, 18.0, 17.0] | [584, 629, 472] |
p02761 | u470560351 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["N,M = map(int, input().split())\n\nans = [-1] * N\nfor i in range(M):\n s,c = map(int, input().split())\n if ans[s-1] == -1:\n ans[s-1] = c\n elif ans[s-1] == c:\n continue\n else:\n ans = -1\n break\n\nif ans == -1:\n print(ans)\nelif ans[0] ==0:\n print(-1)\nelse:\n answer = ''\n for i in range(N):\n if ans[i] == -1:\n ans[i] = 1\n answer += str(ans[i])\n print(answer)", "N,M = map(int, input().split())\n\nans = [-1] * N\nfor i in range(M):\n s,c = map(int, input().split())\n if ans[s-1] == -1:\n ans[s-1] = c\n elif ans[s-1] == c:\n continue\n else:\n ans = -1\n break\n\nif ans == -1:\n print(ans)\nelif ans[0] ==-1:\n print(-1)\nelse:\n answer = ''\n for i in range(N):\n if ans[i] == -1:\n ans[i] = 1\n answer += str(ans[i])\n print(answer)", "N,M = map(int, input().split())\n\nans = [-1] * N\nfor i in range(M):\n s,c = map(int, input().split())\n if ans[s-1] == -1:\n ans[s-1] = c\n elif ans[s-1] == c:\n continue\n else:\n ans = -1\n break\n\nif ans == -1:\n print(ans)\nelif ans[0] == 0:\n if N == 1:\n print(0)\n else:\n print(-1)\nelse:\n answer = ''\n for i in range(N):\n if ans[i] == -1:\n if i ==0 and N==1:\n ans[i] = 0\n elif i == 0:\n ans[i] = 1\n else:\n ans[i] = 0\n answer += str(ans[i])\n print(answer)"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s329704131', 's570298133', 's257355507'] | [3064.0, 3064.0, 3064.0] | [17.0, 17.0, 17.0] | [388, 389, 523] |
p02761 | u471641802 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["n, m = map(int, input().split())\ns_c = tuple(set(tuple(map(int, input().split())) for _ in range(m)))\n\nans = 0\nfor sc in s_c:\n if (sc[0] == 1 and sc[1] == 0) or sc[0] > n:\n print('-1')\n exit()\n \n for s in s_c:\n if s[0] == sc[0] and s[1] != sc[1]:\n print('-1')\n exit()\n \n ans += pow(10, (n - sc[0])) * sc[1]\n\nif ans < pow(10, n):\n ans += pow(10, n)\nprint(ans)", "n, m = map(int, input().split())\ns_c = tuple(set(tuple(map(int, input().split())) for _ in range(m)))\n\nans = 0\nfor sc in s_c:\n if sc[0] == 1 and sc[1] == 0 and n != 1:\n print('-1')\n exit()\n \n for s in s_c:\n if s[0] == sc[0] and s[1] != sc[1]:\n print('-1')\n exit()\n \n ans += pow(10, (n - sc[0])) * sc[1]\n\nif ans < pow(10, n - 1) and n != 1:\n ans += pow(10, n - 1)\nprint(ans)"] | ['Wrong Answer', 'Accepted'] | ['s198912023', 's675324088'] | [3064.0, 3064.0] | [18.0, 18.0] | [420, 434] |
p02761 | u472197237 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["def che(x):\n if x == -1:\n return 0\n return x\n\n\ndef main():\n N, M = map(int, input().split(' '))\n result = [-1 for _ in range(N)]\n flag = True\n for _ in range(M):\n a, b = map(int, input().split(' '))\n a = a - 1\n if result[a] != -1 or (a == 0 and b == 0):\n if result[a] != b:\n flag = False\n break\n result[a] = b\n result = [str(che(i)) for i in result]\n if flag and len(result) == 1:\n print(''.join(result))\n else:\n print(-1)\n\n\nif __name__ == '__main__':\n main()", "N, M = map(int, input().split(' '))\nnumber_list = [-1] * N\nflag = True\nfor _ in range(M):\n s, c = map(int, input().split(' '))\n if number_list[s - 1] in [-1, c]:\n number_list[s - 1] = c\n else:\n flag = False\nif number_list[0] == 0 and N > 1:\n flag = False\nif flag:\n if N > 1 and number_list[0] == -1:\n number_list[0] = 1\n number_list = [x if x != -1 else 0 for x in number_list]\n print(''.join(str(x) for x in number_list))\nelse:\n print(-1)"] | ['Wrong Answer', 'Accepted'] | ['s988284260', 's190417159'] | [3064.0, 3064.0] | [18.0, 17.0] | [579, 484] |
p02761 | u474423089 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["N,M=map(int,input().split(' '))\nl = [[] for i in range(N)]\nfor i in range(M):\n s,c=map(int,input().split(' '))\n s = s-1\n if N != 1 and s==0 and c==0:\n print(-1)\n exit()\n l[s].append(c)\nans = []\nfor n,i in enumerate(l):\n if len(set(i)) >=2:\n print(-1)\n exit()\n elif n==0 and i==[]:\n ans.append(1)\n elif N != 1 and n==0 and i[0]==0:\n print(-1)\n exit()\n elif i==[]:\n ans.append(0)\n else:\n ans.append(i[0])\nif N==1 and ans[0]==0:\n print(0)\n exit()\nfor i in ans:\n print(i,end='')", "N,M=map(int,input().split(' '))\nl = [[] for i in range(N)]\nfor i in range(M):\n s,c=map(int,input().split(' '))\n s = s-1\n if s==0 and c==0:\n print(-1)\n exit()\n l[s].append(c)\nans = []\nfor n,i in enumerate(l):\n if len(set(i)) >=2:\n print(-1)\n exit()\n elif n==0 and i==[]:\n ans.append(1)\n elif n==0 and i[0]==0:\n print(-1)\n exit()\n elif i==[]:\n ans.append(0)\n else:\n ans.append(i[0])\nif N==1 and ans[0]==0:\n print(0)\n exit()\nfor i in ans:\n print(i,end='')", "N,M=map(int,input().split(' '))\nq = [tuple(map(int,input().split(' '))) for i in range(M)]\nans = ''\nd =['' for i in range(N)]\nfor i in q:\n s,c=i[0]-1,i[1]\n if d[s]=='':\n d[s]=c\n elif d[s] != c:\n print(-1)\n exit()\nif d[0]==(''or 0):\n print(-1)\n exit()\nfor i in d:\n if i=='':\n print(0,end='')\n else:\n print(i,end='')", "N,M=map(int,input().split(' '))\nl = [[] for i in range(N)]\nfor i in range(M):\n s,c=map(int,input().split(' '))\n s = s-1\n l[s].append(c)\nans = []\nfor i in l:\n if len(set(i)) >=2:\n print(-1)\n exit()\n elif i==[]:\n ans.append(0)\n else:\n ans.append(i[0])\nif N==1 and ans[0]==0:\n print(0)\n exit()\nif ans[0]==0:\n print(-1)\n exit()\nfor i in ans:\n print(i,end='')", "N,M=map(int,input().split(' '))\nl = [[] for i in range(N)]\nans = ''\nfor i in range(M):\n s,c=map(int,input().split(' '))\n s = s-1\n l[s].append(c)\nfor n,i in enumerate(l):\n if len(set(i)) >=2:\n print(-1)\n exit()\n elif N != 1 and n==0 and i==[]:\n ans += '1'\n elif i==[]:\n ans +='0'\n else:\n ans += str(i[0])\nif len(str(int(ans))) == N:\n print(ans)\nelse:\n print(-1)"] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s121496496', 's333590535', 's752236987', 's786331754', 's078874856'] | [3064.0, 3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 19.0, 17.0, 17.0, 17.0] | [573, 551, 370, 415, 422] |
p02761 | u476124554 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['n,m = map(int,input().split())\ns = []\nc = []\nfor i in range(m):\n val1,val2 = map(int,input().split())\n s.append(val1)\n c.append(val2)\n\nfor i in range(1000):\n if len(str(i)) == n:\n flg = True\n for j in range(m):\n if int(str(i)[j-1]) != c[j]:\n flg = False\n if flg:\n print(i)\n break\nif not flg:\n print(-1)', 'n,m = map(int,input().split())\ns = []\nc = []\nfor i in range(m):\n val1,val2 = map(int,input().split())\n s.append(val1)\n c.append(val2)\n\ndigit = max(s)\n\nans = []\n\nfor i in range(10 ** digit + 1,10 ** (digit + 1)):\n num = str(i)\n flg = 0\n for j in range(m):\n if num[s[j]-1] == str(c[j]):\n flg = 1\n else:\n flg = 0\n break\n if flg == 1:\n ans.append(i)\n\nif ans:\n print(min(ans))\nelse:\n print(-1)', 'n,m = map(int,input().split())\ns = []\nc = []\nfor i in range(m):\n val1,val2 = map(int,input().split())\n s.append(val1)\n c.append(val2)\n \nif n == 1:\n start = 0\n end = 10\nelif n == 2:\n start = 10\n end = 100\nelse:\n start = 100\n end = 1000\n \nans = []\n \nfor i in range(start, end):\n num = str(i)\n flg = 1\n for j in range(m):\n if num[s[j] - 1] == str(c[j]) and len(num) == n:\n flg = 1\n else:\n flg = 0\n break\n if flg == 1:\n ans.append(i)\n \nif ans:\n print(min(ans))\nelse:\n print(-1)'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s230156633', 's858296872', 's043311600'] | [3064.0, 3064.0, 3064.0] | [18.0, 27.0, 18.0] | [390, 469, 572] |
p02761 | u477319617 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['n,m=map(int,input().split())\nsc=[list(map(int,input().split())) for i in range(m)]\nprint(sc)\nfor i in range(10**n):\n i2=str(i)\n print(i2)\n if len(i2)==n and all([i2[s-1]==str(c) for s,c in sc]):\n print(i2)\n exit()\nprint(-1)', 'n,m=map(int,input().split())\nsc=[list(map(int,input().split())) for i in range(m)]\n# print(sc)\nfor i in range(10**n):\n i2=str(i)\n# print(i2)\n if len(i2)==n and all([i2[s-1]==str(c) for s,c in sc]):\n print(i2)\n exit()\nprint(-1)'] | ['Wrong Answer', 'Accepted'] | ['s105617996', 's141560808'] | [3188.0, 3064.0] | [19.0, 18.0] | [236, 240] |
p02761 | u480138356 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['import sys\ninput = sys.stdin.readline\n\ndef main():\n N, M = map(int, input().split())\n ans = [-1] * N\n ok = True\n for i in range(M):\n s, c = map(int, input().split())\n if ans[s-1] != -1 or (N!=1 and c==0):\n ok = False\n ans[s-1] = c\n if ans[0] == -1:\n ans[0] = 1\n for i in range(1, N):\n if ans[i] == -1:\n ans[i] = 0\n \n if ok:\n print("".join(map(str, ans)))\n else:\n print(-1)\n\n\n\nif __name__ == "__main__":\n main()', 'import sys\ninput = sys.stdin.readline\n\ndef main():\n N, M = map(int, input().split())\n if N == 1 and M == 0:\n print(0)\n return\n ans = [-1] * N\n ok = True\n for i in range(M):\n s, c = map(int, input().split())\n if (ans[s-1] != -1 and ans[s-1] != c) or (N!=1 and s==1 and c==0):\n ok = False\n ans[s-1] = c\n if ans[0] == -1:\n ans[0] = 1\n for i in range(1, N):\n if ans[i] == -1:\n ans[i] = 0\n \n if ok:\n print("".join(map(str, ans)))\n else:\n print(-1)\n\n\n\nif __name__ == "__main__":\n main()\n'] | ['Wrong Answer', 'Accepted'] | ['s156208802', 's014646683'] | [3188.0, 3064.0] | [19.0, 17.0] | [511, 599] |
p02761 | u481250941 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['#\n# abc157 c\n#\nimport sys\nfrom io import StringIO\nimport unittest\n\n\nclass TestClass(unittest.TestCase):\n def assertIO(self, input, output):\n stdout, stdin = sys.stdout, sys.stdin\n sys.stdout, sys.stdin = StringIO(), StringIO(input)\n resolve()\n sys.stdout.seek(0)\n out = sys.stdout.read()[:-1]\n sys.stdout, sys.stdin = stdout, stdin\n self.assertEqual(out, output)\n\n def test_入力例_1(self):\n input = """3 3\n1 7\n3 2\n1 7"""\n output = """702"""\n self.assertIO(input, output)\n\n def test_入力例_2(self):\n input = """3 2\n2 1\n2 3"""\n output = """-1"""\n self.assertIO(input, output)\n\n def test_入力例_3(self):\n input = """3 1\n1 0"""\n output = """-1"""\n self.assertIO(input, output)\n\n\ndef resolve():\n N, M = map(int, input().split())\n SC = [list(map(int, input().split())) for _ in range(M)]\n SC = set(map(tuple, SC))\n SC = list(set(SC))\n SC.sort()\n\n ans = -1\n for i in range(10**N):\n si = str(i)\n for sc in SC:\n s, c = sc\n if si[s-1] != str(c):\n break\n else:\n ans = i\n break\n\n print(ans)\n\n\nif __name__ == "__main__":\n # unittest.main()\n resolve()\n', '#\n# abc157 c\n#\nimport sys\nfrom io import StringIO\nimport unittest\n\n\nclass TestClass(unittest.TestCase):\n def assertIO(self, input, output):\n stdout, stdin = sys.stdout, sys.stdin\n sys.stdout, sys.stdin = StringIO(), StringIO(input)\n resolve()\n sys.stdout.seek(0)\n out = sys.stdout.read()[:-1]\n sys.stdout, sys.stdin = stdout, stdin\n self.assertEqual(out, output)\n\n def test_入力例_1(self):\n input = """3 3\n1 7\n3 2\n1 7"""\n output = """702"""\n self.assertIO(input, output)\n\n def test_入力例_2(self):\n input = """3 2\n2 1\n2 3"""\n output = """-1"""\n self.assertIO(input, output)\n\n def test_入力例_3(self):\n input = """3 1\n1 0"""\n output = """-1"""\n self.assertIO(input, output)\n\n\ndef resolve():\n N, M = map(int, input().split())\n SC = [list(map(int, input().split())) for _ in range(M)]\n SC = set(map(tuple, SC))\n SC = list(set(SC))\n SC.sort()\n\n ans = -1\n for i in range(10**N):\n si = str(i)\n if len(si) != N:\n continue\n for sc in SC:\n s, c = sc\n if si[s-1] != str(c):\n break\n else:\n ans = i\n break\n\n print(ans)\n\n\nif __name__ == "__main__":\n unittest.main()\n \n', '#\n# abc157 c\n#\nimport sys\nfrom io import StringIO\nimport unittest\n\n\nclass TestClass(unittest.TestCase):\n def assertIO(self, input, output):\n stdout, stdin = sys.stdout, sys.stdin\n sys.stdout, sys.stdin = StringIO(), StringIO(input)\n resolve()\n sys.stdout.seek(0)\n out = sys.stdout.read()[:-1]\n sys.stdout, sys.stdin = stdout, stdin\n self.assertEqual(out, output)\n\n def test_入力例_1(self):\n input = """3 3\n1 7\n3 2\n1 7"""\n output = """702"""\n self.assertIO(input, output)\n\n def test_入力例_2(self):\n input = """3 2\n2 1\n2 3"""\n output = """-1"""\n self.assertIO(input, output)\n\n def test_入力例_3(self):\n input = """3 1\n1 0"""\n output = """-1"""\n self.assertIO(input, output)\n\n\ndef resolve():\n N, M = map(int, input().split())\n SC = [list(map(int, input().split())) for _ in range(M)]\n SC = set(map(tuple, SC))\n SC = list(set(SC))\n SC.sort()\n\n ans = -1\n for i in range(10**N):\n si = str(i)\n if len(si) != N:\n continue\n for sc in SC:\n s, c = sc\n if si[s-1] != str(c):\n break\n else:\n ans = i\n break\n\n print(ans)\n\n\nif __name__ == "__main__":\n # unittest.main()\n resolve()\n'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s489956435', 's598262061', 's012964357'] | [16240.0, 16712.0, 16148.0] | [77.0, 79.0, 73.0] | [1281, 1327, 1327] |
p02761 | u482157295 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['n,m = map(int,input().split())\ndigit = [0]*m\nnum = [0]*m\nfor i in range(m):\n digit[i], num[i] = map(int, input().split())\nfor i in range(1000):\n dum = str(i)\n flag = "ok"\n for j in range(m):\n #print(j)\n if len(dum) == (n+1-digit[j]):\n if dum[digit[j]-1] != str(num[j]):\n flag = "ng"\n break\n else:\n flag = "ng"\n break\n if flag == "ok":\n print(dum)\n break\nelse:\n print(-1)', 'kensa = 0\nkekka = ""\nnum = []\nhantei = "OK"\nINF = input().split()\ngyosu = int(INF[1])\nketa = int(INF[0])\nout = []\nfor l in range(keta):\n out.append(0)\n\n\nfor i in range(gyosu):\n num.append([int(j) for j in input().split()])\n\nif gyosu >0:\n for j in range(gyosu-1):\n for k in range(gyosu-1):\n if num[j][0] == num[k + 1][0]:\n if num[j][1] != num[k + 1][1]:\n hantei = "NG"\n \n if num[j][0] == keta:\n if num[j][1] == 0:\n hantei ="NG"\n\nif hantei == "NG":\n print("-1")\nelse:\n for m in range(gyosu):\n out[(num[m][0] - 1)] = num[m][1]\n #print(out)\n for n in range(keta):\n kekka = kekka + str(out[n])\n\n for p in kekka:\n if p == "0":\n kensa = kensa + 1\n else:\n break\n for q in kensa:\n kekka.rstrip("0")\n\n# if n == 0 and keta != 1 and gyosu != 0:\n #print("-1")\n \n\nif hantei == "OK":\n if gyosu == 0:\n print(0)\n else:\n print(kekka)', 'kekka = ""\nnum = []\nhantei = "OK"\nINF = input().split()\ngyosu = int(INF[1])\nketa = int(INF[0])\nout = []\nfor l in range(keta):\n out.append(0)\n\n\nfor i in range(gyosu):\n num.append([int(j) for j in input().split()])\n\nfor j in range(gyosu - 1):\n for k in range(gyosu - 1):\n if num[j][0] == num[k + 1][0]:\n if num[j][1] != num[k + 1][1]:\n hantei = "NG"\n \n if num[j][0] == keta:\n if num[j][1] == 0:\n hantei ="NG"\n\nif hantei == "NG":\n print("-2")\nelse:\n for m in range(gyosu):\n out[(num[m][0] - 1)] = num[m][1]\n #print(out)\n for n in range(keta):\n kekka = kekka + str(out[n])\n if n == 0 and keta != 1 :\n print("-2")\n hantei = "NG"\n \n \nif hantei == "OK":\n print(kekka)\n\n\n\n\n', 'kekka = ""\nnum = []\nhantei = "OK"\nINF = input().split()\ngyosu = int(INF[1])\nketa = int(INF[0])\nout = []\nfor l in range(keta):\n out.append(0)\n\n\nfor i in range(gyosu):\n num.append([int(j) for j in input().split()])\n\nfor j in range(0,gyosu):\n for k in range(0,gyosu):\n if num[j][0] == num[k + 1][0]:\n if num[j][1] != num[k + 1][1]:\n hantei = "NG"\n \n if num[j][0] == keta:\n if num[j][1] == 0:\n hantei ="NG"\n\nif hantei == "NG":\n print("-1")\nelse:\n for m in range(gyosu):\n out[(num[m][0] - 1)] = num[m][1]\n #print(out)\n for n in range(keta):\n kekka = kekka + str(out[n])\n if n == 0 and keta != 1 and gyosu != 0:\n print("-1")\n hantei = "NG"\n\nif hantei == "OK":\n if gyosu == 0:\n print(0)\n else:\n print(kekka)', 'kekka = ""\nnum = []\nhantei = "OK"\nINF = input().split()\ngyosu = int(INF[1])\nketa = int(INF[0])\nout = []\nfor l in range(keta):\n out.append(0)\n\n\nfor i in range(gyosu):\n num.append([int(j) for j in input().split()])\n\nif gyosu >0:\n for j in range(gyosu-1):\n for k in range(gyosu-1):\n if num[j][0] == num[k + 1][0]:\n if num[j][1] != num[k + 1][1]:\n hantei = "NG"\n \n if num[j][0] == keta:\n if num[j][1] == 0:\n hantei ="NG"\n\nif hantei == "NG":\n print("-1")\nelse:\n for m in range(gyosu):\n out[(num[m][0] - 1)] = num[m][1]\n #print(out)\n for n in range(keta):\n kekka = kekka + str(out[n])\n if n == 0 and keta != 1 and gyosu != 0:\n print("-1")\n hantei = "NG"\n\nif hantei == "OK":\n if gyosu == 0:\n print(0)\n else:\n print(kekka)', 'kekka = ""\nnum = []\nhantei = "OK"\nINF = input().split()\ngyosu = int(INF[1])\nketa = int(INF[0])\nout = []\nfor l in range(keta):\n out.append(0)\n\n\nfor i in range(gyosu):\n num.append([int(j) for j in input().split()])\n\nfor j in range(gyosu - 1):\n for k in range(gyosu - 1):\n if num[j][0] == num[k + 1][0]:\n if num[j][1] != num[k + 1][1]:\n hantei = "NG"\n \n if num[j][0] == keta:\n if num[j][1] == 0:\n hantei ="NG"\n\nif hantei == "NG":\n print("-1")\nelse:\n for m in range(gyosu):\n out[(num[m][0] - 1)] = num[m][1]\n #print(out)\n for n in range(keta):\n kekka = kekka + str(out[n])\n if n == 0 and keta != 1 :\n print("-1")\n hantei = "NG"\n \n \nif hantei == "OK":\n print(kekka)\n\n\n\n\n', 'n,m = map(int,input().split())\ndigit = [0]*m\nnum = [0]*m\nfor i in range(m):\n digit[i], num[i] = map(int, input().split())\nfor i in range(1000):\n dum = str(i)\n flag = "ok"\n for j in range(m):\n print(j)\n if len(dum) == (n+1-digit[j]):\n if dum[digit[j]-1] != str(num[j]):\n flag = "ng"\n break\n else:\n flag = "ng"\n break\n if flag == "ok":\n print(dum)\n break\nelse:\n print(-1)', 'n,m = map(int,input().split())\ns = [0]*m\nc = [0]*m\nfor i in range(m):\n s[i], c[i] = map(int, input().split())\n\nif n == 1:\n start = 0\nelif n == 2:\n start = 10\nelse:\n start = 100\nfor i in range(start,10**n):\n num = str(i)\n for j in range(m):\n if num[s[j]-1] != str(c[j]):\n break\n else:\n break\nelse:\n print(-1)\n exit()\nprint(num)'] | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s076547710', 's249651815', 's632026617', 's666460753', 's668469460', 's691055670', 's887088339', 's021793362'] | [3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3188.0, 9028.0] | [18.0, 18.0, 17.0, 17.0, 17.0, 17.0, 19.0, 27.0] | [486, 943, 729, 769, 798, 729, 485, 378] |
p02761 | u487594898 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['import sys\nN,M = map(int,input().split())\nP = []\nfor i in range (N):\n P.append(-1)\n\nA=[] \nwhile True:\n try:\n A.append(list(map(int,input().split())))\n\n except:\n break;\nprint(A,P)\n\nfor s in range(M):\n if P[A[s][0]-1]== -1 or P[A[s][0]-1] ==A[s][1]:\n P[A[s][0]-1] = A[s][1]\n else:\n print(-1)\n sys.exit()\nif P[0] == -1:\n P[0]= 1\nelif P[0] == 0:\n print(-1)\n sys.exit()\n\nfor j in range(N):\n if P[j] == -1:\n P[j] = 0 \nprint("".join(map(str,P)))\n \n\n', 'import sys\nN,M = map(int,input().split())\nP = []\nfor i in range (N):\n P.append(-1)\n\nA=[] \nwhile True:\n try:\n A.append(list(map(int,input().split())))\n\n except:\n break;\n\n\n\nfor s in range(M):\n if P[A[s][0]-1]== -1 or P[A[s][0]-1] ==A[s][1]:\n P[A[s][0]-1] = A[s][1]\n else:\n print(-1)\n sys.exit()\nif P[0] == -1 and N != 1:\n P[0] = 1\nelif P[0] == -1 and N == 1:\n P[0] = 0\nelif P[0] == 0 and N != 1:\n print(-1)\n sys.exit()\nelif P[0] == 0 and N == 1:\n print(0)\n sys.exit()\nfor j in range(1,N):\n if P[j] == -1:\n P[j] = 0 \nprint("".join(map(str,P)))\n \n\n\n'] | ['Wrong Answer', 'Accepted'] | ['s255527288', 's390881357'] | [3064.0, 3064.0] | [17.0, 18.0] | [548, 660] |
p02761 | u488884575 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["n,m = map(int, input().split())\nans = [None] *n\nf= 0\nfor i in range(m):\n s,c = map(int, input().split())\n if (ans[s-1] != None) or (ans[s-1] != c):\n f = 1\n ans[s-1] = c\nif f == 1:\n print('-1')\n exit()\nelif ans[0] == None:\n ans[0] == 1\nelif ans[0] == 0:\n print('-1')\n exit()\n\nfor i in range(n):\n if ans[i] == None:\n ans[i] = 0\nprint(''.join(map(str, ans)))\n\n", "n,m = map(int, input().split())\nans = [None] *n\nf= 0\nfor i in range(m):\n s,c = map(int, input().split())\n if (ans[s-1] != None) and (ans[s-1] != c): \n f = 1\n ans[s-1] = c\n\nif f == 1:\n print('-1')\n exit()\nelif ans[0] == None:\n ans[0] == 1\nelif ans[0] == 0 or len(ans) != 1:\n print('-1')\n exit()\n\nfor i in range(n):\n if ans[i] == None:\n ans[i] = 0\nprint(''.join(map(str, ans)))\n\n", "n,m = map(int, input().split())\nans = [-1] *n\nf= 0\nfor i in range(m):\n s,c = map(int, input().split())\n \n if (ans[s-1] == -1) or (ans[s-1] == c):\n ans[s-1] = c\n else:\n print('-1')\n exit()\n'''\n f = 1\nif f == 1:\n print('-1')\n exit()'''\n\nif ans[0] == 0 and len(ans) != 1: \n print('-1')\n exit()\n\nif ans[0] == -1:\n if len(ans) != 1: \n ans[0] = 1\n else:\n print(0)\n exit()\n\nfor i in range(n):\n if ans[i] == -1:\n ans[i] = 0\nprint(''.join(map(str, ans)))\n\n"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s030611413', 's638389567', 's823973771'] | [3064.0, 3064.0, 3064.0] | [17.0, 17.0, 18.0] | [398, 427, 638] |
p02761 | u489155878 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['#C\n\nN,M=map(int,input().split())\nT=[list(map(int,input().split())) for i in range(M)]\n\nA=[0 for i in range(N+1)]\nB=[0 for i in range(N+1)]済みフラグ\n\nt=0\nfor i in T:\n if B[i[0]]==1:済み\n if A[i[0]]!=i[1]:\n print(-1)\n t=1\n break\n \n else:\n A[i[0]]=i[1]\n B[i[0]]=1済み\n\nif A[1]==0 and B[1]==1:\n print(-1)\n t=1\nif t==0:\n x=0\n for j in range(1,N+1):\n if B[j]==1:\n x+=A[j]*(10**(N-j))\n else:\n if j==1:\n x+=10**(N-j)\n print(x)\n', '#C\n\nN,M=map(int,input().split())\nX=[list(map(int,input().split())) for i in range(M)]\n\n\ndef pront(X):\n \n \n if debug==0:\n print(X)\n\n\ndebug=0\n\nt=0\nY=[-1 for i in range(N)]\n\nfor i in X:\n if Y[i[0]-1]==-1:\n Y[i[0]-1]=i[1]\n elif Y[i[0]-1]!=i[1]:\n t=1\n break\n\npront(Y)\nif t==1:\n pront("a")\n print("-1")\nelif N==1:\n if Y[0]==-1:\n pront("b1")\n print("0")\n else:\n pront("b2")\n print(Y[0])\nelif Y[0]==0:\n pront("c")\n print("-1")\nelse:\n pront("d")\n sa=""\n for i in Y:\n if i==-1:\n sa=sa+"0"\n else:\n sa=sa+str(i)\n print(sa)\n', '#C\n\nN,M=map(int,input().split())\nX=[list(map(int,input().split())) for i in range(M)]\n\n\ndef pront(X):\n \n \n if debug==1:\n print(X)\n\n\ndebug=0\n\nt=0\nY=[-1 for i in range(N)]\n\nfor i in X:\n if Y[i[0]-1]==-1:\n Y[i[0]-1]=i[1]\n elif Y[i[0]-1]!=i[1]:\n t=1\n break\n\npront(Y)\nif t==1:\n pront("a")\n print("-1")\nelif N==1:\n if Y[0]==-1:\n pront("b1")\n print("0")\n else:\n pront("b2")\n print(Y[0])\nelif M==0:\n pront("e")\n print(10**(N-1))\nelif Y[0]==0:\n pront("c")\n print("-1")\nelse:\n pront("d")\n for i in range(N):\n if i==0:\n if Y[0]==-1:\n sa="1"\n else:\n sa=str(Y[0])\n elif Y[i]==-1:\n sa=sa+"0"\n else:\n sa=sa+str(Y[i])\n print(sa)\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s369250054', 's371203592', 's310201707'] | [3064.0, 3064.0, 3064.0] | [17.0, 18.0, 18.0] | [620, 819, 983] |
p02761 | u489315616 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['print(-1)', "n, m = map(int, input().split())\nx = [0] * m\ny = [0] * m\nr = [0] * n\nt = [0] * n\nfor i in range(m):\n x[i], y[i] = map(int, input().split())\n if t[x[i] - 1] == 0 and r[x[i] - 1] == y[i]:\n r[x[i] - 1] = y[i]\n t[x[i] - 1] = 1\n else:\n print(-1)\n exit()\nif n > 1 and r[0] == 0:\n print(-1)\nelse:\n print(*r, sep='')\n", "n, m = map(int, input().split())\nx = [0] * m\ny = [0] * m\nr = [0] * n\nt = [0] * n\nfor i in range(m):\n x[i], y[i] = map(int, input().split())\n if t[x[i] - 1] == 0:\n r[x[i] - 1] = y[i]\n t[x[i] - 1] = 1\n else:\n if r[x[i] - 1] != y[i]:\n print(-1)\n exit()\nif n>1 and r[0] == 0 and t[0] == 0:\n r[0] = 1\nelif n > 1 and r[0] == 0 and t[0] != 0:\n print(-1)\n exit()\nprint(*r, sep='')\n"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s090896416', 's425762029', 's183584395'] | [2940.0, 3064.0, 3064.0] | [17.0, 17.0, 25.0] | [9, 352, 434] |
p02761 | u489959379 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['n, m = map(int, input().split())\nsc = [list(map(int, input().split())) for _ in range(m)]\n\nif m == 0:\n if n == 1:\n print(0)\n else:\n print(10 ** (n - 1))\n exit()\n\nans = -1\nfor i in range(10 ** n):\n i = str(i)\n for s, c in sc:\n if int(i[s - 1]) != c:\n break\n else:\n ans = i\n break\n\nprint(ans)\n', 'import sys\n\nsys.setrecursionlimit(10 ** 7)\nf_inf = float(\'inf\')\nmod = 10 ** 9 + 7\n\n\ndef resolve():\n n, m = map(int, input().split())\n query = [list(map(int, input().split())) for _ in range(m)]\n\n def is_ok(L):\n for s, c in query:\n if L[s - 1] != c:\n break\n else:\n print("".join(map(str, L)))\n exit()\n return\n\n def dfs(X):\n if len(X) == n:\n x = int("".join(map(str, X)))\n if len(str(x)) == n:\n is_ok(X)\n return\n\n for i in range(10):\n X.append(i)\n dfs(X)\n X.pop()\n\n dfs([])\n print(-1)\n\n\nif __name__ == \'__main__\':\n resolve()\n'] | ['Runtime Error', 'Accepted'] | ['s415245035', 's779574237'] | [3064.0, 3064.0] | [19.0, 20.0] | [355, 708] |
p02761 | u490553751 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["N,M = [int(i) for i in input().split()]\ns = [0] * M\nc = [0] * M\nfor i in range(M):\n s[i],c[i] = [int(j) for j in input().split()]\nfind = [False] * N\nans = ['0'] * N\nfor i in range(M):\n sa = s[i] -1\n ca = c[i]\n if find[sa] == False:\n find[sa] = True\n ans[sa] = str(ca)\n continue\n if find[sa]:\n if ans[sa] != str(ca):\n print('-1')\n exit()\nif N != 1:\n if ans[0] == '0':\n print('-1')\n exit()\nelse:\n print(''.join(ans))", 'N,M = [int(i) for i in input().split()]\ns = [0] * M\nc = [0] * M\nfor i in range(M):\n s[i],c[i] = [int(j) for j in input().split()]\nfind = [False] * N\nif N == 1:\n for i in range(10):\n i = str(i)\n count = 0\n for j in range(M):\n if i[s[j]-1] != str(c[j]):\n continue\n count +=1\n if count == M:\n print(i)\n exit()\n print(-1)\n exit()\nif N == 2:\n for i in range(10,100):\n count = 0\n for j in range(M):\n i = str(i)\n if i[s[j]-1] != str(c[j]):\n continue\n count +=1\n if count == M:\n print(i)\n exit()\n print(-1)\n exit()\nif N == 3:\n for i in range(100,1000):\n count = 0\n i = str(i)\n for j in range(M):\n if i[s[j]-1] == str(c[j]):\n count+=1\n if count == M:\n print(i)\n exit()\n print(-1)\n exit()'] | ['Wrong Answer', 'Accepted'] | ['s536900641', 's476987187'] | [3192.0, 3064.0] | [17.0, 19.0] | [499, 962] |
p02761 | u493318999 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["n,m = map(int,input().split())\nsc = []\nfor i in range(m):\n sc.append(list(map(int,input().split())))\nsc.sort()\nprint(sc)\nfor i in range(m-1):\n if sc[i][0] == sc[i+1][0]:\n if sc[i][1] != sc[i+1][1]:\n print('-1')\n exit()\n if sc[i][0] == 1 and sc[i][1] == 0:\n print('-1')\n exit()\n \nans = [1]\nfor i in range(n-1):\n ans.append(0)\n\nfor i in range(m):\n ans[sc[i][0]-1] = sc[i][1]\n\nans = map(str,ans)\nprint(''.join(ans))", "n,m = map(int,input().split())\nsc = []\nfor i in range(m):\n sc.append(list(map(int,input().split())))\nsc.sort()\nfor i in range(m):\n if n != 1 and sc[i][0] == 1 and sc[i][1] == 0:\n print('-1')\n exit()\nfor i in range(m-1):\n if sc[i][0] == sc[i+1][0]:\n if sc[i][1] != sc[i+1][1]:\n print('-1')\n exit()\n \nans = [1]\nfor i in range(n-1):\n ans.append(0)\n \nfor i in range(m):\n ans[sc[i][0]-1] = sc[i][1]\n\nif m == 0 and n == 1:\n print(0)\n exit()\nans = map(str,ans)\nprint(''.join(ans))"] | ['Wrong Answer', 'Accepted'] | ['s196945476', 's022916337'] | [3064.0, 3064.0] | [17.0, 17.0] | [477, 539] |
p02761 | u494058663 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["import copy\ndef main():\n n,m = map(int,input().split())\n ans = [10 for i in range(n+1)]\n num = 0\n if m==0:\n if n==1:\n print(0)\n else:\n print(10**(n-1))\n exit()\n for i in range(m):\n s,c = map(int,input().split())\n if ans[s-1] != 10:\n print('-1')\n exit()\n ans[s-1] = min(ans[s-1],c)\n \n for i in range(n):\n if ans[i]==10:\n ans[i] = 0\n num += ans[i]*(10**(n-i-1))\n #print(num)\n cnt = 1\n copy_ans = copy.deepcopy(num)\n while copy_ans >= 10:\n copy_ans /= 10\n cnt += 1\n if cnt==n:\n print(num)\n else:\n print('-1')\n\nmain()", "import copy\ndef main():\n n,m = map(int,input().split())\n sc = []\n for i in range(m):\n s,c = map(int,input().split())\n sc.append([s,str(c)])\n if n==1:\n for i in range(10):\n flag = True\n tmp = str(i)\n tmp = list(tmp)\n tmp = ['0' for j in range(n-len(tmp))] + tmp\n for j in range(m):\n if tmp[sc[j][0]-1] !=sc[j][1]:\n flag = False\n if flag:\n print(i)\n exit()\n \n else: \n for i in range(10**(n-1),10**n):\n flag = True\n tmp = str(i)\n tmp = list(tmp)\n tmp = ['0' for j in range(n-len(tmp))] + tmp\n \n for j in range(m):\n if tmp[sc[j][0]-1] !=sc[j][1]:\n flag = False\n if flag:\n print(i)\n exit()\n print('-1')\nmain()"] | ['Wrong Answer', 'Accepted'] | ['s208112810', 's505147161'] | [9180.0, 9328.0] | [32.0, 34.0] | [691, 939] |
p02761 | u497952650 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['N,M = map(int,input().split())\nsc = []\nfor i in range(M):\n s,c = map(int,input().split())\n sc.append([s-1,c])\n\nA = [0]*3\nfor i in range(M):\n if A[sc[i][0]] == 0:\n A[sc[i][0]] = sc[i][1]\n else:\n if A[sc[i][0]] != sc[i][1]:\n print("-1")\n exit()\n\ncount = 0\nfor i in range(3):\n if A[i] == 0:\n count += 1\nif count==3:\n print(-1)\n exit()\n\nflag = False\nfor i in range(3):\n if A[i]!=0:\n print(A[i],end="")\n flag = True\n elif flag:\n print(A[i],end="")', 'N,M = map(int,input().split())\n\nsc = []\nfor i in range(M):\n s,c = map(int,input().split())\n c = str(c)\n sc.append([s-1,c])\n\nfor i in range(10**N+1):\n tmp = str(i)\n flag = False\n count = 0\n if len(tmp) == N:\n for s,c in sc:\n if tmp[s] == c:\n count += 1\n if count == M:\n flag = True\n if flag:\n print(tmp)\n exit()\nprint(-1)'] | ['Wrong Answer', 'Accepted'] | ['s696084688', 's382720604'] | [3064.0, 3064.0] | [17.0, 18.0] | [619, 409] |
p02761 | u501451051 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['n,m = map(int, input().split())\nlis = []\nfor i in range(m):\n lis.append(list(map(int, input().split())))\n \ns =[0]*n\nfor j in lis:\n s[j[0]-1] = j[1]\n \n\n\ns1 = ""\nfor k in s:\n s1 += str(k)\n\ns1 = int(s1)\ns1 = str(s1)\n\nspe = 0\nif len(s1) != n:\n spe = 1\n \n\n\nflag = 0\nfor i in range(1,10**n):\n if i == s1:\n flag = 1\n break\n\nif flag == 0 or spe == 1:\n print("-1")\nelse:\n print(s1)\n \n\n', 'N,M=map(int,input().split())\ns,c=[0]*M,[0]*M\nfor i in range(M):\n s[i],c[i] = map(int,input().split())\nfor i in range(10**N):\n if len(str(i)) != N:\n pass\n else:\n num=list(str(i))\n ok = True\n for j in range(M):\n if num[s[j]-1] != str(c[j]):\n ok = False\n if ok:\n print(i)\n exit()\nprint(-1)'] | ['Wrong Answer', 'Accepted'] | ['s012531691', 's311847099'] | [3064.0, 3064.0] | [19.0, 19.0] | [423, 378] |
p02761 | u502508885 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['n, m = list(map(int, input().split()))\n\ns = [0]*m\nc = [0]*m\n\nfor k in range(m):\n s[k], c[k] = list(map(int, input().split()))\n\nfor l in range(m):\n if n == 1:\n if s[l] != 1:\n print(-1)\n exit()\n elif n == 2:\n if s[l] == 3 or (s[l] == 1 and c[l] == 0):\n print(-1)\n exit()\n elif n == 3:\n if s[l] == 1 and c[l] == 0:\n print(-1)\n exit()\n\nif n == 1:\n kaishi = 0\n owari = 10\nelif n == 2:\n kaishi = 10\n owari = 100\nelif n == 3:\n kaishi = 100\n owari = 1000\n\nfor num in range (kaishi, owari):\n seigo = 1\n for i in range(m):\n if s[i] == 3:\n if num%10 == c[i]:\n continue\n else:\n seigo = 0\n if s[i] == 2:\n if (num//100) == 0 and (num%100)//10 == 0:\n seigo = 0 \n elif (num%100)//10 == c[i]:\n continue\n else:\n seigo = 0\n if s[i] == 1:\n elif (num%10) == c[i]:\n continue\n else:\n seigo = 0\n\n if seigo == 1:\n print(num)\n exit()\n \nprint(-1)\n\n\n\n', 'n, m = list(map(int, input().split()))\n\ns = [0]*(m+1)\nc = [0]*(m+1)\n\nfor k in range(m):\n s[k], c[k] = list(map(int, input().split()))\n\nfor l in range(m):\n if n == 1:\n if s[l] != 1:\n print(-1)\n exit()\n elif n == 2:\n if s[l] == 3 or (s[l] == 1 and c[l] == 0):\n print(-1)\n exit()\n elif n == 3:\n if s[l] == 1 and c[l] == 0:\n print(-1)\n exit()\n\nif n == 1:\n for num in range(0, 10):\n seigo = 1\n for i in range(m):\n if num != c[i]:\n seigo = 0\n if seigo == 1:\n print(num)\n exit()\n print(-1)\n exit()\nelif n == 2:\n for num in range(10, 100):\n seigo = 1\n for i in range(m):\n if s[i] == 1:\n if num//10 != c[i]:\n seigo = 0\n if s[i] == 2:\n if num%10 != c[i]:\n seigo = 0\n if seigo == 1:\n print(num)\n exit()\n print(-1)\n exit()\nelse:\n for num in range(100, 1000):\n seigo = 1\n for i in range(m):\n if s[i] == 1:\n if num//100 != c[i]:\n seigo = 0\n elif s[i] == 2:\n if (num-100*(num//100))//10 != c[i]:\n seigo = 0\n elif s[i] == 3:\n if num%10 != c[i]:\n seigo = 0\n if seigo == 1:\n print(num)\n exit()\n print(-1)\n exit()\n'] | ['Runtime Error', 'Accepted'] | ['s952260313', 's566305511'] | [3064.0, 3188.0] | [17.0, 21.0] | [1173, 1501] |
p02761 | u506858457 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["N,M=map(int,input().split())\nd={}\nfor i in range(M):\n s,t=map(int,input().split())\n if s in d:\n if d[s]!=t:\n print('-1')\n exit()\n if s==1:\n if t==0:\n print('-1')\n exit()\n d[s]=t\nif 1 not in d:\n d[1]=1\nfor i in range(2,N):\n if i not in d:\n d[i]=0\nL=[]\nfor i in d.values():\n L.append(str(i))\nprint(''.join(L))", "N,M=map(int,input().split())\nd={}\nfor i in range(M):\n s,t=map(int,input().split())\n if s in d:\n if d[s]!=t:\n print('-1')\n exit()\n if s==1:\n if t==0:\n print('-1')\n exit()\n d[s]=t\nfor i in range(1,N):\n if i not in d:\n d[i]=0\n#print(d)\nL=[]\nfor i in d.values():\n L.append(str(i))\nprint(''.join(L))", "N,M=map(int,input().split())\nd={}\nfor i in range(M):\n s,t=map(int,input().split())\n if s in d:\n if d[s]!=t:\n print('-1')\n exit()\n if s==1:\n if t==0:\n if N==1:\n print('0')\n exit() \n else:\n print('-1')\n exit() \n d[s]=t\nif N==1:\n if s==1:\n if t==0:\n print('0')\n exit()\nif 1 not in d:\n d[1]=1\nfor i in range(2,N):\n if i not in d:\n d[i]=0\nL=[]\nfor i in d.values():\n L.append(str(i))\nprint(''.join(L))", "N,M=map(int,input().split())\nd={}\nfor i in range(M):\n s,t=map(int,input().split())\n if s in d:\n if d[s]!=t:\n print('-1')\n exit()\n if s==1:\n if t==0:\n print('-1')\n exit()\n \n d[s]=t\nif N==1:\n if s==1:\n if t==0:\n print('0')\n exit()\nif 1 not in d:\n d[1]=1\nfor i in range(2,N):\n if i not in d:\n d[i]=0\nL=[]\nfor i in d.values():\n L.append(str(i))\nprint(''.join(L))", 'def II(): return int(input())\ndef MI(): return map(int, input().split())\ndef LI(): return list(map(int, input().split()))\n\nN,M=MI()\nSC=[tuple(map(int,input().split())) for _ in range(M)]\ndef check(n):\n n=str(n)\n if len(n)!=N:\n return False\n for i in range(M):\n if n[SC[i][0]-1]!=str(SC[i][1]):\n return False\n return True\n\nfor i in range(1000):\n if check(i):\n print(i)\n exit()\nelse:\n print(-1)'] | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s054527948', 's394273174', 's397809647', 's624929218', 's684509325'] | [3064.0, 3064.0, 3064.0, 3064.0, 9200.0] | [17.0, 18.0, 17.0, 18.0, 28.0] | [343, 329, 486, 417, 416] |
p02761 | u508164527 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['N, M = (int(x) for x in input().split())\ns = [0]*M\nc = [0]*M\nfor i in range(M):\n s[i], c[i] = [int(p) for p in input().split()]\n\nn = [0]*N\n\nfor j in range(len(s)):\n if N > 1 and s[j] == 1 and c[j] == 0:\n print(-1)\n exit()\nfor p in range(len(s)):\n for q in range(len(s)):\n if p == q:\n pass\n else:\n if s[p] == s[q] and c[p] != c[q]:\n print(-1)\n exit()\t\t\nfor k in range(M):\n l = s[k]\n n[l-1] = c[k]\nif N > 1 and n[0] == 0:\n n[0] = 1\nprint(n)\nresstr = [str(x) for x in n]\nres = "".join(resstr)\nresult = int(res) \nprint(result)', 'N, M = (int(x) for x in input().split())\ns = [0]*M\nc = [0]*M\nfor i in range(M):\n s[i], c[i] = [int(p) for p in input().split()]\n\nn = [0]*N\n\nfor j in range(len(s)):\n if N > 1 and s[j] == 1 and c[j] == 0:\n print(-1)\n exit()\nfor p in range(len(s)):\n for q in range(len(s)):\n if p == q:\n pass\n else:\n if s[p] == s[q] and c[p] != c[q]:\n print(-1)\n exit()\t\t\nfor k in range(M):\n l = s[k]\n n[l-1] = c[k]\nif n[0] == 0:\n n[0] = 1\nprint(n)\nresstr = [str(x) for x in n]\nres = "".join(resstr)\nresult = int(res) \nprint(result)', 'N, M = (int(x) for x in input().split())\ns = [0]*M\nc = [0]*M\nfor i in range(M):\n s[i], c[i] = [int(p) for p in input().split()]\n\nn = [0]*N\n\nfor j in range(len(s)):\n if N > 1 and s[j] == 1 and c[j] == 0:\n print(-1)\n exit()\nfor p in range(len(s)):\n for q in range(len(s)):\n if p == q:\n pass\n else:\n if s[p] == s[q] and c[p] != c[q]:\n print(-1)\n exit()\t\t\nfor k in range(M):\n l = s[k]\n n[l-1] = c[k]\nif N > 1 and n[0] == 0:\n n[0] = 1\nresstr = [str(x) for x in n]\nres = "".join(resstr)\nresult = int(res) \nprint(result)'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s698970006', 's746096231', 's922980809'] | [3064.0, 3192.0, 3192.0] | [17.0, 18.0, 18.0] | [566, 556, 557] |
p02761 | u509739538 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['import math\nimport queue\nfrom collections import defaultdict\n \ndef readInt():\n\treturn int(input())\ndef readInts():\n\treturn list(map(int, input().split()))\ndef readChar():\n\treturn input()\ndef readChars():\n\treturn input().split()\ndef factorization(n):\n\tres = []\n\tif n%2==0:\n\t\tres.append(2)\n\tfor i in range(3,math.floor(n//2)+1,2):\n\t\tif n%i==0:\n\t\t\tc = 0\n\t\t\tfor j in res:\n\t\t\t\tif i%j==0:\n\t\t\t\t\tc=1\n\t\t\tif c==0:\n\t\t\t\tres.append(i)\n\treturn res\ndef fact2(n):\n\tp = factorization(n)\n\tres = []\n\tfor i in p:\n\t\tc=0\n\t\tz=n\n\t\twhile 1:\n\t\t\tif z%i==0:\n\t\t\t\tc+=1\n\t\t\t\tz/=i\n\t\t\telse:\n\t\t\t\tbreak\n\t\tres.append([i,c])\n\treturn res\ndef fact(n):\n\tans = 1\n\tm=n\n\tfor _i in range(n-1):\n\t\tans*=m\n\t\tm-=1\n\treturn ans\ndef comb(n,r):\n\tif n<r:\n\t\treturn 0\n\tl = min(r,n-r)\n\tm=n\n\tu=1\n\tfor _i in range(l):\n\t\tu*=m\n\t\tm-=1\n\treturn u//fact(l)\ndef printQueue(q):\n\tr=q\n\tans=[0]*r.qsize()\n\tfor i in range(r.qsize()-1,-1,-1):\n\t\tans[i] = r.get()\n\tprint(ans)\n\nn,m = readInts()\nsc = []\nfor i in range(m):\n\ttmp = readInts()\n\tsc.append([tmp[0]-1,tmp[1]])\n\nif m==0:\n\tif n==1:\n\t\tprint(0)\n\t\texit()\n\telse:\n\t\tprint(-1)\n\t\texit()\nans = -1\nfor i in range(1000):\n\t*t, = map(int, list(str(i)))\n\n\tif len(t) != n:\n\t\tcontinue\n\n\tok = True\n\t for j in range(m):\n\t\tif t[sc[j][0]]!=sc[j][1]:\n\t\t\tok=False\n\t\t\tbreak\n\tif ok is True:\n\t\tprint(i)\n\t\tquit()\n\nprint(-1)', 'import math\nimport queue\nfrom collections import defaultdict\n \ndef readInt():\n\treturn int(input())\ndef readInts():\n\treturn list(map(int, input().split()))\ndef readChar():\n\treturn input()\ndef readChars():\n\treturn input().split()\ndef factorization(n):\n\tres = []\n\tif n%2==0:\n\t\tres.append(2)\n\tfor i in range(3,math.floor(n//2)+1,2):\n\t\tif n%i==0:\n\t\t\tc = 0\n\t\t\tfor j in res:\n\t\t\t\tif i%j==0:\n\t\t\t\t\tc=1\n\t\t\tif c==0:\n\t\t\t\tres.append(i)\n\treturn res\ndef fact2(n):\n\tp = factorization(n)\n\tres = []\n\tfor i in p:\n\t\tc=0\n\t\tz=n\n\t\twhile 1:\n\t\t\tif z%i==0:\n\t\t\t\tc+=1\n\t\t\t\tz/=i\n\t\t\telse:\n\t\t\t\tbreak\n\t\tres.append([i,c])\n\treturn res\ndef fact(n):\n\tans = 1\n\tm=n\n\tfor _i in range(n-1):\n\t\tans*=m\n\t\tm-=1\n\treturn ans\ndef comb(n,r):\n\tif n<r:\n\t\treturn 0\n\tl = min(r,n-r)\n\tm=n\n\tu=1\n\tfor _i in range(l):\n\t\tu*=m\n\t\tm-=1\n\treturn u//fact(l)\ndef printQueue(q):\n\tr=q\n\tans=[0]*r.qsize()\n\tfor i in range(r.qsize()-1,-1,-1):\n\t\tans[i] = r.get()\n\tprint(ans)\n\nn,m = readInts()\nsc = []\nfor i in range(m):\n\ttmp = readInts()\n\tsc.append(tmp[0]-1,tmp[1])\n\nif m==0:\n\tif n==1:\n\t\tprint(0)\n\t\texit()\n\telse:\n\t\tprint(-1)\n\t\texit()\nans = -1\nfor i in range(0,1000):\n\tst = list(str(i))\n\tif n!=len(st):\n\t\tcontinue\n\n\tch = 0\n\tfor j in range(m):\n\t\tif int(st[sc[j][0]])!=sc[j][1]:\n\t\t\tch=1\n\tif ch==0:\n\t\tprint(i)\n\t\texit()\n\nprint(-1)', 'import math\nimport queue\nfrom collections import defaultdict\n \ndef readInt():\n\treturn int(input())\ndef readInts():\n\treturn list(map(int, input().split()))\ndef readChar():\n\treturn input()\ndef readChars():\n\treturn input().split()\ndef factorization(n):\n\tres = []\n\tif n%2==0:\n\t\tres.append(2)\n\tfor i in range(3,math.floor(n//2)+1,2):\n\t\tif n%i==0:\n\t\t\tc = 0\n\t\t\tfor j in res:\n\t\t\t\tif i%j==0:\n\t\t\t\t\tc=1\n\t\t\tif c==0:\n\t\t\t\tres.append(i)\n\treturn res\ndef fact2(n):\n\tp = factorization(n)\n\tres = []\n\tfor i in p:\n\t\tc=0\n\t\tz=n\n\t\twhile 1:\n\t\t\tif z%i==0:\n\t\t\t\tc+=1\n\t\t\t\tz/=i\n\t\t\telse:\n\t\t\t\tbreak\n\t\tres.append([i,c])\n\treturn res\ndef fact(n):\n\tans = 1\n\tm=n\n\tfor _i in range(n-1):\n\t\tans*=m\n\t\tm-=1\n\treturn ans\ndef comb(n,r):\n\tif n<r:\n\t\treturn 0\n\tl = min(r,n-r)\n\tm=n\n\tu=1\n\tfor _i in range(l):\n\t\tu*=m\n\t\tm-=1\n\treturn u//fact(l)\ndef printQueue(q):\n\tr=q\n\tans=[0]*r.qsize()\n\tfor i in range(r.qsize()-1,-1,-1):\n\t\tans[i] = r.get()\n\tprint(ans)\n\nn,m = readInts()\nsc = []\nfor i in range(m):\n\ttmp = readInts()\n\tsc.append([tmp[0]-1,tmp[1]])\n\nif m==0:\n\tif n==1:\n\t\tprint(0)\n\t\texit()\n\telse:\n\t\tprint(-1)\n\t\texit()\nans = -1\nfor i in range(1000):\n\t*t, = map(int, list(str(i)))\n\n\tif len(t) != n:\n\t\tcontinue\n\n\tok = True\n\tfor j in range(m):\n\t\tif t[sc[j][0]]!=sc[j][1]:\n\t\t\tok = False\n break\n \n\tif ok:\n print(i)\n quit()\n\nprint(-1)', 'import math\nimport queue\nfrom collections import defaultdict\n \ndef readInt():\n\treturn int(input())\ndef readInts():\n\treturn list(map(int, input().split()))\ndef readChar():\n\treturn input()\ndef readChars():\n\treturn input().split()\ndef factorization(n):\n\tres = []\n\tif n%2==0:\n\t\tres.append(2)\n\tfor i in range(3,math.floor(n//2)+1,2):\n\t\tif n%i==0:\n\t\t\tc = 0\n\t\t\tfor j in res:\n\t\t\t\tif i%j==0:\n\t\t\t\t\tc=1\n\t\t\tif c==0:\n\t\t\t\tres.append(i)\n\treturn res\ndef fact2(n):\n\tp = factorization(n)\n\tres = []\n\tfor i in p:\n\t\tc=0\n\t\tz=n\n\t\twhile 1:\n\t\t\tif z%i==0:\n\t\t\t\tc+=1\n\t\t\t\tz/=i\n\t\t\telse:\n\t\t\t\tbreak\n\t\tres.append([i,c])\n\treturn res\ndef fact(n):\n\tans = 1\n\tm=n\n\tfor _i in range(n-1):\n\t\tans*=m\n\t\tm-=1\n\treturn ans\ndef comb(n,r):\n\tif n<r:\n\t\treturn 0\n\tl = min(r,n-r)\n\tm=n\n\tu=1\n\tfor _i in range(l):\n\t\tu*=m\n\t\tm-=1\n\treturn u//fact(l)\ndef printQueue(q):\n\tr=q\n\tans=[0]*r.qsize()\n\tfor i in range(r.qsize()-1,-1,-1):\n\t\tans[i] = r.get()\n\tprint(ans)\n\nn, m = map(int, input().split())\nsc = []\ns=[]\nc=[]\nfor i in range(m):\n\t_s, _c = map(int, input().split())\n\ts.append(_s-1)\n c.append(_c)\n\nif m==0:\n\tif n==1:\n\t\tprint(0)\n\t\texit()\n\telse:\n\t\tprint(-1)\n\t\texit()\nans = -1\nfor i in range(1000):\n\t*t, = map(int, list(str(i)))\n\n\tif len(t) != n:\n\t\tcontinue\n\n\tok = True\n\tfor j in range(m):\n\t\tif t[s[j]]!=c[j]:\n\t\t\tok = False\n\t\t\tbreak\n \n\tif ok:\n\t\tprint(i)\n\t\tquit()\n\nprint(-1)', 'import math\nimport queue\nfrom collections import defaultdict\n \ndef readInt():\n\treturn int(input())\ndef readInts():\n\treturn list(map(int, input().split()))\ndef readChar():\n\treturn input()\ndef readChars():\n\treturn input().split()\ndef factorization(n):\n\tres = []\n\tif n%2==0:\n\t\tres.append(2)\n\tfor i in range(3,math.floor(n//2)+1,2):\n\t\tif n%i==0:\n\t\t\tc = 0\n\t\t\tfor j in res:\n\t\t\t\tif i%j==0:\n\t\t\t\t\tc=1\n\t\t\tif c==0:\n\t\t\t\tres.append(i)\n\treturn res\ndef fact2(n):\n\tp = factorization(n)\n\tres = []\n\tfor i in p:\n\t\tc=0\n\t\tz=n\n\t\twhile 1:\n\t\t\tif z%i==0:\n\t\t\t\tc+=1\n\t\t\t\tz/=i\n\t\t\telse:\n\t\t\t\tbreak\n\t\tres.append([i,c])\n\treturn res\ndef fact(n):\n\tans = 1\n\tm=n\n\tfor _i in range(n-1):\n\t\tans*=m\n\t\tm-=1\n\treturn ans\ndef comb(n,r):\n\tif n<r:\n\t\treturn 0\n\tl = min(r,n-r)\n\tm=n\n\tu=1\n\tfor _i in range(l):\n\t\tu*=m\n\t\tm-=1\n\treturn u//fact(l)\ndef printQueue(q):\n\tr=q\n\tans=[0]*r.qsize()\n\tfor i in range(r.qsize()-1,-1,-1):\n\t\tans[i] = r.get()\n\tprint(ans)\n\nn,m = readInts()\nsc = []\nfor i in range(m):\n\ttmp = readInts()\n\tsc.append([tmp[0]-1,tmp[1]])\n\nif m==0:\n\tif n==1:\n\t\tprint(0)\n\t\texit()\n\telse:\n\t\tprint(-1)\n\t\texit()\nans = -1\nfor i in range(1000):\n\t*t, = map(int, list(str(i)))\n\tif len(t) != n:\n continue\n\n\tch = True\n\tfor j in range(m):\n\t\tif int(t[sc[j][0]])!=sc[j][1]:\n\t\t\tch=False\n\t\t\tbreak\n\tif ch is True:\n\t\tprint(i)\n\t\tquit()\n\nprint(-1)', 'import math\nimport queue\nfrom collections import defaultdict\n \ndef readInt():\n\treturn int(input())\ndef readInts():\n\treturn list(map(int, input().split()))\ndef readChar():\n\treturn input()\ndef readChars():\n\treturn input().split()\ndef factorization(n):\n\tres = []\n\tif n%2==0:\n\t\tres.append(2)\n\tfor i in range(3,math.floor(n//2)+1,2):\n\t\tif n%i==0:\n\t\t\tc = 0\n\t\t\tfor j in res:\n\t\t\t\tif i%j==0:\n\t\t\t\t\tc=1\n\t\t\tif c==0:\n\t\t\t\tres.append(i)\n\treturn res\ndef fact2(n):\n\tp = factorization(n)\n\tres = []\n\tfor i in p:\n\t\tc=0\n\t\tz=n\n\t\twhile 1:\n\t\t\tif z%i==0:\n\t\t\t\tc+=1\n\t\t\t\tz/=i\n\t\t\telse:\n\t\t\t\tbreak\n\t\tres.append([i,c])\n\treturn res\ndef fact(n):\n\tans = 1\n\tm=n\n\tfor _i in range(n-1):\n\t\tans*=m\n\t\tm-=1\n\treturn ans\ndef comb(n,r):\n\tif n<r:\n\t\treturn 0\n\tl = min(r,n-r)\n\tm=n\n\tu=1\n\tfor _i in range(l):\n\t\tu*=m\n\t\tm-=1\n\treturn u//fact(l)\ndef printQueue(q):\n\tr=q\n\tans=[0]*r.qsize()\n\tfor i in range(r.qsize()-1,-1,-1):\n\t\tans[i] = r.get()\n\tprint(ans)\n\nn, m = map(int, input().split())\ns=[]\nc=[]\nfor i in range(m):\n\t_s, _c = map(int, input().split())\n\ts.append(_s-1)\n\tc.append(_c)\n\nif m==0:\n\tif n==1:\n\t\tprint(0)\n\t\texit()\n\nans = -1\nfor i in range(1000):\n\t*t, = map(int, list(str(i)))\n\n\tif len(t) != n:\n\t\tcontinue\n\n\tok = True\n\tfor j in range(m):\n\t\tif t[s[j]]!=c[j]:\n\t\t\tok = False\n\t\t\tbreak\n \n\tif ok:\n\t\tprint(i)\n\t\tquit()\n\nprint(-1)'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s131956234', 's512591281', 's588137186', 's630765031', 's647678281', 's884162150'] | [3064.0, 3952.0, 3064.0, 3064.0, 3064.0, 3944.0] | [18.0, 26.0, 18.0, 17.0, 18.0, 29.0] | [1313, 1284, 1329, 1347, 1322, 1309] |
p02761 | u509784400 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['line = input().split()\nN, M = int(line[0]), int(line[1]) \n\nif M == 0:\n return 10**N\n\nconds = []\nfor i in range(M):\n line = input().split()\n conds.append((int(line[0]),int(line[1])))\n \nNUM = [-1] * N\n \nisOK = True\nfor curCon in conds:\n s = curCon[0]\n dig = curCon[1]\n \n if NUM[s-1] == -1:\n NUM[s-1] = dig\n elif NUM[s-1] > dig:\n NUM[s-1] = dig\n \nif N > 1:\n if NUM[0] == -1 or NUM[0] == 0:\n isOK = False\n \nif isOK != True:\n print(-1)\nelse:\n for i in range(N):\n if NUM[i] == -1:\n NUM[i] = 0\n numChar = ""\n for iNum in NUM:\n numChar += str(iNum)\n print(int(numChar))', 'line = input().split()\nN, M = int(line[0]), int(line[1]) \n\nif M == 0:\n if N == 1:\n print(0)\n else:\n print(10**(N-1))\n quit()\n\nconds = []\nfor i in range(M):\n line = input().split()\n conds.append((int(line[0]),int(line[1])))\n \nNUM = [-1] * N\n \nisOK = True\nfor curCon in conds:\n s = curCon[0]\n dig = curCon[1]\n \n if NUM[s-1] == -1:\n NUM[s-1] = dig\n elif NUM[s-1] != dig:\n isOK = False\n \nif N > 1:\n if NUM[0] == 0:\n isOK = False\n \nif isOK != True:\n print(-1)\n quit()\nelse:\n if NUM[0] == -1:\n NUM[0]=1\n \n for i in range(N):\n if NUM[i] == -1:\n NUM[i] = 0\n numChar = ""\n for iNum in NUM:\n numChar += str(iNum)\n print(int(numChar))'] | ['Runtime Error', 'Accepted'] | ['s606868638', 's943193676'] | [3064.0, 3188.0] | [17.0, 19.0] | [595, 673] |
p02761 | u510331904 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["#!/usr/bin/env python3\nimport sys\nimport math\nimport decimal\nimport itertools\nfrom itertools import product\nfrom functools import reduce\ndef input():\n return sys.stdin.readline()[:-1]\n\ndef main():\n N, M = map(int, input().split())\n s = [0] * M\n c = [0] * M\n for i in range(M):\n s[i], c[i] = map(int, input().split())\n\n for i in range(1, N + 1):\n if i not in s:\n s.append(i)\n c.append(1)\n\n z = zip(s, c)\n z = sorted(z)\n s, c = zip(*z)\n s = list(s)\n c = list(c)\n\n for i in range(len(c) - 1):\n if s[i] == 1 and c[i] == 0:\n print(-1)\n exit()\n if s[i + 1] == s[i]:\n if c[i + 1] != c[i]:\n print(-1)\n exit()\n\n ans = ''\n k = 1\n for i in range(len(c)):\n if s[i] == k:\n ans += str(c[i])\n k += 1\n print(ans)\n\nif __name__ == '__main__':\n main()\n", "#!/usr/bin/env python3\nimport sys\nimport math\nimport decimal\nimport itertools\nfrom itertools import product\nfrom functools import reduce\ndef input():\n return sys.stdin.readline()[:-1]\ndef sort_zip(a:list, b:list):\n z = zip(a, b)\n z = sorted(z)\n a, b = zip(*z)\n a = list(a)\n b = list(b)\n return a, b\n\ndef main():\n N, M = map(int, input().split())\n s = [0] * M\n c = [0] * M\n for i in range(M):\n s[i], c[i] = map(int, input().split())\n\n if M == 0:\n if N == 1:\n print(0)\n exit()\n elif N == 2:\n print(10)\n exit()\n elif N == 3:\n print(100)\n exit()\n\n for i in range(M):\n if s[i] == 1 and c[i] == 0 and N > 1:\n print(-1)\n exit()\n\n s, c = sort_zip(s, c)\n\n for i in range(M - 1):\n if s[i] == s[i + 1]:\n if c[i] != c[i + 1]:\n print(-1)\n exit()\n\n for i in range(1, N + 1):\n if i not in s:\n s.append(i)\n if i == 1:\n c.append(1)\n else:\n c.append(0)\n\n s, c = sort_zip(s, c)\n\n k = 1\n ans = ''\n for i in range(len(s)):\n if s[i] == k:\n ans += str(c[i])\n k += 1\n print(ans)\n\n\nif __name__ == '__main__':\n main()\n"] | ['Wrong Answer', 'Accepted'] | ['s799706406', 's728708518'] | [9988.0, 9992.0] | [35.0, 36.0] | [926, 1328] |
p02761 | u511449169 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['n, m = map(int, input().split())\ns = [list(map(int, input().split())) for _ in range(m)]\nlis = [str(0)]*n\nfor i in s:\n if lis[int(i[0]) - 1] != "0":\n lis[int(i[0]) - 1] = str(i[-1])\n else:\n print(-1)\n exit()\nlis = int("".join(lis))\nif lis == 0:\n print(-1)\nelse:\n print(lis)', 'n, m = map(int, input().split())\ns = [list(map(int, input().split())) for _ in range(m)]\nlis = [str(0)]*n\nfor i in s:\n if lis[int(i[0]) - 1] != 0:\n print(-1)\n exit()\n else:\n lis[int(i[0]) - 1] = str(i[-1])\n\nlis = int("".join(lis))\nif lis == 0 or len(str(lis)) != n:\n print(-1)\nelse:\n print(lis)', 'n, m = map(int, input().split())\ns = [list(map(int, input().split())) for _ in range(m)]\nlis = []\nfor i in range(10**n):\n num = list(str(i))\n if len(num) == n:\n flag = True\n for j in s:\n if num[j[0] - 1] != str(j[-1]):\n flag = False\n if flag:\n lis.append(i)\n break\nif lis:\n print(lis[0])\nelse:\n print(-1)'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s345704771', 's756389287', 's575952511'] | [3064.0, 3064.0, 3064.0] | [17.0, 17.0, 18.0] | [306, 327, 385] |
p02761 | u511824539 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["N, M = map(int, input().split())\nnum = [x for x in str(10**(N - 1))]\nconfirmed_or_not = [False] * N\n\nfor _ in range(M):\n s, c = map(int, input().split())\n if s > N:\n num = ['-1']\n break\n \n if s == 1 and c == 0:\n if N > 1:\n num = ['-1']\n break\n \n if confirmed_or_not[s-1] and num[s-1] != str(c):\n num = ['-1']\n break\n \n num[s - 1] = str(c)\n confirmed_or_not[s-1] = True\n\n\nif N == 1 and not confirmed_or_not[0]:\n num = ['0']\n\nprint(*num)", "N, M = map(int, input().split())\nnum = [x for x in str(10**(N - 1))]\nconfirmed_or_not = [False] * N\n\nfor _ in range(M):\n s, c = map(int, input().split())\n \n if s == 1 and c == 0:\n if N > 1:\n num = ['-1']\n break\n \n if confirmed_or_not[s-1] and num[s-1] != str(c):\n num = ['-1']\n break\n \n num[s - 1] = str(c)\n confirmed_or_not[s - 1] = True\n\n\nif N == 1 and not confirmed_or_not[0]:\n num = ['0']\n\nprint(*num, sep='')"] | ['Wrong Answer', 'Accepted'] | ['s565775817', 's160113196'] | [3188.0, 3064.0] | [22.0, 17.0] | [530, 491] |
p02761 | u511870776 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['N, M = map(int, input().split())\nnum = ["0" for y in range(N)]\n\n\nfor x in range(M):\n s, c = map(int, input().split())\n if s+1 > len(num):\n print(-1)\n exit()\n num[s-1] = str(c)\n\nprint("".join(num) if num[0] != "0" else -1)\n\n\n\n', 'N, M = map(int, input().split())\nnum = [input().split() for y in range(N)]\n\n\ndef check(target):\n if not len(target) == N:\n return False\n for x, y in num:\n if not target[x-1] == y:\n return False\n return True\n\n\nfor i in range(1000):\n if check(str(i)):\n print(i)\n exit()\n \nprint(-1)\n', 'N, M = map(int, input().split())\nnum = [[] for y in range(N)]\n\n\nfor x in range(M):\n s, c = map(int, input().split())\n num[s-1].append(str(c))\nfor x in range(0, 10*N):\n if not len(str(x)) == N:\n continue\n p = []\n for i, y in enumerate(num, start=0):\n if not y:\n y.append("0")\n try:\n p.append(str(x)[i] in y)\n except:\n continue\n if all(p):\n print(x)\n exit()\n\nprint(-1)', 'for x in range(0, 1000):\n if not len(str(x)) == N:\n continue\n p = []\n for i, y in enumerate(num, start=0):\n if not y:\n y.append("0")\n try:\n p.append(str(x)[i] in y)\n except:\n continue\n if all(p):\n print(x)\n exit()\n\nprint(-1)', 'N, M = map(int, input().split())\nnum = [input().split() for y in range(M)]\n\n\ndef check(target):\n if not len(target) == N:\n return False\n for x, y in num:\n if not target[int(x)-1] == y:\n return False\n return True\n\n\nfor i in range(1000):\n if check(str(i)):\n print(i)\n exit()\n\nprint(-1)\n'] | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s402461524', 's434044829', 's612181659', 's999333340', 's068428819'] | [3060.0, 3060.0, 3064.0, 3060.0, 3060.0] | [17.0, 18.0, 17.0, 20.0, 18.0] | [248, 338, 459, 311, 335] |
p02761 | u512138205 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['def calc():\n mp = {}\n n, m = map(int, input().split())\n for i in range(0, m):\n s, c = map(int, input().split())\n if s in mp and mp[s] != c:\n return -1\n else:\n mp[s] = c\n res = 0\n if n == 1:\n res = mp[1] if 1 in mp else 0\n else:\n for j in range(1, n + 1):\n if j == n:\n x = mp[j] if j in mp else 1\n else:\n x = mp[j] if j in mp else 0\n res += x * (10 ^ ((n - j + 1) - 1))\n if len(str(res)) != n:\n return -1\n return res\n\n\nprint(calc())\n', 'def calc():\n mp = {}\n n, m = map(int, input().split())\n for i in range(0, m):\n s, c = map(int, input().split())\n if s in mp and mp[s] != c:\n return -1\n else:\n mp[s] = c\n res = 0\n if n == 1:\n res = mp[1] if 1 in mp else 0\n else:\n for j in range(1, n + 1):\n if j == 1:\n x = mp[1] if 1 in mp else 1\n else:\n x = mp[j] if j in mp else 0\n digit = n - (j - 1)\n res += x * (10 ** (digit - 1))\n if len(str(res)) != n:\n return -1\n return res\n\n\nprint(calc())\n'] | ['Wrong Answer', 'Accepted'] | ['s755564955', 's976220744'] | [3064.0, 3064.0] | [19.0, 17.0] | [583, 610] |
p02761 | u512212329 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["def main():\n digits, orders = [int(x) for x in input().split()]\n number = [-1] * digits\n for _ in range(orders):\n left_count, numeral = [int(x) for x in input().split()]\n left_count -= 1\n if number[left_count] != -1:\n # already assigned!\n if number[left_count] != numeral:\n print(-1)\n return\n else:\n number[left_count] = numeral\n if number[0] == 0:\n print(-1)\n return\n if number[0] == -1:\n number[0] = 1\n for x in number:\n if x == -1:\n x = 0\n print(x, end='')\n return\n\n\nif __name__ == '__main__':\n main()\n", "def main():\n digits, orders = [int(x) for x in input().split()]\n number = [-1] * digits\n for _ in range(orders):\n left_count, numeral = [int(x) for x in input().split()]\n left_count -= 1\n if number[left_count] != -1:\n # already assigned!\n if number[left_count] != numeral:\n print(-1)\n return\n else:\n number[left_count] = numeral\n if digits > 1 and number[0] == 0:\n print(-1)\n return\n if number[0] == -1:\n number[0] = 1\n for x in number:\n if x == -1:\n x = 0\n print(x, end='')\n return\n\n\nif __name__ == '__main__':\n main()\n", "def main():\n digits, m = [int(x) for x in input().split()]\n orders = []\n for _ in range(m):\n left_count, numeral = [int(x) for x in input().split()]\n left_count -= 1\n orders.append((left_count, numeral))\n\n def gen():\n for x in range(10 ** digits):\n if x < 10 ** (digits - 1):\n if not(x == 0 and digits == 1):\n continue\n ok = True\n s = str(x)\n for left_count, numeral in orders:\n if len(s) <= left_count:\n ok = False\n break\n if s[left_count] != str(numeral):\n ok = False\n break\n if ok:\n yield x\n\n candidates = gen()\n try:\n print(min(candidates))\n except ValueError:\n print(-1)\n return\n\n\nif __name__ == '__main__':\n main()\n"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s104180806', 's737777612', 's323262827'] | [3064.0, 3064.0, 3064.0] | [17.0, 17.0, 18.0] | [666, 681, 900] |
p02761 | u515052479 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['import numpy as np\n\nnum = list(map(int,input().split()))\n\nmatrix = np.ones(num[0]) * (-1)\nsign_0 = []\nsign_1 = []\nans = 0\n\nif num[1] == 0:\n if not matrix[0] == 0:\n ans = 10**(num[0]-1)\n elif matrix[0] == 0:\n ans = -1\n\nelif not num[1] == 0:\n for i in range(0,num[1]):\n temp = list(map(int,input().split()))\n if (temp[0] in sign_0 and) (temp not in sign_1) :\n ans = -1\n break\n else:\n matrix[temp[0]-1] = temp[1]\n sign_0.append(temp[0])\n sign_1.append(temp)\n \n if not ans == -1:\n if matrix[0] == -1:\n matrix[0] = 1\n \n for i in range(1,num[0]):\n if matrix[i] == -1:\n matrix[i] = 0\n \n ans = matrix[0]*(10**(num[0]-1))\n \n for i in range(1,num[0]):\n ans = ans + matrix[i]*(10**(num[0]-1-i))\n ans = int(ans)\n \n judge_a = len(list(str(ans)))\n judge = judge_a - num[0]\n \n if not judge == 0:\n ans = -1\n \n \nprint(int(ans))', 'import numpy as np\nn,m = map(int,input().split())\nbase = np.zeros(n)\nseen = np.zeros(n)\nbase[0] = 1\nsign = 0\n\nfor i in range(m):\n s,c = map(int,input().split())\n if (seen[s-1] == 0) or (base[s-1] == c):\n base[s-1] = c\n seen[s-1] = 1\n sign = 1\n else:\n sign = 2\n break\nans = 0\nif (sign == 2) or ((base[0] == 0) and (n > 1)):\n ans = -1\nelse:\n for i in range(1,len(base)+1):\n ans += base[-i]*(10**(i-1))\n \nif (m == 0) and (n == 1):\n ans = 0\nprint(int(ans))'] | ['Runtime Error', 'Accepted'] | ['s753531093', 's925757613'] | [3064.0, 12396.0] | [17.0, 148.0] | [926, 479] |
p02761 | u518386853 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['n, m = map(int, input().split())\nsc = []\nfor i in range(m):\n sc.append(list(map(int, input().split())))\nans = 0\ns = set()\nketa = set()\nfor i in range(m):\n preans = sc[i][1]*(10**(n-sc[i][0]))\n if sc[i][0] in keta and preans not in s:\n print(-1)\n break\n elif sc[i][0] not in keta:\n ans += preans\n s.add(preans)\n keta.add(sc[i][0])\nelse:\n if n not in keta::\n print(ans + 10**(n-1))\n elif len(str(ans)) == n:\n print(ans)\n else:\n print(-1)\n', 'n, m = map(int, input().split())\nsc = []\nfor i in range(m):\n sc.append(list(map(int, input().split())))\nans = 0\ns = set()\nketa = set()\nfor i in range(m):\n preans = sc[i][1]*(10**(n-sc[i][0]))\n if sc[i][0] in keta and preans not in s:\n print(-1)\n break\n elif sc[i][0] not in keta:\n ans += preans\n s.add(preans)\n keta.add(sc[i][0])\nelse:\n if n == 1 and m == 0:\n print(0)\n elif 1 not in keta:\n print(ans + 10**(n-1))\n elif len(str(ans)) == n:\n print(ans)\n else:\n print(-1)'] | ['Runtime Error', 'Accepted'] | ['s278265562', 's465568102'] | [3064.0, 3064.0] | [17.0, 17.0] | [514, 557] |
p02761 | u518891382 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["bingo = []\nfor _ in range(3):\n bingo.append(list(map(int,input().split())))\n\ncl = [[0,0,0],[0,0,0],[0,0,0]]\n\nn = int(input())\nst = set()\nfor _ in range(n):\n st.add(int(input()))\n\nfor _ in range(len(st)):\n for i in range(3):\n for j in range(3):\n if bingo[i][j] in st:\n cl[i][j] = 1\n\nif sum(cl[0]) == 3 or sum(cl[1]) == 3 or sum(cl[2]) == 3:\n print('Yes')\nelif sum(cl[:][0]) == 3 or sum(cl[:][1]) == 3 or sum(cl[:][2]) == 3:\n print('Yes')\nelif cl[0][0]+cl[1][1]+cl[2][2] == 3 or cl[0][2]+cl[1][1]+cl[0][2] == 3:\n print('Yes')\nelse:\n print('No')", "bingo = []\nfor _ in range(3):\n bingo.append(list(map(int,input().split())))\n\ncl = [[0,0,0],[0,0,0],[0,0,0]]\n\nn = int(input())\nst = set()\nfor _ in range(n):\n st.add(int(input()))\n\nfor _ in range(len(st)):\n for i in range(3):\n for j in range(3):\n if bingo[i][j] in st:\n cl[i][j] = 1\n\nif sum(cl[0]) == 3 or sum(cl[1]) == 3 or sum(cl[2]) == 3:\n print('Yes')\nelif sum(cl[:][0]) == 3 or sum(cl[:][1]) == 3 or sum(cl[:][2]) == 3:\n print('Yes')\nelif cl[0][0]+cl[1][1]+cl[2][2] == 3 or cl[0][2]+cl[1][1]+cl[0][2] == 3:\n print('Yes')\nelse:\n print('No')", 'import sys\n\nn,m = map(int, input().split())\nnum = [0]*n\ncount = [0]*n\n\nfor _ in range(m):\n b,c = map(int, input().split())\n if num[b-1] != c and count[b-1] > 0:\n print(-1)\n sys.exit()\n count[b-1]+=1\n num[b-1] = c \n\nif n >= 2 and num[0] == 0:\n if count[0] == 0:\n num[0] = 1\n else:\n print(-1)\n sys.exit()\n\nans = ""\nfor i in range(n):\n ans+=str(num[i])\nprint(ans)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s300348271', 's624286498', 's550525380'] | [9116.0, 9260.0, 9244.0] | [28.0, 26.0, 29.0] | [596, 596, 419] |
p02761 | u520843951 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["def solve(n, m):\n ans = [-1]*n\n for _ in range(m):\n s, c = map(int, input().split())\n s = s-1\n if ans[s] == c:\n continue\n elif ans[s] == -1:\n ans[s] = c\n else:\n return -1\n\n if ans[0] == '0':\n if n == 1:\n return '0'\n else:\n ans[0] = '1'\n for i in range(1, n):\n if ans[i] == -1:\n ans[i] = '0'\n return ''.join(ans)\n\nn, m = map(int, input().split())\nprint(solve(n, m))", "def solve(n, m):\n ans = [-1] * n\n for _ in range(m):\n s, c = input().split()\n s = int(s) - 1\n if ans[s] == c:\n continue\n elif ans[s] == -1:\n ans[s] = c\n else:\n return -1\n\n if ans[0] == '0':\n if n == 1:\n return '0'\n else:\n return -1\n elif ans[0] == -1:\n if n == 1:\n return '0'\n else:\n ans[0] = '1'\n for i in range(1, n):\n if ans[i] == -1:\n ans[i] = '0'\n return ''.join(ans)\n\nn, m = map(int, input().split())\nprint(solve(n, m))"] | ['Runtime Error', 'Accepted'] | ['s337024009', 's908041074'] | [3064.0, 3064.0] | [19.0, 18.0] | [501, 601] |
p02761 | u527993431 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['N,M=map(int,input().split())\nS=[]\nC=[]\nA=[0]*N\nif N>1:\n A[0]=1\nX=[]\nY=[]\nZ=[]\nfor i in range(M):\n\tx,y=map(int,input().split())\n\tS.append(x)\n\tC.append(y)\nfor i in range(M):\n\tif S[i]==1:\n\t\tX.append(C[i])\n\tif S[i]==2:\n\t\tY.append(C[i])\n\tif S[i]==3:\n\t\tZ.append(C[i])\nif len(set(X))>1:\n\tprint(-1)\n\texit()\nif len(set(Y))>1:\n\tprint(-1)\n\texit()\nif len(set(Z))>1:\n\tprint(-1)\n\texit()\n\nfor i in range(M):\n\tif A[(S[i]-1)]==0:\n\t\tA[(S[i]-1)]=C[i]\n\tif A[(S[i]-1)]!=0:\n\t\tif A[(S[i]-1)]!=C[i]:\n\t\t\tprint(-1)\n\t\t\texit()\nans=0\nfor i in range (1,N+1):\n\tans+=A[-i]*10**(i-1)\nif len(str(ans))!=N:\n\tprint(-1)\nelse:\n\tprint(ans)', 'N,M=map(int,input().split())\nS=[]\nC=[]\nans=[0]*N\nif N>1:\n\tans[0]=1\nA=[]\nB=[]\nD=[]\nfor i in range (M):\n\tx,y=map(int,input().split())\n\tS.append(x)\n\tC.append(y)\nfor i in range (M):\n\tif S[i]==1:\n\t\tA.append(C[i])\n\tif S[i]==2:\n\t\tB.append(C[i])\n\tif S[i]==3:\n\t\tD.append(C[i])\nif len(set(A))>1:\n\tprint(-1)\n\texit()\nif len(set(B))>1:\n\tprint(-1)\n\texit()\nif len(set(D))>1:\n\tprint(-1)\n\texit()\nfor i in range (M):\n\tans[(S[i]-1)]=C[i]\nend=0\nfor i in range(1,N+1):\n\tend+=ans[-i]*10**(i-1)\nif len(str(end))!=N:\n\tprint(-1)\nelse:\n\tprint(end)'] | ['Wrong Answer', 'Accepted'] | ['s300883542', 's859849414'] | [3064.0, 3064.0] | [17.0, 17.0] | [601, 521] |
p02761 | u528748570 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['N, M = map(int, input().split())\ndata = [list(map(int, input().split())) for _ in range(M)]\n\n# condition[1:N+1]\nhantei = True\ncondition = [None] * (N+1)\ncondition[0] = 0\nS = []\nfor s, c in data:\n if condition[s] is None:\n condition[s] = c\n S.append(s)\n else:\n break\nelse:\n hantei = False\n\nif (condition[1] == 0) or hantei:\n print(-1)\nelif None in condition:\n temp = list(set(range(1, N+1)) - set(S))\n for t in temp:\n if t != 1:\n condition[t] = 0\n else:\n condition[t] = 1\n condition = map(str, condition[1:])\n print("".join(condition))\n', 'N, M = map(int, input().split())\ndata = [list(map(int, input().split())) for _ in range(M)]\n\nhantei = True\ncondition = [None] * (N+1)\ncondition[0] = 0\nS = []\nfor s, c in data:\n if (condition[s] is None) or (condition[s] == c):\n condition[s] = c\n S.append(s)\n else:\n break\nelse:\n hantei = False\n\nif (N != 1 and condition[1] == 0) or hantei:\n print(-1)\nelse:\n if None in condition:\n temp = list(set(range(1, N+1)) - set(S))\n for t in temp:\n if (N == 1) or (t != 1):\n condition[t] = 0\n else:\n condition[t] = 1\n condition = map(str, condition[1:])\n print("".join(condition))\n'] | ['Wrong Answer', 'Accepted'] | ['s835847996', 's717786610'] | [3064.0, 3064.0] | [17.0, 17.0] | [616, 679] |
p02761 | u529106146 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['import sys\nN,M = map(int, input(). split())\n\ns = [0,]*M\nc = [0,]*M\nans =[10,]*N\n\n\n\n\nfor i in range(M):\n s[i], c[i] = map(int, input(). split())\n if ans[s[i]-1] != 10 and ans[s[i]-1] != c[i]:\n print(-1)\n sys.exit()\n else:\n ans[s[i]-1] = c[i] \n\nif N == 1:\n print(0) \n \nelse:\n A = 0 \n print(ans)\n if ans[0] == 0:\n print(-1)\n sys.exit()\n elif ans[0] == 10:\n ans[0] = 1\n for j in range(N):\n if ans[j] == 10:\n ans[j] = 0\n for k in range(N):\n A += 10**(N-k-1)*ans[k] \n \n print(A)\n \n\n \n else:\n for j in range(N):\n if ans[j] == 10:\n ans[j] = 0\n for k in range(N):\n A += 10**(N-k-1)*ans[k] \n print(A)\n \n \n\n\n ', 'import sys\nN,M = map(int, input(). split())\ns = [0,]*M\nc = [0,]*M\nans =[10,]*N\nfor i in range(M):\n s[i], c[i] = map(int, input(). split())\n if ans[s[i]-1] != 10 and ans[s[i]-1] != c[i]:\n print(-1)\n sys.exit()\n else:\n ans[s[i]-1] = c[i]\nif ans[0] == 0:\n print(-1)\n sys.exit()\nelif ans[0] == 10:\n ans[0] = 1\n A = 0\n for j in range(N):\n if ans[j] == 10:\n ans[j] = 0\n for k in range(N):\n A += 10**(M-k)*ans[k] \n print(A)\n \nelse:\n A = 0\n for j in range(N):\n if ans[j] == 10:\n ans[j] = 0\n for k in range(N):\n A += 10**(M-k)*ans[k] \n print(A)\n \n \n\n\n ', 'import sys\nN,M = map(int, input(). split())\ns = [0,]*M\nc = [0,]*M\nans =[10,]*N\nfor i in range(M):\n s[i], c[i] = map(int, input(). split())\n if ans[s[i]-1] != 10 and ans[s[i]-1] != c[i]:\n print(-1)\n sys.exit()\n else:\n ans[s[i]-1] = c[i]\nif ans[0] == 0:\n print(-1)\n sys.exit()\nelif ans[0] == 10:\n ans[0] = 1\n A = 0\n for j in range(N):\n if ans[j] == 10:\n ans[j] = 0\n for k in range(N):\n A += 10**(M-k)*ans[k] \n print(A)\n \nelse:\n A = 0\n for j in range(N):\n if ans[j] == 10:\n ans[j] = 0\n for k in range(N):\n A += 10**(M-k)*ans[k] \n print(A', 'import sys\nN,M = map(int, input(). split())\n\ns = [0,]*M\nc = [0,]*M\nans =[10,]*N\n\n\n\nfor i in range(M):\n s[i], c[i] = map(int, input(). split())\n if ans[s[i]-1] != 10 and ans[s[i]-1] != c[i]:\n print(-1)\n sys.exit()\n else:\n ans[s[i]-1] = c[i] \nif N >= 2:\n \n A = 0 \n if ans[0] == 0:\n print(-1)\n sys.exit()\n elif ans[0] == 10:\n ans[0] = 1\n for j in range(N):\n if ans[j] == 10:\n ans[j] = 0\n for k in range(N):\n A += 10**(N-k-1)*ans[k] \n \n print(A)\n \n else:\n for j in range(N):\n if ans[j] == 10:\n ans[j] = 0\n for k in range(N):\n A += 10**(N-k-1)*ans[k] \n print(A)\nelse:\n A = 0\n if ans[0] == 0 or ans[0] == 10:\n print(0)\n else:\n print(ans[0])\n \n\n\n '] | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s407515793', 's503666851', 's773129914', 's133945401'] | [3064.0, 3064.0, 3064.0, 3064.0] | [19.0, 18.0, 17.0, 17.0] | [826, 672, 654, 878] |
p02761 | u531599639 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["N,M = map(int,input().split())\no = {}\nif N==1 and M==0:\n print(0)\nelse:\n for i in range(M):\n s,c = map(int,input().split())\n if o.get(s,-1)==-1:\n o[s]=c\n elif o.get(s,-1)!=-1 and o[s]!=c:\n print(-1)\n break\n else:\n m = [1]+[0]*(N-1)\n for k in o.keys():\n m[k-1]=o[k]\n if N!=1 and moji[0]==0:\n print(-1)\n else:\n print(''.join([str(a) for a in m]))\n", "N,M = map(int,input().split())\norder = {}\nif N==1 and M==0:\n print(0)\nelse:\n for i in range(M):\n s,c = map(int,input().split())\n if order.get(s,x)==x:\n order[s]=c\n elif order.get(s,x)!=x and order[s]!=c:\n print(-1)\n break\n else:\n moji = [1]+[0]*(N-1)\n for k in order.keys():\n moji[k-1]=order[k]\n if N!=1 and moji[0]==0:\n print(-1)\n else:\n print(''.join([str(a) for a in moji]))\n", "N,M = map(int,input().split())\no = {}\nif N==1 and M==0:\n print(0)\nelse:\n for i in range(M):\n s,c = map(int,input().split())\n if o.get(s,-1)==-1:\n o[s]=c\n elif o.get(s,-1)!=-1 and o[s]!=c:\n print(-1)\n break\n else:\n m = [1]+[0]*(N-1)\n for k in o.keys():\n m[k-1]=o[k]\n if N!=1 and m[0]==0:\n print(-1)\n else:\n print(''.join([str(a) for a in m]))\n"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s182637350', 's484382369', 's858115018'] | [3064.0, 3064.0, 3064.0] | [18.0, 18.0, 18.0] | [407, 440, 404] |
p02761 | u537538698 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['def main():\n r1 = input()\n n, m = map(int, r1.split(" "))\n v = ["~"] * n\n for v in range(m):\n r = input()\n s, c = map(int, r1.split(" "))\n v[s] = c\n if v[s] != "~" and v[s] != c:\n print(-1)\n return\n for x in range(len(v)):\n if v[x] == \'~\':\n v[x] = 0\n sv = "".join(v)\n res = int(sv)\n res_str = str(res)\n if len(sv) != len(res_str):\n print(-1)\n return\n print(res_str)\n\nmain()\n ', 'def main():\n r1 = input()\n n, m = map(int, r1.split(" "))\n v = ["~"] * n\n for t in range(m):\n r = input()\n s, c = map(int, r1.split(" "))\n s -= 1\n v[s] = str(c)\n if v[s] != "~" and v[s] != str(c):\n print(-1)\n return\n for x in range(len(v)):\n if v[x] == \'~\':\n v[x] = "0"\n sv = "".join(v)\n res = int(sv)\n res_str = str(res)\n if len(sv) != len(res_str):\n print(-1)\n return\n print(res_str)\n\nmain()\n ', 'def main():\n r1 = input()\n n, m = map(int, r1.split(" "))\n v = ["~"] * n\n for t in range(m):\n r = input()\n s, c = map(int, r.split(" "))\n s -= 1\n if v[s] != "~" and v[s] != str(c):\n print(-1)\n return\n v[s] = str(c)\n if n >= 2 and v[0] == \'~\':\n v[0] = "1"\n for x in range(n):\n if v[x] == \'~\':\n v[x] = "0"\n sv = "".join(v)\n res = int(sv)\n res_str = str(res)\n if len(res_str) != n:\n print(-1)\n return\n print(res_str)\n\nmain()\n '] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s250587950', 's349421273', 's765066082'] | [3316.0, 3064.0, 3064.0] | [19.0, 17.0, 17.0] | [490, 517, 555] |
p02761 | u538361257 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['N, M = map(int, input().split())\n\nans = [-1 for i in range(N)]\nflag = False\nfor i in range(M):\n s, c = map(int, input().split())\n if ans[s-1] == -1:\n ans[s-1] = c\n elif ans[s-1] == c:\n continue\n else:\n flag = True\n break\n\nif len(ans) > 1 and ans[0]:\n ans[0] = 1\n\nfor i in range(len(ans)):\n if ans[i] == -1:\n ans[i] = 0\n\nif len(ans) > 1 and ans[0] == 0:\n flag = True\n\nif flag:\n print(-1)\nelse:\n print("".join([str(c) for c in ans]))\n', 'N, M = map(int, input().split())\n\nans = [-1 for i in range(N)]\nflag = False\nfor i in range(M):\n s, c = map(int, input().split())\n if ans[s-1] == -1:\n ans[s-1] = c\n elif ans[s-1] == c:\n continue\n else:\n flag = True\n break\n\nif len(ans) > 1 and ans[0] == -1:\n ans[0] = 1\n\nfor i in range(len(ans)):\n if ans[i] == -1:\n ans[i] = 0\n\nif len(ans) > 1 and ans[0] == 0:\n flag = True\n\nif flag:\n print(-1)\nelse:\n print("".join([str(c) for c in ans]))\n'] | ['Wrong Answer', 'Accepted'] | ['s220220001', 's401954768'] | [3064.0, 3064.0] | [17.0, 18.0] | [494, 500] |
p02761 | u538537141 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['\nN,M=map(int,input().split())\nslist=[]\nfor i in range(M):\n slist.append(list(map(int,input().split())))\nans=["0"]*N\n\n\nfor i in range(len(slist)):\n print("i",i)\n if ans[slist[i][0]-1] == "0":\n ans[slist[i][0]-1] = slist[i][1]\n elif ans[slist[i][0]-1] != slist[i][1]:\n ans=["-1"]\n break\n\n#print(ans)\n\nif ans[0]=="0":\n ans[0]=1\nif N>=2 and ans[0]==0:\n ans=["-1"]\n \nfor i in range(len(ans)):\n if ans[i]=="0":\n ans[i]=0\n\nprint(*ans,sep=(""))', 'N,M=map(int,input().split())\nslist=[]\nfor i in range(M):\n slist.append(list(map(int,input().split())))\n\nans=["0"]*N\n\nfor i in range(M):\n if ans[slist[i][0]-1]=="0":\n ans[slist[i][0]-1]=slist[i][1]\n elif ans[slist[i][0]-1]!=slist[i][1]:\n ans=["-1"]\n break\n\n\n\nif N>1:\n if ans[0]=="0":\n ans[0]=1\n elif ans[0]==0:\n ans=["-1"]\n \n\nfor i in range(len(ans)):\n if ans[i]=="0":\n ans[i]=0\n\nprint(*ans,sep=(""))'] | ['Wrong Answer', 'Accepted'] | ['s478877968', 's908935509'] | [3064.0, 3064.0] | [17.0, 18.0] | [488, 466] |
p02761 | u539367121 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["N, M = map(int, input().split())\nans='1' + '0'*(N-1) if M>1 else '0'\nchk=[False]*N\n\nfor m in range(M):\n s, c = map(int, input().split())\n if s==1 and c==0:\n print(-1); exit(0)\n if chk[s-1] and c!=ans[s-1]:\n print(-1); exit(0)\n chk[s-1]=True\n ans = ans[:s-1] + str(c) + ans[s:]\n #print(chk, ans)\nprint(ans)", "N, M = map(int, input().split())\nans='1' + '0'*(N-1) if N>1 else '0'\nchk=[False]*N\n\nfor m in range(M):\n s, c = input().split()\n s=int(s)\n if s==1 and c=='0' and N>1:\n print(-1); exit(0)\n if chk[s-1] and c!=ans[s-1]:\n print(-1); exit(0)\n chk[s-1]=True\n ans = ans[:s-1] + c + ans[s:]\n #print(chk, ans)\nprint(ans)"] | ['Wrong Answer', 'Accepted'] | ['s188709862', 's482525920'] | [9136.0, 9064.0] | [28.0, 26.0] | [317, 323] |
p02761 | u539850805 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["n, m = map(int, input().split())\nres = ['-1' for i in range(n)]\nf = 1\nfor _ in range(m):\n s, c = map(int, input().split())\n if res[s-1] == '-1' or res[s-1] == str(c):\n res[s-1] = str(c)\n else:\n f = 0\nif not f:\n print(-1)\n exit()\nif res[0] == '0' or res[0] == '-1':\n if n == 1:\n print(0)\n exit()\n else:\n if res[0] == '0':\n print(-1)\n exit()\n else:\n res[0] = '1'\nfor i in range(1, n):\n if res[i] == '-1':\n res[i] = '1'\nprint(''.join(res))\n\n", "n, m = map(int, input().split())\nres = ['-1' for i in range(n)]\nf = 1\nfor _ in range(m):\n s, c = map(int, input().split())\n if res[s-1] == '-1' or res[s-1] == str(c):\n res[s-1] = str(c)\n else:\n f = 0\nif not f:\n print(-1)\n exit()\nif res[0] == '0' or res[0] == '-1':\n if n == 1:\n print(0)\n exit()\n else:\n res[0] = '1'\nfor i in range(1, n):\n if res[i] == '-1':\n res[i] = '1'\nprint(''.join(res))\n\n", "n, m = map(int, input().split())\nres = ['-1' for i in range(n)]\nf = 1\nfor _ in range(m):\n s, c = map(int, input().split())\n if res[s-1] == '-1' or res[s-1] == str(c):\n res[s-1] = str(c)\n else:\n f = 0\nif not f:\n print(-1)\n exit()\nif res[0] == '0' or res[0] == '-1':\n if n == 1:\n print(0)\n exit()\n else:\n if res[0] == '0':\n print(-1)\n exit()\n else:\n res[0] = '1'\nfor i in range(1, n):\n if res[i] == '-1':\n res[i] = '0'\nprint(''.join(res))\n\n"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s950938807', 's965566692', 's886870482'] | [3064.0, 3064.0, 3064.0] | [18.0, 17.0, 17.0] | [544, 459, 544] |
p02761 | u540631540 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['print(-1)', 'n, m = map(int, input().split())\na = [0] * n\nd = {}\nok = True\nfor i in range(m):\n s, c = map(int, input().split())\n if s not in d or d[s] == c:\n d[s] = c\n a[s - 1] = c\n else:\n ok = False\nif n != 1 and 1 not in d:\n a[0] = 1\nif ok and a[0] != 0:\n print(*a, sep="")\nelif ok and n == 1:\n print(0)\nelse:\n print(-1)'] | ['Wrong Answer', 'Accepted'] | ['s943685967', 's413574229'] | [2940.0, 3064.0] | [18.0, 17.0] | [9, 351] |
p02761 | u541318412 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['n,m = map(int,input().split())\n\nc = []\nfor i in range(m):\n c.append(list(map(int,input().split())))\n\nmax = 0\nfor i in range(m):\n if c[i][0] >= max:\n max = c[i][0]\n\nans = -1\nfor i in range(pow(10,max-1),pow(10,n)):\n tmp = 0\n for j in range(m):\n if str(i)[c[j][0]-1] == str(c[j][1]):\n tmp += 1\n if tmp == m:\n ans = i\n\nprint(ans) ', 'n,m = map(int,input().split())\n \nc = []\nfor i in range(m):\n c.append(list(map(int,input().split())))\n \nmax = 0\nfor i in range(m):\n if c[i][0] >= max:\n max = c[i][0]\n \nans = -1\nif n == 1:\n tmp = 0\n for i in range(m):\n if c[i][1] == c[0][1]:\n tmp += 1\n if tmp == m:\n ans = c[0][1]\nelse: \n for i in range(pow(10,n-1),pow(10,n)):\n tmp = 0\n for j in range(m):\n if str(i)[c[j][0]-1] == str(c[j][1]):\n tmp += 1\n if tmp == m:\n ans = i\n \nprint(ans) \n', 'n,m = map(int,input().split())\n\nc = []\nfor i in range(m):\n c.append(list(map(int,input().split())))\n\nmax = 0\nfor i in range(m):\n if c[i][0] >= max:\n max = c[i][0]\n\nans = -1\nif n == 1:\n tmp = 0\n for i in range(m):\n if c[i][1] == c[0][1]:\n tmp += 1\n if tmp == m:\n ans = c[0][1]\nelse: \n for i in range(pow(10,max-1),pow(10,n)):\n tmp = 0\n for j in range(m):\n if str(i)[c[j][0]-1] == str(c[j][1]):\n tmp += 1\n if tmp == m:\n ans = i\n\nprint(ans) ', 'n,m = map(int,input().split())\n \nc = []\nfor i in range(m):\n c.append(list(map(int,input().split())))\n \n\nans = -1\nif m == 0:\n ans = pow(10,n-1)\nelif n == 1:\n tmp = 0\n for i in range(m):\n if c[i][1] == c[0][1]:\n tmp += 1\n if tmp == m:\n ans = i\nelse: \n for i in range(pow(10,n-1),pow(10,n)):\n tmp = 0\n for j in range(m):\n if str(i)[c[j][0]-1] == str(c[j][1]):\n tmp += 1\n if tmp == m:\n ans = i\nprint(ans) ', 'n,m = map(int,input().split())\n \nc = []\nfor i in range(m):\n c.append(list(map(int,input().split())))\n \n\nans = -1\nif n == 1 and m == 0:\n ans = 0\nelif m == 0 and n != 1:\n ans = pow(10,n-1)\nelif n == 1:\n tmp = 0\n for i in range(m):\n if c[i][1] == c[0][1]:\n tmp += 1\n if tmp == m:\n ans = c[0][1]\n break\nelse: \n for i in range(pow(10,n-1),pow(10,n)):\n tmp = 0\n for j in range(m):\n if str(i)[c[j][0]-1] == str(c[j][1]):\n tmp += 1\n if tmp == m:\n ans = i\n break\nprint(ans) '] | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s085380763', 's246002170', 's365435046', 's867189968', 's410920980'] | [3064.0, 3064.0, 3192.0, 3064.0, 3064.0] | [19.0, 20.0, 19.0, 19.0, 18.0] | [376, 552, 542, 497, 583] |
p02761 | u541921833 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["N, M = map(int, input().rstrip().split())\nd = {}\nsuccess_flg = True\nfor _ in range(M):\n s, c = map(int, input().rstrip().split())\n if s == 0:\n success_flg = False\n break\n if s > N:\n success_flg = False\n break\n elif s in d.keys() and c != d[s]:\n success_flg = False\n break\n else:\n d[s] = c\nif success_flg:\n tmp_result = '0' * N\n success_flg2 = True\n for s, c in d.items():\n if s == 1 and c == 0:\n success_flg2 = False\n print(-1)\n break\n tmp_result = tmp_result[:s] + str(c) + tmp_result[s + 1:]\n if success_flg2:\n if tmp_result[0] == '0':\n tmp_result = str(1) + tmp_result[1:]\n print(int(tmp_result))\nelse:\n print(-1)\n", "N, M = map(int, input().rstrip().split())\nif N == 0:\n print(-1)\nelse:\n d = {}\n success_flg = True\n for _ in range(M):\n s, c = map(int, input().rstrip().split())\n if s == 0:\n success_flg = False\n break\n if s > N:\n success_flg = False\n break\n elif s in d.keys() and c != d[s]:\n success_flg = False\n break\n else:\n d[s] = c\n if success_flg:\n print(d)\n tmp_result = '0' * N\n success_flg2 = True\n for s, c in d.items():\n if s == 1 and c == 0:\n success_flg2 = False\n print(-1)\n break\n tmp_result = tmp_result[:s - 1] + str(c) + tmp_result[s:]\n if success_flg2:\n if tmp_result[0] == '0':\n tmp_result = str(1) + tmp_result[1:]\n print(int(tmp_result))\n else:\n print(-1)\n", "N, M = map(int, input().rstrip().split())\nif N == 0:\n print(-1)\nelse:\n d = {}\n success_flg = True\n for _ in range(M):\n s, c = map(int, input().rstrip().split())\n if s == 0:\n success_flg = False\n break\n if s > N:\n success_flg = False\n break\n elif s in d.keys() and c != d[s]:\n success_flg = False\n break\n else:\n d[s] = c\n if success_flg:\n tmp_result = '0' * N\n success_flg2 = True\n for s, c in d.items():\n if s == 1 and c == 0 and N != 1:\n success_flg2 = False\n print(-1)\n break\n tmp_result = tmp_result[:s - 1] + str(c) + tmp_result[s:]\n if success_flg2:\n if tmp_result[0] == '0' and N != 1:\n tmp_result = str(1) + tmp_result[1:]\n print(int(tmp_result))\n else:\n print(-1)\n"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s839452929', 's961009933', 's492927230'] | [3064.0, 3064.0, 3064.0] | [18.0, 17.0, 17.0] | [768, 936, 941] |
p02761 | u548525760 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['N, M = map(int, input().split())\n\nans = []\nneg = 0\nfor n in range(N):\n ans.append(-1)\n\nprint(ans)\n\nfor m in range(M):\n s, c = map(int, input().split())\n if ans[s-1] == -1:\n ans[s-1] = c\n elif ans[s-1] == c:\n pass\n else:\n neg = -1\n break\n\nprint(ans)\n\nfor j in range(len(ans)):\n if ans[j] == -1:\n ans[j] = 0\n\nif N == 1:\n pass\nelif ans[0] == 0:\n ans[0] = 1\n\nif neg == -1:\n print(neg)\nelse:\n print("".join([str(i) for i in ans]))', 'N, M = map(int, input().split())\n\nans = []\nneg = 0\nfor n in range(N):\n ans.append(-1)\n\nfor m in range(M):\n s, c = map(int, input().split())\n if ans[s-1] == -1:\n ans[s-1] = c\n elif ans[s-1] == c:\n pass\n else:\n neg = -1\n break\n\nif ans[0] == 0 and N != 1:\n neg = -1\n\nfor j in range(len(ans)):\n if ans[j] == -1:\n ans[j] = 0\n\nif N == 1:\n pass\n\nelif ans[0] == 0:\n ans[0] = 1\n\nif neg == -1:\n print(neg)\nelse:\n print("".join([str(i) for i in ans]))'] | ['Wrong Answer', 'Accepted'] | ['s226299679', 's849511297'] | [9240.0, 9236.0] | [29.0, 27.0] | [450, 466] |
p02761 | u549278479 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['# input\nN, M = map(int, input().split())\ns = [0]*M\nc = [0]*M\n\nif(M==0 and N==1):\n print("0")\nelif(M==0 and N>1):\n ans_print = "1"\n for i in range(N-1):\n ans_print += "0"\n print(ans_print)\nelse:\n for i in range(M):\n s[i], c[i] = map(int, input().split())\n\n ans = [-1]*N\n b = True\n\n for i in range(M):\n if(ans[s[i]-1] != -1 and ans[s[i]-1] != c[i]):\n b = False\n else:\n ans[s[i]-1] = c[i]\n\n for i in range(len(ans)):\n if(i==0):\n ans[i] = 1\n elif(ans[i] == -1):\n ans[i] = 0\n \n if(N>1 and ans[0]==0):\n b = False\n \n if(b):\n ans_print = ""\n for i in range(len(ans)):\n ans_print += str(ans[i])\n print(ans_print)\n else:\n print("-1")', '# input\nN, M = map(int, input().split())\ns = [0]*M\nc = [0]*M\n\nif(M==0 and N==1):\n print("0")\nelif(M==0 and N>1):\n ans_print = "1"\n for i in range(N-1):\n ans_print += "0"\n print(ans_print)\nelse:\n for i in range(M):\n s[i], c[i] = map(int, input().split())\n\n ans = [-1]*N\n b = True\n\n for i in range(M):\n if(ans[s[i]-1] != -1 and ans[s[i]-1] != c[i]):\n b = False\n else:\n ans[s[i]-1] = c[i]\n\n for i in range(len(ans)):\n if(i==0 and ans[i]==-1):\n ans[i] = 1\n elif(ans[i] == -1):\n ans[i] = 0\n \n if(N > 1 and ans[0]==0):\n b = False\n \n if(b):\n ans_print = ""\n for i in range(len(ans)):\n ans_print += str(ans[i])\n print(ans_print)\n else:\n print("-1")'] | ['Wrong Answer', 'Accepted'] | ['s142282167', 's592370675'] | [3064.0, 3188.0] | [18.0, 19.0] | [801, 818] |
p02761 | u549383771 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['import numpy as np\nN,M,K = map(int,input().split())\nanswer_list = [0]*N\nfrend_list = [[0] * N for i in range(N)]\nflag_list = [0]*N\nfor i in range(M):\n num_list= list(map(int,input().split()))\n frend_list[num_list[0]-1][num_list[1]-1] = 1\n frend_list[num_list[1]-1][num_list[0]-1] = 1\n\nfor i in range(K):\n num_list= list(map(int,input().split()))\n frend_list[num_list[0]-1][num_list[1]-1] = 3\n frend_list[num_list[1]-1][num_list[0]-1] = 3\n \n \nfor i in range(len(answer_list)):\n for n in range(len(frend_list[i])):\n if (frend_list[i][n] == 0) & (i != n):\n flag_list = (np.array(frend_list[n])+np.array(frend_list[i]))\n flag_list = flag_list.tolist()\n for g in flag_list:\n if g == 2:\n answer_list[i] += 1\nprint(answer_list)', 'N,M = map(int,input().split())\nflag = True\nanswer = [0]*N\nif len(answer) != 1:\n answer[0] = 1\nchange_list = [0]*N\nanswer_num = 0\nfor i in range(M):\n num_list = list(map(int,input().split()))\n if change_list[num_list[0]-1] == 0:\n answer[num_list[0]-1] = num_list[1]\n change_list[num_list[0]-1] = 1\n else:\n if answer[num_list[0]-1] == num_list[1]:\n continue\n else:\n flag = False\n\nif flag == False:\n print(-1)\n\nelif (answer[0] == 0)&(len(answer) != 1):\n print(-1)\nelse:\n for i in range(len(answer)):\n answer_num += 10**(len(answer) - (i+1))*answer[i]\n print(answer_num)'] | ['Runtime Error', 'Accepted'] | ['s258500734', 's749585794'] | [12416.0, 3064.0] | [151.0, 20.0] | [821, 647] |
p02761 | u549494450 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['a = input().split(" ")\nN = int(a[0])\nM = int(a[1])\nans1 = 10\nans2 = 10\nans3 = 10\nfor i in range(M):\n b = input().split(" ")\n c = int(b[0])\n d = int(b[1])\n if c == 1:\n if d == 0:\n if N == 1:\n ans1 = d:\n elif d < ans1:\n ans1 = d\n elif c == 2:\n if d < ans2:\n ans2 = d\n else:\n if d < ans3:\n ans3 = d\nif ans1 == 10:\n ans1 = 0\nif ans2 == 10:\n ans2 = 0\nif ans3 == 10:\n ans3 = 0\nif N == 1:\n print(ans1)\nelif N == 2:\n if ans1 == 0:\n print(-1)\n else:\n print(str(ans1) + str(ans2))\nelse:\n if ans1 == 0:\n print(-1)\n else:\n print(str(ans1) + str(ans2) + str(ans3))', 'a = input().split(" ")\nN = int(a[0])\nM = int(a[1])\nans1 = 10\nans2 = 10\nans3 = 10\nx = 0\nfor i in range(M):\n b = input().split(" ")\n c = int(b[0])\n d = int(b[1])\n if c == 1:\n if d == 0:\n if N == 1:\n ans1 = 0\n else:\n x = 1\n elif ans1 == 10:\n ans1 = d\n elif ans1 != d:\n x = 1\n elif c == 2:\n if ans2 == 10:\n ans2 = d\n elif ans2 != d:\n x = 1\n else:\n if ans3 == 10:\n ans3 = d\n elif ans3 != d:\n x = 1\nif ans1 == 10:\n ans1 = 0\nif ans2 == 10:\n ans2 = 0\nif ans3 == 10:\n ans3 = 0\n\nif x = 1:\n print(-1)\nelse:\n if N == 1:\n print(ans1)\n elif N == 2:\n if ans1 == 0:\n print(-1)\n else:\n print(str(ans1) + str(ans2))\n else:\n if ans1 == 0:\n print(-1)\n else:\n print(str(ans1) + str(ans2) + str(ans3))', 'a = input().split(" ")\nN = int(a[0])\nM = int(a[1])\nans1 = 10\nans2 = 10\nans3 = 10\nx = 0\nfor i in range(M):\n b = input().split(" ")\n c = int(b[0])\n d = int(b[1])\n if c == 1:\n if ans1 == 10:\n if d == 0:\n if N == 1:\n ans1 = 0\n else:\n x = 1\n else:\n ans1 = d\n elif ans1 != d:\n x = 1\n elif c == 2:\n if ans2 == 10:\n ans2 = d\n elif ans2 != d:\n x = 1\n else:\n if ans3 == 10:\n ans3 = d\n elif ans3 != d:\n x = 1\nif ans1 == 10:\n if N == 1:\n ans1 = 0\n else:\n ans1 = 1\nif ans2 == 10:\n ans2 = 0\nif ans3 == 10:\n ans3 = 0\n\nif x == 1:\n print(-1)\nelse:\n if N == 1:\n print(ans1)\n elif N == 2:\n if ans1 == 0:\n print(-1)\n else:\n print(str(ans1) + str(ans2))\n else:\n if ans1 == 0:\n print(-1)\n else:\n print(str(ans1) + str(ans2) + str(ans3))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s022237492', 's938513417', 's880055672'] | [2940.0, 3064.0, 3064.0] | [17.0, 17.0, 18.0] | [708, 964, 1051] |
p02761 | u552143188 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["N,M = map(int,input().split())\ns = []\nc = []\nfor i in range(M):\n s1,c1=[int(i) for i in input().split()]\n s.append(s1)\n c.append(c1)\n\nans = [10 for i in range(N)]\nx = ''\n\nfor j in range(M):\n if ans[s[j]-1] == 10:\n ans[s[j]-1] = c[j]\n elif ans[s[j]-1] != 10 and ans[s[j]-1] != c[j]:\n print('-1')\n exit()\n \nfor k in range(N):\n if ans[k] == 10:\n ans[k] = 0\nif N == 1:\n for l in range(N):\n x += str(ans[l])\n print(x)\n exit()\nelse:\n if ans[0] == 0 :\n print('-1')\n else :\n for l in range(N):\n x += str(ans[l])\n print(x)\n ", "N,M = map(int,input().split())\ns = []\nc = []\nfor i in range(M):\n s1,c1=[int(i) for i in input().split()]\n s.append(s1)\n c.append(c1)\n\nans = [10 for i in range(N)]\nx = ''\n\nfor j in range(M):\n if ans[s[j]-1] == 10:\n ans[s[j]-1] = c[j]\n elif ans[s[j]-1] != 10 and ans[s[j]-1] != c[j]:\n print('-1')\n exit()\n \nfor k in range(N):\n if ans[k] == 10:\n ans[k] = 0\nif N == 1:\n for l in range(N):\n x += str(ans[l])\n print(x)\n exit()\nelse:\n if ans[0] == 0 :\n print('-1')\n else :\n for l in range(N):\n x += str(ans[l])\n print(x)\n \n ", "N,M = map(int,input().split())\ns = []\nc = []\nfor i in range(M):\n s1,c1=[int(i) for i in input().split()]\n s.append(s1)\n c.append(c1)\n\nans = [10 for i in range(N)]\nx = ''\n\nfor j in range(M):\n if ans[s[j]-1] == 10:\n ans[s[j]-1] = c[j]\n elif ans[s[j]-1] != 10 and ans[s[j]-1] != c[j]:\n print('-1')\n exit()\n \nfor k in range(N):\n if k == 0 and ans[k] == 10 and N != 1:\n ans[k] = 1\n elif k == 0 and ans[k] == 10 and N == 1:\n ans[k] = 0\n elif ans[k] == 10:\n ans[k] = 0\nif N == 1:\n print(ans[0])\n exit()\nelse:\n if ans[0] == 0 :\n print('-1')\n else :\n for l in range(N):\n x += str(ans[l])\n print(x)\n\n"] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s126650935', 's285928177', 's286804082'] | [3188.0, 3064.0, 3064.0] | [19.0, 17.0, 17.0] | [572, 561, 644] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.