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 | u054825571 | 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())\np=True\nl=[-1 for _ in range(N)]\nfor i in range(M):\n s,c=map(int,input().split())\n if l[s-1] == -1:\n l[s-1] = c\n elif not l[s-1]==c:\n p=False\nif p:\n ans=""\n if l[0]==0:\n p=False\n elif l[0]==-1:\n if len(l)==1:\n ans="0"\n else:\n ans="1"\n else:\n ans=str(l[0])\n for i in l[1:]:\n if i == -1:\n ans+="0"\n else:\n ans+=str(i)\nprint(int(ans) if p else -1)\nprint(l)', 'N,M=map(int,input().split())\np=True\nl=[-1 for _ in range(N)]\nfor i in range(M):\n s,c=map(int,input().split())\n if l[s-1] == -1:\n l[s-1] = c\n elif not l[s-1]==c:\n p=False\nif p:\n ans=""\n if len(l) == 1:\n if l[0] == -1:\n ans = "0"\n else:\n ans = str(l[0])\n elif l[0]==0:\n p=False\n elif l[0]==-1:\n ans="1"\n else:\n ans=str(l[0])\n for i in l[1:]:\n if i == -1:\n ans+="0"\n else:\n ans+=str(i)\nprint(int(ans) if p else -1)'] | ['Wrong Answer', 'Accepted'] | ['s432660573', 's758406918'] | [9232.0, 9240.0] | [30.0, 26.0] | [433, 467] |
p02761 | u054931633 | 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\ndef get_unique_list(seq):\n seen = []\n return [x for x in seq if x not in seen and not seen.append(x)]\n\nn,m = map(int,input().split())\nl = [list(map(int,input().split())) for _ in range(m)]\nd = {}\nfor i in l:\n if i[0] in d and d[i[0]] != i[0]:\n d[i[0]] += 1\n print("-1")\n sys.exit()\n else:\n d[i[0]] =i[1]\n\n\n\nl = get_unique_list(l) \nl.sort() \nd = 0\nif l[0][1]==0 and l[0][0]==1: \n if n ==1: \n print("0")\n sys.exit()\n else:\n print("-1")\n sys.exit()\n \nif l[0][0]!=1: \n d = 10**(n-1)\n for i in l:\n d += int(i[1])*10**(n-int(i[0]))\n \nelse:\n for i in l:\n d += i[1]*10**(n-i[0]) \n\nprint(d)', 'import sys\ndef get_unique_list(seq):\n seen = []\n return [x for x in seq if x not in seen and not seen.append(x)]\n\nn,m = map(int,input().split())\nl = [list(map(int,input().split())) for _ in range(m)]\nd = {}\nif m == 0 and n != 0:\n print(10**(n-1))\n sys.exit()\nif m = =0 and n == 0:\n print("0")\n \nfor i in l:\n if i[0] in d and i[1] !=d[i[0]]:\n d[i[0]] += 1\n print("-1")\n sys.exit()\n else:\n d[i[0]] =i[1]\n\n\nl = get_unique_list(l) \nl.sort() \nd = 0\nif l[0][1]==0 and l[0][0]==1: \n if n ==1: \n print("0")\n sys.exit()\n else:\n print("-1")\n sys.exit()\n \nif l[0][0]!=1: \n d = 10**(n-1)\n for i in l:\n d += i[1]*10**(n-i[0])\n \nelse:\n for i in l:\n d += i[1]*10**(n-i[0]) \n\nprint(d)', 'import sys\ndef get_unique_list(seq):\n seen = []\n return [x for x in seq if x not in seen and not seen.append(x)]\n\nn,m = map(int,input().split())\nl = [list(map(int,input().split())) for _ in range(m)]\nd = {}\nif m == 0 and n != 1:\n print(10**(n-1))\n sys.exit()\nif m == 0 and n == 1:\n print("0")\n sys.exit()\n \nfor i in l:\n if i[0] in d and i[1] !=d[i[0]]:\n d[i[0]] += 1\n print("-1")\n sys.exit()\n else:\n d[i[0]] =i[1]\n\n\nl = get_unique_list(l) \nl.sort() \nd = 0\nif l[0][1]==0 and l[0][0]==1: \n if n ==1: \n print("0")\n sys.exit()\n else:\n print("-1")\n sys.exit()\n \nif l[0][0]!=1: \n d = 10**(n-1)\n for i in l:\n d += i[1]*10**(n-i[0])\n \nelse:\n for i in l:\n d += i[1]*10**(n-i[0]) \n\nprint(d)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s492503283', 's766170477', 's014665672'] | [3064.0, 2940.0, 3064.0] | [18.0, 17.0, 18.0] | [864, 953, 968] |
p02761 | u057079894 | 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())\n#s = input()\n#n, k= map(int,input().split())\n#da = list(map(int,input().split()))\n\nn,m = map(int,input().split())\nda = [list(map(int,input().split())) for i in range(m)]\n\nans = -1\nfor i in range(10**(n)):\n now = str(i)\n ju = True\n for j in range(m):\n if len(now) < da[j][0]:\n ju = False\n break\n if now[da[j][0]-1] != str(da[j][1]):\n ju= False\n if ju and len(str(ans)) == n:\n ans = i\n break\n\nprint(ans)', '# n = int(input())\n\nn, m = map(int,input().split())\n\n\nda = [list(map(int,input().split())) for i in range(m)]\n\ndef ch(x):\n k = len(x)\n if n!=k: return False\n for i in range(m):\n if k < da[i][0]:\n return False\n if x[da[i][0]-1] != str(da[i][1]):\n return False\n return True\n\ndef solve():\n for i in range(10**n):\n if(ch(str(i))):\n print(i)\n return\n print(-1)\n return\n\nsolve()'] | ['Wrong Answer', 'Accepted'] | ['s942761555', 's607870008'] | [3064.0, 3188.0] | [20.0, 18.0] | [492, 546] |
p02761 | u057668615 | 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()))\nins = True\nans = [0]*N\nok = True\nfor i in range(M):\n s, c = list(map(int, input().split()))\n if s==1 and c==0:\n ok = False\n if ans[s-1]==0 or ans[s-1]==c:\n ans[s-1] = c\n else:\n ok = False\n if s == 1:\n ins = True\n else:\n ins = False\nanswer = []\nif ok == True:\n for i in range(len(ans)):\n answer.append(str(ans[i]))\n if ins==False:\n answer[0]='1'\n print(answer)\n print(''.join(answer))\nelse:\n print('-1')", "ins = False\nans = [0]*N\nok = True\nfor i in range(M):\n s, c = list(map(int, input().split()))\n if N != 1 and s==1 and c==0:\n ok = False\n if ans[s-1]==0 or ans[s-1]==c:\n ans[s-1] = c\n else:\n ok = False\n if s == 1:\n ins = True\n else:\n ins = False\nanswer = []\nif ok == True:\n for i in range(len(ans)):\n answer.append(str(ans[i]))\n if N != 1 and ins==False:\n answer[0]='1'\n if N == 1 and M == 0:\n print(0)\n else:\n print(''.join(answer))\nelse:\n print('-1')\n", "\n#C\nN, M = list(map(int, input().split()))\nins = False\nans = [0]*N\nok = True\nfor i in range(M):\n s, c = list(map(int, input().split()))\n if N != 1 and s==1 and c==0:\n ok = False\n if ans[s-1]==0 or ans[s-1]==c:\n ans[s-1] = c\n else:\n ok = False\n if s == 1:\n ins = True\n else:\n ins = False\nanswer = []\nif ok == True:\n for i in range(len(ans)):\n answer.append(str(ans[i]))\n #if N != 1 and ins==False:\n if N != 1 and answer[0]=='0':\n answer[0]='1'\n if N == 1 and M == 0:\n print(0)\n else:\n print(''.join(answer))\nelse:\n print('-1')\n"] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s464111169', 's680990208', 's124573227'] | [3192.0, 3064.0, 3064.0] | [17.0, 17.0, 17.0] | [523, 547, 625] |
p02761 | u057993957 | 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()))\nsc = [list(map(int,input().split())) for i in range(m)]\n\nfor i in range(0, 10**n):\n str_i = str(i)\n if len(str_i) != n: continue\n\n chk = True\n for s, c in sc:\n cnt &= str_i[s-1] == str(c)\n if chk:\n print(i)\n exit()\n\n print(-1)\n ', 'n, m = list(map(int, input().split()))\nsc = [list(map(int,input().split())) for i in range(m)]\n\nfor i in range(0, 10**n):\n str_i = str(i)\n if len(str_i) != n: continue\n\n chk = True\n for s, c in sc:\n if str_i[s-1] == c:\n cnt &= str_i[s-1] == str(c)\n if chk:\n print(i)\n exit()\n\n print(-1)\n \n \n ', 'n, m = list(map(int, input().split()))\nsc = [list(map(int,input().split())) for i in range(m)]\n\nfor i in range(0, 10**n):\n str_i = str(i)\n if len(str_i) != n: continue\n\n chk = True\n for s, c in sc:\n chk &= str_i[s-1] == str(c)\n if chk:\n print(i)\n exit()\n\nprint(-1)\n \n \n '] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s047653033', 's850282901', 's172064053'] | [3060.0, 3188.0, 3060.0] | [18.0, 19.0, 18.0] | [286, 320, 292] |
p02761 | u060432908 | 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 i in range(n)]\nflag=[False for i in range(n)]\ns=[]\nc=[]\nfor i in range(m):\n si,ci=map(int,input().split())\n s.append(si)\n c.append(ci)\n\ndef ans():\n for i in range(m):\n if s[i]-1==0 and c[i]==0:\n continue\n if !flag[s[i]-1]:\n num[s[i]-1]=c[i]\n flag=True\n else:\n num[s[i]-1]=min(c[i],num[s[i]-1])\n if n!=1 and num[0]==0:\n print(-1)\n return\n for i in range(n):\n print(num[i],end="")\n print()\n\nans()', "def main():\n I=lambda:input()\n L=lambda:list(map(int,input().split()))\n n,m=L()\n sc=[]\n for i in range(m):\n si,ci=L()\n sc.append([si,ci])\n mini=0 if n==1 else 10**(n-1)\n for i in range(mini,10**n):\n tmp=str(i)\n flag=True\n for j in range(m):\n if tmp[sc[j][0]-1]!=str(sc[j][1]):\n flag=False\n if flag:\n print(i)\n exit()\n print(-1)\n \n \n \nif __name__ == '__main__':\n main()"] | ['Runtime Error', 'Accepted'] | ['s968537020', 's841649350'] | [2940.0, 3064.0] | [17.0, 18.0] | [541, 498] |
p02761 | u060694763 | 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()))\n\nnumlist = ['-'] * N\nfor m in range(M):\n s, c = list(map(int, input().split()))\n if numlist[s - 1] == '-':\n numlist[s - 1] = c\n else:\n if numlist[s - 1] == c:\n print(-1)\n sys.exit(0)\n\n\nif numlist[0] == '-' or numlist[0] == 0:\n if N == 1:\n answer = 0\n else:\n answer = -1\nelse:\n strlist = []\n for num in numlist:\n num = 0 if num == '-' else num\n strlist.append(str(num))\n answer = ''.join(strlist)\nprint(answer)\n", "N, M = list(map(int, input().split()))\n\nnumlist = [-1] * N\nexist = True\nfor m in range(M):\n s, c = list(map(int, input().split()))\n if numlist[s - 1] == -1:\n numlist[s - 1] = c\n else:\n if numlist[s - 1] != c:\n exist = False\n break\n\nif numlist[0] == 0 and len(numlist) > 1:\n exist = False\nelif numlist[0] == -1 and len(numlist) > 1:\n numlist[0] = 1\nelif numlist[0] == -1 and len(numlist) == 1:\n numlist[0] = 0\nif exist:\n ans = [0 if i == -1 else i for i in numlist]\n print(''.join([str(i) for i in ans]))\nelse:\n print(-1)\n"] | ['Wrong Answer', 'Accepted'] | ['s850212775', 's441476941'] | [3064.0, 3064.0] | [23.0, 17.0] | [548, 584] |
p02761 | u064571674 | 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 Counter\n\nn,m = map(int,input().split())\nl1 = []\n\nfor i in range(m):\n l1.append(list(map(int,input().split())))\n\nl1 = list(set(list(map(tuple, l1))))\n\nans = ''\nfor i in range(len(l1)):\n for j in range(len(l1)):\n if i < j:\n if l1[i][0] == l1[j][0]:\n ans = -1\n \nif n > 1:\n for i in range(len(l1)):\n if l1[i][0] == 1 and l1[i][1] == 0:\n ans = -1\nif not ans == -1:\n for i in range(1,n+1):\n new = ''\n for j in range(len(l1)):\n if i == l1[j][0]:\n new = str(l1[j][1])\n if len(new) == 0:\n new = '1'\n ans = ans + new\nprint(ans)\n ", "from collections import Counter\n\nn,m = map(int,input().split())\nl1 = []\n\nfor i in range(m):\n l1.append(list(map(int,input().split())))\n\nl1 = list(set(list(map(tuple, l1))))\n\nans = ''\nfor i in range(len(l1)):\n for j in range(len(l1)):\n if i < j:\n if l1[i][0] == l1[j][0]:\n ans = -1\n \nif n > 1:\n for i in range(len(l1)):\n if l1[i][0] == 1 and l1[i][1] == 0:\n ans = -1\n \nif not ans == -1:\n for i in range(1,n+1):\n new = ''\n for j in range(len(l1)):\n if i == l1[j][0]:\n new = str(l1[j][1])\n if len(new) == 0:\n if i == 1 and n != 1:\n new = '1'\n else:\n new = '0'\n ans = ans + new\nprint(ans)\n "] | ['Wrong Answer', 'Accepted'] | ['s293233466', 's322718566'] | [3316.0, 3444.0] | [21.0, 25.0] | [689, 784] |
p02761 | u067694718 | 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()]\nsc = [[int(i) for i in input().split()] for j in range(m)]\n\nfor i in range(900):\n result = True\n num = str(100 + i)\n for j in range(m):\n s, c = sc[j]\n if not num[s - 1] == c:\n result = False\n break\n if(result):\n print(int(num))\n exit()\nprint(-1)\n', 'n, m = [int(i) for i in input().split()]\ns = []\nc = []\nfor i in range(m):\n tmp = [int(j) for j in input().split()]\n s.append(tmp[0])\n c.append(tmp[1])\n\nfor i in range(10 ** (n - 1) - int(n == 1) ,10 ** n):\n status = True\n for j in range(m):\n if(str(i)[s[j] - 1] != str(c[j])):\n status = False\n if(status):\n print(i)\n exit()\nprint(-1)\n'] | ['Wrong Answer', 'Accepted'] | ['s993404021', 's184695775'] | [3060.0, 3064.0] | [18.0, 18.0] | [349, 384] |
p02761 | u074372598 | 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 N, M = map(int, input().split())\n d = {}\n for _ in range(M):\n s, c = map(int, input().split())\n if s == 1 and c==0:\n print('-1')\n return\n if s in d and d[s] != c:\n print('-1')\n return\n if s > N:\n print('-1')\n return\n\n s = ''\n if N == 1:\n if 1 in d:\n print(d[1])\n else:\n print('0')\n else:\n for n in range(1, N+1):\n if n in d:\n s += str(d[n])\n else:\n if n==1:\n s+= '1'\n else:\n s += '0'\n print(s)\n \nmain()", "def main():\n N, M = map(int, input().split())\n d = {}\n for _ in range(M):\n s, c = map(int, input().split())\n if s == 1 and c==0 and N > 1:\n print('-1')\n return\n if s in d and d[s] != c:\n print('-1')\n return\n if s > N:\n print('-1')\n return\n d[s] = c\n\n s = ''\n if N == 1:\n if 1 in d:\n s += str(d[1])\n else:\n s += '0'\n else:\n for n in range(1, N+1):\n if n in d:\n s += str(d[n])\n else:\n if n==1:\n s += '1'\n else:\n s += '0'\n print(s) \n\nmain()"] | ['Wrong Answer', 'Accepted'] | ['s680401749', 's142796438'] | [3064.0, 3064.0] | [17.0, 17.0] | [689, 707] |
p02761 | u075303794 | 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=['0']*N\nI=[]\nfor _ in range(M):\n s,c=input().split()\n index=int(s)-1\n if index==0 and N!=1 and c=='0':\n print(-1)\n break\n if index in I and ans[index]!=c:\n print(-1)\n break\n ans[index]=c\n I.append(index)\n \n ", "N,M=map(int,input().split())\nans=['0']*N\nI=[]\nfor _ in range(M):\n s,c=input().split()\n index=int(s)-1\n if index==0 and N>1 and c=='0':\n print(-1)\n break\n if index in I and ans[index]!=c:\n print(-1)\n break\n ans[index]=c\n I.append(index)\nelse:\n if 0 not in I and N>1:\n ans[0]='1'\n print(''.join(ans))"] | ['Wrong Answer', 'Accepted'] | ['s082170972', 's315169776'] | [9176.0, 9124.0] | [33.0, 28.0] | [260, 321] |
p02761 | u079022693 | 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\ndef main():\n \n readline=stdin.readline\n N,M=map(int,readline().split())\n s=[0]*M\n c=[0]*M\n for i in range(M):\n a,b=map(int,readline().split())\n s[i]=a\n c[i]=b\n\n for n in range(10**N):\n n=str(n)\n for i in range(M):\n if len(n)<s[i]:\n break\n else:\n if n[s[i]-1]!=c[i]:\n break\n print(n)\n break\n else:\n print(-1)\nif __name__=="__main__":\n main()', 'from sys import stdin\ndef main():\n \n readline=stdin.readline\n N,M=map(int,readline().split())\n s=[0]*M\n c=[0]*M\n for i in range(M):\n a,b=map(int,readline().split())\n s[i]=a\n c[i]=b\n\n for n in range(10**N):\n n=str(n)\n if len(n)!=N:\n continue\n for i in range(M):\n if n[s[i]-1]!=str(c[i]):\n break\n else:\n print(n)\n break\n else:\n print(-1)\nif __name__=="__main__":\n main()'] | ['Wrong Answer', 'Accepted'] | ['s161837916', 's972420603'] | [3064.0, 3064.0] | [18.0, 19.0] | [523, 517] |
p02761 | u081445185 | 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 int_values(slr):\n l, r = map(lambda s: int(s), slr)\n return l, r\n\n\ndef conv_digits(N, digits):\n for i in range(N):\n if digits[i] is None:\n digits[i] = \'0\' if i == 0 and N == 1 else \'1\'\n\n return \'\'.join(digits)\n\n\ndef main():\n N, M = int_values(input().split())\n digits = [None] * N\n valid = True\n\n for i in range(M):\n ss = input().split()\n s = int(ss[0])\n c = ss[1]\n if s == 1 and c == \'0\':\n valid = False\n elif digits[s - 1] is None:\n digits[s - 1] = c\n else:\n valid = digits[s - 1] == c\n\n if valid:\n print(conv_digits(N, digits))\n else:\n print(\'-1\')\n\n\nif __name__ == "__main__":\n main()\n', 'def int_values(slr):\n l, r = map(lambda s: int(s), slr)\n return l, r\n\n\ndef comp_digits(digits):\n if digits[0] is None:\n digits[0] = \'1\'\n\n for i in range(1, len(digits)):\n if digits[i] is None:\n digits[i] = \'0\'\n\n\ndef main():\n N, M = int_values(input().split())\n digits = [None] * N\n valid = True\n\n for i in range(M):\n ss = input().split()\n s = int(ss[0])\n c = ss[1]\n if (s == 1 and c == 0) or (digits[s - 1] is not None):\n valid = False\n else:\n digits[s - 1] = c\n\n if valid:\n comp_digits(digits)\n print(\'\'.join(digits))\n else:\n print(\'-1\')\n\n\nif __name__ == "__main__":\n main()\n', 'def int_values(slr):\n l, r = map(lambda s: int(s), slr)\n return l, r\n\n\ndef conv_digits(N, digits):\n for i in range(N):\n if digits[i] is None:\n digits[i] = \'0\' if i > 0 or N == 1 else \'1\'\n\n return \'\'.join(digits)\n\n\ndef main():\n N, M = int_values(input().split())\n digits = [None] * N\n valid = True\n\n for i in range(M):\n ss = input().split()\n s = int(ss[0])\n c = ss[1]\n if N > 1 and s == 1 and c == \'0\':\n valid = False\n elif digits[s - 1] is None:\n digits[s - 1] = c\n else:\n valid = digits[s - 1] == c\n\n if valid:\n print(conv_digits(N, digits))\n else:\n print(\'-1\')\n\n\nif __name__ == "__main__":\n main()\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s827412559', 's831803753', 's448960946'] | [3064.0, 3064.0, 3064.0] | [17.0, 17.0, 18.0] | [732, 712, 740] |
p02761 | u089925107 | 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())\ncc = [list(map(int, input().split())) for i in range(M)]\nif [0,1] in cc:\n if N!= 1:\n print(-1)\n sys.exit()\na,b = [0]*N,['v']*N\nfor [i,j] in cc:\n a[i-1] = j\n if b[i-1] != 'v' or b[i-1] != j:\n print(-1)\n sys.exit\n b[i-1] = j\nif a[0] = 0:\n a[0] = 1\nc = ''\nfor i in a:\n c = c + str(i)\nprint(c)\n \n \n ", "import sys\nN,M = map(int,input().split())\ncc = [list(map(int, input().split())) for i in range(M)]\nif [1,0] in cc:\n if N!= 1:\n print(-1)\n sys.exit()\na,b = [0]*N,['v']*N\nfor [i,j] in cc:\n a[i-1] = j\n if b[i-1] != 'v' and b[i-1] != j:\n print(-1)\n sys.exit()\n b[i-1] = j\nif a[0] == 0:\n if N != 1:\n a[0] = 1\nc = ''\nfor i in a:\n c = c + str(i)\nprint(c)"] | ['Runtime Error', 'Accepted'] | ['s624912932', 's877000692'] | [8936.0, 9132.0] | [26.0, 29.0] | [360, 368] |
p02761 | u091307273 | 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 n, m = list(map(int, input().split()))\n dcon = [set() for _ in range(n)]\n for _ in range(m):\n s, c = tuple(map(int, input().split()))\n dcon[s-1].add(c)\n\n if any(len(d) > 1 for d in dcon):\n print(-1)\n return\n \n digits = [0] if n == 1 else [1] + [0] * (n-1)\n for i in range(n):\n if d:\n digits[i] = d.pop()\n\n print(''.join(map(str, digits)))\n\nmain()\n", "def main():\n n, m = list(map(int, input().split()))\n dcon = [set() for _ in range(n)]\n for _ in range(m):\n s, c = tuple(map(int, input().split()))\n dcon[s-1].add(c)\n\n if any(len(d) > 1 for d in dcon):\n print(-1)\n return\n \n # populate the digits with the constrained digit, if it exists,\n # or the minimum possible digit. the min possible digit is\n # 1 if it's the leading digit, or zero otherwise\n digits = [d.pop() if d else 0 + int(i == 0) for i, d in enumerate(dcon)]\n\n if digit[0] == 0:\n print(-1)\n else:\n print(''.join(map(str, digits)))\n\nmain()\n", "def main():\n n, m = list(map(int, input().split()))\n dcon = [set() for _ in range(n)]\n for _ in range(m):\n s, c = tuple(map(int, input().split()))\n dcon[s-1].add(c)\n\n if any(len(d) > 1 for d in dcon):\n print(-1)\n return\n \n digits = [0] if n == 1 else [1] + [0] * (n-1)\n for i in range(n):\n if dcon[i]:\n digits[i] = dcon[i].pop()\n\n if digits[0] == 0 and n != 1:\n print(-1)\n\n else:\n print(''.join(map(str, digits)))\n\nmain()\n"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s023006108', 's390456239', 's894367261'] | [9040.0, 9080.0, 9200.0] | [26.0, 25.0, 32.0] | [430, 627, 509] |
p02761 | u093783313 | 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 \nm = []\nfor i in range(M):\n m.append(list(map(int,input().split())))\nfor i in range(10**N):\n a = str(i)\n \n if i >= 10**(N-1):\n \n for j in range(M):\n try:\n \n if a[m[j][0]-1] == str(m[j][1]):\n True\n \n else:\n break\n except:\n break\n \n if j == M-1:\n print(i)\n exit() \nif M==0:\n if N == 1:\n print(0)\n else:\n print(10**(N-1))\n \nif M==1:\n if N == 1:\n if m == [[1,0]]\n print(0)\n exit()\n \nelse :\n print(-1)', 'N,M = map(int,input().split())\n \nm = []\nfor i in range(M):\n m.append(list(map(int,input().split())))\nfor i in range(10**N):\n a = str(i)\n \n if i >= 10**(N-1):\n \n for j in range(M):\n try:\n \n if a[m[j][0]-1] == str(m[j][1]):\n True\n \n else:\n break\n except:\n break\n \n if j == M-1:\n print(i)\n exit()\n \nif M==0:\n if N == 1:\n print(0)\n else:\n print(10**(N-1))\n \nif M==1:\n if N == 1:\n if m == [[1,0]]\n print(0)\n exit()\n \nelse :\n print(-1)', 'N,M = map(int,input().split())\n \nm = []\nfor i in range(M):\n m.append(list(map(int,input().split())))\nfor i in range(10**N):\n a = str(i)\n \n if i >= 10**(N-1):\n \n for j in range(M):\n try:\n \n if a[m[j][0]-1] == str(m[j][1]):\n True\n \n else:\n break\n except:\n break\n \n if j == M-1:\n print(i)\n exit()\n \nif M==0:\n if N == 1:\n print(0)\n \n else:\n print(10**(N-1))\n \n exit()\n\nelif M==1:\n if N == 1:\n m == [[1,0]]\n print(0)\n exit()\n\n\nprint(-1)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s033031460', 's169385806', 's174946753'] | [3064.0, 3064.0, 3064.0] | [18.0, 18.0, 19.0] | [718, 734, 728] |
p02761 | u094425865 | 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())\nif m == 0:\n print('-1')\n sys.exit()\na = []\nwk =[]\nkai = 0\nfor i in range(m):\n wk = (list(map(int,input().split())))\n if wk in a:\n m -= 1\n else:\n a.append(wk)\n\na.sort()\n\nif a[m-1][0] != 1 or a[m-1][1] == 0:\n print('-1')\n sys.exit()\nfor i in range(m):\n if a[i][0]==n and a[i][1]==0:\n print('-1')\n sys.exit()\nfor i in range(m-1):\n if a[i][0] == a[i+1][0]:\n print('-1')\n sys.exit()\n\nfor i in range(m):\n kai += (10**(n-a[i][0]))*a[i][1]\n\nprint(kai)", "import sys\n\ndef ans(anl,n):\n an = 0\n for i in range(n):\n an += 10**(n-i-1)*anl[i]\n return(an)\n\nn,m = map(int,input().split())\nsc = [list(map(int,input().split())) for i in range(m)]\n\nsc.sort(key=lambda x:x[0])\nsc.sort()\nanl =[0 for i in range(n)]\nanl[0] = 1\n\nif m == 0:\n if n == 1:\n print(0)\n sys.exit()\n else:\n print(10**(n-1))\n sys.exit()\nif m == 1:\n if sc[0][1] == 0 and n == 1:\n print(0)\n sys.exit()\n anl[sc[0][0]-1] = sc[0][1]\n if anl[0] == 0:\n print('-1')\n sys.exit()\n print(ans(anl,n))\n sys.exit()\n\nfor i in range(m):\n for j in range(1,m):\n if sc[i][0] == sc[j][0] and sc[i][1]!=sc[j][1]:\n print('-1')\n sys.exit()\n else:\n anl[sc[i][0]-1] = sc[i][1]\n\nif anl[0] == 0:\n print('-1')\n sys.exit()\n\nprint(ans(anl,n))"] | ['Wrong Answer', 'Accepted'] | ['s356653728', 's441351134'] | [3064.0, 3192.0] | [17.0, 18.0] | [566, 865] |
p02761 | u095094246 | 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())\nsc = [list(map(int,input().split())) for i in range(m)]\nfor i in range(10**n):\n for j in range(m):\n sti = str(i)\n if sti[sc[j][0]-1] != str(sc[j][1]):\n break\n else:\n print(i)\n sys.exit()\nprint(-1)', 'import sys\nn,m=map(int,input().split())\nsc = [list(map(int,input().split())) for i in range(m)]\nfor i in range(10**n):\n if len(str(i)) < n:\n continue\n for j in range(m):\n sti = str(i)\n if sti[sc[j][0]-1] != str(sc[j][1]):\n break\n else:\n print(i)\n sys.exit()\nprint(-1)'] | ['Runtime Error', 'Accepted'] | ['s281465724', 's748046095'] | [3064.0, 3064.0] | [17.0, 18.0] | [255, 290] |
p02761 | u098968285 | 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]*N\n\nflag = True\nfor _ in range(M):\n s, c = list(map(int, input().split()))\n if s == 1 and c == 0:\n flag = False\n break\n \n if ans[s-1] == -1:\n ans[s-1] = c\n else:\n if ans[s-1] != c:\n flag = False\n break\n\nif flag:\n print("".join(["3" if e == -1 else str(e) for e in ans]))\nelse:\n print(-1)\n', 'N, M = list(map(int, input().split()))\nans = [-1]*N\n\nflag = True\n\nif N == 1:\n for _ in range(M):\n s, c = list(map(int, input().split()))\n if ans[s-1] == -1:\n ans[s-1] = c\n else:\n if ans[s-1] != c:\n flag = False\n break\n if flag:\n print(max(0, ans[0]))\n else:\n print(-1)\n\nelse:\n for _ in range(M):\n s, c = list(map(int, input().split()))\n if s == 1 and c == 0:\n flag = False\n break\n\n if ans[s-1] == -1:\n ans[s-1] = c\n else:\n if ans[s-1] != c:\n flag = False\n break\n\n if flag:\n ans[0] = max(1, ans[0])\n print("".join(["0" if e == -1 else str(e) for e in ans]))\n else:\n print(-1)\n'] | ['Wrong Answer', 'Accepted'] | ['s861527437', 's648907445'] | [3064.0, 3064.0] | [17.0, 18.0] | [408, 803] |
p02761 | u102126195 | 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\ncheck = [0 for i in range(n)]\nans = [0 for i in range(n)]\nfor i in range(m):\n s, c = map(int, input().split())\n if check[s - 1] and check[s - 1] != c:\n ans[0] = -1\n break\n check[s - 1] = c\n ans[s - 1] = c\n\nif ans[0] == -1 or ans[0] == 0:\n print(-1)\nelse:\n a = ""\n for i in ans:\n print(i, end = "")', 'n, m = map(int, input().split())\nsc = [list(map(int, input().split())) for i in range(m)]\nans = -1\nfor i in range(10 ** (n - 1), 10 ** n):\n strI = str(i)\n ans = strI\n for s, c in sc:\n if strI[s - 1] != str(c):\n ans = -1\n break\n if ans != -1:\n break\nif n == 1:\n for i in range(0, 10 ** n):\n strI = str(i)\n ans = strI\n for s, c in sc:\n if strI[s - 1] != str(c):\n ans = -1\n break\n if ans != -1:\n break\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s216870911', 's816531614'] | [3064.0, 3064.0] | [17.0, 18.0] | [373, 540] |
p02761 | u102223485 | 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# print("N:", N, "M:", M)\ns = [list(map(int, input().split())) for _ in range(M)]\ns.sort()\n# print(s)\n\nc = []\nfor i in range(N):\n c.append(0)\n\nfor i in s:\n print("i:", i)\n if i[0] - 1 == 0 and i[1] == 0:\n pass\n elif (c[i[0] - 1] == 0) or (c[i[0] - 1] > i[1]):\n c[i[0] - 1] = i[1]\n\nc = map(str, c)\n\nd = \'\'.join(c)\nif (d[:1] == "0") and (N != 1):\n print("-1")\nelse:\n print(d)', 'N, M = map(int, input().split())\n# print("N:", N, "M:", M)\ns = [list(map(int, input().split())) for _ in range(M)]\n# print(s)\n\nc = []\nfor i in range(N):\n c.append(0)\n\nfor i in s:\n if (i[0] - 1) == 0 and i[1] == 0:\n pass\n elif (c[i[0] - 1] > i[1]):\n c[i[0] - 1] = i[1]\n\nc = map(str, c)\n\nd = \'\'.join(c)\nif (d[:1] == "0") and (N != 1):\n print("-1")\nelse:\n print(d)', 'import re\n\nN, M = map(int, input().split())\n# print("N:", N, "M:", M)\ns = [list(map(int, input().split())) for _ in range(M)]\ns.sort()\n# print(s)\n\nc = []\nfor i in range(N):\n c.append(\'x\')\n\nfor i in s:\n # print("c:", c, " i:", i, " c[i[0] - 1]:", c[i[0] - 1])\n if i[0] - 1 == 0 and i[1] == 0:\n pass\n elif (c[i[0] - 1] == \'x\') or (c[i[0] - 1] > i[1]):\n c[i[0] - 1] = i[1]\n\nc = map(str, c)\n\nd = \'\'.join(c)\nre.sub(\'x\', \'0\', d)\n# print("d:", d)\nif (d[:1] == "0") and (N != 1):\n print("-1")\nelse:\n print(d)', 'N, M = map(int, input().split())\ns = [list(map(int, input().split())) for _ in range(M)]\nc = []\n\nfor i in range(N):\n c.append(0)\n\nflg = True\nfor i in s:\n if c[i[0] - 1] == 0:\n c[i[0] - 1] = i[1]\n else:\n flg = False\n break\n\nif flg == True:\n c = map(str, c)\n d = \'\'.join(c)\n\n if d[:1] == \'0\':\n print("-1")\n else:\n print(d)\nelse:\n print("-1")', 'N, M = map(int, input().split())\n# print("N:", N, "M:", M)\ns = [list(map(int, input().split())) for _ in range(M)]\n# print(s)\n\nc = []\nfor i in range(N):\n c.append(0)\n\nfor i in s:\n if i == 0 and i[1] == 0:\n pass\n elif (c[i[0] - 1] > i[1]):\n c[i[0] - 1] = i[1]\n\nc = map(str, c)\n\nd = \'\'.join(c)\nif (d[:1] == "0") and (N != 1):\n print("-1")\nelse:\n print(d)', 'N, M = map(int, input().split())\n# print("N:", N, "M:", M)\ns = [list(map(int, input().split())) for _ in range(M)]\n# print(s)\n\nc = []\nf = []\nfor i in range(N):\n c.append(0)\n f.append(0)\n# print(c)\nflg = True\nfor i in s:\n if f[i[0] - 1] == 0:\n c[i[0] - 1] = i[1]\n f[i[0] - 1] = 1\n else:\n flg = False\n break\nif flg == True:\n # print(c)\n c = map(str, c)\n # print(c)\n d = \'\'.join(c)\n if d[:1] == "0":\n print("-1")\n else:\n print(d)\nelse:\n print("-1")', 'N, M = map(int, input().split())\n# print("N:", N, "M:", M)\ns = [list(map(int, input().split())) for _ in range(M)]\n# print(s)\n\nc = []\nfor i in range(N):\n c.append(0)\nflg = True\nfor i in s:\n if i[0] - 1 == 0 and i[1] == 0 and N != 1:\n flg = False\n break\n if (c[i[0] - 1] != 0) and c[i[0] - 1] != i[1]:\n flg = False\n break\n c[i[0] - 1] = i[1]\n\nc = map(str, c)\nd = \'\'.join(c)\n\nif flg == False:\n print("-1")\nelif (d[:1] == "0") and (N != 1):\n print("1" + d[1:])\nelse:\n print(d)'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s294039366', 's504042902', 's696289377', 's698758547', 's866434322', 's867367505', 's458694708'] | [3064.0, 3064.0, 3188.0, 3064.0, 3192.0, 3064.0, 3064.0] | [17.0, 17.0, 19.0, 17.0, 17.0, 17.0, 17.0] | [438, 390, 532, 398, 381, 520, 522] |
p02761 | u103520789 | 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 _ in range(M):\n s_c.append(list(map(int, input().split())))\n \n \nflag = False\nnum = [-1,-1,-1]\nfor s,c in s_c:\n if num[s-1] == -1:\n num[s-1] = c\n elif not num[s-1] == c:\n flag = True\n\n# print(num)\nans = 0\nif flag:\n print(-1)\nelif num[0] == 0:\n print(-1)\nelse:\n for i,n in enumerate(num):\n if n == -1:\n n = 0\n else:\n ans += n*(10**(3-i))\n print(ans)\n ', 'N, M = map(int, input().split())\ns_c = []\nfor _ in range(M):\n s_c.append(list(map(int, input().split())))\n \n \nflag = False\nnum = [-1 for i in range(N)]\nfor s,c in s_c:\n if s>=len(num):\n flag= True\n elif num[s-1] == -1: \n num[s-1] = c\n elif not num[s-1] == c: \n flag = True\n\n# print(num)\nans = 0\nif flag:\n print(-1)\nelif len(num)>1 and num[0] == 0:\n print(-1)\nelse:\n for i,n in enumerate(num):\n if n == -1:\n n = 0\n else:\n ans += n*(10**(len(num)-i-1))\n print(ans)\n ', 'N, M = map(int, input().split())\ns_c = []\nfor _ in range(M):\n s_c.append(list(map(int, input().split())))\n \n \nflag = False\nnum = [-1 for i in range(N)]\nfor s,c in s_c:\n if s>=len(num): \n flag= True\n elif num[s-1] == -1: \n num[s-1] = c\n elif not num[s-1] == c: \n flag = True\n\n# print(num)\nans = 0\nif flag:\n print(-1)\nelif len(num)>1 and num[0] == 0:\n print(-1)\nelse:\n for i,n in enumerate(num):\n if n == -1:\n n = 0\n else:\n ans += n*(10**(len(num)-i-1))\n print(ans)\n ', 'N, M = map(int, input().split())\ns_c = []\nfor _ in range(M):\n s_c.append(list(map(int, input().split())))\n \n \nflag = False\nnum = [-1,-1,-1]\nfor s,c in s_c:\n if num[s-1] == -1:\n num[s-1] = c\n elif not num[s-1] == c:\n flag = True\n\n# print(num)\nans = 0\nif flag:\n print(-1)\nelif len(num) >1 and num[0] == 0:\n print(-1)\nelse:\n for i,n in enumerate(num):\n if n == -1:\n n = 0\n else:\n ans += n*(10**(3-i))\n print(ans)\n ', 'N, M = map(int, input().split())\ns_c = []\nfor _ in range(M):\n s_c.append(list(map(int, input().split())))\n\ndef check(num, s_c):\n num = str(num)\n flag = True\n for s,c in s_c:\n if s>len(num):\n flag = False\n elif not num[s-1] == str(c):\n flag = False\n return flag\n\na = False\nb = True\nfor i in range(1000):\n a = check(i, s_c)\n if a:\n print(i)\n b = True\n break\nif b:\n print(-1)', 'N, M = map(int, input().split())\ns_c = []\nfor _ in range(M):\n s_c.append(list(map(int, input().split())))\n\ndef check(num, s_c):\n num = str(num)\n flag = True\n for s,c in s_c:\n # print(num[s-1], c)\n if s>len(num):\n flag = False\n elif not num[s-1] == str(c):\n # print(num[s-1], c)\n flag = False\n return flag\n\na = False\nfor i in range(1000):\n a = check(i, s_c)\n if a:\n print(i)\n break\n print(-1)', 'N, M = map(int, input().split())\ns_c = []\nfor _ in range(M):\n s_c.append(list(map(int, input().split())))\n\ndef check(num, s_c):\n num = str(num)\n flag = True\n for s,c in s_c:\n # print(num[s-1], c)\n if s>len(num):\n flag = False\n elif not num[s-1] == str(c):\n # print(num[s-1], c)\n flag = False\n return flag\n\na = False\nfor i in range(1000):\n a = check(i, s_c)\n if a:\n print(i)\n break\nprint(-1)', 'N, M = map(int, input().split())\ns_c = []\nfor _ in range(M):\n s_c.append(list(map(int, input().split())))\n\ndef check(num, s_c):\n num = str(num)\n flag = True\n for s,c in s_c:\n if s>len(num):\n flag = False\n elif not num[s-1] == str(c):\n flag = False\n return flag\n\na = False\nb = True\nfor i in range(1000):\n if check(i, s_c) and len(str(i)) == N:\n falg = False\n print(i)\n b = False\n break\nif b:\n print(-1)'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s193685448', 's257329268', 's440977661', 's654534917', 's837310795', 's925800112', 's985736648', 's686885012'] | [3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3188.0, 3064.0, 3188.0] | [18.0, 17.0, 17.0, 17.0, 19.0, 19.0, 18.0, 19.0] | [457, 652, 680, 473, 453, 484, 480, 486] |
p02761 | u103902792 | 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 _ in range(m):\n s,c = map(int,input().split())\n if s > n:\n print(-1)\n exit()\n if s in d:\n if d[s] == c:\n continue\n else:\n print(-1)\n exit()\n else:\n d[s] = c\n\nans = ''\nfor i in range(n):\n if i+1 in d:\n ans += str(d[i+1])\n else:\n ans += '1'\nprint(ans)\n\n", "n,m = map(int,input().split())\nd = {}\nfor _ in range(m):\n s,c = map(int,input().split())\n if s ==1 and c ==0:\n print(-1)\n exit()\n if s in d:\n if d[s] == c:\n continue\n else:\n print(-1)\n exit()\n else:\n d[s] = c\n\nprint(d)\nans = ''\nflag = False\nfor i in range(1,n+1):\n if i in d:\n if d[i] != 0:\n flag = True\n ans += str(d[i])\n else:\n if flag:\n ans += '0'\n else:\n ans += '1'\n flag = True\nprint(ans)\n\n\n\n", "n,m = map(int,input().split())\nd = {}\nfor _ in range(m):\n s,c = map(int,input().split())\n if s in d:\n if d[s] == c:\n continue\n else:\n print(-1)\n exit()\n else:\n d[s] = c\n\nans = ''\nfor i in range(n):\n if i+1 in d:\n ans += str(d[i+1])\n else:\n ans += '1'\nprint(ans)", "n,m = map(int,input().split())\nd = {}\nfor _ in range(m):\n s,c = map(int,input().split())\n if n != 1 and s ==1 and c == 0:\n print(-1)\n exit()\n if s in d:\n if d[s] == c:\n continue\n else:\n print(-1)\n exit()\n else:\n d[s] = c\n\nans = ''\nflag = False\nif n == 1:\n flag = True\nfor i in range(n):\n if i+1 in d:\n if d[i+1] != 0:\n flag = True\n ans += str(d[i+1])\n else:\n if flag:\n ans += '0'\n else:\n ans += '1'\n flag = True\nprint(ans)\n\n\n\n\n"] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s356025230', 's500686599', 's802713410', 's931253695'] | [3188.0, 3064.0, 3064.0, 3064.0] | [18.0, 17.0, 17.0, 17.0] | [335, 465, 296, 496] |
p02761 | u104005543 | 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 for i in range(n)]\npossibility = True\nfor i in range(m):\n s, c = map(int, input().split())\n if a[s - 1] == -1:\n a[s - 1] = c\n elif a[s - 1] == c:\n pass\n else:\n possibility = False\nif a[0] == 0:\n possibility = False\n\nif possibility == True:\n ans = ''\n for i in range(n):\n ans += a[i]\n print(ans)\nelse:\n print('-1')", "n, m = map(int, input().split())\nnum = [-1 for _ in range(n + 1)]\nfor _ in range(m):\n s, c = map(int, input().split())\n if num[s] == -1 or num[s] == c:\n num[s] = c\n else:\n print('-1')\n exit()\nif num[1] == -1 and n > 1:\n num [1] = 1\nans = ''\nfor i in num:\n if i == -1:\n ans += '0'\n else:\n ans += str(i)\nprint(int(ans) if len(str(int(ans))) == n else '-1')"] | ['Runtime Error', 'Accepted'] | ['s173344832', 's454236705'] | [3064.0, 3064.0] | [17.0, 17.0] | [409, 407] |
p02761 | u106342872 | 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\ns = [0] * m\nc = [0] * m\n\nfor i in range(m):\n s[i], c[i] = map(int, input().split())\n\nans = False\nfor x in range(10 ** (n - 1), 10 ** n):\n x = list(str(x))\n flag = True\n for i in range(m):\n if int(x[s[i]-1]) == c[i]:\n pass\n else:\n flag = False\n\n if flag:\n print(int(''.join(x)))\n ans = True\n break\n\nif n == 1:\n x = list(str(0))\n flag = True\n for i in range(m):\n if int(x[s[i]-1]) == c[i]:\n pass\n else:\n flag = False\n\n if flag:\n print(int(''.join(x)))\n ans = True\n break\n \nif ans == False:\n print(-1)\n", "n, m = map(int, input().split())\n\ns = [0] * m\nc = [0] * m\n\nfor i in range(m):\n s[i], c[i] = map(int, input().split())\n\nans = False\nfor x in range(10 ** (n - 1), 10 ** n):\n x = list(str(x))\n flag = True\n for i in range(m):\n if int(x[s[i]-1]) == c[i]:\n pass\n else:\n flag = False\n\n if flag:\n print(int(''.join(x)))\n ans = True\n break\n\nif n == 1:\n x = list(str(0))\n flag = True\n for i in range(m):\n if int(x[s[i]-1]) == c[i]:\n pass\n else:\n flag = False\n\n if flag:\n print(int(''.join(x)))\n ans = True\n break\n \nif ans == False:\n print(-1)\n", "n, m = map(int, input().split())\n\ns = [0] * m\nc = [0] * m\n\nfor i in range(m):\n s[i], c[i] = map(int, input().split())\n\nans = False\nfor x in range(10 ** (n - 1), 10 ** n):\n x = list(str(x))\n flag = True\n for i in range(m):\n if int(x[s[i]-1]) == c[i]:\n pass\n else:\n flag = False\n\n if flag:\n print(int(''.join(x)))\n ans = True\n break\n\nif n = 1:\n x = list(str(0))\n flag = True\n for i in range(m):\n if int(x[s[i]-1]) == c[i]:\n pass\n else:\n flag = False\n\n if flag:\n print(int(''.join(x)))\n ans = True\n break\n \nif ans == False:\n print(-1)\n", "n, m = map(int, input().split())\n\ns = [0] * m\nc = [0] * m\n\nfor i in range(m):\n s[i], c[i] = map(int, input().split())\n\nans = False\n\nif n == 1:\n x = list(str(0))\n flag = True\n for i in range(m):\n if int(x[s[i]-1]) == c[i]:\n pass\n else:\n flag = False\n\n if flag:\n print(int(''.join(x)))\n ans = True\n \nfor x in range(10 ** (n - 1), 10 ** n):\n x = list(str(x))\n flag = True\n for i in range(m):\n if int(x[s[i]-1]) == c[i]:\n pass\n else:\n flag = False\n\n if flag and ans == False:\n print(int(''.join(x)))\n ans = True\n break\n\n\n \nif ans == False:\n print(-1)\n"] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s219351459', 's391749131', 's685526186', 's946840350'] | [3064.0, 3064.0, 3064.0, 3188.0] | [17.0, 17.0, 17.0, 20.0] | [680, 684, 683, 694] |
p02761 | u109396127 | 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())\nM = int(input())\n\nfrag = True\nfor i in range(N):\n A[i] = -1\nfor i in range(M):\n si = int(input())\n ci = int(input())\n if A[si] != -1 and A[si] != ci:\n frag = False\n break\n else if si == 1 and ci == 0:\n frag = False\n break\n else:\n A[si] = ci\n\nans = 0\nfor i in range(N):\n if A[N-i-1] == -1:\n A[N-i-1] = 0\n ans += A[N-i-1]*(10**i)\n \nif frag:\n print(ans)\nelse:\n print(-1)', 'import numpy as np\nN, M = map(int, input().split())\n\nfrag = True\nA = np.zeros(N)\nfor i in range(N):\n A[i] = -1\nfor i in range(M):\n si,ci = map(int, input().split())\n if A[si-1] != -1 and A[si-1] != ci:\n frag = False\n elif si == 1 and ci == 0 and N != 1:\n frag = False\n else:\n A[si-1] = ci\n\nans = 0\nfor i in range(N):\n if A[N-i-1] == -1:\n A[N-i-1] = 0\n ans += A[N-i-1]*(10**i)\n \nif ans == 0 and N == 1:\n pass\nelif ans < 10**(N-1):\n ans += 10**(N-1)\n \nif frag:\n print(int(ans))\nelse:\n print(-1)'] | ['Runtime Error', 'Accepted'] | ['s229600473', 's639703441'] | [2940.0, 21264.0] | [17.0, 697.0] | [459, 559] |
p02761 | u109617108 | 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\nQ=True\nL=list(list(map(int,input().split())) for j in range(M))\nfor i in range(M):\n if A[L[i][0]-1]==-1 or A[L[i][0]-1]==L[i][1]:\n A[L[i][0]-1]==L[i][1]\n else:\n Q=False\nfor k in range(N):\n if A[k]==-1:\n if N!=1 and k==0:\n A[k]=1\n else:\n A[k]=0\nif N!=1 and A[0]==0:\n Q=False\nif Q:\n S=""\n for i in range(N):\n S+=str(A[i])\n print(int(S))\nelse:\n print(-1)\n', 'N,M=map(int,input().split())\nA=[-1]*N\nans=0\nL=list(list(map(int,input().split())) for j in range(M))\nfor i in range(M):\n if A[L[M][0]-1]==-1 or A[L[M][0]-1]==L[M][1]:\n A[L[M][0]-1]==L[M][1]\n else:\n ans=-1\n break\nS=""\nfor k in range(N):\n if A[k]==-1:\n if N!=1 and k==0:\n A[k]=1\n else:\n A[k]=0\n \n if N!=1 and A[0]==0:\n ans=-1\n break\n S+=str(A[i])\nif ans=-1:\n print(-1)\nelse:\n print(int(S))', 'N,M=map(int,input().split())\nA=[-1]*N\nk=0\nfor i in range(M):\n L=list(map(int,input().split()))\n if A[L[0]-1]==-1:\n A[L[0]-1]=L[1]\n else:\n if A[L[0]-1]!=L[1]:\n k=1\n break\n else:\n continue\nif (k=1) or (N!=1 and A[0]==0):\n print(-1)\nelse:\n A=""\n if A[0]==-1:\n A[0]=1\n if N!=1:\n for i in range(N):\n if A[i]==-1:\n A[i]=0\n S+=str(A[i])\nprint(int(S))\n \n \n\n\n ', 'N,M=map(int,input().split())\nA=[-1]*N\nk=0\nfor i in range(M):\n L=list(map(int,input().split()))\n if A[L[0]-1]==-1:\n A[L[0]-1]=L[1]\n else:\n if A[L[0]-1]!=L[1]:\n k=1\n break\n else:\n continue\nif (k==1) or (N!=1 and A[0]==0):\n print(-1)\nelse:\n S=""\n if A[0]==-1:\n A[0]=1\n \n if N!=1:\n for i in range(N):\n if A[i]==-1:\n A[i]=0\n S+=str(A[i])\n print(int(S))\n else N==1:\n print(int(A[0])\n', 'N,M=map(int,input().split())\nA=[-1]*N\nk=0\nfor i in range(M):\n L=list(map(int,input().split()))\n if A[L[0]-1]==-1:\n A[L[0]-1]=L[1]\n else:\n if A[L[0]-1]!=L[1]:\n k=1\n break\n else:\n continue\nif (k==1) or (N!=1 and A[0]==0):\n print(-1)\nelse:\n S=""\n if A[0]==-1:\n A[0]=1\n if N!=1:\n for i in range(N):\n if A[i]==-1:\n A[i]=0\n S+=str(A[i])\n print(int(S))\n if N==1:\n print(int(A[0])\n', 'N,M=map(int,input().split())\nA=[-1]*N\nL=[]\nfor j in range(M):\n L.append(list(map(int,input().split())))\nfor i in range(M):\n if A[L[M][0]-1]==-1 or A[L[M][0]-1]==L[M][1]:\n A[L[M][0]-1]==L[M][1]\n else:\n print(-1)\n exit()\nS=""\nif N!=1 and A[0]==0:\n print(-1)\n exit()\nfor k in range(N):\n if A[k]==-1:\n if N!=1 and k==0:\n A[k]=1\n else:\n A[k]=0\n S+=str(A[i])\nprint(int(S))\n \n', 'N,M=map(int,input().split())\nA=[-1]*N\nfor i in range(M):\n L=list(map(int,input().split()))\n if A[L[0]-1]==-1:\n A[L[0]-1]=L[1]\n else:\n if A[L[0]-1]==L[1]:\n continue\n else:\n print(-1)\n exit()\nif N!=1 and A[0]==0:\n print(-1)\nelse:\n S=""\n if A[0]==-1:\n A[0]=1\n \n if N!=1:\n for i in range(N):\n if A[i]==-1:\n A[i]=0\n S+=str(A[i])\n print(int(S))\n else:\n print(int(A[0])\n', 'n,m = map(int,input().split())\ns = list(list(map(int,input().split())) for i in range(m))\nx = [-1]*n\nb = True\nfor i in range(m):\n if x[s[i][0]-1] == -1 or x[s[i][0]-1] == s[i][1]:\n x[s[i][0]-1] = s[i][1]\n else:\n b = False\nfor j in range(n):\n if x[j] == -1:\n if len(x) != 1 and j == 0:\n x[j] = 1\n else:\n x[j] = 0\nif len(x) != 1 and x[0] == 0:\n b = False\n\nif b:\n S=""\n for o in range(n):\n S+=str(x[o])\n print(int(S))\nelse:\n print(-1)\n'] | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s075378469', 's434027042', 's618668055', 's860839664', 's865570639', 's948559758', 's977105744', 's465610983'] | [3064.0, 3064.0, 2940.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 18.0, 17.0, 17.0] | [423, 426, 412, 443, 434, 402, 425, 501] |
p02761 | u110199424 | 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\nsc = [list(map(int, input().split())) for _ in range(M)]\n\nans = [set() for _ in range(N)]\n\nfor i in range(M):\n ans[sc[i][0] - 1].add(sc[i][1])\n\n\n#print(ans)\n\nans_2 = ''\nfor i in range(N):\n if len(ans[i]) > 1 or (0 in ans[0]):\n ans_2 = -1\n break\n else:\n if len(ans[i]) == 0:\n if i == 0:\n ans_2 += str(1)\n else:\n ans_2 += str(0)\n else:\n ans_2 += str(ans[i])\n\nprint(ans_2)\n", "N, M = map(int, input().split())\n\nsc = [list(map(int, input().split())) for _ in range(M)]\n\nans = [set() for _ in range(N)]\n\nfor i in range(M):\n ans[sc[i][0] - 1].add(sc[i][1])\n\n\n#print(ans)\n\nans_2 = ''\nfor i in range(N):\n if len(ans[i]) > 1 or (N > 1 and 0 in ans[0]):\n ans_2 = -1\n break\n else:\n if len(ans[i]) == 0:\n if i == 0 and N > 1:\n ans_2 += str(1)\n else:\n ans_2 += str(0)\n else:\n ans_2 += str(max(ans[i]))\n\nprint(ans_2)\n"] | ['Wrong Answer', 'Accepted'] | ['s763060520', 's238043172'] | [3064.0, 3064.0] | [17.0, 17.0] | [504, 529] |
p02761 | u111473084 | 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\ndigit = [[] for i in range(3)]\nfor i in range(M):\n si, ci = map(int, input().split(" "))\n if si > N:\n print(-1)\n exit()\n digit[si-1].append(ci)\n\nfor i in range(N):\n if len(digit[i]) > 1:\n print(-1)\n exit()\n\nans = 0\ncoef = 10 ** (N-1)\nfor i in range(N):\n if len(digit[i]) > 0:\n ans += min(digit[i]) * coef\n coef //= 10\n\nif ans < 100 and N == 3:\n ans = -1\nif ans < 10 and N == 2:\n ans = -1\n\nprint(ans)', 'N, M = map(int, input().split(" "))\n\ndigit = [-1 for i in range(N)]\nfor i in range(M):\n s, c = map(int, input().split(" "))\n if s > N:\n print(-1)\n exit()\n if digit[s-1] == -1 or digit[s-1] == c:\n digit[s-1] = c\n else:\n print(-1)\n exit()\n\nif N > 1 and digit[0] == -1:\n digit[0] = 1\nfor i in range(1, N):\n if digit[i] == -1:\n digit[i] = 0\nif N == 1 and M == 0:\n digit[0] = 0\n\nans = 0\ncoef = 10 ** (N-1)\nfor i in range(N):\n if digit[i]:\n ans += digit[i] * coef\n coef //= 10\n\nif ans < 100 and N == 3:\n ans = -1\nif ans < 10 and N == 2:\n ans = -1\n\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s685200908', 's273445978'] | [3064.0, 3064.0] | [17.0, 18.0] | [495, 634] |
p02761 | u113255362 | 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())\nflag = True\nres = ""\nList = []\nfor i in range (M):\n List.append(list(map(int, input().split())))\nresList = ["10"]*N\nfor i in range(M):\n if resList[List[i][0]-1] == "10":\n resList[List[i][0]-1] = str(List[i][1])\n else:\n if resList[List[i][0]-1] != str(List[i][1]):\n flag = False\nif resList[0] == 0:\n flag = False\nif flag:\n for i in range(N):\n if resList[i] == "10":\n res += "1"\n else:\n res += resList[i]\n print(int(res))\nelse:\n print(-1)', 'N,M=map(int,input().split())\nflag = True\nres = ""\nList = []\nfor i in range (M):\n List.append(list(map(int, input().split())))\nresList = ["10"]*N\nfor i in range(M):\n if resList[List[i][0]-1] == "10":\n resList[List[i][0]-1] = str(List[i][1])\n else:\n if resList[List[i][0]-1] != str(List[i][1]):\n flag = False\nif resList[0] == "0":\n flag = False\nelif resList[0] == "10" and N > 1:\n resList[0]="1"\nelif resList[0] == "10" and N == 1:\n resList[0]="0"\n flag = False\nif flag:\n for i in range(N):\n if resList[i] == "10":\n res += "0"\n else:\n res += resList[i]\n print(int(res))\nelse:\n if resList[0] == "0" and N ==1:\n print(0)\n else:\n print(-1)'] | ['Wrong Answer', 'Accepted'] | ['s866734647', 's844299800'] | [9236.0, 9260.0] | [28.0, 24.0] | [499, 678] |
p02761 | u115877451 | 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,b=map(int,input().split())\nc=[]\nfor _ in range(b):\n c.append(list(map(int,input().split())))\n\nfor i in range(b):\n for j in range(i):\n if c[i][0]==c[j][0] and c[i][1]!=c[j][1]:\n print(-1)\n exit()\nfor i in range(b):\n if c[i][1]==0:\n print(-1)\n exit()\n\nresult=[0]*a\nfor i in range(b):\n result[a-c[i][0]]=c[i][1]\n\nif result[0]==0:\n result[0]=1\n\nfor i in range(a):\n result[i]=str(result[i])\n\nprint(''.join(result))", "a,b=map(int,input().split())\nc=[]\nfor _ in range(b):\n c.append(list(map(int,input().split())))\n\nfor i in range(b):\n for j in range(i):\n if c[i][0]==c[j][0] and c[i][1]!=c[j][1]:\n print(-1)\n exit()\nfor i in range(b):\n if a==b==1:\n break\n if c[i][1]==0 and c[i][0]==1:\n print(-1)\n exit()\n\nresult=[0]*a\nfor i in range(b):\n result[c[i][0]-1]=c[i][1]\n\nif result[0]==0 and a>=2:\n result[0]=1\n\nfor i in range(a):\n result[i]=str(result[i])\n\nprint(''.join(result))"] | ['Wrong Answer', 'Accepted'] | ['s755798494', 's196350004'] | [9076.0, 9172.0] | [30.0, 29.0] | [472, 526] |
p02761 | u116038906 | 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 = (int(x) for x in input().split())\nketa_num_str = [ (input().split()) for i in range(M) ]\n\n\nsuuji = ""\nnum_str_dic = defaultdict(set)\nkotae_dic ={ str(i):"0" for i in range(1,N + 1) } \nfor i in keta_num_str: \n num_str_dic[i[0]].add(i[1])\n\n\nfor i,v in num_str_dic.items():\n if 1 < len(v) : \n kotae_dic ={}\n break\n\n else:\n kotae_dic[i] = list(v)\n\n\nimport math\nif kotae_dic == {}: \n print(-1)\nelse:\n kotae_dic_sorted = sorted(kotae_dic.items(),key=lambda x:int(x[0]))\n kotae_str = "".join( [i[1][0] for i in kotae_dic_sorted ] ) \n kotae_int =int(kotae_str)\n if kotae_int == 0 and 1< N: \n print(-1)\n elif 1 < N and math.log10(kotae_int) < N: \n print(-10)\n else:\n print(kotae_int)\n', 'from collections import defaultdict\nN,M = (int(x) for x in input().split())\nketa_num_str = [ (input().split()) for i in range(M) ]\n\n\nsuuji = ""\nnum_str_dic = defaultdict(set)\nkotae_dic ={ str(i):"0" for i in range(1,N + 1) } \nfor i in keta_num_str: \n num_str_dic[i[0]].add(i[1])\n\n\nfor i,v in num_str_dic.items():\n if 1 < len(v) : \n kotae_dic ={}\n break\n\n else:\n kotae_dic[i] = list(v)\n\n\nimport math\nif kotae_dic == {}: \n print(-1)\nelse:\n kotae_dic_sorted = sorted(kotae_dic.items(),key=lambda x:int(x[0]))\n kotae_str = "".join( [i[1][0] for i in kotae_dic_sorted ] ) \n kotae_int =int(kotae_str)\n if kotae_int == 0 and 1< N: \n print(-1)\n elif 1 < N and math.log10(kotae_int) != N: \n print(-1)\n else:\n print(kotae_int)', 'from collections import defaultdict\nN,M = (int(x) for x in input().split())\nketa_num_str = [ (input().split()) for i in range(M) ]\n\n\nsuuji = ""\nnum_str_dic = defaultdict(set)\nkotae_dic ={ str(i):"0" for i in range(1,N + 1) } \nfor i in keta_num_str: \n num_str_dic[i[0]].add(i[1])\n\n\nfor i,v in num_str_dic.items():\n if 1 < len(v) : \n kotae_dic ={}\n break\n\n else:\n kotae_dic[i] = list(v)\n\n\nimport math\nif kotae_dic == {}: \n print(-1)\nelse:\n kotae_dic_sorted = sorted(kotae_dic.items(),key=lambda x:int(x[0]))\n kotae_str = "".join( [i[1][0] for i in kotae_dic_sorted ] ) \n kotae_int =int(kotae_str)\n if kotae_int == 0 and 1< N: \n print(-1)\n elif 1 < N and math.log10(kotae_int) < N: \n print(-1)\n else:\n print(kotae_int)', 'import math\nif kotae_dic == {}: \n print(-1)\nelse:\n kotae_dic_sorted = sorted(kotae_dic.items(),key=lambda x:int(x[0]))\n kotae_str = "".join( [i[1][0] for i in kotae_dic_sorted ] ) \n kotae_int =int(kotae_str)\n if kotae_int == 0 and 1< N: \n print(-1)\n elif kotae_int == 0 and N == 1:\n print("0")\n elif 10**(N-1) > kotae_int or kotae_int >= 10** N: \n print(-1)\n else:\n print(kotae_int)', '\nfrom collections import defaultdict\nN,M = (int(x) for x in input().split())\nketa_num_str = [ (input().split()) for i in range(M) ]\n\n\nsuuji = ""\nnum_str_dic = defaultdict(set)\nkotae_dic ={ str(i):"0" for i in range(1,N +1) } \nif 1< N:\n kotae_dic["1"] = "1" \nfor i in keta_num_str: \n num_str_dic[i[0]].add(i[1])\n\n\nfor i,v in num_str_dic.items():\n if 1 < len(v) : \n kotae_dic ={}\n break\n \n else:\n kotae_dic[i] = list(v)[0]\n\n\nimport math\nif kotae_dic == {}: \n print(-1)\nelse:\n kotae_dic_sorted = sorted(kotae_dic.items(),key=lambda x:int(x[0]))\n kotae_str = "".join( [i[1] for i in kotae_dic_sorted ] ) \n kotae_int =int(kotae_str)\n if kotae_int == 0 and 1< N: \n print(-1)\n elif kotae_int == 0 and N == 1:\n print("0")\n elif 10**(N-1) > kotae_int or kotae_int >= 10** N: \n print(-1)\n \n \n # print(-1)\n\n else:\n print(kotae_int)'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s373676138', 's424907157', 's520167098', 's747676166', 's637310294'] | [3436.0, 3444.0, 3316.0, 3064.0, 3316.0] | [22.0, 23.0, 22.0, 18.0, 21.0] | [1107, 1106, 1105, 600, 1347] |
p02761 | u117793693 | 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)\ns_list = []\nc_list = []\nfor i in range(M):\n si, ci = input().split(" ")\n s_list.append(int(si))\n c_list.append(int(ci))\n\nnum = ["0" for i in range(N)]\nis_num = [0 for i in range(N)]\nis_break = False\nfor si, ci in zip(s_list, c_list):\n if num[si-1] != "0" and num[si-1] != str(ci):\n print(-1)\n is_break = True\n break\n else:\n num[si-1] = str(ci)\n num[si-1] = 1\nif not is_break:\n num = int("".join([val for val in num]))\n if num:\n print(num)\n elif is_num[-1] == 0:\n print(1)\n else:\n print(0)', 'N, M = input().split(" ")\nN = int(N)\nM = int(M)\ns_list = []\nc_list = []\nfor i in range(M):\n si, ci = input().split(" ")\n s_list.append(int(si))\n c_list.append(int(ci))\nnum = ["0" for i in range(N)]\nfor si, ci in zip(s_list, c_list):\n if num[si-1] != "0" and num[si-1] != str(ci):\n print(-1)\n is_break = True\n break\n elif N > 1 and si == 1 and ci == 0:\n print(-1)\n is_break = True\n break\n else:\n num[si-1] = str(ci)\nif not is_break:\n num = int("".join([val for val in num]))\n if num:\n print(num)\n else:\n print(0)', 'N, M = input().split(" ")\nN = int(N)\nM = int(M)\ns_list = []\nc_list = []\nfor i in range(M):\n si, ci = input().split(" ")\n s_list.append(int(si))\n c_list.append(int(ci))\nnum = ["0" for i in range(N)]\nis_break = False\nfor si, ci in zip(s_list, c_list):\n if num[si-1] != "0" and num[si-1] != str(ci):\n print(-1)\n is_break = True\n break\n elif N > 1 and si == 1 and ci == 0:\n print(-1)\n is_break = True\n break\n else:\n num[si-1] = str(ci)\nif not is_break:\n num = "".join([val for val in num])\n if int(num[0]) or N == 1:\n print(int(num))\n else:\n print(int("1" + num[1:]))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s015798227', 's387269569', 's622627070'] | [3064.0, 3064.0, 3064.0] | [18.0, 17.0, 19.0] | [619, 601, 653] |
p02761 | u118760114 | 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)]\nfor i in range(0, 10**n):\n if len(str(i)) == n and all(str(i)[s-1] == str(c) for j in sc):\n print(i)\n break\nelse:\n print(-1)', 'n, m = map(int, input().split())\nsc = [list(map(int, input().split())) for i in range(m)]\nfor i in range(0, 10**n):\n if len(str(i)) == n and all(str(i)[s-1] == str(c) for s,c in sc):\n print(i)\n break\nelse:\n print(-1)'] | ['Runtime Error', 'Accepted'] | ['s423909613', 's918871255'] | [3060.0, 3064.0] | [18.0, 19.0] | [234, 236] |
p02761 | u121698457 | 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 = dict()\nfor o in range(1,N+1):\n d[o] = 1\nS = []\nC = []\nfor i in range(M):\n s, c = map(int,input().split())\n S.append(s)\n C.append(c)\n d[s] = c\nif (1, 0) in d.items():\n print(-1)\n exit()\nfor j in range(0,M-1):\n for k in range(j+1, M):\n if S[j] == S[k] and C[j] != C[k]:\n print(-1)\n exit()\nnum = 0\nfor p in range(1,N+1):\n num += d[p]*10**(N-p)\nprint(num)', 'N, M = map(int, input().split())\nd = dict()\nfor o in range(1,N+1):\n d[o] = 1\nS = []\nC = []\nfor i in range(M):\n s, c = map(int,input().split())\n S.append(s)\n C.append(c)\n d[s] = c\nif (1, 0) in d.items() and N != 1:\n print(-1)\n exit()\nfor j in range(0,M-1):\n for k in range(j+1, M):\n if S[j] == S[k] and C[j] != C[k]:\n print(-1)\n exit()\nnum = 0\nfor p in range(1,N+1):\n num += d[p]*10**(N-p)\nprint(num)', 'N, M = map(int, input().split())\nd = {1: 1, 2: 1, 3: 1}\nS = []\nC = []\nfor i in range(M):\n s, c = map(int,input().split())\n S.append(s)\n C.append(c)\n d[s] = c\nif (1, 0) in d.items():\n print(-1)\n exit()\nfor j in range(0,M-1):\n for k in range(j+1, M):\n if S[j] == S[k] and C[j] != C[k]:\n print(-1)\n exit()\nprint(d[1]*100+d[2]*10+d[3])', 'N, M = map(int, input().split())\nif N ==1 and M == 0:\n print(0)\n exit()\nd = dict()\nd[1] = 1\nfor o in range(2,N+1):\n d[o] = 0\nS = []\nC = []\nfor i in range(M):\n s, c = map(int,input().split())\n S.append(s)\n C.append(c)\n d[s] = c\nif (1, 0) in d.items() and N != 1:\n print(-1)\n exit()\nfor j in range(0,M-1):\n for k in range(j+1, M):\n if S[j] == S[k] and C[j] != C[k]:\n print(-1)\n exit()\nnum = 0\nfor p in range(1,N+1):\n num += d[p]*10**(N-p)\nprint(num)'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s171135232', 's526880315', 's944110566', 's286814968'] | [3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 17.0, 17.0, 17.0] | [444, 455, 381, 509] |
p02761 | u123849536 | 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) | ['# -*- coding: utf-8 -*-\n# 157c\nn, m = map(int, input().split())\ns = []\nc = []\nfor _ in range(m):\n _s, _c = input().split()\n s.append(int(_s))\n c.append(_c)\n\nret = -1\nfor i in range(10 ** 4):\n for _s, _c in zip(s, c):\n if len(str(i)) < _s or str(i)[_s - 1] != _c:\n ret = -1\n break\n ret = i\n if i == 702:\n print(i)\n if ret != -1:\n break\nprint(ret)\n', '# -*- coding: utf-8 -*-\n# 157c\nn, m = map(int, input().split())\ns = []\nc = []\nfor _ in range(m):\n _s, _c = input().split()\n s.append(int(_s))\n c.append(_c)\n\nret = -1\nfor i in range(1000):\n x = str(i)\n if len(x) != n:\n continue\n isOk = True\n for _s, _c in zip(s, c):\n if len(x) < _s or x[_s - 1] != _c:\n isOk = False\n break\n if isOk:\n ret = i\n break\nprint(ret)\n'] | ['Wrong Answer', 'Accepted'] | ['s177450637', 's315576579'] | [3064.0, 3064.0] | [28.0, 18.0] | [374, 390] |
p02761 | u127499732 | 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 and n==1:\n print(0)\n exit()\nelse:\n print("1"+"0"*(n-1))\n exit()\n \nx=["0" for _ in range(n)]\nfor _ in range(m):\n s,c=map(int,input().split())\n if x[s-1] != \'0\' and x[s-1] != str(c):\n print(-1)\n break\n else:\n x[s-1] = str(c)\nelse:\n if n==1:\n print(x[0])\n elif x[0]==\'0\':\n print(-1)\n else:\n print("".join(x))', "n,m=map(int,input().split())\nx=['0' for _ in range(n)]\n\nfor _ in range(m):\n s,c=map(int,input().split())\n \n if x[s-1] != '0' and x[s-1] != str(c):\n print(-1)\n exit()\n if s==1 and c==0 and n>1:\n print(-1)\n exit()\n else:\n x[s-1] = str(c)\nif n==1:\n print(x[0])\nelif x[0]=='0':\n x[0]='1'\n print(''.join(x))\nelse:\n print(''.join(x))"] | ['Wrong Answer', 'Accepted'] | ['s606687147', 's866626308'] | [3188.0, 3064.0] | [18.0, 17.0] | [371, 351] |
p02761 | u128661070 | 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) | ['# -*- coding:utf-8 -*-\nn, m = map(int, input().strip().split())\nans = 0\nf_one = False\nfor i in range(m):\n tmp_d, tmp = map(int, input().strip().split())\n if tmp_d == 1:\n f_one = True\n \n if ((tmp_d == 1) and (tmp == 0)):\n ans = -1\n break\n elif (tmp_d in digit.keys()) and (digit[tmp_d] != tmp):\n ans = -1\n break\n else:\n ans += tmp*(10**(n-tmp_d))\n \nif not f_one:\n\tans += 1*(10**(n-1))\n \nprint(ans)', '# -*- coding:utf-8 -*-\nn, m = map(int, input().strip().split())\nans = 0\n\ndigit ={}\nfor i in range(m):\n tmp_d, tmp = map(int, input().strip().split())\n \t\n if (tmp_d in digit.keys()) and (digit[tmp_d] != tmp):\n print(-1)\n exit()\n else:\n digit[tmp_d] = tmp\n \n \nif not (1 in digit.keys()) and n>=2:\n\tdigit[1] = 1\n \nans = 0\nfor key in digit.keys():\n ans += digit[key]*(10**(n-key))\n\nif len(str(ans)) == n: \n print(ans)\nelse:\n print(-1)'] | ['Runtime Error', 'Accepted'] | ['s735371009', 's096815038'] | [3064.0, 3064.0] | [17.0, 17.0] | [462, 482] |
p02761 | u130900604 | 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# from collections import Counter\n\n# n=int(input())\n# s=input()\nn,m=map(int,input().split())\ncl=[-1]*n\nfor i in range(m):\n s,c=map(int,input().split())\n if cl[s-1]==-1 or cl[s-1]==c:\n cl[s-1]=c\n else:\n print(-1)\n exit()\nif cl[0]==0:\n print(-1)\n exit()\nif cl[0]==-1:\n cl[0]=1\nfor i in range(n):\n if cl[i]==-1:\n cl[i]=0\nfor i in cl:\n print(i,end="")\n \n# h=list(map(int,input().split()))\n\n\n', '\n# from collections import Counter\n\n# n=int(input())\n# s=input()\nn,m=map(int,input().split())\ncl=[-1]*n\nfor i in range(m):\n s,c=map(int,input().split())\n if cl[s-1]==-1 or cl[s-1]==c:\n cl[s-1]=c\n else:\n print(-1)\n exit()\nif cl[0]==0:\n print(-1)\n exit()\nfor i in range(n):\n if cl[i]==-1:\n cl[i]=0\nfor i in cl:\n print(i,end="")\n \n# h=list(map(int,input().split()))\n\n\n', 'def mi():return map(int,input().split())\nn,m=mi()\nsc=[]\nfor i in range(m):\n s,c=mi()\n sc+=(s,c),\n \nfor i in range(0,999+1):\n h=str(i)\n if len(h)==n:\n if all([h[s-1]==str(c) for s,c in sc]):\n print(i)\n exit()\nprint(-1) '] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s286140674', 's690429441', 's906460483'] | [3064.0, 3064.0, 3064.0] | [17.0, 17.0, 18.0] | [530, 504, 239] |
p02761 | u131638468 | 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=int(N)\nm=int(M)\nnumlist=[0,0,0]\naccess_log=[0,0,0]\nanswer=0\nfor i in range(m):\n s,c=map(int,input().split())\n s=int(s)\n c=int(c)\n if access_log[s]==1 and numlist[s]!=c:\n answer=-1\n break\n else:\n numlist[s]=c\n access_log[s]=1\nif answer==-1:\n print(answer)\nelse:\n answer=numlist[2]*10**2+numlist[1]*10+numlist[0]\n if answer==0:\n print(-1)\n else:\n print(answer)', 'N,M=map(int,input().split())\nn=int(N)\nm=int(M)\nnumlist=[]\nloglist=[]\nfor i in range(n):\n numlist.append(0)\n loglist.append(0)\nanswer=0\n\nfor i in range(m):\n s,c=map(int,input().split())\n s=int(s)\n c=int(c)\n if s==1 and c==0 and n!=1:\n answer=-1\n elif loglist[s-1]!=0 and numlist[s-1]!=c:\n answer=-1\n else:\n numlist[s-1]=c\n loglist[s-1]=1\n\nif answer==-1:\n print(answer)\nelif n==1 and numlist[0]==0:\n print(0)\nelse:\n if numlist[0]==0:\n numlist[0]=1\n else:\n pass\n for i in range(n):\n answer+=numlist[i]*10**(n-i-1)\n print(answer)'] | ['Runtime Error', 'Accepted'] | ['s274060486', 's583544541'] | [3064.0, 3064.0] | [18.0, 18.0] | [416, 560] |
p02761 | u131944095 | 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())\nS,C=[],[]\n\nfor _ in range(m):\n s,c=map(int,input().split())\n S.append(s)\n C.append(c)\ncur = 0\nfor i in range(10**(n-1)-1, 10**n):\n isOk = True\n for j in range(m):\n if str(i)[S[j]-1] != str(C[j]):\n isOk = False\n if isOk:\n print(i)\n sys.exit()\nprint(-1)', "n,m = map(int,input().split())\n \nsc=[list(map(int,input().split())) for _ in range(m)]\n \ndef main():\n for i in range(10**n):\n scstr = str(i)\n f = True\n if len(scstr) == n:\n for j in range(m):\n if scstr[sc[j][0]-1] != str(sc[j][1]):\n f = False\n if f:\n print(i)\n return\n print('-1')\n \nmain()"] | ['Runtime Error', 'Accepted'] | ['s213202519', 's038277417'] | [3064.0, 3060.0] | [19.0, 18.0] | [315, 340] |
p02761 | u132878037 | 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())\nk=m+1\ns=[0]*k\nc=[0]*k\nanswer=0\nfor i in range(m):\n s[i+1],c[i+1]=(int(x) for x in input().split())\n\n\na=[-1]*10\n\nfor i in range(m):\n if a[s[i+1]]==-1:\n a[s[i+1]]=c[i+1]\n elif not a[s[i+1]]==c[i+1]:\n answer=-1\nif a[1]==0 and not n=1:\n answer=-1\nif a[1]==-1 and not n=1:\n a[1]=1\nif a[1]==-1 and n=1:\n a[1]=0\nfor i in range(10):\n if a[i]==-1:\n a[i]=0\n\nif answer==0:\n for i in range(n):\n d=n-i-1\n answer+=10**d*a[i+1]\nprint(answer)\n', 'n,m=(int(x) for x in input().split())\nk=m+1\ns=[0]*k\nc=[0]*k\nanswer=0\nfor i in range(m):\n s[i+1],c[i+1]=(int(x) for x in input().split())\n\n\na=[-1]*10\n\nfor i in range(m):\n if a[s[i+1]]==-1:\n a[s[i+1]]=c[i+1]\n elif not a[s[i+1]]==c[i+1]:\n answer=-1\nif a[1]==0 and not n==1:\n answer=-1\nif a[1]==-1 and not n==1:\n a[1]=1\nif a[1]==-1 and n==1:\n a[1]=0\nfor i in range(10):\n if a[i]==-1:\n a[i]=0\n\nif answer==0:\n for i in range(n):\n d=n-i-1\n answer+=10**d*a[i+1]\nprint(answer)\n'] | ['Runtime Error', 'Accepted'] | ['s457192659', 's480617612'] | [3064.0, 3188.0] | [17.0, 19.0] | [524, 527] |
p02761 | u133347536 | 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) | ['op = [list(map(int, inp.split())) for inp in open(0)]\nprint(op)\nn = op[0][0]\nm = op[0][1]\ns = []\nc = []\ndict_ = {}\nflag = True\nfor i in range(1, m + 1):\n s = n + 1 - op[i][0]\n c = op[i][1]\n if s in dict_:\n if dict_[s] == c:\n pass\n else:\n flag = False\n else:\n dict_[s] = c\n if s == n and c == 0:\n flag = False\nif n in dict_:\n res = 10 ** (n - 1) * dict_[n]\nelse:\n res = 10 ** (n - 1)\nfor i in range(n - 1):\n if i + 1 in dict_:\n res += 10 ** i * dict_[i + 1]\nif flag:\n print(res)\nelse:\n print(-1)', 'op = [list(map(int, inp.split())) for inp in open(0)]\nn = op[0][0]\nm = op[0][1]\nlist_s = []\nlist_c = []\nfor i in range(1, m + 1):\n s = op[i][0]\n c = op[i][1]\n list_s.append(s)\n list_c.append(c)\nres = -1\nfor num in range(10 ** (n - 1), 10 ** n):\n list_ = [int(num_) for num_ in list(str(num))]\n flag = True\n for i in range(m):\n if list_[list_s[i] - 1] == list_c[i]:\n pass\n else:\n flag = False\n if flag:\n res = num\n break\nif n == 1:\n flag = True\n for i in range(m):\n if list_s[i] == 1:\n if list_c[i] == 0:\n pass\n else:\n flag = False\n else:\n flag = False\n if flag:\n res = 0\nprint(res)'] | ['Wrong Answer', 'Accepted'] | ['s192969408', 's832164825'] | [3064.0, 3064.0] | [17.0, 20.0] | [529, 652] |
p02761 | u136843617 | 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 - Guess The Number https://atcoder.jp/contests/abc157/tasks/abc157_c\nx,m = map(int, input().split())\ns=[-1]*m\nc=[-1]*m\nnum = [-1]*3\nans = 0\nfor i in range(m):\n s[i], c[i] = map(int, input().split())\n\nfor j, l in zip(s, c):\n if num[j-1] == -1:\n num[j-1] = l\n elif num[j-1] != l:\n print(-1)\n break\n\nelse:\n num = list(map(lambda x: x*0 if x<0 else x, num))\n print(num)\n for k in num:\n ans = ans *10 + k\n if ans != 0 and x>1:\n print(ans)\n elif ans == 0 and x ==1:\n print(0)\n else:\n print(-1)', '#C - Guess The Number https://atcoder.jp/contests/abc157/tasks/abc157_c\nx,m = map(int, input().split())\ns=[-1]*m\nc=[-1]*m\nnum = [-1]*3\nans = 0\nfor i in range(m):\n s[i], c[i] = map(int, input().split())\n\nfor j, l in zip(s, c):\n if num[j-1] == -1:\n num[j-1] = l\n elif num[j-1] != l:\n print(-1)\n break\n\nelse:\n num = list(map(lambda x: x*0 if x<0 else x, num))\n for k in num:\n ans = ans *10 + k\n if ans == 0 and x>1:\n print(-1)\n elif ans == 0 and x ==1:\n print(0)\n else:\n print(-1)', '#C - Guess The Number https://atcoder.jp/contests/abc157/tasks/abc157_c\nx,m = map(int, input().split())\ns=[-1]*m\nc=[-1]*m\nnum = [-1]*3\nans = 0\nfor i in range(m):\n s[i], c[i] = map(int, input().split())\n\nfor j, l in zip(s, c):\n if num[j-1] == -1:\n num[j-1] = l\n elif num[j-1] != l:\n print(-1)\n break\n\n \nelse:\n num = list(map(lambda x: x*0 if x<0 else x, num))\n for k in num:\n ans = ans *10 + k\n if ans != 0 and num>1:\n print(ans)\n else:\n print(-1)', 'x,m = map(int, input().split())\ns=[-1]*m\nc=[-1]*m\nfor i in range(m):\n s[i], c[i] = map(int, input().split())\nif x ==1:\n start = 0\nelse:\n start = 10**(x-1)\n\nfor j in range(start, 1000):\n num = str(j)\n for k1, k2 in zip(s, c):\n if num[k1-1] != str(k2):\n break\n else: \n print(j)\n break\nelse:\n print(-1)'] | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s178623679', 's600775919', 's859720915', 's390446213'] | [3064.0, 3064.0, 3064.0, 3064.0] | [18.0, 17.0, 17.0, 18.0] | [566, 550, 561, 381] |
p02761 | u137226361 | 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 = ['t'] * n\n\nfor _ in range(m):\n s, c = map(int, input().split())\n if ans[s-1] =='t' or ans[s-1] == str(c):\n ans[s-1]= str(c)\n else:\n print(-1)\n exit(0)\nans = ''.join(ans).replace('t', str(0))\nprint(ans)\nans = int(ans)\nl = str(ans)\nprint(l)\nif len(l) != n:\n print(-1)\nelse:\n print(ans)", "n, m = map(int, input().split())\nans = ['t'] * n\n\nfor _ in range(m):\n s, c = map(int, input().split())\n if ans[s-1] =='t' or ans[s-1] == str(c):\n ans[s-1]= str(c)\n else:\n print(-1)\n exit(0)\nans = ''.join(ans).replace('t', str(0))\nans = int(ans)\nl = str(ans)\nif l != n:\n print(-1)\nelse:\n print(ans)\n ", "n, m = map(int, input().split())\nans = ['t'] * n\n\nfor _ in range(m):\n s, c = map(int, input().split())\n if ans[s-1] =='t' or ans[s-1] == str(c):\n ans[s-1]= str(c)\n else:\n print(-1)\n exit(0)\nif ans[0] == 't' and n >1:\n ans[0]=str(1)\n\nans = ''.join(ans).replace('t', str(0))\nans = int(ans)\nl = str(ans)\nif len(l) != n:\n print(-1)\nelse:\n print(ans)"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s370405918', 's743496689', 's061681664'] | [9220.0, 9200.0, 9220.0] | [27.0, 24.0, 28.0] | [358, 338, 384] |
p02761 | u139112865 | 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={i:-1 for i in range(1,n+1)}\nflg=True\nfor _ in range(m):\n s,c=map(int,input().split())\n if s==1 and c==0:\n flg=False\n elif d[s]==-1:\n d[s]=c\n else:\n flg=False\n\nans=[]\nfor i in range(1,n+1):\n if d[i]==-1:\n if i==1:\n d[i]=1\n else:\n d[i]=0\n ans.append(d[i])\n \nif flg:\n print(*ans,sep='')\nelse:\n print(-1)", "n,m=map(int,input().split())\nans=[-1 for _ in range(n)]\nflg=True\nfor i in range(m):\n s,c=map(int,input().split())\n s-=1\n if ans[s]==-1:\n ans[s]=c\n elif ans[s]!=c:\n flg=False\n \nif len(ans)>1 and ans[0]==0:\n flg=False\n \nfor i in range(n):\n if ans[i]==-1:\n if n==1:\n ans[i]=0\n else:\n if i==0:\n ans[i]=1\n else:\n ans[i]=0\n \nif flg:\n print(*ans,sep='')\nelse:\n print(-1)"] | ['Wrong Answer', 'Accepted'] | ['s213230171', 's402389864'] | [3064.0, 3064.0] | [17.0, 18.0] | [416, 507] |
p02761 | u143051858 | 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())\ns1 = []\ns2 = []\nflg = True\nfor i in range(M):\n n1,n2 = map(int,input().split())\n s1.append(n1)\n s2.append(n2)\nfor i in range(1000):\n flg = True\n num = [int(x) for x in list(str(i))]\n if len(num) == N:\n for j in range(M):\n if s2[j] != num[s1[j] - 1]:\n flg = False\n if flg:\n print(s2)\n print(i)\n print(num)\n exit()\nif flg == False:\n print(-1)', 'N,M = map(int, input().split())\ns1 = []\ns2 = []\nflg = True\nfor i in range(M):\n n1,n2 = map(int,input().split())\n s1.append(n1)\n s2.append(n2)\nfor i in range(1000):\n flg = True\n num = [int(x) for x in list(str(i))]\n if len(num) == N:\n for j in range(M):\n if s2[j] != num[s1[j] - 1]:\n flg = False\n if flg:\n print(i)\n exit()\nprint(-1)'] | ['Wrong Answer', 'Accepted'] | ['s037215304', 's754934656'] | [3064.0, 3064.0] | [19.0, 20.0] | [417, 365] |
p02761 | u143212659 | 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\n# -*- coding: utf-8 -*-\n\n\ndef main():\n N, M = map(int, input().split())\n result = [0] * N\n\n for m in range(M):\n s, c = map(int, input().split())\n if s == 1 and c == 0:\n print(-1)\n exit(0)\n\n if result[s - 1] == c:\n continue\n elif result[s - 1] != 0:\n print(-1)\n exit(0)\n else:\n result[s - 1] = c\n\n result[0] = 1\n result = int(\'\'.join([str(r) for r in result]))\n\n if len(list(str(result))) == N:\n print(result)\n else:\n print(-1)\n\n\nif __name__ == "__main__":\n main()\n', '#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\n\ndef main():\n N, M = map(int, input().split())\n SC = [list(map(int, input().split())) for i in range(M)]\n\n for i in range(10**N):\n result = str(i)\n if len(result) != N:\n continue\n if all(result[s - 1] == str(c) for s, c in SC):\n print(result)\n exit()\n\n print(-1)\n\n\nif __name__ == "__main__":\n main()\n'] | ['Wrong Answer', 'Accepted'] | ['s672931062', 's813341547'] | [3064.0, 3060.0] | [17.0, 18.0] | [626, 417] |
p02761 | u145600939 | 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())\narray = [10]*N\nT_F = True\n\nfor i in range(M):\n s,c = map(int,input().split())\n if s>N or (array[s-1] != 10 and array[s-1] !=c) or (s == 1 and c == 0):\n T_F = False\n break\n else:\n array[s-1] = c\nans = 0\n\nif T_F:\n for i in range(N):\n if array[i] == 10:\n array[i] == 0\n ans += array[i]*(10**(N-i-1))\n if array[0]:\n print(ans)\n else:\n print(ans+10**(N-1))\nelse:\n print(-1)', 'N,M = map(int,input().split())\narray = [10]*N\nT_F = True\n\nfor i in range(M):\n s,c = map(int,input().split())\n if s>N or (array[s-1] != 10 and array[s-1] !=c) or (s == 1 and c == 0):\n T_F = False\n break\n else:\n array[s-1] = c\nans = 0\n\nif T_F:\n for i in range(N):\n if array[i] == 10:\n array[i] == 0\n ans += array[i]*(10**(N-i-1))\n if array[0]:\n print(ans)\n else:\n print(ans+10**(N-1))\nelse:\n print(-1)', 'N,M = map(int,input().split())\narray = [10]*N\nT_F = True\n\nfor i in range(M):\n s,c = map(int,input().split())\n if s>N or (array[s-1] != 10 and array[s-1] !=c) or (s == 1 and c == 0 and N != 1):\n T_F = False\n break\n else:\n array[s-1] = c\n\nans = 0\nif T_F:\n for i in range(N):\n if array[i] == 10:\n array[i] = 0\n ans += array[i]*(10**(N-i-1))\n if array[0] or N == 1:\n print(ans)\n else:\n print(ans+10**(N-1))\nelse:\n print(-1)'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s057999995', 's234611038', 's112380278'] | [2940.0, 3064.0, 3064.0] | [17.0, 17.0, 18.0] | [428, 434, 454] |
p02761 | u150641538 | 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) | ["f = True\nn,m=map(int,input().split())\nnumber = [-1 for i in range(n)]\nfor i in range(m):\n s,c=list(map(int,input().split()))\n s -= 1\n if s == 0 and c == 0 and n > 1:\n f = False\n elif number[s] == -1:\n number[s] = c\n f = False\n else:\n f = False\nif not f:\n print(-1)\nelif n == 1:\n if number[0] == -1:\n print(0)\n else:\n print(number[0])\nelse:\n if number[0] == -1:\n number[0] = 1\n for i in range(1,n):\n if number[i] == -1:\n number[i] = 0\n print(''.join(map(str,number)))", "f = True\nn,m=map(int,input().split())\nnumber = [-1 for i in range(n)]\nfor i in range(m):\n s,c=list(map(int,input().split()))\n s -= 1\n if s == 0 and c == 0 and n > 1:\n f = False\n elif number[s] == -1 or number[s] == c:\n number[s] = c\n else:\n f = False\nif not f:\n print(-1)\nelif n == 1:\n if number[0] == -1:\n print(0)\n else:\n print(number[0])\nelse:\n if number[0] == -1:\n number[0] = 1\n for i in range(1,n):\n if number[i] == -1:\n number[i] = 0\n print(''.join(map(str,number)))"] | ['Wrong Answer', 'Accepted'] | ['s735923984', 's574200048'] | [3064.0, 3064.0] | [17.0, 17.0] | [506, 510] |
p02761 | u153902122 | 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=[0]*(N)\nans=[0]*(N)\nfor i in range(M):\n si,ci=map(int,input().split())\n si-=1\n if res[si]==1 and ans[si]!=ci:\n print(-1)\n exit()\n res[si]=1\n ans[si]=ci\nif N==1:\n if ans==[0]:\n print(0)\n exit()\n else:\n print(ans[0])\n exit()\n\nif ans[N-1]==0:\n print(-1)\n exit()\nans = ans\nfor s in ans:\n print(s, end ="")', 'N,M=map(int,input().split())\nres=[0]*(N)\nans=[0]*(N)\nfor i in range(M):\n si,ci=map(int,input().split())\n si-=1\n if res[si]==1 and ans[si]!=ci:\n print(-1)\n exit()\n res[si]=1\n ans[si]=ci\nif N==1:\n if ans==[0]:\n print(0)\n exit()\n else:\n print(ans[0])\n exit()\n\nif ans[N-1]==0:\n print(-1)\n exit()\nans = ans[::-1]\nfor s in ans:\n print(s, end ="")', 'N,M=map(int,input().split())\nres=[0]*(N)\nans=[0]*(N)\nfor i in range(M):\n si,ci=map(int,input().split())\n si-=1\n if res[si]==1 and ans[si]!=ci:\n print(-1)\n exit()\n res[si]=1\n ans[si]=ci\nif ans[N-1]==0:\n print(-1)\n exit()\nans = ans[::-1]\nfor s in ans:\n print(s, end ="")', 'N,M=map(int,input().split())\nres=[0]*(N)\nans=[0]*(N)\nfor i in range(M):\n si,ci=map(int,input().split())\n si-=1\n if res[si]==1 and ans[si]!=ci:\n print(-1)\n exit()\n res[si]=1\n ans[si]=ci\nif N==1:\n if ans==[0]:\n print(0)\n exit()\n else:\n print(ans[0])\n exit()\nif ans[0]==0:\n print(-1)\n exit()\nans = ans\nfor s in ans:\n print(s, end ="")', 'n, m = map(int, input().split())\nsc = [list(map(int, input().split())) for i in range(m)]\nif n == 3:\n l = range(100, 1000)\nif n == 2:\n l = range(10, 100)\nif n == 1:\n l = range(0, 10)\nflag = False\nfor i in l:\n num = str(i)\n if all([num[s-1] == str(c) for s, c in sc]):\n #print(num)\n #exit()\n flag = True\n ans = num\n break\nif flag:\n print(num)\nelse:\n print(-1)\n'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s573642238', 's742142492', 's905918036', 's972619138', 's929903894'] | [3064.0, 3064.0, 3064.0, 3188.0, 3188.0] | [17.0, 17.0, 17.0, 19.0, 19.0] | [406, 412, 306, 403, 415] |
p02761 | u153968927 | 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)\nS = []\nC = []\nA = []\nzero_flag = False\nfor m in range(M):\n s, c = input().split()\n s = int(s)\n c = int(c)\n S.append(s)\n C.append(c)\n if s == 2 and c == 0 and N == 2:\n A.append('0')\n elif s == 2 and c == 0 and N == 3:\n A.append('00')\n elif s == 3 and c == 0 and N == 3:\n A.append('0') \n else:\n \tA.append(str((10**(N-(s-1)-1)) * c))\n if s == 1 and c == 0 and N != 1:\n zero_flag = True\n\nprint(A)\nflag = False\nfor a1 in A:\n for a2 in A:\n if a1 != a2 and len(a1) == len(a2):\n if a1 != a2:\n flag = True\n\nif zero_flag:\n print(-1)\nelif flag:\n print(-1)\nelse:\n ans = list(set(A))\n sum_ans = 0\n for a in ans:\n sum_ans += int(a)\n if sum_ans < (10**(N-1)):\n \tsum_ans = sum_ans + (10**(N-1)) \n print(sum_ans)\n", "N, M = input().split()\nN = int(N)\nM = int(M)\nS = []\nC = []\nA = []\nzero_flag = False\nfor m in range(M):\n s, c = input().split()\n s = int(s)\n c = int(c)\n S.append(s)\n C.append(c)\n if s == 2 and c == 0 and N == 2:\n A.append('0')\n elif s == 2 and c == 0 and N == 3:\n A.append('00')\n elif s == 3 and c == 0 and N == 3:\n A.append('0') \n else:\n \tA.append(str((10**(N-(s-1)-1)) * c))\n if s == 1 and c == 0 and N != 1:\n zero_flag = True\n\nflag = False\nfor a1 in A:\n for a2 in A:\n if a1 != a2 and len(a1) == len(a2):\n if a1 != a2:\n flag = True\n\nif zero_flag:\n print(-1)\nelif flag:\n print(-1)\nelse:\n ans = list(set(A))\n sum_ans = 0\n for a in ans:\n sum_ans += int(a)\n if sum_ans < (10**(N-1)) and N != 1:\n \tsum_ans = sum_ans + (10**(N-1)) \n print(sum_ans)\n"] | ['Wrong Answer', 'Accepted'] | ['s503703862', 's502109614'] | [3064.0, 3064.0] | [17.0, 18.0] | [791, 793] |
p02761 | u155659281 | 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\t\nimport sys\nstdin = open(0)\nN,M = (stdin.readline()).split()\nN = int(N)\nM = int(M)\nsc = []\nans = np.array([-1,-1,-1])\nfor i in range(M):\n sc.append(stdin.readline().split())\nsc = np.array(sc, dtype='int')\n\n\nif (N<1)|(N>3):\n print(-1)\n sys.exit()\nif (M<0)|(M>5):\n print(-1)\n sys.exit()\nfor i in range(M):\n if(sc[i,0]>N)|(sc[i,0]<1):\n print(-1)\n sys.exit()\n if(sc[i,1]>9)|(sc[i,1]<0):\n print(-1)\n sys.exit()\n \n#conflict\nfor i in range(M):\n for j in range(i+i,M):\n if ((sc[i,0] == sc[j,0]) & (sc[i,1] != sc[j,1])):\n print(-1)\n sys.exit()\n\nans = np.array([-1,-1,-1])\nfor i in range(M):\n ans[sc[i,0]-1] = sc[i,1]\n\nprint(ans)\nif N==1:\n if(ans[0]==-1):\n answer = 0\n else:\n answer = ans[0]\n print(answer)\n sys.exit()\nelif N==2:\n if(ans[0]==-1):\n ans[0]=1\n elif(ans[0]==0):\n print(-1)\n sys.exit()\n if(ans[1]==-1):\n ans[1] =0\n answer = ans[0]*10+ans[1]\n print(answer)\n sys.exit()\nelse:\n if(ans[0]==0):\n print(-1)\n sys.exit()\n elif(ans[0]==-1):\n ans[0] = 1\n if(ans[1]==-1):\n ans[1]=0\n if(ans[2]==-1):\n ans[2]=0\n answer = ans[0]*100+ans[1]*10+ans[2]\n print(answer)\n sys.exit()\n \n", "import numpy as np\t\nimport sys\nstdin = open(0)\nN,M = (stdin.readline()).split()\nN = int(N)\nM = int(M)\nsc = []\nans = np.array([-1,-1,-1])\nfor i in range(M):\n sc.append(stdin.readline().split())\nsc = np.array(sc, dtype='int')\n\n\nif (N<1)|(N>3):\n print(-1)\n sys.exit()\nif (M<0)|(M>5):\n print(-1)\n sys.exit()\nfor i in range(M):\n if(sc[i,0]>N)|(sc[i,0]<1):\n print(-1)\n sys.exit()\n if(sc[i,1]>9)|(sc[i,1]<0):\n print(-1)\n sys.exit()\n \n#conflict\nfor i in range(M):\n for j in range(i+i,M):\n if ((sc[i,0] == sc[j,0]) & (sc[i,1] != sc[j,1])):\n print(-1)\n sys.exit()\n\nfor i in range(M):\n ans[sc[i,0]+2-N] = sc[i,1]\n\nif ans[0] == 0:\n print(-1)\n sys.exit()\nif (ans[1] == 0)&(N==2):\n print(-1)\n sys.exit()\n\nprint(ans)\nif ans[2]==-1:\n ans[2] = 0\nif ans[1]==-1:\n ans[1] = 0\nif ans[0]==-1:\n if(N==3):\n ans[0] = 1\n else:\n ans[0] = 0\n\nanswer = ans[0]*100+ans[1]*10+ans[2]\n\nif (N==3):\n if(answer<100):\n print(-1)\n sys.exit()\nelif (N==2):\n if(answer<10)|(answer>100):\n print(-1)\n sys.exit()\nelif (N==1):\n if(answer>10):\n print(-1)\n sys.exit()\n \nprint(answer)", "import numpy as np\t\nimport sys\nstdin = open(0)\nN,M = (stdin.readline()).split()\nN = int(N)\nM = int(M)\nsc = []\nans = np.array([-1,-1,-1])\nfor i in range(M):\n sc.append(stdin.readline().split())\nsc = np.array(sc, dtype='int')\n\n\nif (N<1)|(N>3):\n print(-1)\n sys.exit()\nif (M<0)|(M>5):\n print(-1)\n sys.exit()\nfor i in range(M):\n if(sc[i,0]>N)|(sc[i,0]<1):\n print(-1)\n sys.exit()\n if(sc[i,1]>9)|(sc[i,1]<0):\n print(-1)\n sys.exit()\n \n#conflict\nfor i in range(M):\n for j in range(i+i,M):\n if ((sc[i,0] == sc[j,0]) & (sc[i,1] != sc[j,1])):\n print(-1)\n sys.exit()\n\nans = np.array([-1,-1,-1])\nfor i in range(M):\n ans[sc[i,0]-1] = sc[i,1]\n\nif N==1:\n if(ans[0]==-1):\n answer = 0\n else:\n answer = ans[0]\n print(answer)\n sys.exit()\nelif N==2:\n if(ans[0]==-1):\n ans[0]=1\n elif(ans[0]==0):\n print(-1)\n sys.exit()\n if(ans[1]==-1):\n ans[1] =0\n answer = ans[0]*10+ans[1]\n print(answer)\n sys.exit()\nelse:\n if(ans[0]==0):\n print(-1)\n sys.exit()\n elif(ans[0]==-1):\n ans[0] = 1\n if(ans[1]==-1):\n ans[1]=0\n if(ans[2]==-1):\n ans[2]=0\n answer = ans[0]*100+ans[1]*10+ans[2]\n print(answer)\n sys.exit()\n \n"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s407045173', 's828111819', 's836842716'] | [12504.0, 12504.0, 12504.0] | [151.0, 152.0, 150.0] | [1185, 1119, 1174] |
p02761 | u157020659 | 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_li = [list(map(int, input().split())) for i in range(m)]\n\nif n != 1:\n ans = ['1']\n ans.extend(['0'] * (n - 1))\nelse:\n ans = ['0']\n flag = [0] * n\n\nfor s, c in s_li:\n if flag[s - 1] == 0:\n ans[s - 1] = '{}'.format(c)\n flag[s - 1] = 1\n elif flag[s - 1] == 1 and int(ans[s - 1]) == c:\n continue\n else:\n ans = ['-1']\n break\n\nans = int(('').join(ans))\n\nif n != 1 and (ans // 10**(n - 1)) == 0:\n ans = -1\n\nprint(ans)", "n, m = map(int, input().split())\ns_li = [list(map(int, input().split())) for i in range(m)]\n\nif n != 1:\n ans = ['1']\n ans.extend(['0'] * (n - 1))\nelse:\n ans = ['0']\nflag = [0] * n\n\nfor s, c in s_li:\n if flag[s - 1] == 0:\n ans[s - 1] = '{}'.format(c)\n flag[s - 1] = 1\n elif flag[s - 1] == 1 and int(ans[s - 1]) == c:\n continue\n else:\n ans = ['-1']\n break\n\nans = int(('').join(ans))\n\nif n != 1 and (ans // 10**(n - 1)) == 0:\n ans = -1\n\nprint(ans)"] | ['Runtime Error', 'Accepted'] | ['s538424694', 's951449733'] | [3064.0, 3064.0] | [17.0, 17.0] | [504, 500] |
p02761 | u157232135 | 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 n, m = list(map(int, input().split()))\n r = [-1] * n\n for _ in range(m):\n i, v = map(int, input().split())\n if r[i-1] == -1:\n r[i-1] = v\n elif r[i-1] != v:\n print(-1)\n return\n r = [0 if i == -1 else i for i in r]\n r = "".join(map(str, r))\n if len(str(int(r))) == n:\n print(-1)\n else:\n print(r)\n\nif __name__ == \'__main__\':\n main()', "def main():\n n, m = list(map(int, input().split()))\n x = []\n for _ in range(m):\n x.append(list(map(int, input().split())))\n for i in range(1000):\n y = str(i)\n if len(y) != n:\n continue\n \n for s, c in x:\n if y[s-1] != str(c):\n break\n else:\n print(i)\n return\n print(-1)\n\nif __name__ == '__main__':\n main()"] | ['Wrong Answer', 'Accepted'] | ['s393465075', 's230374138'] | [3064.0, 3064.0] | [18.0, 18.0] | [434, 422] |
p02761 | u163501259 | 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)]\n\nseen = []\nlist_1 = [ x for x in sc if x not in seen and not seen.append(x)]\n\nflag = [0]*n\nans = [0]*n\n\nfor i in range(len(list_1)):\n ans[list_1[i][0] - 1] = list_1[i][1]\n flag[list_1[i][0] - 1] += 1\n', "n, m = map(int, input().split())\nsc = [list(map(int, input().split())) for i in range(m)]\n\nseen = []\nlist_1 = [ x for x in sc if x not in seen and not seen.append(x)]\n\nflag = [0]*n\nans = [0]*n\nerr = False\nnum = ''\nfor i in range(len(list_1)):\n if flag[list_1[i][0] - 1] == 0:\n ans[list_1[i][0] - 1] = list_1[i][1]\n flag[list_1[i][0] - 1] += 1\n else:\n err = True\nif flag[0] == 0 and n == 1:\n ans[0] = 0\nelif flag[0] == 0 and n > 1:\n ans[0] = 1\nelif n>1 and ans[0] == 0:\n err = True\n\nif err == False:\n for i in range(n):\n num += str(ans[i])\nelse:\n num = -1\n\nprint(num)"] | ['Wrong Answer', 'Accepted'] | ['s492757011', 's697737462'] | [3064.0, 3064.0] | [19.0, 17.0] | [298, 587] |
p02761 | u163829702 | 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]*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 print(-1)\n break\n\nprint(ans)\nif len(ans) == 1:\n print(0)\nelse:\n if ans[0] == 0:\n ans = [-1]\n elif ans[0] == -1:\n ans[0] = 1\n for i in range(M):\n if ans[i] == -1:\n ans[i] = 0\n print(int(''.join(map(str,ans))))", "N, M = map(int, input().split())\nif N == 0:\n ans = [0]\nelse:\n ans = [0 for _ in range(N)]\nprint(ans)\nfor i in range(M):\n s, c = map(int, input().split())\n if s == 1 and c == 0 and len(ans) > 1:\n print(-1)\n break\n elif ans[s-1] != 0 and ans[s-1] != c:\n print(-1)\n break\n else:\n ans[s-1] = c\nelse:\n print(int(''.join(map(str,ans))))", "N, M = map(int, input().split())\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 print(-1)\n break\n\nif len(ans) == 1:\n print(0)\nelse:\n if ans[0] == 0:\n print(-1)\n elif ans[0] == -1:\n ans[0] = 1\n for i in range(1, M):\n if ans[i] == -1:\n ans[i] = 0\n print(int(''.join(map(str,ans))))", "N, M = map(int, input().split())\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 print(-1)\n exit()\nif N == 1:\n if ans[0] == -1:\n print(0)\n else:\n print(int(''.join(map(str,ans))))\nelse:\n if ans[0] == 0:\n print(-1)\n exit()\n elif ans[0] == -1:\n ans[0] = 1\n for i in range(N):\n if ans[i] == -1:\n ans[i] = 0\n print(int(''.join(map(str,ans))))"] | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s005502866', 's482160004', 's740074569', 's695089048'] | [3064.0, 3064.0, 3064.0, 3064.0] | [18.0, 17.0, 18.0, 20.0] | [440, 386, 447, 513] |
p02761 | u164029270 | 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().rstrip().split()]\nn = 1 if N > 1 else 0\nC = [list(range(n,10))] + [list(range(10)) for i in range(N-1)]\n\nfor m in range(M):\n s,c = [int(i) for i in input().rstrip().split()]\n s -= 1\n if c in C[s]:\n C[s] = [c]\n else:\n print(-1)\n exit()\n print(C)\nC = [str(min(c)) for c in C]\nprint("".join(C))\n', 'N,M = [int(i) for i in input().rstrip().split()]\nn = 1 if N > 1 else 0\nC = [list(range(n,10))] + [list(range(10)) for i in range(N-1)]\n\nfor m in range(M):\n s,c = [int(i) for i in input().rstrip().split()]\n s -= 1\n if c in C[s]:\n C[s] = [c]\n else:\n print(-1)\n exit()\n #print(C)\nC = [str(min(c)) for c in C]\nprint("".join(C))\n'] | ['Wrong Answer', 'Accepted'] | ['s911951967', 's257461133'] | [3064.0, 3064.0] | [17.0, 18.0] | [359, 360] |
p02761 | u167205647 | 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 = []\nfor i in range(m):\n l.append(list(map(int,input().split())))\nans = -1\nif n == 1:\n for i in range(10):\n i = str(i)\n flag = True\n for j in range(m):\n if i[l[j][0]-1] != str(l[j][1]) :\n flag = False\n if flag:\n ans = int(i)\n break\nelse:\n for i in range(10**(n-1),10**n):\n i = str(i)\n flag = True\n for j in range(m):\n if i[l[j][0]-1] != str(l[j][1]) :\n flag = False\n if flag:\n ans = int(i)\n break\nprint(ans)\n', 'n,m = map(int,input().split())\nl = []\nfor i in range(m):\n l.append(list(map(int,input().split())))\nans = -1\nif n == 1:\n for i in range(10):\n i = str(i)\n flag = True\n for j in range(m):\n if i[l[j][0]-1] != str(l[j][1]) :\n flag = False\n if flag:\n ans = int(i)\n break\nelse:\n for i in range(10**(n-1),10**n):\n i = str(i)\n flag = True\n for j in range(m):\n if i[l[j][0]-1] != str(l[j][1]) :\n flag = False\n if flag:\n ans = int(i)\n break\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s446747356', 's031386869'] | [3064.0, 3064.0] | [18.0, 19.0] | [570, 601] |
p02761 | u167681750 | 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\nif n == 1 and m == 0:\n print(0)\n exit()\n\nans = [-1] * n\n\n\nfor i in range(m):\n s, c = map(int, input().split())\n s -= 1\n if ans[s] != -1 and ans[s] != c:\n print(-1)\n exit()\n\n else:\n ans[s] = c\n \nelif ans[0] == 0 and n >= 2:\n print(-1)\n exit()\n \nelif ans[0] == -1:\n ans[0] = 1\n\na = ""\nfor i in ans:\n a += str(i) if i != -1 else "0"\nprint(a)\n', 'n, m = map(int, input().split())\n\nif n == 1 and m == 0:\n print(0)\n exit()\n\nans = [-1] * n\n\n\nfor i in range(m):\n s, c = map(int, input().split())\n s -= 1\n if ans[s] != -1 and ans[s] != c:\n print(-1)\n exit()\n\n else:\n ans[s] = c\n\nif ans[0] == 0 and n >= 2:\n print(-1)\n exit()\n\nelif ans[0] == -1:\n ans[0] = 1\n\na = ""\nfor i in ans:\n a += str(i) if i != -1 else "0"\nprint(a)'] | ['Runtime Error', 'Accepted'] | ['s651563604', 's142506401'] | [2940.0, 3064.0] | [17.0, 17.0] | [430, 415] |
p02761 | u167908302 | 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) | ["#coding:utf-8\nn, m = map(int, input().split())\nnum = '0' * n\ncount = [0, 0, 0]\n\n\nfor i in range(m):\n s, c = map(int, input().split())\n print(num, count)\n if (s == 1 and c == 0) or (count[s-1] >= 1 and int(num[s-1]) != c):\n print(-1)\n exit()\n else:\n count[s-1] += 1\n if int(num[s-1]) != c:\n \n num = list(num)\n num[s-1:s] = str(c)\n num = ''.join(num)\n\nif num[0] == '0':\n print(-1)\n exit()\nelse:\n print(num)\n", "#coding:utf-8\nn, m = map(int, input().split())\nnum = '0' * n\ncount = [0, 0, 0]\n\n\nfor i in range(m):\n s, c = map(int, input().split())\n if (n >= 2 and s == 1 and c == 0) or (count[s-1] >= 1 and int(num[s-1]) != c):\n print(-1)\n exit()\n else:\n count[s-1] += 1\n if int(num[s-1]) != c:\n num = list(num)\n num[s-1:s] = str(c)\n num = ''.join(num)\n\nif len(num) >= 2 and num[0] == '0':\n num = list(num)\n num[0:1] = '1'\n num = ''.join(num)\n\nprint(num)\n"] | ['Wrong Answer', 'Accepted'] | ['s184351031', 's634458678'] | [3064.0, 3064.0] | [18.0, 17.0] | [537, 520] |
p02761 | u167988719 | 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\nA = [-1] * N\nok= True\nfor s, c in SC:\n i = s-1\n if A[i] != -1 and A[i] != c:\n ok = False\n break\n A[i] = c\nif N > 1 and A[0]==0:\n ok = False\nif ok:\n for i in range(N):\n if A[i] == -1:\n if i == 0 && N != 1:\n A[i] = 1\n else:\n A[i] = 0\nif ok:\n print(''.join(map(str, A)))\nelse: \n print(-1)", "N, M = map(int, input().split())\nSC = [list(map(int, input().split())) for _ in range(M)]\n\nA = [-1] * N\nok= True\nfor s, c in SC:\n i = s-1\n if A[i] != -1 and A[i] != c:\n ok = False\n break\n A[i] = c\nif N > 1 and A[0]==0:\n ok = False\nif ok:\n for i in range(N):\n if A[i] == -1:\n if i == 0 and N != 1:\n A[i] = 1\n else:\n A[i] = 0\nif ok:\n print(''.join(map(str, A)))\nelse: \n print(-1)"] | ['Runtime Error', 'Accepted'] | ['s208149370', 's849437425'] | [3064.0, 3064.0] | [17.0, 17.0] | [473, 474] |
p02761 | u169350228 | 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\nfor i in range(n):\n ans += "x"\n\npf = True\nfor i in range(m):\n s,c = map(int,input().split())\n if (not ans[s] == "x") and (not ans[s] == str(c)):\n print(-1)\n pf = False\n break\n else:\n ans[s] = str(c)\n\nif pf:\n if ans[0] == "x":\n ans[0] = "1"\n for i in range(n):\n if ans[i] == "x":\n ans[i] = "0"\nprint(ans)\n', "n, m = map(int,input().split())\n\nans = [-1 for i in range(n)]\n\npf = True\nfor i in range(m):\n s,c = map(int,input().split())\n if ((not ans[s-1] == -1) and (not ans[s-1] == c)) or ((not n == 1)and s == 1 and c == 0):\n print(-1)\n pf = False\n break\n else:\n ans[s-1] = c\n\nif pf and n == 1:\n if ans[0] == -1:\n print(0)\n else:\n print(ans[0])\nelif pf:\n if ans[0] == -1:\n ans[0] = 1\n for i in range(n):\n if ans[i] == -1:\n ans[i] = 0\n print(''.join(map(str,ans)))\n"] | ['Runtime Error', 'Accepted'] | ['s730716272', 's166946339'] | [3064.0, 3064.0] | [17.0, 17.0] | [408, 545] |
p02761 | u169501420 | 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) | ["# -*- coding: utf-8 -*-\nimport sys\n\n[N, M] = [int(i) for i in input().split()]\n\nSC = []\nfor m in range(M):\n [s, c] = [int(i) for i in input().split()]\n SC.append((s, c))\n\nans_str = ['0'] * N\n\nprint(ans_str)\n\nfor (s, c) in SC:\n if ans_str[s - 1] != '0' and ans_str[s - 1] != str(c):\n print(-1)\n sys.exit()\n \n ans_str[s - 1] = str(c)\n\nprint(ans_str)\n\nfor s in ans_str:\n if s != '0':\n break\nelse:\n print(-1)\n sys.exit()\n\nfor i in range(len(ans_str)):\n if ans_str[i] == '0':\n ans_str[i] = '1'\n else:\n break\n\nans = ''.join(ans_str)\nprint(int(ans))", "# -*- coding: utf-8 -*-\nimport sys\n\n[N, M] = [int(i) for i in input().split()]\n\nSC = []\nfor m in range(M):\n [s, c] = [int(i) for i in input().split()]\n SC.append((s, c))\n\nans_str = ['-1'] * N\n\nfor (s, c) in SC:\n if ans_str[s - 1] != '-1' and ans_str[s - 1] != str(c):\n print(-1)\n sys.exit()\n if s == 1 and c == 0 and N != 1:\n print(-1)\n sys.exit()\n \n ans_str[s - 1] = str(c)\n\nif N == 1:\n if ans_str[0] == '-1':\n ans_str[0] = '0'\nelse:\n for i in range(len(ans_str)):\n if ans_str[i] == '-1':\n if i == 0:\n ans_str[i] = '1'\n else:\n ans_str[i] = '0'\n\nans = ''.join(ans_str)\nprint(int(ans))"] | ['Wrong Answer', 'Accepted'] | ['s137589393', 's059697501'] | [3064.0, 3064.0] | [17.0, 17.0] | [611, 706] |
p02761 | u170410075 | 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)]\ns=[]\nc=[]\nf=0\nans=[str(0) for i in range(n)]\nfor i in range(m):\n if sc[i][0]==1 and sc[i][1]==0 and n!=1:\n f=-1\n break\n else:\n if sc[i][0] in s:\n if sc[i][1]!=c[s.index(sc[i][0])]:\n f=-1\n break\n else:\n ans[sc[i][0]-1]=str(sc[i][1])\n s.append(sc[i][0])\n c.append(sc[i][1])\nif s[i] in 1 and c[s.index(1)]==0 and n!=1:\n f=-1\n \nif f==-1:\n print(-1)\nelse:\n if n==1:\n print(''.join(ans))\n else:\n if s[i] in 1:\n if c[s.index(1)]==0:\n ans=str(-1)\n if ans[0]==str(0):\n ans[0]==str(1)\n print(''.join(ans))\n", "n,m = map(int, input().split())\nsc=[list(map(int,input().split())) for i in range(m)]\ns=[]\nc=[]\nf=0\nans=[str(0) for i in range(n)]\nfor i in range(m):\n if sc[i][0]==1 and sc[i][1]==0 and n!=1:\n f=-1\n break\n else:\n if sc[i][0] in s:\n if sc[i][1]!=c[s.index(sc[i][0])]:\n f=-1\n break\n else:\n ans[sc[i][0]-1]=str(sc[i][1])\n s.append(sc[i][0])\n c.append(sc[i][1])\nif c(s.index(0))==0 and n!=1:\n f=-1\n \nif f==-1:\n print(-1)\nelse:\n if n==1:\n print(''.join(ans))\n else:\n if ans[0]==str(0):\n ans[0]==str(1)\n print(''.join(ans))\n", "n,m = map(int, input().split())\nsc=[list(map(int,input().split())) for i in range(m)]\ns=[]\nc=[]\nf=0\nans=[str(0) for i in range(n)]\nfor i in range(m):\n if sc[i][0]==1 and sc[i][1]==0 and n!=1:\n f=-1\n break\n else:\n if sc[i][0] in s:\n if sc[i][1]!=c[s.index(sc[i][0])]:\n f=-1\n break\n else:\n ans[sc[i][0]-1]=str(sc[i][1])\n s.append(sc[i][0])\n c.append(sc[i][1])\nif s[i] in 1:\n if n!=1 and c[s.index(1)]==0:\n f=-1\nif f==-1:\n print(-1)\nelse:\n if n==1:\n print(''.join(ans))\n else:\n if ans[0]==str(0):\n ans[0]==str(1)\n print(''.join(ans))\n", "n,m = map(int, input().split())\nsc=[list(map(int,input().split())) for i in range(m)]\ns=[]\nc=[]\nf=0\nans=[str(0) for i in range(n)]\nfor i in range(m):\n if sc[i][0]==1 and sc[i][1]==0 and n!=1:\n f=-1\n break\n else:\n if sc[i][0] in s:\n if sc[i][1]!=c[s.index(sc[i][0])]:\n f=-1\n break\n else:\n ans[sc[i][0]-1]=str(sc[i][1])\n s.append(sc[i][0])\n c.append(sc[i][1])\n\nif f==-1:\n print(-1)\nelse:\n if n==1:\n print(''.join(ans))\n else:\n if s[i] in 1:\n if c[s.index(1)]==0:\n ans=str(-1)\n if ans[0]==str(0):\n ans[0]==str(1)\n print(''.join(ans))\n", "n,m = map(int, input().split())\nsc=[list(map(int,input().split())) for i in range(m)]\ns=[]\nc=[]\nf=0\nans=[str(0) for i in range(n)]\nfor i in range(m):\n if sc[i][0]==1 and sc[i][1]==0 and n!=0:\n f=-1\n break\n else:\n if sc[i][0] in b:\n if sc[i][1]!=c[s.index(sc[i][0])]:\n f=-1\n break\n else:\n ans[sc[i][0]-1]=str(sc[i][1])\n s.append(sc[i][0])\n c.append(sc[i][1])\nif f==-1:\n print(-1)\nelif m==0:\n if n==1:\n print(0)\n elif n==2:\n print(10)\n else:\n print(100)\nelse:\n if n==1:\n print(''.join(ans))\n else:\n if ans[0]==0:\n ans[0]=str(0)\n print(''.join(ans))\n", 'N,M=map(int,input().split())\nsc = [list(map(int, input().split())) for _ in range(M)]\na=str(0)*N\nA=[a[i] for i in range(len(a))]\nx=0\n#print(sc)\nb=[]\nc=[]\nfor i in range(M):\n if (sc[i][0] == 1) and (sc[i][1]==0) and (N!=1):\n x=-1\n break\n else:\n if (sc[i][0]) in b:\n if sc[i][1]!=int(c[b.index(sc[i][0])]):\n #print(c[b.index(sc[i][0])])\n x=-1#ERROR\n break\n else:\n A[sc[i][0]-1]=str(sc[i][1])\n b.append(sc[i][0])\n c.append(sc[i][1])\nif x==-1:#error\n print(-1) \nelif b==[] and (N!=1):\n if N==2:\n print(10)\n elif N==3:\n print(100)\nelif (1 not in b) and(N!=1):\n A[0]=str(1)\n a="".join(A)\n print(a)\nelif (1 not in b) and (2 not in b) and (N==3):\n A[0]=str(1)\n A[1]=str(0)\n a="".join(A)\n print(a)\n\nelse:\n a="".join(A)\n print(a)\n'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s216976507', 's466499461', 's467751728', 's742929130', 's923564864', 's433084434'] | [3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3188.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 20.0] | [770, 673, 690, 713, 726, 1394] |
p02761 | u175034939 | 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\nfor i in range(m):\n s, c = map(int,input().split())\n if a[s-1] >= 0:\n if a[s-1] != c:\n print(-1)\n exit()\n else:\n a[s-1] = c\n print(a)\n\nans = ''\nfor t in a:\n if t:\n ans += str(t)\n else:\n ans += '0'\n\nif n == 1 and ans[0] == '0':\n print(0)\n exit()\nif ans[0] == '0':\n print(-1)\n exit()\nprint(ans)", "n, m = map(int,input().split())\na = [-1]*n\nfor i in range(m):\n s, c = map(int,input().split())\n if n > 1:\n if s == 1 and c == 0:\n print(-1)\n exit()\n if a[s-1] >= 0:\n if a[s-1] != c:\n print(-1)\n exit()\n else:\n a[s-1] = c\n\nif n == 1:\n if a[0] == -1:\n print(0)\n else:\n print(a[0])\n exit()\n \nans = ''\nfor i, t in enumerate(a):\n if i == 0 and t == -1:\n ans += '1'\n elif t == -1:\n ans += '0'\n else:\n ans += str(t)\nprint(ans)\n"] | ['Wrong Answer', 'Accepted'] | ['s761276490', 's824529477'] | [3064.0, 3064.0] | [17.0, 18.0] | [419, 552] |
p02761 | u175590965 | 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 i in range(m)]\n\nfor i in range(10**n):\n tmp = str(i)\n if len(tmp) == n:\n f = True\n for s,c in a:\n if tmp[s-1] != str(c):\n f = False\n break\n if f :\n print(i)\n exit()\nprint(-1)', 'n,m = map(int,input().split())\na = [list(map(int,input().split()))]\nfor i in range(10**n):\n tmp = str(i)\n if len(tmp)== n:\n f = True\n for s,c in a:\n if tmp[s-1] != str(c):\n f = False\n break\n if f:\n print(i)\n exit()\nprint(-1)', 'n,m = map(int,input().split())\na = [list(map(int,input().split()))for i in range(m)]\nfor i in range(10**n):\n tmp = str(i)\n if len(tmp)== n:\n f = True\n for s,c in a:\n if tmp[s-1] != str(c):\n f = False\n break\n if f:\n print(i)\n exit()\nprint(-1)'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s166729879', 's480991101', 's243431351'] | [3060.0, 9120.0, 9080.0] | [18.0, 32.0, 28.0] | [346, 314, 331] |
p02761 | u177070195 | 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, list(input().split()))) for i in range(M)]\n\nans = [-1] * M\nfor i in s:\n if ans[i[0] - 1] != -1 and ans[i[0] - 1] != i[1]:\n print(-1)\n return \n ans[i[0] - 1] = i[1]\n\nans = [int(str(a).replace('-1', '0')) for a in ans]\nres = ''.join((map(str, ans)))\nif int(res) != 0:\n print(int(res))\nelse:\n print(-1)", "N, M = map(int, input().split())\ns = [list(map(int, list(input().split()))) for i in range(M)]\n\nans = [-1] * N\n\nfor i in s:\n if ans[i[0] - 1] != -1 and ans[i[0] - 1] != i[1]:\n print(-1)\n exit()\n ans[i[0] - 1] = i[1]\n\nif M == 0 and N != 1:\n ans[0] = 1\ntmp = int(''.join((map(str, [int(str(a).replace('-1', '0')) for a in ans]))))\nif N >= 2 and ans[0] == -1:\n ans[0] = 1\n\nans = [int(str(a).replace('-1', '0')) for a in ans]\n\nres = ''.join((map(str, ans)))\nif int(res) >= 0 and len(str(int(res))) == N:\n print(int(res))\nelse:\n print(-1)"] | ['Runtime Error', 'Accepted'] | ['s892770792', 's117786946'] | [3064.0, 3064.0] | [18.0, 17.0] | [377, 565] |
p02761 | u179376941 | 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())\ndic = {}\nflag = True\nfor _ in range(m):\n digit, num = map(int, input().split())\n if dic.get(digit, None):\n if dic[digit] != num:\n flag = False\n break\n if digit == 1 and num == 0 and n != 1:\n flag = False\n break\n if not dic.get(digit, None):\n dic[digit] = num\nif flag:\n lst = [1] * n\n for digit, num in dic.items():\n lst[digit - 1] = num\n s = ''\n for ele in lst:\n s += str(ele)\n print(int(s))\nelse:\n print(-1)", "n, m = map(int, input().split())\ndic = {}\nflag = True\nfor _ in range(m):\n digit, num = map(int, input().split())\n if dic.get(digit, None):\n if dic[digit] != num:\n flag = False\n break\n if digit == 1 and num == 0 and n != 1:\n flag = False\n break\n if not dic.get(digit, None):\n dic[digit] = num\nif flag:\n lst = [0] * n\n for digit, num in dic.items():\n lst[digit - 1] = num\n s = ''\n if lst[0] == 0 and n != 1:\n lst[0] = 1\n for ele in lst:\n s += str(ele)\n print(int(s))\nelse:\n print(-1)"] | ['Wrong Answer', 'Accepted'] | ['s435824678', 's103295465'] | [9140.0, 9220.0] | [31.0, 33.0] | [479, 523] |
p02761 | u183657342 | 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 = [0]*n \n\nfor i in range(m):\n s, c = map(int, input().split())\n if ans[s-1] == 0:\n ans[s-1] = c \n elif not ans[s-1] == c:\n print(-1)\n break\n if i == m-1:\n if ans[0] == 0:\n print(-1)\n else:\n for j in range(n):\n a = a+ans[j]*(10**(n-j-1))\n print(a)', 'n, m = map(int, input().split())\nx = [-1]*n\nans = 0\ncount = 0\nfor i in range(m):\n s, c = map(int, input().split())\n if (s==1) and (c==0) and(n!=1):\n count = 1\n if x[s-1]!=-1 and x[s-1]!=c:\n count = 1\n if x[s-1] != c:\n ans += c*(10**(n-s))\n x[s-1] = c\n\nif count==1:\n print(-1)\nelif n==1 and ans==0:\n print(0)\nelif ans>=10**(n-1):\n print(ans)\nelse:\n print(ans+10**(n-1))'] | ['Runtime Error', 'Accepted'] | ['s062673009', 's801641167'] | [3064.0, 3064.0] | [18.0, 18.0] | [379, 416] |
p02761 | u184661160 | 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) | ['#graph implementation\nimport math\nn,m=map(int,input().split())\nans=[0]*n\nfor i in range(m):\n s,c=map(int,input().split())\n if ans[s-1]==0:\n ans[s-1]=c\n else:\n if ans[s-1]>=c and c>0:\n ans[s-1]=c\nif len(ans)<3:\n for i in ans:\n print(i,end="")\nelif ans[0]==0:\n print(-1)\nelse:\n for i in ans:\n print(i,end="")\n#print(ans)\n', '#graph implementation\nimport math\nn,m=map(int,input().split())\nans=[0]*n\nfor i in range(m):\n s,c=map(int,input().split())\n if ans[s-1]==0:\n ans[s-1]=c\n else:\n if ans[s-1]>=c and c>0:\n ans[s-1]=c\nif ans[0]==0 and len(ans)<3:\n for i in ans:\n print(i,end="")\nelif ans[0]==0:\n print(-1)\nelse:\n for i in ans:\n print(i,end="")\n#print(ans)\n', '#graph implementation\nimport math\nn,m=map(int,input().split())\nans=[\'l\']*n\nflag=False\nfor i in range(m):\n s,c=map(int,input().split())\n if ans[s-1]==\'l\':\n ans[s-1]=c\n else:\n if ans[s-1]!=c:\n print(-1)\n exit(0)\n if s-1==0:\n flag=True\n#print(ans)\nif not flag:\n ans[0]=1\nif ans[0]==0 and n>1:\n print(-1)\nelse:\n for i in ans:\n print(i,end="")\nprint()\n', '#graph implementation\nimport math\nn,m=map(int,input().split())\nans=[\'bal\']*n\nfor i in range(m):\n s,c=map(int,input().split())\n if ans[s-1]==\'bal\':\n ans[s-1]=c\n else:\n if ans[s-1]!=c:\n print(-1)\n exit(0)\nif ans[0]==\'bal\' and n>1:\n ans[0]=1\nfor i in range(n):\n if ans[i]==\'bal\':\n ans[i]=0\nif ans[0]==0 and n>1:\n print(-1)\nelse:\n for i in ans:\n print(i,end="")\nprint()\n'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s038778337', 's453358395', 's532638420', 's643726730'] | [3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 17.0, 18.0, 18.0] | [380, 394, 416, 435] |
p02761 | u185325486 | 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())\nketa = ['?']*N\n\nfor _ in range(M):\n s, c = map(int, input().split()) \n if keta[s-1] == '?' or keta[s-1] == c:\n keta[s-1] = c\n else:\n return -1\nif keta[0] == 0:\n return -1\n\nketa = [0 if num == '?' else num for num in keta]\n\nprint(''.join(map(str, keta)))", "def check():\n N, M = map(int, input().split())\n keta = ['?']*N\n \n for _ in range(M):\n s, c = map(int, input().split()) \n if keta[s-1] == '?' or keta[s-1] == c:\n keta[s-1] = c\n else:\n return -1\n if keta[0] == 0 and N !=1:\n return -1\n \n keta = [0 if num == '?' else num for num in keta]\n \n if N == 1:\n return keta[0]\n \n keta = [1 if i==0 and num==0 else num for i,num in enumerate(keta)]\n \n return ''.join(map(str, keta))\n \nprint(check())"] | ['Runtime Error', 'Accepted'] | ['s132979169', 's306399639'] | [3064.0, 3064.0] | [17.0, 17.0] | [319, 538] |
p02761 | u185502200 | 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\nl = [[0 for _ in range(2)] for _ in range(m)]\n\nf = 0\ncon = ""\n\nfor i in range(n):\n s, c = map(int,input().split()))\n if l[s-1][1] == 0 or l[s-1][0] == c:\n if s == 1 and c == 0:\n f = 1\n break\n l[s-1][0] = c\n l[s-1][1] = 1\n else:\n f = 1\n break\nelse:\n for j in range(m):\n if l[j][0] != 0:\n break\n else:\n f = 1\n break\n\nif f:\n print(-1)\nelse:\n for i in range(m):\n con += str(l[i][0])\n print(int(con))\n \n', 'n, m = map(int,input().split())\n\nl = [[0 for _ in range(2)] for _ in range(n)]\n\nprint(l)\nf = 0\ncon = ""\n\nfor i in range(n):\n s, c = (list(map(int,input().split())))\n if l[s-1][1] == 0 or l[s-1][0] == c:\n if s == 1 and c == 0:\n f = 1\n break\n l[s-1][0] = c\n l[s-1][1] = 1\n else:\n f = 1\n break\nelse:\n for j in range(n):\n if l[j][0] != 0:\n break\n else:\n f = 1\n break\n\nif f:\n print(-1)\nelse:\n for i in range(n):\n con += str(l[i][0])\n print(int(con))', "# n = int(input())\nn, m = map(int,input().split())\n# l = [[0 for _ in range(n)] for _ in range(n)]\nl = []\nf = 0\n\nfor i in range(m):\n l.append(list(map(int,input().split())))\n\n# print(l)\n\nfor i in range(1000):\n si = str(i)\n if len(si) == n:\n for j in range(m):\n print(si, l)\n if si[l[j][0]-1] == str(l[j][1]):\n print('OK')\n f = 0\n else:\n f = 1\n break\n else:\n continue\n if f == 0:\n print(si)\n exit()\n\nprint(-1)", 'n, m = map(int,input().split())\n\nl = [[0 for _ in range(2)] for _ in range(n)]\n\nprint(l)\nf = 0\ncon = ""\n\nfor i in range(n):\n s, c = (list(map(int,input().split())))\n if l[s-1][1] == 0 or l[s-1][0] == c:\n if s == 1 and c == 0:\n f = 1\n break\n l[s-1][0] = c\n l[s-1][1] = 1\n else:\n f = 1\n break\n\nif f:\n print(-1)\nelse:\n for i in range(n):\n con += str(l[i][0])\n print(con)', "# n = int(input())\nn, m = map(int,input().split())\n# l = [[0 for _ in range(n)] for _ in range(n)]\nl = []\nf = 0\n\nfor i in range(m):\n l.append(list(map(int,input().split())))\n\n# print(l)\n\nfor i in range(1000):\n si = str(i)\n if len(si) == n:\n for j in range(m):\n # print(si, l)\n if si[l[j][0]-1] == str(l[j][1]):\n # print('OK')\n f = 0\n else:\n f = 1\n break\n else:\n continue\n if f == 0:\n print(si)\n exit()\n\nprint(-1)"] | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s414429500', 's572253299', 's884316310', 's969758035', 's776348728'] | [2940.0, 3064.0, 3316.0, 3064.0, 3064.0] | [17.0, 17.0, 20.0, 17.0, 18.0] | [566, 576, 544, 449, 548] |
p02761 | u186974762 | 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(a) for a in input().split()]\nS = [[int(i) for i in input().split()] for _ in range(M)]\nflag = 0\nNUM = 0\nLIST = [-1 for _ in range(N)]\nfor s,c in S:\n s -= 1\n if(LIST[s]==-1):\n NUM += c*(10**(N-s-1))\n LIST[s] = c\n else:\n if(LIST[s]!=c):\n flag = 1\n print(-1)\n break\n else:\n continue\n if(LIST[0] == -1):\n if(N>1):\n NUM += 10**(N-1)\n else:\n NUM = 0\n elif(LIST[0] == 0):\n if(N>1):\n print(-1)\n flag = 1\n else:\n NUM = 0\n if(flag==0):\n print(NUM)', 'N, M = [int(a) for a in input().split()]\nS = [[int(i) for i in input().split()] for _ in range(M)]\nflag = 0\nelse:\n NUM = 0\n LIST = [-1 for _ in range(N)]\n for s,c in S:\n s -= 1\n if(LIST[s]==-1):\n NUM += c*(10**(N-s-1))\n LIST[s] = c\n else:\n if(LIST[s]!=c):\n flag = 1\n print(-1)\n break\n else:\n continue\n if(LIST[0] == -1):\n if(N>1):\n NUM += 10**(N-1)\n else:\n NUM = 0\n elif(LIST[0] == 0):\n if(N>1):\n print(-1)\n flag = 1\n else:\n NUM = 0\n if(flag==0):\n print(NUM)', 'N, M = [int(a) for a in input().split()]\nS = [[int(i) for i in input().split()] for _ in range(M)]\nflag = 0\nelse:\n NUM = 0\n LIST = [-1 for _ in range(N)]\n for s,c in S:\n s -= 1\n if(LIST[s]==-1):\n NUM += c*(10**(N-s-1))\n LIST[s] = c\n else:\n if(LIST[s]!=c):\n flag = 1\n print(-1)\n break\n else:\n continue\n if(LIST[0] == -1):\n if(N>1):\n NUM += 10**(N-1)\n else:\n NUM = 0\n elif(LIST[0] == 0):\n if(N>1):\n print(-1)\n flag = 1\n else:\n NUM = 0\n if(flag==0):\n print(NUM)', 'N, M = [int(a) for a in input().split()]\nS = [[int(i) for i in input().split()] for _ in range(M)]\nflag = 0\nNUM = 0\nLIST = [-1 for _ in range(N)]\nfor s,c in S:\n s -= 1\n if(LIST[s]==-1):\n NUM += c*(10**(N-s-1))\n LIST[s] = c\n else:\n if(LIST[s]!=c):\n flag = 1\n print(-1)\n break\n else:\n continue\nif(LIST[0] == -1):\n if(N>1):\n NUM += 10**(N-1)\n else:\n NUM = 0\nelif(LIST[0] == 0):\n if(N>1):\n print(-1)\n flag = 1\n else:\n NUM = 0\nif(flag==0):\n print(NUM)'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s040784654', 's388364059', 's728336817', 's938290507'] | [3060.0, 2940.0, 2940.0, 3064.0] | [17.0, 17.0, 17.0, 17.0] | [717, 691, 691, 577] |
p02761 | u188827677 | 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\np = ['0']*n\nfor i in range(m):\n s,c = input().split()\n s = int(s)\n p[s-1] = c\n\nt = 0\nfor i in p:\n t += int(i)\n\nif len(str(t)) == n:\n print(int(t))\nelse:\n print(-1)", "import sys\nn,m = map(int, input().split())\n\np = [0]*n\nq = [False]*n\nfor i in range(m):\n s,c = map(int, input().split())\n if s == 1 and c == 0 and n != 1:\n #continue\n if s > n:\n print(-1)\n sys.exit()\n \n if q[s-1] == False:\n p[s-1] = c\n q[s-1] = True\n elif p[s-1] > c:\n p[s-1] = c\n\nt = ''\nfor i in p:\n t += str(i)\n \nt = int(t)\nif len(str(t)) == n:\n print(t)\nelse:\n print(-1)", 'n,m = map(int, input().split())\n\nnums = [-1]*n\nfor i in range(m):\n s,c = map(int, input().split())\n s -= 1\n if nums[s] != -1 and nums[s] != c:\n print(-1)\n exit()\n nums[s] = c\n \nif n == 1 and nums[0] == -1: nums[0] = 0\nelif n != 1 and nums[0] == -1: nums[0] = 1\n\nfor i in range(1,n):\n if nums[i] == -1: nums[i] = 0\n\nans = ""\nfor i in nums:\n ans += str(i)\nans = int(ans)\n\nif len(str(ans)) == n: print(ans)\nelse: print(-1)'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s443884647', 's504951073', 's530948331'] | [3064.0, 2940.0, 9244.0] | [19.0, 18.0, 30.0] | [202, 402, 432] |
p02761 | u189089176 | 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 - Guess The Number\n\n\nN,M = list(map(int,input().split()))\n\ndigit_num_list = [list(map(int, input().split())) for i in range(0,M)]\n\n\nmin = ["1"]\nfor n in range(1,N):\n min.append("0")\nmin = int("".join(min))\n\nmax = []\nfor n in range(0,N):\n max.append("9")\nmax = int("".join(max))\n\nprint(min)\nprint(max)\n\n\nans = ["0"]*N\nprint(len(ans))\n\n\n\nfor i in range(min,max):\n cnt = 0\n for digit_num in digit_num_list:\n\n # # print("=========")\n \n # # print(str(i))\n \n \n # # print("=========")\n\n # print("=========")\n \n \n # print(i)\n # print("=========")\n\n if int(str(i)[digit_num[0]-1]) == digit_num[1]:\n ans[digit_num[0]-1] = str(digit_num[1])\n cnt += 1\n \n # print(cnt)\n\n if cnt == N:\n print("".join(ans))\n exit()\n\nprint(-1)\n\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)\n c.append(C)\n\n\nfor i in range(10 ** (N + 1)):\n Str = str(i)\n\n if len(Str) == N and all([Str[s[j] - 1] == str(c[j]) for j in range(M)]):\n print(Str)\n exit()\n\nprint(-1)'] | ['Wrong Answer', 'Accepted'] | ['s497575885', 's922770858'] | [3064.0, 3064.0] | [18.0, 21.0] | [1140, 292] |
p02761 | u189326411 | 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\nlst = []\nfor i in range(m):\n s,c = map(int, input().split())\n lst.append((s,c))\n\nfor i in range(1,1000):\n flag = 0\n I = str(i)\n if len(I)==n:\n for j in range(len(lst)):\n if I[lst[j][0]-1]!=lst[k][1]:\n flag = 1\n if flag == 0:\n print(I)\nprint(-1)', 'n,m = map(int, input().split())\n\nif m==0:\n print("-1")\n\nflag = 0\nans = ["-1" for i in range(n)]\nfor i in range(m):\n s,c = map(int, input().split())\n if ans[s-1]=="-1":\n ans[s-1] = str(c)\n elif ans[s-1]!=str(c):\n flag = 1\n\nprint(ans)\n\nif ans[0]=="0" or flag==1:\n print("-1")\n exit()\n\nif ans[0]=="-1":\n ans[0] = "1"\nfor i in range(1,n):\n if ans[i]=="-1":\n ans[i] = "0"\n\nprint(ans)\nans = "".join(ans)\nprint(ans)\n', 'n,m = map(int, input().split())\nlst = []\nfor i in range(m):\n s,c = map(int, input().split())\n lst.append((s-1,c))\n\nif n!=1:\n for i in lst:\n if i==(0,0):\n print(-1)\n exit()\n\n# print(lst)\nif n==1:\n for i in range(10):\n I = str(i)\n flag = 0\n for j in lst:\n if I[j[0]]!=str(j[1]):\n flag = 1\n if flag == 0:\n print(I)\n exit()\nelse:\n for i in range(10**(n-1),10**n):\n I = str(i)\n # print(I)\n flag = 0\n for j in lst:\n if I[j[0]]!=str(j[1]):\n flag = 1\n if flag == 0:\n print(I)\n exit()\n\nprint(-1)\n'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s045065165', 's237857917', 's544002807'] | [3188.0, 3064.0, 3064.0] | [18.0, 17.0, 18.0] | [343, 454, 690] |
p02761 | u189487046 | 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\nSC = []\nfor _ in range(M):\n s, c = map(int, input().split())\n SC.append([s, c])\n\nfor i in range(1000):\n str_i = str(i)\n if len(str_i) != N:\n break\n\n for sc in SC:\n index = sc[0]-1\n\n if len(str_i) != N:\n break\n if str_i[index] != str(sc[1]):\n break\n else:\n print(i)\n exit(0)\nprint(-1)\n', 'N, M = map(int, input().split())\n\nSC = []\nfor _ in range(M):\n s, c = map(int, input().split())\n SC.append([s, c])\n\nfor i in range(1000):\n str_i = str(i)\n if len(str_i) != N:\n continue\n\n for sc in SC:\n index = sc[0]-1\n\n if len(str_i) != N:\n break\n if str_i[index] != str(sc[1]):\n break\n else:\n print(i)\n exit(0)\nprint(-1)\n'] | ['Wrong Answer', 'Accepted'] | ['s016841342', 's066407218'] | [3064.0, 3064.0] | [17.0, 18.0] | [400, 403] |
p02761 | u189516107 | 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 si, ci = map(int, input().split())\n s.append(si)\n c.append(ci)\n#print(s, c)\n\nfor i in range(M):\n if s[i] == 1 and c[i] == 0:\n print(-1)\n exit()\n \nfor i in range(M):\n for j in range(M):\n if i != j and s[i] == s[j] and c[i] != c[j]:\n print(-1)\n exit()\n \nnum = [1] +[0]*(N-1)\nfor i in range(M):\n num[s[i]-1] = c[i]\n \nprint(num)', 'N, M = map(int, input().split())\ns = []\nc = []\nfor i in range(M):\n si, ci = map(int, input().split())\n s.append(si)\n c.append(ci)\n#print(s, c)\n\nfor i in range(M):\n if N != 1 and s[i] == 1 and c[i] == 0:\n print(-1)\n exit()\n \nfor i in range(M):\n for j in range(M):\n if i != j and s[i] == s[j] and c[i] != c[j]:\n print(-1)\n exit()\n\nif N == 1:\n num = [0]\nelse:\n num = [1] +[0]*(N-1)\nfor i in range(M):\n num[s[i]-1] = c[i]\n \nans = [str(i) for i in num]\nans = "".join(ans)\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s469316424', 's248279868'] | [3064.0, 3064.0] | [17.0, 18.0] | [419, 506] |
p02761 | u192433528 | 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 = [list(map(int,input().split())) for i in range(M)]\ndict = {}\n\nif M == 0 :\n print(10**(N-1))\n exit()\n\nfor x in L :\n dict.setdefault(x[0],[])\n dict[x[0]].append(x[1])\n\nfor k,v in dict.items():\n dict[k] = set(v)\n\nansList = ["0"]*N\nfor i in range(N) :\n if i+1 in dict :\n ansList[i] = str(list(dict[i+1])[0])\n else :\n ansList[i] = "1"\n\nisFirstZero = 2 <= N and ansList[0] == "0"\nisOverlapping = any([ 2 <= len(v) for v in dict.values()]) \n\n# print(dict)\n\n\n\nif isFirstZero or isOverlapping :\n print(-1)\nelse :\n print(int("".join(ansList)))', 'N,M = map(int,input().split())\nL = [list(map(int,input().split())) for i in range(M)]\ndict = {}\n \nif M == 0 :\n if N == 1 :\n print(0)\n else :\n print(10**(N-1))\n exit()\n \nfor x in L :\n dict.setdefault(x[0],[])\n dict[x[0]].append(x[1])\ndict.setdefault(1,[1])\n \nfor k,v in dict.items():\n dict[k] = set(v)\n \nansList = ["0"]*N\nfor i in range(N) :\n if i+1 in dict :\n ansList[i] = str(list(dict[i+1])[0])\n \nisZeroHead = 2 <= N and ansList[0] == "0"\nisOverlapping = any([ 2 <= len(v) for v in dict.values()]) \nans = -1 if isZeroHead or isOverlapping else int("".join(ansList))\n \n# print(dict)\n\n\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s011366020', 's310571650'] | [9176.0, 9184.0] | [31.0, 28.0] | [688, 713] |
p02761 | u193927973 | 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"]*M\nf=0\nfor i in range(M):\n s, c=map(int, input().split())\n if s==1 and c==0:\n f=1\n if ans[s-1]!=str(c) and ans[s-1]!="-1":\n f=1\n ans[s-1]=str(c)\n\nif f==1:\n print(-1)\nelse:\n a="".join(ans)\n b=a.replace("-1", "1")\n print(b)\n ', 'N, M=map(int, input().split())\nans=["1"]*M\ntmp=[]\nf=0\nfor i in range(M):\n s, c=map(input().split())\n if [s, c] in tmp or (s==1 and c==0):\n f=1\n tmp.append([s,c])\n ans[s-1]=str(c)\n\nif f==1:\n print(-1)\nelse:\n print("".join(ans))\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 if s==1 and c==0 and N!=1:\n f=1\n if ans[s-1]!=str(c) and ans[s-1]!="-1":\n f=1\n ans[s-1]=str(c)\n\nif f==1:\n print(-1)\nelse:\n if ans[0]=="-1" and N!=1:\n ans[0]="1"\n elif M==0 and N==1:\n ans[0]="0"\n a="".join(ans)\n b=a.replace("-1", "0")\n print(b)\n '] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s744438478', 's792034366', 's453472834'] | [3064.0, 3060.0, 3188.0] | [17.0, 17.0, 20.0] | [280, 239, 369] |
p02761 | u194228880 | 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) | ["in1 = input('')\nn = int(in1.split(' ')[0])\nm = int(in1.split(' ')[1])\nl = []\nfor i in range(0,n):\n l.append(0)\n\nhasError = False\nfor i in range(0,m):\n in2 = input('')\n idx = int(in2.split(' ')[0])\n li = int(in2.split(' ')[1])\n if l[idx-1] != li:\n hasError = True\n else:\n l[idx-1] = li\n\nresult = 0\nfor i in range(0,n):\n ix = 1\n for j in range(0,(n-i-1)):\n ix*=10\n result += int(l[i])*ix\n\nif result < 0:\n result = -1\nif n == 1 and result == 0:\n result = 0\nelif len(str(result)) != n:\n result = -1\nif hasError = True:\n result = -1\nprint(result)\n\n", 'in1 = input(\'\')\nn = int(in1.split(\' \')[0])\nm = int(in1.split(\' \')[1])\nl = []\nfor i in range(0,n):\n l.append(0)\n\nfor i in range(0,m):\n in2 = input(\'\')\n idx = int(in2.split(\' \')[0])-1\n li = int(in2.split(\' \')[1])\n l[idx] = li\n\nresult = 0\nfor i in range(0,n):\n ix = 1\n for j in range(0,(n-i-1)):\n ix *=10\n result += int(l[i])*ix\nprint(result)\nif len(str(result)) != n and result != 0:\n result = "-1"\nprint(result)\n\n', "in1 = input('')\nn = int(in1.split(' ')[0])\nm = int(in1.split(' ')[1])\nl = []\nfor i in range(0,n):\n l.append(-1)\n\nhasError = False\nfor i in range(0,m):\n in2 = input('')\n idx = int(in2.split(' ')[0])-1\n li = int(in2.split(' ')[1])\n if l[idx] != -1 and l[idx] != li:\n hasError = True\n else:\n l[idx] = li\n\nfor i in range(0,n):\n if l[i] == -1:\n if i == 0 and n > 1:\n l[i] = 1\n else:\n l[i] = 0\n\nresult = 0\nfor i in range(0,n):\n ix = 1\n for j in range(0,(n-i-1)):\n ix*=10\n result += int(l[i])*ix\n\nif result < 0:\n result = -1\nif n == 1 and result == 0:\n result = 0\nelif len(str(result)) != n:\n result = -1\nif hasError == True:\n result = -1\nprint(result)\n\n"] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s041764682', 's217671542', 's699620172'] | [3064.0, 3064.0, 3064.0] | [17.0, 17.0, 17.0] | [565, 424, 686] |
p02761 | u194472175 | 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 a,b=map(int,input().split())\n s.append(a)\n c.appemd(b)\nfound=False\nstart=pow(10,N-1)\nstop=pow(10,N)\nif N==1:\n start=0\nfor i in range(start,stop):\n i_str=str(i)\n passed=True\n for j in range(M):\n if not i_str[s[j]-1]==str(c[j]):\n passed=False\n break\n if passed:\n found=False\n print(i)\n break\nif not found:\n print('-1')", "n,m = map(int,input().split())\ns=[0]*m\nc=[0]*m\nans=[]\njudge=False\nfor i in range(m):\n s[i],c[i]=map(int,input().split())\nfor j in range(10**n):\n j=str(j)\n for l in range(m):\n if int(j[s[l]-1])==c[l]:\n pass\n else:\n break\n else:\n ans.append(int(j))\n judge=True\nif judge:\n print(min(ans))\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())\nans=[]\njudge=False\nif n ==1:\n for j in range(10):\n j = str(j)\n for l in range(m):\n if int(j[s[l]-1])==c[l]:\n pass\n else:\n break\n else:\n ans.append(int(j))\n judge=True\n\nelse:\n for j in range(10**(n-1),10**n):\n j=str(j)\n for l in range(m):\n if int(j[s[l]-1])==c[l]:\n pass\n else:\n break\n else:\n ans.append(int(j))\n judge=True\nif judge:\n print(min(ans))\nelse:\n print('-1')"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s102045136', 's513884005', 's920061787'] | [3064.0, 3064.0, 3064.0] | [17.0, 18.0, 20.0] | [452, 372, 675] |
p02761 | u197300773 | 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())\ns=[]\nc=[]\nfor i in range(m):\n ts,tc=map(int,input().split())\n ts-=1\n s.append(ts)\n c.append(tc)\n\nif n==1:\n ans=min(c)\n for i in range(m):\n if ans!=c[i]:\n print(-1)\n sys.exit()\n\nif n!=1:\n ans=[1]+[0 for i in range(n-1)]\n for i in range(m):\n if s[i]==0 and c[i]==0:\n print(-1)\n sys.exit()\n ans[s[i]]=max(ans[s[i]],c[i])\n\n\n for i in range(m):\n if ans[s[i]]!=c[i]:\n print(-1)\n sys.exit()\n for i in range(n):\n print(ans[i],end="")\n\n', 'import sys\nn,m=map(int,input().split())\na=[-1 for i in range(n)]\n\nfor i in range(m):\n s,c=map(int,input().split())\n s-=1\n\n if n!=1 and s==0 and c==0:\n print(-1)\n sys.exit()\n\n if a[s]!=-1 and a[s]!=c:\n print(-1)\n sys.exit()\n else:\n a[s]=c\n\n\nif n==1 and (a[0]==0 or a[0]==-1):\n print(0)\n sys.exit()\n\nx=""\nif a[0]==-1: a[0]=1\nfor i in range(n):\n if a[i]==-1: a[i]=0\n x+=str(a[i])\nprint(x)\n \n'] | ['Runtime Error', 'Accepted'] | ['s165639006', 's037321840'] | [3064.0, 3064.0] | [17.0, 17.0] | [598, 453] |
p02761 | u199830845 | 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 N, M = map(int, input().split())\n s_list = list()\n c_list = list()\n for _ in range(M):\n s, c = input().split()\n s_list.append(s)\n c_list.append(c)\n\n out = '-1'\n exists = True\n\n num = 'd' * N\n\n for index in range(len(s_list)):\n if num[int(s_list[index]) - 1] == 'd' or num[int(s_list[index]) - 1] == c_list[index]:\n # num[int(s_list[index])] = c_list[index]\n num_tmp = num[:int(s_list[index]) - 1]\n num_tmp += c_list[index] + num[int(s_list[index]):]\n num = num_tmp\n\n else:\n exists = False\n break\n\n if exists:\n out = num.replace('d', '0')\n if out[0] == '0' and N > 1:\n out = '-1'\n\n print(out)", "N, M = map(int, input().split())\ns_list = list()\nc_list = list()\nfor _ in range(M):\n s, c = input().split()\n s_list.append(s)\n c_list.append(c)\n\nout = '-1'\nexists = True\n\nnum = 'd' * N\n\nfor index in range(len(s_list)):\n if num[int(s_list[index]) - 1] == 'd' or num[int(s_list[index]) - 1] == c_list[index]:\n # num[int(s_list[index])] = c_list[index]\n num_tmp = num[:int(s_list[index]) - 1]\n num_tmp += c_list[index] + num[int(s_list[index]):]\n num = num_tmp\n\n else:\n exists = False\n break\n\nif num[0] == '0' and N > 1: \n exists = False\n\nif exists:\n out = num.replace('d', '0')\n if out[0] == '0' and N > 1: \n out = '1' + out[1:]\n\nprint(out)"] | ['Runtime Error', 'Accepted'] | ['s250499585', 's326307832'] | [2940.0, 3064.0] | [17.0, 17.0] | [749, 766] |
p02761 | u201387466 | 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)]\nans = [0 for _ in range(N)]\ncheck = [0 for _ in range(N)]\nfor i in range(M):\n s = S[i][0]\n c = S[i][1]\n if check[s-1] == 0:\n check[s-1] = 1\n ans[s-1] = c\n else:\n if ans[s-1] != c:\n e = 1\n break\nif e == 1:\n print(-1)\nelif e != 1:\n if ans[0] == 0:\n if N == 1:\n print(0)\n else:\n print(-1)\n else:\n d = 0\n for i in range(N):\n d += ans[i] * (10 ** (N-1-i))\n print(d)', 'N,M = map(int,input().split())\nS = [list(map(int,input().split())) for _ in range(M)]\nans = [0 for _ in range(N)]\ncheck = [0 for _ in range(N)]\ne = 0\nfor i in range(M):\n s = S[i][0]\n c = S[i][1]\n if check[s-1] == 0:\n check[s-1] = 1\n ans[s-1] = c\n else:\n if ans[s-1] != c:\n e = 1\n break\nif e == 1:\n print(-1)\nelse:\n if ans[0] == 0:\n if N == 1:\n print(0)\n else:\n if check[0] == 0:\n ans[0] = 1\n d = 0\n for i in range(N):\n d += ans[i] * (10 ** (N-1-i))\n print(d)\n else:\n print(-1)\n\n else:\n d = 0\n for i in range(N):\n d += ans[i] * (10 ** (N-1-i))\n print(d)'] | ['Runtime Error', 'Accepted'] | ['s384373256', 's843894166'] | [3064.0, 3064.0] | [17.0, 17.0] | [582, 789] |
p02761 | u201928947 | 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 = []\nfor i in range(n):\n ans.append(0)\nfor k in range(m):\n s,c = map(int,input().split())\n if c == 0:\n c = 10 \n if ans[s-1] == 0 or ans[s-1] == c:\n ans[s-1] = c\n else:\n print(\'-1\')\n exit()\nif n != 0:\n if ans[0] == 10:\n print(\'-1\')\n exit()\nans = [str(s) for s in ans]\nprint(ans)\nif n != 0:\n if ans[0] == "0":\n ans[0] = "1"\nans = [s.replace("10","0") for s in ans]\nprint("".join(ans))', 'n,m = map(int,input().split())\nans = []\nfor i in range(n):\n ans.append(0)\nfor k in range(m):\n s,c = map(int,input().split())\n if c == 0:\n c = 10 \n if ans[s-1] == 0 or ans[s-1] == c:\n ans[s-1] = c\n else:\n print(\'-1\')\n exit()\nif ans[0] == 10:\n print(\'-1\')\n exit()\nans = [str(s) for s in ans]\nprint(ans)\nif ans[0] == "0":\n ans[0] = "1"\nans = [s.replace("10","0") for s in ans]\nprint("".join(ans))', 'n,m = map(int,input().split())\nif n == 1 and m == 0:\n print(0)\n exit()\nlst = [-1 for _ in range(n)]\nfor i in range(m):\n s,c = map(int,input().split())\n if lst[s-1] != -1:\n if lst[s-1] != c:\n print(-1)\n exit()\n else:\n lst[s-1] = c\nif lst[0] == 0 and n != 1:\n print(-1)\n exit()\nif lst[0] == -1:\n lst[0] = 1\nfor i in range(n):\n if lst[i] == -1:\n lst[i] = 0\n lst[i] = str(lst[i])\nprint("".join(lst))'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s901866475', 's975108912', 's456241490'] | [3064.0, 3064.0, 3188.0] | [17.0, 18.0, 20.0] | [489, 448, 468] |
p02761 | u202560873 | 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) | ['S = input()\nQ = int(input())\n\nc2 = 0\nquery = []\nfor i in range(Q):\n q = [x for x in input().split()]\n T = int(q[0])\n if T == 1:\n query.append([T])\n else: # T == 2\n F, C = int(q[1]), q[2]\n query.append([T, F, C])\n c2 += 1\n\nwhile len(query) > c2 + 1:\n print(query)\n T1 = query[i][0]\n if T1 == 1:\n T2 = query[i + 1][0]\n if T2 == 1:\n query = query[:i] + query[i + 2:]\n if T2 == 2:\n F, C = query[i + 1][1], query[i + 1][2]\n if F == 1:\n query[i] = [2, 2, C]\n query[i + 1] = [1]\n else: # F == 2\n query[i] = [2, 1, C]\n query[i + 1] = [1]\n\nM = c2 + 1\nfor i in range(M):\n T = query[i][0]\n if T == 1:\n L = len(S)\n S = S[L - 1::-1]\n else: # T == 2\n F, C = query[i][1], query[i][2]\n if F == 1:\n S = C + S\n else: # F == 2\n S = S + C\n\nprint(S)', "N, M = [int(x) for x in input().split()]\n\ncond = [None for _ in range(N + 1)]\nok = True\nfor i in range(M):\n s, c = [int(x) for x in input().split()]\n if cond[s] == None:\n cond[s] = c\n else:\n if cond[s] != c:\n ok = False\n break\n\nif cond[1] == None:\n if N == 1:\n cond[1] = 0\n else:\n cond[1] = 1\nelse:\n if cond[1] == 0:\n if N != 1:\n ok = False\n\nfor i in range(2, N + 1):\n if cond[i] == None:\n cond[i] = 0\n\nif ok == True:\n for i in range(1, N + 1):\n print(cond[i], end='')\n print('')\nelse:\n print(-1)"] | ['Runtime Error', 'Accepted'] | ['s661657742', 's945693165'] | [9224.0, 9176.0] | [24.0, 30.0] | [968, 608] |
p02761 | u202570162 | 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\nN,M=map(int,input().split())\ncnd=[tuple(int(i) for i in input().split()) for j in range(M)]\nans=-1\nfor n in range(10**N-1):\n # print(n)\n flag=True\n n_str=str(n)\n for s,c in cnd:\n if n_str[s-1]!=str(c):\n # print(n_str[s-1],c)\n flag=False\n break\n if flag:\n ans=n\n break\nprint(ans)', '# C\nN,M=map(int,input().split())\ncnd=[tuple(int(i) for i in input().split()) for j in range(M)]\nans=-1\nfor n in range(10**N):\n # print(n)\n flag=True\n n_str=str(n)\n if len(n_str)!= N:\n continue\n for s,c in cnd:\n if n_str[s-1]!=str(c):\n # print(n_str[s-1],c)\n flag=False\n break\n if flag:\n ans=n\n break\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s082736449', 's093862441'] | [3064.0, 3064.0] | [17.0, 19.0] | [351, 389] |
p02761 | u203382704 | 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 = [list(map(int, input().split())) for _ in range(M)]\nans = [-1] *N\nfor k in range(M):\n if ans[num[k][0] -1] == -1 or ans[num[k][0] -1] == num[k][1]:\n ans[num[k][0] -1] = num[k][1]\n else:\n ans[0] = 0\n break\n\nif ans[0] == 0:\n print(-1)\nelse:\n ans = [1 if a == -1 else a for a in ans]\n print(''.join(map(str,ans)))", "N, M = map(int, input().split())\nnum = [list(map(int, input().split())) for _ in range(M)]\nans = [-1] *N\ncall = True\nfor k in range(M):\n if ans[num[k][0] -1] == -1 or ans[num[k][0] -1] == num[k][1]:\n ans[num[k][0] -1] = num[k][1]\n else:\n call = False\n break\n\nif call == True:\n \n if N != 1:\n if ans[0] == 0:\n print(-1)\n else:\n ans = [0 if a == -1 else a for a in ans]\n if ans[0] == 0:\n ans[0] = 1\n print(''.join(map(str,ans)))\n else:\n if ans[0] == -1:\n print(0)\n else:\n print(''.join(map(str,ans)))\nelse:\n print(-1)"] | ['Wrong Answer', 'Accepted'] | ['s968096042', 's309837120'] | [3064.0, 3064.0] | [17.0, 17.0] | [385, 662] |
p02761 | u204208382 | 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_and_c = []\nfor i in range(m):\n s_and_c.append(list(map(int, input().split())))\n\nans = ["-1" for i in range(n)]\ns_and_c.sort()\n\n\nif m == 0:\n if n == 1:\n ans = ["0"ß]\n else:\n ans[0] = "1"\n\nelif n != 1 and s_and_c[0][0] == 1 and s_and_c[0][1] == 0:\n ans = -1\nelse:\n for i in range(m):\n if ans[s_and_c[i][0] - 1] == "-1":\n ans[s_and_c[i][0] - 1] = str(s_and_c[i][1])\n elif ans[s_and_c[i][0] - 1] == str(s_and_c[i][1]):\n continue\n else:\n ans = -1\n\n\nif ans != -1:\n for i in range(n):\n if ans[i] == "-1":\n ans[i] = "0"\n ans = "".join(ans)\n\nprint(ans)\n', 'n,m = map(int, input().split())\ns_and_c = []\nfor i in range(m):\n s_and_c.append(list(map(int, input().split())))\n\nans = ["-1" for i in range(n)]\ns_and_c.sort()\n\n\nif m == 0:\n if n == 1:\n ans = ["0"]\n else:\n ans[0] = "1"\n\nelif n != 1 and s_and_c[0][0] == 1 and s_and_c[0][1] == 0:\n ans = -1\nelse:\n for i in range(m):\n if ans[s_and_c[i][0] - 1] == "-1":\n ans[s_and_c[i][0] - 1] = str(s_and_c[i][1])\n elif ans[s_and_c[i][0] - 1] == str(s_and_c[i][1]):\n continue\n else:\n ans = -1\n\n\nif ans != -1:\n for i in range(n):\n if ans[i] == "-1":\n if i == 0:\n ans[i] = "1"\n else:\n ans[i] = "0"\n ans = "".join(ans)\n\nprint(ans)\n\n'] | ['Runtime Error', 'Accepted'] | ['s054980844', 's954984031'] | [2940.0, 3064.0] | [17.0, 18.0] | [686, 759] |
p02761 | u207799478 | 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 string\n\n\ndef readints():\n return list(map(int, input().split()))\n\n\ndef nCr(n, r):\n return math.factorial(n)//math.factorial(n-r)*math.factorial(r)\n\n\nn, m = map(int, input().split())\nsc = [input().split() for i in range(m)]\n# print(sc)\n# print(len(sc))\nif len(sc) == 1:\n print(-1)\n exit()\n\nfor i in range(m):\n if (sc[0][0] == sc[i][0])and(sc[0][1] != sc[i][1]):\n print(-1)\n exit()\n\n#print(sorted(set(list(map(tuple, sc)))))\nx = sorted(set(list(map(tuple, sc))))\n# print(len(x))\n# print(x[0][0])\nfor i in range(len(x)):\n if int(x[i][0]) == 1:\n h = 100*int(x[i][1])\n print(h)\n elif int(x[i][0]) == 2:\n i = 10*int(x[i][1])\n print(i)\n elif int(x[i][0]) == 3:\n j = 1*int(x[i][1])\n print(j)\nprint(h+i+j-1)\n', 'import math\nimport string\n\n\ndef readints():\n return list(map(int, input().split()))\n\n\ndef nCr(n, r):\n return math.factorial(n)//math.factorial(n-r)*math.factorial(r)\n\n\nn, m = map(int, input().split())\nsc = [input().split() for i in range(m)]\n# print(sc)\n# print(len(sc))\nif len(sc) == 1:\n print(-1)\n exit()\n\nfor i in range(m):\n if (sc[0][0] == sc[i][0])and(sc[0][1] != sc[i][1]):\n print(-1)\n exit()\n\n#print(sorted(set(list(map(tuple, sc)))))\nx = sorted(set(list(map(tuple, sc))))\n# print(len(x))\n# print(x[0][0])\nfor i in range(len(x)):\n if int(x[i][0]) == 1:\n h = 100*int(x[i][1])\n # print(h)\n elif int(x[i][0]) == 2:\n i = 10*int(x[i][1])\n # print(i)\n elif int(x[i][0]) == 3:\n j = 1*int(x[i][1])\n # print(j)\nprint(h+i+j)\n', 'import math\nimport string\n\n\ndef readints():\n return list(map(int, input().split()))\n\n\ndef nCr(n, r):\n return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))\n\n\nN, M = map(int, input().split())\ncs = [None]*N\nfor i in range(M):\n s, c = map(int, input().split())\n #print(s, c)\n if cs[(s-1)] == None:\n cs[(s-1)] = c\n elif cs[s-1] != c:\n print(-1)\n exit()\n\n\ndef check(x):\n s = str(x)\n if not(len(s) == N):\n return False\n for i in range(N):\n if not(cs[i] == None or cs[i] == int(s[i])):\n return False\n return True\n\n\nfor i in range(10000):\n if check(i):\n print(i)\n exit()\nprint(-1)\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s650739857', 's829129912', 's388357310'] | [3832.0, 3832.0, 3896.0] | [24.0, 24.0, 29.0] | [798, 802, 678] |
p02761 | u210827208 | 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())\nx=[]\nfor _ in range(n):\n x.append([])\n\nfor _ in range(m):\n s,c=map(int,input().split())\n x[s-1].append(c)\nans=''\nfor i in range(n):\n if len(set(x[i]))>=2:\n ans='-1'\n break\n elif len(x[i])==0 and i==0:\n ans+='1'\n elif len(x[i])==0 and i!=0:\n ans+='0'\n else:\n if x[i][0]==0 and n==1:\n ans='0'\n break\n elif x[i][0]==0 and n!=1:\n ans='-1'\n break\n ans+=str(x[i][0])", "n,m=map(int,input().split())\na=[]\nfor _ in range(m):\n s,c=map(int,input().split())\n a.append([s,c])\n\nans='-1'\nfor i in range(10**n):\n x=str(i)\n c=0\n for j in range(m):\n if x[a[j][0]-1] == str(a[j][1]):\n c+=1\n if c==m:\n ans=i\n break\nprint(ans)", "n,m=map(int,input().split())\nx=[]\nfor _ in range(n):\n x.append([])\n\nfor _ in range(m):\n s,c=map(int,input().split())\n x[s-1].append(c)\nans=''\nfor i in range(n):\n if len(set(x[i]))>=2:\n ans='-1'\n break\n if len(x[i])==0 and i==0:\n ans='1'\n if len(x[i])==0 and i!=0:\n ans='0'\n ans+=str(x[i][0])\nprint(int(ans))", 'n,m=map(int,input().split())\na=[]\nfor _ in range(m):\n s,c=map(int,input().split())\n a.append([s,c])\n\nans=-1\nif n==1:\n for i in range(10):\n x=str(i)\n c=0\n for j in range(m):\n if x[a[j][0]-1] == str(a[j][1]):\n c+=1 \n if c==m:\n ans=i\n break\nelse:\n for i in range(10**(n-1),10**n):\n x=str(i)\n c=0\n for j in range(m):\n if x[a[j][0]-1] == str(a[j][1]):\n c+=1 \n if c==m:\n ans=i\n break\nprint(ans)'] | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s352732247', 's548058556', 's579536537', 's194226444'] | [3064.0, 3064.0, 3064.0, 3064.0] | [19.0, 17.0, 17.0, 18.0] | [503, 292, 356, 570] |
p02761 | u211706121 | 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="a"*n\nflag=False\n\nfor i in range(m):\n s,c=map(int,input().split())\n s-=1\n if num[s]=="a" or num[s]==str(c):\n num=num[:s]+str(c)+num[s+1:]\n else:\n flag=True\nif flag or num[0]=="0":\n print(-1)\nelse:\n if num[0]!="a":\n num="1"+num[1:]\n print(num.replace("a","0"))', 'n,m=map(int,input().split())\nnum="a"*n\nflag=False\n\nfor i in range(m):\n s,c=map(int,input().split())\n s-=1\n if num[s]=="a" or num[s]==str(c):\n num=num[:s]+str(c)+num[s+1:]\n else:\n flag=True\nif flag or num[0]=="0":\n print(-1)\nelse:\n print(num.replace("a","1"))', 'n,m=map(int,input().split())\nnum="a"*n\nflag=False\n\nfor i in range(m):\n s,c=map(int,input().split())\n s-=1\n if num[s]=="a" or num[s]==str(c):\n num=num[:s]+str(c)+num[s+1:]\n else:\n flag=True\nif n==1 and ( m==0 or num=="0" ):\n print(0)\nelif flag or num[0]=="0":\n print(-1)\nelse:\n if num[0]=="a":\n num="1"+num[1:]\n print(num.replace("a","0"))'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s411939125', 's783134836', 's932377715'] | [3064.0, 3064.0, 3064.0] | [17.0, 18.0, 18.0] | [334, 290, 383] |
p02761 | u211805975 | 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) | ["#ABC157 Guess the number\nn,m = map(int,input().split())\nsc = [input().split() for _ in range(m)]\nif len(sc) == 0:\n print('0')\n exit()\n\nif n == 1:\n ans = []\n for i in range(m):\n ans.append(sc[m][1])\n if set(ans) == 1:\n print(ans[0])\n else:\n print('-1')\n exit()\n \nfor i in range(10**(n-1),10**n):\n cnt = 0\n seq = str(i)\n for j in range(m):\n if seq[int(sc[j][0])-1] == sc[j][1]:\n cnt += 1\n if cnt == m:\n ans.append(i)\n \nif len(ans) == 0:\n print('-1')\nelse:\n print(min(ans))", "#ABC157 Guess the number\nn,m = map(int,input().split())\nsc = [input().split() for _ in range(m)]\nprint(sc)\nans = []\nfor i in range(10**(n-1),10**n):\n cnt = 0\n seq = str(i)\n for j in range(m):\n if seq[int(sc[j][0])-1] == sc[j][1]:\n cnt += 1\n if cnt == m:\n ans.append(i)\nif cnt == 0:\n print('-1')\nelse:\n print(min(ans))", "#ABC157 Guess the number\nn,m = map(int,input().split())\nsc = [input().split() for _ in range(m)]\nans = []\nfor i in range(0,10**n):\n cnt = 0\n seq = str(i)\n for j in range(m):\n if seq[int(sc[j][0])-1] == sc[j][1]:\n print(seq[int(sc[j][0])-1])\n cnt += 1\n if cnt == m:\n ans.append(i)\n \nif len(ans) == 0:\n print('-1')\nelse:\n print(min(ans))", "#ABC157 Guess the number\nn,m = map(int,input().split())\nsc = [input().split() for _ in range(m)]\nans =[]\n\nif n == 1:\n if len(sc)== 0:\n print('0')\n else:\n ans = []\n for i in range(m):\n ans.append(sc[i][1])\n if len(set(ans)) == 1:\n print(ans[0])\n else:\n print('-1')\n \nelse:\n for i in range(10**(n-1),10**n):\n cnt = 0\n seq = str(i)\n for j in range(m):\n if seq[int(sc[j][0])-1] == sc[j][1]:\n cnt += 1\n if cnt == m:\n ans.append(i)\n \n if len(ans) == 0:\n print('-1')\n else:\n print(min(ans))"] | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s146088287', 's251174513', 's310263080', 's068088812'] | [3064.0, 3064.0, 3064.0, 3064.0] | [18.0, 19.0, 18.0, 19.0] | [565, 360, 396, 655] |
p02761 | u212328220 | 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())\nlst = []\nfor _ in range(m):\n lst.append(list(map(int,input().split())))\n\nnumber = [[] for _ in range(n)]\nfor v in lst:\n keta,num = v[0]-1,v[1]\n if not number[keta]:\n number[keta] = num\n else:\n if number[keta] != num:\n print(-1)\n exit()\n\nif n == 1:\n print(''.join([str(i) for i in number]))\nelif n == 2:\n if number[0] == 0:\n print(-1)\n exit()\n else:\n if not number[0]:\n number[0] = 1\n if not number[1]:\n number[1] = 0\n print(''.join([str(i) for i in number]))\nelse:\n if number[0] == 0:\n print(-1)\n exit()\n else:\n if not number[0]:\n number[0] = 1\n if not number[1]:\n number[1] = 0\n if not number[1]:\n number[2] = 0\n print(''.join([str(i) for i in number]))", "n, m = map(int,input().split())\nlst = []\nfor _ in range(m):\n lst.append(list(map(int,input().split())))\n\nnumber = [[] for _ in range(n)]\nfor v in lst:\n keta,num = v[0]-1,v[1]\n if number[0] == []:\n number[keta] = num\n\n if number[keta] != num:\n print(-1)\n exit()\n\nif n == 1:\n if not number[0]:\n print(0)\n else:\n print(number[0])\nelif n == 2:\n if number[0] == 0:\n print(-1)\n exit()\n else:\n if not number[0]:\n number[0] = 1\n if not number[1]:\n number[1] = 0\n print(''.join([str(i) for i in number]))\nelse:\n if number[0] == 0:\n print(-1)\n exit()\n else:\n if not number[0]:\n number[0] = 1\n if not number[1]:\n number[1] = 0\n if not number[2]:\n number[2] = 0\n print(''.join([str(i) for i in number]))", "n, m = map(int,input().split())\nlst = []\nfor _ in range(m):\n lst.append(list(map(int,input().split())))\n\nnumber = [[] for _ in range(n)]\nfor v in lst:\n keta,num = v[0]-1,v[1]\n if not number[keta]:\n number[keta] = num\n else:\n if number[keta] != num:\n print(-1)\n exit()\n\nif n == 1:\n print(''.join([str(i) for i in number]))\nelif n == 2:\n if number[0] == 0:\n print(-1)\n exit()\n else:\n if not number[0]:\n number[0] = 1\n if not number[1]:\n number[1] = 1\n print(''.join([str(i) for i in number]))\nelse:\n if number[0] == 0:\n print(-1)\n exit()\n else:\n if not number[0]:\n number[0] = 1\n if not number[1]:\n number[1] = 1\n if not number[1]:\n number[2] = 1\n print(''.join([str(i) for i in number]))", "n, m = map(int,input().split())\nlst = []\nfor _ in range(m):\n lst.append(list(map(int,input().split())))\n\nnumber = [[] for _ in range(n)]\nfor v in lst:\n keta,num = v[0]-1,v[1]\n if number[keta] == []:\n number[keta] = num\n\n if number[keta] != num:\n print(-1)\n exit()\n\nif n == 1:\n if not number[0]:\n print(0)\n else:\n print(''.join([str(i) for i in number]))\nelif n == 2:\n if number[0] == 0:\n print(-1)\n exit()\n else:\n if not number[0]:\n number[0] = 1\n if not number[1]:\n number[1] = 0\n print(''.join([str(i) for i in number]))\nelse:\n if number[0] == 0:\n print(-1)\n exit()\n else:\n if not number[0]:\n number[0] = 1\n if not number[1]:\n number[1] = 0\n if not number[2]:\n number[2] = 0\n print(''.join([str(i) for i in number]))\n"] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s715672312', 's728049184', 's945059247', 's918300419'] | [9116.0, 9224.0, 9180.0, 9224.0] | [33.0, 25.0, 29.0, 29.0] | [881, 888, 881, 916] |
p02761 | u215286521 | 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 i in range(m):\n s[i], c[i] = list(map(int, input().split()))\n\nresult = [0] * n\n\nfor i in range(m):\n if result[s[i]-1] == 0:\n result[s[i]-1] = c[i]\n elif result[s[i]-1] > c[i]:\n result[s[i]-1] = c[i]\n\nprint(result)\nif result[0] == 0:\n print(-1)\n exit()\n\nans = "".join(str(x) for x in result)\nprint(ans)', 'n, m = list(map(int, input().split()))\n\ns = [0] * m\nc = [0] * m\n\nfor i in range(m):\n s[i], c[i] = list(map(int, input().split()))\n\nresult = [0] * n\n\nfor i in range(m):\n if result[s[i]-1] == 0:\n result[s[i]-1] = c[i]\n elif result[s[i]-1] > c[i]:\n result[s[i]-1] = c[i]\n\nprint(result)\nif result[0] == 0:\n print(-1)\nelse:\n if result[1] == 0:\n print(-1)\n \n ans = ""\n for n in result:\n ans += n\n print(ans)\n', 'n, m = map(int, input().split())\nsc = [list(map(int, input().split())) for _ in range(m)]\n\nnum = [-1] * n\nfor s, c in sc:\n if num[s - 1] != -1 and num[s - 1] != c:\n print(-1)\n exit()\n if n > 1 and s == 1 and c == 0:\n print(-1)\n exit()\n num[s - 1] = c\n\nif n > 1 and num[0] == -1:\n num[0] = 1\n\nfor i in range(n):\n if num[i] == -1:\n num[i] = 0\n\nprint("".join(str(x) for x in num))\n'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s171737429', 's200884466', 's198039699'] | [3064.0, 3064.0, 3064.0] | [17.0, 18.0, 18.0] | [395, 453, 428] |
p02761 | u215341636 | 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().strip().split())\na = [input().split() for i in range(m)]\nans = ['a'] * n\n\n\nfor i in range(m):\n ind = int(a[i][0]) - 1\n if ans[ind] != 'a':\n ans = '-1'\n break\n else:\n ans[ind] = a[i][1]\n\nprint(''.join(ans))", "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\n\nn, m = list(map(int, input().split()))\nprint(solve(n, m))\n"] | ['Wrong Answer', 'Accepted'] | ['s831143925', 's756636532'] | [3060.0, 3064.0] | [17.0, 17.0] | [241, 609] |
p02761 | u216011776 | 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) | ['\nif __name__ == \'__main__\':\n n, m = [int(i) for i in input().split()]\n\n d = {}\n for i in range(1, n + 1):\n d[i] = 0\n\n\n result = -1\n for i in range(m):\n s, c = [int(i) for i in input().split()]\n \n if d[s] != 0:\n print(result)\n exit()\n d[s] = c\n\n tmp = ""\n for i in sorted(d.keys()):\n tmp += str(d[i])\n\n if tmp != str(int(tmp)):\n result = -1\n else:\n result = int(tmp)\n \n print(result)\n', 'import sys\n\ndef main():\n\n inp = sys.stdin.readline\n n, m = [int(i) for i in inp().split()]\n \n d = {}\n for _ in range(m):\n s, c = [int(i) for i in inp().split()]\n \n if s in d.keys():\n if d[s] != c:\n print(-1)\n exit()\n else:\n d[s] = c\n\n tmp = ""\n for i in range(1, n + 1):\n if i in d.keys():\n if i == 1 and d[i] == 0 and n > 1:\n print(-1)\n exit()\n tmp += str(d[i])\n else:\n if i == 1 and n > 1:\n tmp += "1"\n else:\n tmp += "0"\n\n print(tmp)\n\n\nif __name__ == \'__main__\':\n main()'] | ['Wrong Answer', 'Accepted'] | ['s333313595', 's362819449'] | [3064.0, 3064.0] | [19.0, 22.0] | [494, 697] |
p02761 | u216392490 | 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\nimport math\nsys.setrecursionlimit(int(1e6))\n\nN, 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\ndigits = [-1]*N\nfault = False\nfor i in range(M):\n d = s[i]-1\n if digits[d] >= 0:\n fault = True\n break\n digits[d] = c[i]\n\nif fault:\n print(-1)\n exit()\n\nif (N>1) and (digits[0] == 0):\n print(-1)\n exit()\n\nans = 0\nfor i in range(N):\n b = 10 ** (N - i - 1)\n n = digits[i] if digits[i] >= 0 else 0\n ans = ans + n * b\n\nprint(ans)\n', 'import sys\nimport math\nsys.setrecursionlimit(int(1e6))\n\nN, 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\ndigits = [-1]*N\nfault = False\nfor i in range(M):\n d = s[i]-1\n if digits[d] >= 0 and (digits[d] != c[i]):\n fault = True\n break\n digits[d] = c[i]\n\nif fault:\n print(-1)\n sys.exit()\n\nif (N>1) and (digits[0] == 0):\n print(-1)\n sys.exit()\n\nans = 0\nfor i in range(N):\n b = 10 ** (N - i - 1)\n n = digits[i] if digits[i] >= 0 else 0\n ans = ans + n * b\n\nmin_ans = 10 ** (N - 1) if N > 1 else 0\nif ans < min_ans:\n ans = ans + min_ans\n\nprint(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s469825907', 's431849419'] | [3064.0, 3064.0] | [17.0, 17.0] | [539, 654] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.