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 | u552176911 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['print(-1)', 'import sys\n\nn, m = list(map(int, input().split()))\nar = [list(map(int, input().split())) for _ in range(m)]\nans = [0 for _ in range(n)]\n\nfor a in ar:\n if ans[a[0] - 1] != 0:\n print("-1")\n sys.exit()\n ans[a[0] - 1] = a[1]\n\nif ans[0] == 0:\n ans[0] = 1\n\nans = int("".join(map(str, ans)))', 'import sys\n\nn, m = list(map(int, input().split()))\nar = [list(map(int, input().split())) for _ in range(m)]\nans = [0 for _ in range(n)]\n\nfor a in ar:\n if ans[a[0] - 1] != 0:\n print(-1)\n sys.exit()\n ans[a[0] - 1] = a[1]\n\nif ans[0] == 0:\n ans[0] = 1\n\nans = int("".join(map(str, ans)))', 'import sys\n\nn, m = list(map(int, input().split()))\nar = [list(map(int, input().split())) for _ in range(m)]\nans = [0 for _ in range(n)]\n\nfor a in ar:\n ans[a[0] - 1] = a[1]\n\nif ans[0] == 0:\n print(-1)\n sys.exit()\n\nans = int("".join(map(str, ans)))', 'import math\n\nn, m = map(int, input().split(" "))\n\nans = list([0 for _ in range(n)])\n\nerr = False\nfor i in range(m):\n s, c = map(int, input().split(" "))\n if s == 1 and c == 0:\n if n == 1:\n print(0)\n exit()\n err = True\n elif ans[s - 1] == 0:\n ans[s - 1] = c\n elif not ans[s - 1] == c:\n err = True\n\nif ans[0] == 0:\n ans[0] = 1\n\nif (n == 1 and ans[0] == 0) or (n == 1 and m == 0):\n print(0)\n exit()\n\nif err:\n print(-1)\n exit()\n\nprint("".join(map(str, ans)))'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s097654118', 's636336666', 's803159546', 's891859800', 's904476384'] | [2940.0, 3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 17.0, 18.0, 17.0, 18.0] | [9, 307, 305, 255, 531] |
p02761 | u553308611 | 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) | ['vN, M = map(int, input().split())\ns = [-1]\nc = [-1]\nOK = True\nx = 0\nfor i in range(M):\n s_, c_ = map(int, input().split())\n if N != 1 and s_ == 1 and c_ == 0:\n OK = False\n ok = True\n for i in range(len(s)):\n if s[i] == s_:\n ok = False\n if c[i] != c_:\n OK = False\n break\n break\n if ok:\n s.append(s_)\n c.append(c_)\n x += (10 ** (N - s_)) * c_\n\nif N != 1 and x < 10 ** (N - 1):\n x += 10 ** (N - 1)\n\nif OK:\n print(x)\nelse:\n print(-1)\n', 'N, M = map(int, input().split())\ns = [-1]\nc = [-1]\nOK = True\nx = 0\nfor i in range(M):\n s_, c_ = map(int, input().split())\n ok = True\n for i in range(len(s)):\n if s[i] == s_:\n ok = False\n if c[i] != c_:\n OK = False\n break\n break\n if ok:\n s.append(s_)\n c.append(c_)\n x += (10 ** (N - s_)) * c_\n\n\nif OK and x >= 10 ** N:\n print(x)\nelse:\n print(-1)\n', 'N, M = map(int, input().split())\ns = [-1]\nc = [-1]\nOK = True\nx = 0\nfor i in range(M):\n s_, c_ = map(int, input().split())\n if N != 1 and s_ == 1 and c_ == 0:\n OK = False\n ok = True\n for i in range(len(s)):\n if s[i] == s_:\n ok = False\n if c[i] != c_:\n OK = False\n break\n break\n if ok:\n s.append(s_)\n c.append(c_)\n x += (10 ** (N - s_)) * c_\n\nif N != 1 and x < 10 ** (N - 1):\n x += 10 ** (N - 1)\n\nif OK:\n print(x)\nelse:\n print(-1)\n'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s109900890', 's302689228', 's632855763'] | [3064.0, 3064.0, 3064.0] | [17.0, 19.0, 18.0] | [552, 454, 551] |
p02761 | u556225812 | 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\nlst = [[] for i in range(3)]\nfor i in range(M):\n a, b = map(int, input().split())\n if b not in lst[a-1]:\n lst[a-1].append(b)\nfor i in range(3):\n if len(lst[i]) > 1:\n print(-1)\n exit()\n if i == 0:\n if not lst[i]:\n ans += 100\n elif lst[i][0] == 0:\n ans += 0\n else:\n ans += lst[i][0]*100\n else:\n if not lst[i]:\n ans += 0\n elif lst[i][0] == 0:\n ans += 0\n else:\n ans += lst[i][0]*(10**(2-i)) \n\nif (ans//(10**N)) >= 1:\n print(ans)\nelif ans == 0 and N == 1:\n print(ans)\nelse:\n print(-1)', 'N, M = map(int, input().split())\nans = []\nlst = []\nstart = 0 if N == 1 else 10**(N-1)\nfor i in range(M):\n a, b = map(int, input().split())\n lst.append([a, b])\n\n\nfor i in range(start, 10**N):\n flag = True\n for j in range(M):\n if str(i)[lst[j][0]-1] != str(lst[j][1]):\n flag = False\n break\n \n if flag == True:\n print(i)\n exit()\n\nprint(-1)'] | ['Wrong Answer', 'Accepted'] | ['s810763844', 's042754276'] | [3064.0, 3064.0] | [17.0, 18.0] | [679, 397] |
p02761 | u557565572 | 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\n\n# import heapq\n# from collections import deque\nimport numpy as np\n\nn, m = map(int, input().split())\ns, c = [0] * m, [0] * m\nfor i in range(m):\n s[i], c[i] = map(int, input().split())\n\n# replace = [False] * n\nnumber = ['a'] * n\nans = 0\nfor i in range(m):\n\n if number[s[i]-1] != 'a' and str(c[i]) != number[s[i]-1]:\n ans = -1\n break\n\n number[s[i]-1] = str(c[i])\n\nif not ans == -1:\n if n != 1 and number[0] == '0':\n ans = -1\nelse:\n for i in range(n):\n if i == 0 and number[i] == 'a' and len(number) != 1:\n number[0] = '1'\n elif number[i] == 'a':\n number[i] = '0'\n ans = ''.join(number)\n\nprint(ans)\n\n\n", "# import math\n\n# import heapq\n# from collections import deque\nimport numpy as np\n\nn,m = map(int,input().split())\ns,c = [0] * m, [0] * m\nfor i in range(m):\n s[i],c[i] = map(int,input().split())\n\n# replace = [False] * n\nans = list('a'* n)\n\nfor i in range(m):\n\n if len(ans) != 1 and s[i] == 1 and c[i] == 0:\n ans = -1\n break\n elif ans[s[i]-1] != 'a' and str(c[i]) != ans[s[i]-1]:\n ans = -1\n break\n\n ans[s[i]-1] = str(c[i])\nif n == 1 and ans[0] == 0: print(0)\n\nelif not ans == -1:\n\n for i in range(n):\n if i == 0 and ans[i] == 'a': ans[0] = '1'\n elif ans[i] == 'a': ans[i] = '0'\n\n print(''.join(ans))\n\nelif : print(-1)\n", "# import math\n\n# import heapq\n# from collections import deque\n# import numpy as np\n\nn, m = map(int, input().split())\n\nans = [-1] * n\nsafe = True\n\nfor i in range(m):\n s,c = map(int, input().split())\n\n if (n!=1 and s==1 and c==0) or (ans[s-1]!=-1 and c != ans[s-1]):\n safe = False\n\n ans[s-1] = c\n\n\nif safe:\n for i in range(n):\n if n!=1 and ans[0]==-1 and i==0:\n ans[0] = 1\n\n elif ans[i] == -1:\n ans[i] = 0\n print(''.join(str(n) for n in ans))\n\nelse: print(-1)\n"] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s569917412', 's900740734', 's071977312'] | [21024.0, 3064.0, 3064.0] | [306.0, 19.0, 17.0] | [702, 690, 531] |
p02761 | u558242240 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["n, m = map(int, input().split())\nsc = [tuple(map(int, input().split())) for _ in range(m)]\nsc = sorted(sc, reverse=True, key=lambda x:x[0])\nif m == 0:\n print(-1)\n exit()\nif sc[0][0] != n:\n print(-1)\n exit()\nans = [0] * n\nans[0] = 1\nprev = sc[0]\nfor i in range(1, m):\n if prev[0] == sc[i][0] and prev[1] != sc[i][1]:\n print(-1)\n exit()\n ans[sc[i][0]-1] = sc[i][1]\n prev = sc[i]\nprint(''.join(map(lambda x: str(x), ans)))", "n, m = map(int, input().split())\nsc = [tuple(map(int, input().split())) for _ in range(m)]\nsc = sorted(sc, reverse=True, key=lambda x:x[0])\nif sc[0][0] != n:\n print(-1)\n exit()\n\nans = [0] * n\nans[0] = 1\nprev = sc[0]\n\nfor i in range(1, m):\n if prev[0] == sc[i][0] and prev[1] != sc[i][1]:\n print(-1)\n exit()\n ans[sc[i][0]-1] = sc[i][1]\n prev = sc[i]\nprint(ans)\nprint(''.join(map(lambda x: str(x), ans)))", "n, m = map(int, input().split())\nsc = [tuple(map(int, input().split())) for _ in range(m)]\nsc = sorted(sc, key=lambda x:x[0])\n\nif m != 0 and n != 1 and sc[0][0] == 1 and sc[0][1] == 0:\n print(-1)\n exit()\nif m == 0 and n == 1:\n print(0)\n exit()\n\nans = [0] * n\nans[0] = 1\nprev = (0, 0)\nif m != 0:\n prev = sc[0]\nfor i in range(m):\n if prev[0] == sc[i][0] and prev[1] != sc[i][1]:\n print(-1)\n exit()\n ans[sc[i][0]-1] = sc[i][1]\n prev = sc[i]\nprint(''.join(map(lambda x: str(x), ans)))"] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s807081049', 's851179460', 's759448845'] | [3064.0, 3064.0, 3064.0] | [17.0, 17.0, 17.0] | [454, 431, 518] |
p02761 | u559196406 | 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\nans = [0]*n\njudge_s = 0\njudge_c = 0\nsc = sorted(sc)\nfor i in range(m):\n if judge_s == sc[i][0] and judge_c != sc[i][1]:\n ans = -1\n break\n judge_s = sc[i][0]\n judge_c = sc[i][1]\n ans[sc[i][0]-1] = sc[i][1]\n\n\nif ans != -1:\n if ans[0] == 0:\n ans = -1\n else:\n ans = 0\n for i in range(n):\n ans += ans[i]*10**(n-i-1)\n \nprint(ans)', 'n,m = map(int,input().split())\nsc = [list(map(int,input().split())) for _ in range(m)]\n\nans = [0]*n\njudge_s = 0\njudge_c = 0\nsc = sorted(sc)\n\nif m == 0:\n if n == 1:\n ans = 0\n else:\n ans = 10**(n-1)\nelse:\n for i in range(m):\n if judge_s == sc[i][0] and judge_c != sc[i][1]:\n ans = -1\n break\n if n != 1 and sc[i] == [1,0]\n ans = -1\n break\n judge_s = sc[i][0]\n judge_c = sc[i][1]\n ans[sc[i][0]-1] = sc[i][1]\n\n\n if ans != -1:\n ans_ = ans.copy()\n ans = 0\n for i in range(n):\n ans += ans_[i]*10**(n-i-1)\n \n if ans_[0] == 0 and n != 1:\n ans += 10**(n-1)\n \n \nprint(ans)', 'n,m = map(int,input().split())\nsc = [list(map(int,input().split())) for _ in range(m)]\n\nans = [0]*n\njudge_s = 0\njudge_c = 0\nsc = sorted(sc)\n\nif m == 0:\n if n == 1:\n ans = 0\n else:\n ans = 10**(n-1)\nelse:\n for i in range(m):\n if judge_s == sc[i][0] and judge_c != sc[i][1]:\n ans = -1\n break\n if n != 1 and sc[i] == [1,0]:\n ans = -1\n break\n judge_s = sc[i][0]\n judge_c = sc[i][1]\n ans[sc[i][0]-1] = sc[i][1]\n\n\n if ans != -1:\n ans_ = ans.copy()\n ans = 0\n for i in range(n):\n ans += ans_[i]*10**(n-i-1)\n \n if ans_[0] == 0 and n != 1:\n ans += 10**(n-1)\n \n \nprint(ans)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s615096884', 's684327067', 's397096993'] | [3064.0, 3064.0, 3064.0] | [17.0, 18.0, 17.0] | [478, 736, 737] |
p02761 | u563676207 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['# input\nN, M, K = map(int, input().split())\n\nFrends = [[] for _ in range(N)]\nfor _ in range(M):\n a, b = map(int, input().split())\n a -= 1\n b -= 1\n if a < b:\n Frends[a].append(b)\n else:\n Frends[b].append(a)\n\nBlocked = [[] for _ in range(N)]\nfor _ in range(K):\n c, d = map(int, input().split())\n c -= 1\n d -= 1\n if c < d:\n Blocked[c].append(d)\n else:\n Blocked[d].append(c)\n\n# process\n\nfg = []\nfor i in range (N):\n fs = Frends[i]\n for f in fs:\n t = -1\n\n j = 0\n fglen = len(fg)\n while j < fglen:\n g = fg[j]\n if i in g and f in g:\n if t < 0:\n t = j \n else:\n fg[t] = fg[t] | g\n fg.pop(j)\n fglen -= 1\n elif not (i in g or f in g):\n j += 1\n continue\n else:\n if t < 0:\n if i in g:\n g.add(f)\n else:\n g.add(i)\n\n t = j\n else:\n fg[t] = fg[t] | g\n fg.pop(j)\n fglen -= 1\n j += 1\n \n if t < 0:\n fg.append(set([i, f]))\n\n\ncand = []\nfor i in range(N):\n for g in fg:\n if i in g:\n for f in g:\n if i < f and not f in Frends[i] and not f in Blocked[i]:\n cand.append((i, f,))\n\n\nans = [0 for _ in range(N)]\nfor c in cand:\n a, b = c\n ans[a] += 1\n ans[b] += 1\n\n# output\n#print(fg)\n#print(cand)\nprint(" ".join(map(str, ans)))\n', '# input\nN, M = map(int, input().split())\n\nSC = []\nfor _ in range(M):\n SC.append(tuple(map(int, input().split())))\n\n# process\nans = 0\n\nA = [-1 for _ in range(N)]\n\nfor s, c in SC:\n s -= 1\n if s == 0 and c == 0 and N > 1:\n ans = -1\n break\n elif A[s] == -1:\n A[s] = c\n elif A[s] != c:\n ans = -1\n break\n\nif ans != -1:\n if A[0] == -1 and N > 1:\n A[0] = 1\n for i in range(0, N):\n if A[i] == -1:\n A[i] = 0\n\n A = A[::-1]\n for i in range(N):\n ans += A[i]*(10**i)\n\n# output\nprint(ans)\n'] | ['Runtime Error', 'Accepted'] | ['s377693504', 's696573910'] | [3192.0, 3064.0] | [18.0, 17.0] | [1757, 568] |
p02761 | u563838154 | 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 operator import itemgetter\nn,m = map(int,input().split())\nt = [list(map(int,input().split())) for _ in range(m)]\nt.sort(key=itemgetter(0))\nc = [i[1] for i in t ]\ns = [i[0] for i in t]\n# print(c)\nx = 0\n\nans = "aaa"\nans = list(ans)\nfor i in range(3):\n for j in range(len(s)):\n if i==s[j]-1 :\n if str(c[j])!=ans[i] and ans[i]=="a":\n ans[2-i]=str(c[j])\n elif str(c[j])!=ans[i] and ans[i]!="a":\n x =1\n# print(ans)\n\nif x==1:\n print(-1)\nelif n!=1 and ans[3-n]=="0":\n print(-1)\nelif m==0 and n!=1:\n print(-1)\nelif m==0 and n==1:\n print(0)\nelse:\n if ans[3-n]=="a" and max(s)<n and n!=1:\n ans[3-n]="1"\n # print(ans)\n for i in range(3):\n if ans[i]=="a":\n ans[i]="0"\n # if ans[n-1]=="0" and max(s)<n and n!=1:\n # ans[n-1]="1"\n # print(ans)\n ans = int("".join(ans))\n\n print(ans)', 't = [list(map(int,input().split())) for _ in range(m)]\nt.sort(key=itemgetter(0))\nc = [i[1] for i in t ]\ns = [i[0] for i in t]\n# print(c)\nx = 0\n\nans = "a"*n\nans = list(ans)\nfor i in range(n):\n for j in range(len(s)):\n if i==s[j]-1 :\n if str(c[j])!=ans[i] and ans[i]=="a":\n ans[i]=str(c[j])\n elif str(c[j])!=ans[i] and ans[i]!="a":\n x =1\n# print(ans)\n\nif ans[0]=="0":\n x=1\nfor i in range(len(ans)):\n if ans[i]=="a":\n ans[i]="0"\n# print(ans)\nif x==0:\n print("".join(ans))\nelse:\n print(-1)', 'from operator import itemgetter\nn,m = map(int,input().split())\nt = [list(map(int,input().split())) for _ in range(m)]\nt.sort(key=itemgetter(0))\nc = [i[1] for i in t ]\ns = [i[0] for i in t]\n# print(c)\nx = 0\n\nans = "aaa"\nans = list(ans)\nfor i in range(3):\n for j in range(len(s)):\n if i==s[j]-1 :\n if str(c[j])!=ans[i] and ans[i]=="a":\n ans[i]=str(c[j])\n elif str(c[j])!=ans[i] and ans[i]!="a":\n x =1\n# print(ans)\n\nif x==1:\n print(-1)\nelif n!=1 and ans[3-n]=="0":\n print(-1)\nelif m==0 and n!=1:\n print(-1)\nelif m==0 and n==1:\n print(0)\nelse:\n if ans[3-n]=="a" and max(s)<n and n!=1:\n # ans[3-n]="1"\n # print(ans)\n for i in range(3):\n if ans[i]=="a":\n ans[i]="0"\n # if ans[n-1]=="0" and max(s)<n and n!=1:\n # ans[n-1]="1"\n # print(ans)\n ans = int("".join(ans))\n if len(str(ans))>n:\n print(-1)\n else:\n print(ans)', 'from operator import itemgetter\nn,m = map(int,input().split())\nt = [list(map(int,input().split())) for _ in range(m)]\nt.sort(key=itemgetter(0))\nc = [i[1] for i in t ]\ns = [i[0] for i in t]\n# print(c)\nx = 0\nans = "aaa"\nans = list(ans)\nfor i in range(3):\n for j in range(len(s)):\n if i==s[j]-1 :\n if str(c[j])!=ans[i] and ans[i]=="a":\n ans[i]=str(c[j])\n elif str(c[j])!=ans[i] and ans[i]!="a":\n x =1\n\nif x==1:\n print(-1)\nelse:\n for i in range(3):\n if ans[i]=="a":\n ans[i]=0\n print(ans)\n\n\n', 'from operator import itemgetter\nn,m = map(int,input().split())\nt = [list(map(int,input().split())) for _ in range(m)]\nt.sort(key=itemgetter(0))\nc = [i[1] for i in t ]\ns = [i[0] for i in t]\n# print(c)\nx = 0\n\nans = "a"*n\nans = list(ans)\nfor i in range(n):\n for j in range(len(s)):\n if i==s[j]-1 :\n if str(c[j])!=ans[i] and ans[i]=="a":\n ans[i]=str(c[j])\n elif str(c[j])!=ans[i] and ans[i]!="a":\n x =1\n# print(ans)\n\nif ans[0]=="0" and n!=1:\n x=1\nfor i in range(len(ans)):\n if ans[i]=="a":\n ans[i]="0"\n# print(ans)\nif ans[0]=="0"and n!=1:\n ans[0]="1"\nif x==0:\n print(int("".join(ans)))\nelse:\n print(-1)'] | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s053394949', 's135622684', 's634337347', 's884529270', 's333824450'] | [3064.0, 3064.0, 3064.0, 3316.0, 3064.0] | [18.0, 17.0, 17.0, 21.0, 18.0] | [898, 567, 953, 576, 683] |
p02761 | u564655959 | 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 calculate(n, m, condition_list):\n if [1, 0] in condition_list:\n return '-1'\n \n \n result = ['null']*n\n for condition in condition_list:\n if result[condition[0]-1] != 'null':\n if not result[condition[0]-1] == condition[1]:\n return '-1'\n result[condition[0]-1] = condition[1]\n \n for i in range(result):\n if result[i] == 'null':\n \n if i == 0 and n != 1:\n result[i] = 1\n \n else:\n result[i] = 0\n return ''.join([str(each) for each in result])\n\nn, m = (int(each) for each in input().split(' '))\n\n\ncondition_list = []\nfor i in range(m):\n condition_list.append([int(each) for each in input().split(' ')])\n\nprint(calculate(n, m, condition_list))", "def calculate(n, m, condition_list):\n if [1, 0] in condition_list and n > 1:\n return '-1'\n \n \n result = ['null']*n\n for condition in condition_list:\n if result[condition[0]-1] != 'null':\n if not result[condition[0]-1] == condition[1]:\n return '-1'\n result[condition[0]-1] = condition[1]\n \n for i in range(len(result)):\n if result[i] == 'null':\n \n if i == 0 and n != 1:\n result[i] = 1\n \n else:\n result[i] = 0\n return ''.join([str(each) for each in result])\n\nn, m = (int(each) for each in input().split(' '))\n\n\ncondition_list = []\nfor i in range(m):\n condition_list.append([int(each) for each in input().split(' ')])\n\nprint(calculate(n, m, condition_list))"] | ['Runtime Error', 'Accepted'] | ['s289262638', 's257810856'] | [3064.0, 3064.0] | [18.0, 17.0] | [1084, 1099] |
p02761 | u564770050 | 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)]\ntemp = [-1] * n\nans = -1\n\nfor i in sc:\n if temp[i[0]-1] != -1 and temp[i[0]-1] != i[1]:\n print(-1)\n exit()\n temp[i[0]-1] = i[1]\n\nif n == 1:\n mini = 0\n maxi = 10\nif n == 2:\n mini = 10\n maxi = 100\nif n == 3:\n mini = 100\n maxi = 1000\n\nprint(mini,maxi)\nfor i in range(mini,maxi):\n s = str(i)\n ok = True\n for j in sc:\n if s[j[0]-1] != str(j[1]):\n ok = False\n if ok:\n ans = i\n print(ans)\n exit()\n\nprint(ans)', "n,m = map(int,input().split())\nsc = [list(map(int,input().split())) for i in range(m)]\ntemp = [-1] * n\nsc.sort(key=lambda x: x[0])\nans = []\nc = 1\nprint(sc)\nfor i in sc:\n print(temp,i)\n if temp[i[0]-1] != -1 and temp[i[0]-1] != i[1]:\n print(-1)\n exit()\n temp[i[0]-1] = i[1]\nif temp[0] == -1:\n ans = '1'\nelse:\n ans = str(temp[0])\nif ans == '0':\n print(-1)\n exit()\nfor i in temp[1:]:\n if i == -1:\n ans += '0'\n else:\n ans += str(i)\nprint(ans)", 'n,m = map(int,input().split())\nsc = [list(map(int,input().split())) for i in range(m)]\ntemp = [-1] * n\nans = -1\n\nfor i in sc:\n if temp[i[0]-1] != -1 and temp[i[0]-1] != i[1]:\n print(-1)\n exit()\n temp[i[0]-1] = i[1]\n\nif n == 1:\n mini = 0\n maxi = 10\nif n == 2:\n mini = 10\n maxi = 100\nif n == 3:\n mini = 100\n maxi = 1000\n\nfor i in range(mini,maxi):\n s = str(i)\n ok = True\n for j in sc:\n if s[j[0]-1] != str(j[1]):\n ok = False\n if ok:\n ans = i\n print(ans)\n exit()\n\nprint(ans)'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s293411606', 's457040534', 's865596231'] | [3064.0, 3444.0, 3064.0] | [18.0, 21.0, 18.0] | [577, 493, 560] |
p02761 | u569272329 | 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 = []\nfor i in range(0, M):\n a = tuple(map(int, input().split()))\n A.append(a)\nfor x in range(10**(N-1)-1, 10**N):\n ans = str(x)\n flag = True\n for a in A:\n if ans[a[0]-1] != str(a[1]):\n flag = False\n if flag:\n print(x)\n exit(0)\nprint(-1)\n', 'N, M = map(int, input().split())\nA = []\nfor i in range(0, M):\n a = tuple(map(int, input().split()))\n A.append(a)\nstart = 10**(N-1)\nif N == 1:\n start = 0\nfor x in range(start, 10**N):\n ans = str(x)\n flag = True\n for a in A:\n if ans[a[0]-1] != str(a[1]):\n flag = False\n if flag:\n print(x)\n exit(0)\nprint(-1)\n'] | ['Runtime Error', 'Accepted'] | ['s781184373', 's465301807'] | [3060.0, 3064.0] | [19.0, 17.0] | [322, 359] |
p02761 | u572425901 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['N, M = map(int, input().split())\nSC = []\nfor i in range(M):\n SC.append(list(map(int, input().split())))\nflag = 0\nN, M = 3, 1\nSC = [[1, 0]]\na = ""\nA = [[] for row in range(N)]\nfor i, S in enumerate(SC):\n if not (str(S[1]) in A[S[0]-1]):\n A[S[0]-1].append(str(S[1]))\nfor i in range(0,N):\n if len(A[i]) == 0:\n if i == 0:\n a += "1"\n else:\n a += "0"\n elif i==0 and A[i][0] == "0":\n flag = 1\n break\n elif len(A[i]) == 1:\n a += A[i][0]\n else:\n flag = 1\n break\n\nif flag == 1:\n print(-1)\nelse:\n print(int(a))', 'N, M = map(int, input().split())\nSC = []\nfor i in range(M):\n SC.append(list(map(int, input().split())))\nflag = 0\na = ""\nA = [[] for row in range(N)]\nfor i, S in enumerate(SC):\n if not (str(S[1]) in A[S[0]-1]):\n A[S[0]-1].append(str(S[1]))\nfor i in range(0,N):\n if len(A[i]) == 0:\n if i == 0 and N>1:\n a += "1"\n else:\n a += "0"\n elif i==0 and A[i][0] == "0" and N>1:\n flag = 1\n break\n elif len(A[i]) == 1:\n a += A[i][0]\n else:\n flag = 1\n break\n\nif flag == 1:\n print(-1)\nelse:\n print(int(a))'] | ['Wrong Answer', 'Accepted'] | ['s791373654', 's786129224'] | [3064.0, 3064.0] | [18.0, 18.0] | [601, 592] |
p02761 | u575239123 | 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) | ['l=[10]*3\nn,m=map(int,input().split())\nfor i in range(m):\n s,c=map(int,input().split())\n if c<l[s-1]:\n l[s-1]=c\nl=l[::-1]\nfor i in range(len(l)):\n if l[i]==10:\n l[i]=str(0)\n else:\n l[i]=str(l[i])\nans=int("".join(l))\nif ans==0:\n print(1)\n exit(0)\nif len(str(ans))!=n:\n print(-1)\nelse:\n print(ans)', 'n,m=map(int,input().split())\nl=[10]*n\nfor i in range(m):\n s,c=map(int,input().split())\n if c<l[s-1]:\n l[s-1]=c\nfor i in range(len(l)):\n if l[i]==10:\n l[i]=str(1)\n else:\n l[i]=str(l[i])\nans=int("".join(l))\nif len(str(ans))!=n and ans!=0:\n print(-1)\nelse:\n print(ans)', 'l=[10]*3\nn,m=map(int,input().split())\nfor i in range(m):\n s,c=map(int,input().split())\n if c<l[s-1]:\n l[s-1]=c\nl=l[::-1]\nfor i in range(len(l)):\n if l[i]==10:\n l[i]=str(0)\n else:\n l[i]=str(l[i])\nans=int("".join(l))\nif len(str(ans))!=n:\n print(-1)\nelse:\n print(ans)', 'n,m=map(int,input().split())\nl=[]\nfor i in range(m):\n s,c=map(int,input().split())\n l.append((s-1,str(c)))\nfor i in range(1000):\n d=list(str(i))\n if len(d)!=n:continue\n for j in l:\n if d[j[0]]!=j[1]:break\n else:\n print(i)\n break\nelse:\n print(-1)\n \n'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s145742162', 's277480285', 's517893163', 's194630460'] | [3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 17.0, 17.0, 18.0] | [311, 280, 279, 267] |
p02761 | u575956662 | 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())\nnum = [0]*n\nnum[0] = 1\nAns = 0\nfor i in range(m):\n s,c = map(int, input().split())\n if num[s-1] != 0 and num[s-1] != c:\n print(-1)\n sys.exit()\n else:\n num[s-1] = c\nprint(num)\nfor i in range(len(num)):\n Ans = Ans + num[i] * (10 ** (n-i-1))\nprint(Ans)', 'import sys\nn,m = map(int, input().split())\nnum = [0]*n\nal = [-1]*n\nAns = 0\nfor i in range(m):\n s,c = map(int, input().split())\n if num[s-1] != 0 and num[s-1] != c:\n print(-1)\n sys.exit()\n else:\n num[s-1] = c\n al[s-1] = c\nif al.count(0)==n and n >= 2:\n print(-1)\n sys.exit()\nif al[0] == 0and n >= 2:\n print(-1)\n sys.exit()\nif num[0] == 0 and n >= 2:\n num[0] = 1\nfor i in range(len(num)):\n Ans = Ans + num[i] * (10 ** (n-i-1))\n\nif Ans == 0 and n >= 2:\n print(-1)\nelse:\n print(Ans)'] | ['Wrong Answer', 'Accepted'] | ['s459850250', 's350650048'] | [9152.0, 9252.0] | [32.0, 31.0] | [325, 539] |
p02761 | u576917603 | 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=[[int(i) for i in input().split()] for i in range(m)]\n\nnumber=[99]*n\nif m==0 and n==1:\n print(0)\n exit()\nif m==0 and n==2:\n print(10)\n exit()\nif m==0 and n==3:\n print(100)\n exit()\nflag=True\nfor x,y in a:\n if number[x-1]!=99:\n if number[x-1]!=y:\n flag=False\n number[x-1]=y\nif flag==False:\n print(-1)\n exit()\nif number[0]==0:\n print(-1)\n exit()\nfor i in range(n):\n if number[i]==99:\n number[i]=0\nif number[0]==0:\n number[0]=1\nfor i in number:\n print(i,end="")', 'n,m=map(int,input().split())\na=[[int(i) for i in input().split()] for i in range(m)]\n\nnumber=[99]*n\nflag=True\nfor x,y in a:\n if number[x-1]!=99:\n flag=False\n number[x-1]=y\nif flag==False:\n print(-1)\n exit()\nif number[0]==0:\n print(-1)\n exit()\nfor i in range(n):\n if number[i]==99:\n number[i]=0\nnumber[0]=1\nfor i in number:\n print(i,end="")', 'n,m=map(int,input().split())\na=[[int(i) for i in input().split()] for i in range(m)]\n\nnumber=[99]*n\nflag=True\nfor x,y in a:\n if number[x-1]!=99:\n flag=False\n number[x-1]=y\nif number[0]==99:\n print(-1)\n exit()\n\nfor i in range(n):\n if number[i]==99:\n number[i]=0\nif number[0]==0:\n print(-1)\n exit()\nfor i in number:\n print(i,end="")', 'n,m=map(int,input().split())\na=[[int(i) for i in input().split()] for i in range(m)]\n\nnumber=[99]*n\nflag=True\nfor x,y in a:\n if number[x-1]!=99:\n flag=False\n number[x-1]=y\nif number[0]==0:\n print(-1)\n exit()\nfor i in range(n):\n if number[i]==99:\n number[i]=0\nnumber[0]=1\nfor i in number:\n print(i,end="")', 'n,m=map(int,input().split())\na=[[int(i) for i in input().split()] for i in range(m)]\n\nnumber=[99]*n\nflag=True\nfor x,y in a:\n if number[x-1]!=99:\n if number[x-1]!=y:\n flag=False\n number[x-1]=y\nif flag==False:\n print(-1)\n exit()\nif number[0]==0:\n print(-1)\n exit()\nfor i in range(n):\n if number[i]==99:\n number[i]=0\nif number[0]==0:\n number[0]=1\nfor i in number:\n print(i,end="")', 'n,m=map(int,input().split())\nlis=[[int(i) for i in input().split()] for i in range(m)]\n\nfor i in range(1000):\n i=str(i)\n if len(i)!=n:\n continue\n for x,y in lis:\n if i[x-1]!=str(y):\n break\n else:\n print(i)\n exit()\nprint(-1)'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s029415431', 's089551836', 's359291944', 's585450414', 's786038700', 's202130569'] | [3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 17.0, 18.0, 18.0, 17.0, 18.0] | [558, 377, 368, 336, 429, 274] |
p02761 | u578501242 | 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\nimport sys\nlist = [int(i) for i in input().split()]\na=list[0]\nb=list[1]\n\ntablec = np.array([[int(i) for i in input().split()] for b in range(b)])\n\nx=0\ny=0\nz=0\nt=-1\nk=0\np=0\nfor i in range(1000):\n\tif t!=-1:\n\t\texit\n\telse:\n\t\tt=0\n\t\tx= i // 100\n\t\ty= (i//10) % 10\n\t\tz=i % 10\n\t\tlistb=[x,y,z]\n\t\tfor n in range(b):\n\t\t\tk= tablec[n,1]\n\t\t\tp= listb[n]\n\t\t\tif k != p:\n\t\t\t\tt=-1\n\t\t\tif t==0:\n\t\t\t\tif not(x==0 and a==3):\n\t\t\t\t\tif not(y==0 and a==2):\n\t\t\t\t\t\tif not(z==0 and a==1):\n\t\t\t\t\t\t\tt=i\nprint (t)', 'import sys\nn, m = [int(i) for i in input().split()]\ntable = [[int(i) for i in input().split()] for m in range(m)]\n\nk=0\nt=0\nx=0\na=[0]*n\n\nfor i in table:\n\tk=i[0]\n\tt=i[1]\n\tif k>n:\n\t\tprint(-1)\n\t\tsys.exit()\n\tb=a[k-1]\n\tif k==1 and t==0 and n!=1:\n\t\tx=-1\n\telif k>n:\n\t\tx=-1\n\tif b!=t and b!=0:\n\t\tx=-1\n\telse:\n\t\ta[k-1]=t\nif len(a)==3 and x==0:\n\tif a[0]==0:\n\t\ta[0]=1\n\tx=a[0]\n\ty=a[1]\n\tz=a[2]\n\tprint(x*100+y*10+z)\nif len(a)==2 and x==0:\n\tif a[0]==0:\n\t\ta[0]=1\n\tx=a[0]\n\ty=a[1]\n\tprint(x*10+y)\nif len(a)==1 and x==0:\n\tx=a[0]\n\tprint(x)\nif x==-1:\n\tprint(-1)'] | ['Wrong Answer', 'Accepted'] | ['s320921449', 's375293279'] | [12452.0, 3064.0] | [154.0, 18.0] | [496, 536] |
p02761 | u580073714 | 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 itertools\n\nN, M = map(int, input().split())\na = [[0] * 10] * N\n\nfor i in range(N):\n if i == 0:\n a[i] = [1, 2, 3, 4, 5, 6, 7, 8, 9]\n else:\n a[i] = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]\n\nflag = 1\n\nfor i in range(M):\n s, c = map(int, input().split())\n if (N > 1 and s == 1 and c == 0) or a[s-1] != [c]:\n flag = 0\n a[s-1] = [c]\n\nif flag == 0:\n print(-1)\nelse:\n list_a = list(itertools.product(*a))\n ans = ""\n for i in range(N):\n ans += str(list_a[0][i])\n print(int(ans))', 'import itertools\n\nN, M = map(int, input().split())\na = [[0] * 10] * N\n\nfor i in range(N):\n if i == 0:\n a[i] = [1, 2, 3, 4, 5, 6, 7, 8, 9]\n else:\n a[i] = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]\n\nflag = 1\n\nfor i in range(M):\n s, c = map(int, input().split())\n if (N > 1 and s == 1 and c == 0) or a[s-1] != [c]:\n flag = 0\n a[s-1] = [c]\n\nif N == 1 and M == 0:\n print(0)\nelif flag == 0:\n print(-1)\nelse:\n list_a = list(itertools.product(*a))\n ans = ""\n for i in range(N):\n ans += str(list_a[0][i])\n print(int(ans))', 'import itertools\n\nN, M = map(int, input().split())\na = [[0] * 10] * N\n\nfor i in range(N):\n if i == 0:\n a[i] = [1, 2, 3, 4, 5, 6, 7, 8, 9]\n else:\n a[i] = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]\n\nflag = 1\n\nfor i in range(M):\n s, c = map(int, input().split())\n if N > 1 and s == 1 and c == 0 or a[s-1] != [c]:\n flag = 0\n a[s-1] = [c]\n\nif flag == 0:\n print(-1)\nelif N == 1 and M == 0:\n print(0)\nelse:\n list_a = list(itertools.product(*a))\n ans = ""\n for i in range(N):\n ans += str(list_a[0][i])\n print(int(ans))', 'import itertools\n \nN, M = map(int, input().split())\na = [[0] * 10] * N\n \nfor i in range(N):\n if i == 0:\n a[i] = [1, 2, 3, 4, 5, 6, 7, 8, 9]\n else:\n a[i] = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]\n \nflag = 1\n \nfor i in range(M):\n s, c = map(int, input().split())\n if (N > 1 and s == 1 and c == 0) or (len(a[s-1]) == 1 and a[s-1] != [c]):\n flag = 0\n a[s-1] = [c]\n \nif N == 1 and M == 0:\n print(0)\nelif flag == 0:\n print(-1)\nelse:\n list_a = list(itertools.product(*a))\n ans = ""\n for i in range(N):\n ans += str(list_a[0][i])\n print(int(ans))'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s369411841', 's765097752', 's794174317', 's620636660'] | [3064.0, 3192.0, 3064.0, 3064.0] | [18.0, 18.0, 18.0, 18.0] | [488, 523, 521, 551] |
p02761 | u580697892 | 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())\nd = {}\nS = ["0" for _ in range(N)]\nfor _ in range(M):\n s, c = map(str, input().split())\n if s not in d.keys():\n d[s] = c\n else:\n if d[s] != c:\n print(-1)\n exit()\nif N == 1:\n ans = "".join(S)\n print(ans)\n exit()\nelif S[0] == "0" and "1" not in d.keys():\n S[0] = "1"\nelse:\n print(-1)\n exit()\nans = "".join(S)\nprint(ans)', '# coding: utf-8\nN, M = map(int, input().split())\nd = {}\nS = ["0" for _ in range(N)]\nfor _ in range(M):\n s, c = map(str, input().split())\n if s not in d.keys():\n d[s] = c\n else:\n if d[s] != c:\n print(-1)\n exit()\nif N == 1:\n ans = "".join(S)\n print(ans)\n exit()\nelif S[0] == "0" and "1" not in d.keys():\n S[0] = "1"\nans = "".join(S)\nprint(ans)', '# coding: utf-8\nN, M = map(int, input().split())\nd = {}\nS = ["0" for _ in range(N)]\nfor _ in range(M):\n s, c = map(str, input().split())\n if s not in d.keys():\n d[s] = c\n S[int(s)-1] = c\n else:\n if d[s] != c:\n print(-1)\n exit()\nif N == 1:\n ans = "".join(S)\n print(ans)\n exit()\nelif S[0] == "0" and "1" not in d.keys():\n S[0] = "1"\nans = "".join(S)\nif ans[0] == "0":\n print(-1)\nelse:\n print(ans)'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s635200424', 's671735968', 's110179906'] | [3064.0, 3064.0, 3064.0] | [17.0, 17.0, 17.0] | [429, 398, 464] |
p02761 | u581603131 | 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)]\na = 0\nfor i in range(M):\n if SC[i][0] != N or (SC[i][0] ==3 and SC[i][1]==0):\n a += 1\n\nhandred = 0\nten = 0\none = 0\n\nfor i in range(M):\n if S[i][0] == 3:\n handred = 9\n elif S[i][0] == 2:\n ten = 9\n elif S[i][0] == 1:\n one = 9\n\nif a == M:\n print('-1')\nelse:\n for i in range(M):\n if S[i][0] == 3:\n if handred >= S[i][1]:\n handred = S[i][1]\n elif S[i][0] == 2:\n if ten >= S[i][1]:\n ten = S[i][1]\n elif S[i][0] == 1:\n if one >= S[i][1]:\n one = S[i][1]\n\nif a != M and N == 3:\n print(str(handred) + str(ten) + str(one))\nelif a != M and N == 2:\n print(str(ten) + str(one))\nelif a != M and N==1:\n print(str(one))", '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] == c for s,c 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)]\na = 0\nfor i in range(M):\n if SC[i][0] != 3-N or (SC[i][0] == 1 and SC[i][1]==0):\n a += 1\n\nhandred = 0\nten = 0\none = 0\n\nfor i in range(M):\n if SC[i][0] == 1:\n handred = 9\n elif SC[i][0] == 2:\n ten = 9\n elif SC[i][0] == 3:\n one = 9\n\nif a == M:\n print('-1')\nelse:\n for i in range(M):\n if SC[i][0] == 1:\n if handred >= SC[i][1]:\n handred = SC[i][1]\n elif SC[i][0] == 2:\n if ten >= SC[i][1]:\n ten = SC[i][1]\n elif SC[i][0] == 3:\n if one >= SC[i][1]:\n one = SC[i][1]\n\nif a != M and N == 3:\n print(str(handred) + str(ten) + str(one))\nelif a != M and N == 2:\n print(str(ten) + str(one))\nelif a != M and N==1:\n print(str(one))", "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] == c for s,c in sc)\n print('Yes')\nelse:\n print('No')", "N, M = map(int, input().split())\nSC = [list(map(int, input().split())) for i in range(M)]\na = 0\nfor i in range(M):\n if SC[i][0] != N or SC[i][0] == 0:\n a += 1\n\nhandred = 0\nten = 0\none = 0\n\nfor i in range(M):\n if S[i][0] == 3:\n handred = 9\n elif S[i][0] == 2\n ten = 9\n elif S[i][0] == 1:\n one = 9\n\nif a == M:\n print('-1')\nelse:\n for i in range(M):\n if S[i][0] == 3:\n if handred >= S[i][1]:\n handred = S[i][1]\n elif S[i][0] == 2:\n if ten >= S[i][1]:\n ten = S[i][1]\n elif S[i][0] == 1:\n if one >= S[i][1]:\n one = S[i][1]\n\nif a != M and N == 3:\n print(str(handred) + str(ten) + str(one))\nelif a != M and N == 2:\n print(str(ten) + str(one))\nelif a != M and N==1:\n print(str(one))", '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] == c for s,c in sc)\n print(i)\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', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s054367322', 's241702238', 's393174427', 's552053871', 's610276646', 's921799784', 's505166855'] | [3064.0, 3064.0, 3064.0, 2940.0, 2940.0, 2940.0, 3060.0] | [17.0, 18.0, 18.0, 17.0, 17.0, 17.0, 18.0] | [846, 229, 861, 216, 828, 210, 234] |
p02761 | u585348179 | 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 i in range(m):\n sc.append(list(map(int, input().split())))\nfor i in range(10**N):\n anc = str(i)\n if len(ans) == N and all(ans[s-1] == str(c) for s,c in sc):\n print(ans)\n quit()\nprint(-1)', 'N,M=map(int, input().split())\n\nsc = []\nfor i in range(m):\n sc.append(list(map(int, input().split())))\nfor i in range(10**N):\n ans = str(i)\n if len(ans) == N and all(ans[s-1] == str(c) for s,c in sc):\n print(ans)\n quit()\nprint(-1)', 'N,M=map(int, input().split())\n\nsc = []\nfor i in range(M):\n sc.append(list(map(int, input().split())))\nfor i in range(10**N):\n ans = str(i)\n if len(ans) == N and all(ans[s-1] == str(c) for s,c in sc):\n print(ans)\n quit()\nprint(-1)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s055592167', 's470560660', 's718821294'] | [3064.0, 3316.0, 3064.0] | [17.0, 20.0, 18.0] | [252, 252, 252] |
p02761 | u585963734 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["if M==0:\n if N>=2:\n print(-1)\n exit(0)\n elif N==1:\n print(0)\n exit(0)\n \nif N!=1 and A[0][0]==1 and A[0][1]==0:\n print(-1)\n exit(0)\ni=1\nj=len(A)\nwhile i<j:\n if A[i][0]==A[i-1][0] and A[i][1]==A[i-1][1]:\n A.pop(i)\n j-=1\n continue\n elif A[i][0]==A[i-1][0] and A[i][1]!=A[i-1][1]:\n print(-1)\n exit(0)\n i+=1\nans=[None]*N\n\nfor i,j in A:\n ans[i-1]=j\n\nfor i in range(len(ans)):\n if ans[i]==None:\n if i==0:\n ans[i]=1\n else:\n ans[i]=0\n\nprint(''.join(map(str,ans)))", "N,M=map(int, input().split())\nA=[list(map(int, input().split())) for _ in range(M)]\nA = sorted(A, reverse=False, key=lambda x: x[0])\n\nans=[[] for i in range(N)]\nif A[0][0]==1 and A[0][1]==0:\n print(-1)\n exit(0)\n\nelif A[0][0]==1:\n ans[0]=A[0][1]\nelif A[0][0]!=1:\n ans[0]=1\n pt=1\n while pt+1<A[0][0]:\n ans[pt]=0\n pt+=1\n ans[pt]=A[0][1]\n pt+=1\n\nfor i in range(1,M):\n while pt+1<A[i][0]:\n ans[pt]=0\n pt+=1\n if A[i-1][0]==A[i][0] and A[i-1][1]!=A[i][1]:\n print(-1)\n exit(0)\n else: ans[pt]=A[i][1]\n \nprint(''.join(map(str,ans))) ", "N,M=map(int, input().split())\nA=[list(map(int, input().split())) for _ in range(M)]\nA = sorted(A, reverse=False, key=lambda x: x[0])\n\nif M==0:\n if N==3:\n print(100)\n exit(0)\n elif N==2:\n print(10)\n exit(0) \n elif N==1:\n print(0)\n exit(0)\n\nif N!=1 and A[0][0]==1 and A[0][1]==0:\n print(-1)\n exit(0)\ni=1\nj=len(A)\nwhile i<j:\n if A[i][0]==A[i-1][0] and A[i][1]==A[i-1][1]:\n A.pop(i)\n j-=1\n continue\n elif A[i][0]==A[i-1][0] and A[i][1]!=A[i-1][1]:\n print(-1)\n exit(0)\n i+=1\nans=[None]*N\n\nfor i,j in A:\n ans[i-1]=j\n\nfor i in range(len(ans)):\n if ans[i]==None:\n if i==0:\n ans[i]=1\n else:\n ans[i]=0\n\nprint(''.join(map(str,ans)))"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s322254492', 's996595716', 's132050160'] | [9136.0, 9096.0, 9232.0] | [25.0, 30.0, 31.0] | [587, 606, 772] |
p02761 | u586639900 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['import sys\n\nN, M = map(int, input().split())\n\nS = []\nC = []\nfor m in range(M):\n s, c = map(int, input().split())\n S.append(s)\n C.append(c)\n\nfor i in range(10**N):\n tes = str(i)\n flag = True\n if len(tes) < N:\n flag = False\n for s, c in zip(S, C):\n if tes[s-1] != str(c):\n flag = False\n if flag:\n print(tes)\n sys.exit()\n\n\nprint(-1)\n', 'import sys\n\nN, M = map(int, input().split())\n\nS = []\nC = []\nfor m in range(M):\n s, c = map(int, input().split())\n S.append(s)\n C.append(c)\n\nfor i in range(10**(N-1)-1, 10**N):\n tes = str(i)\n flag = True\n for s, c in zip(S, C):\n if tes[s-1] != str(c):\n flag = False\n if flag:\n print(tes)\n sys.exit()\n\nprint(-1)', 'import sys\n\nN, M = map(int, input().split())\n\nS = []\nC = []\nfor m in range(M):\n s, c = map(int, input().split())\n S.append(s)\n C.append(c)\n\nfor i in range(10**N):\n tes = str(i)\n\n if len(tes) != N:\n continue\n \n flag = True\n for s, c in zip(S, C):\n if tes[s-1] != str(c):\n flag = False\n if flag:\n print(tes)\n sys.exit()\n\n\nprint(-1)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s535020702', 's592770790', 's311524096'] | [9208.0, 9208.0, 9144.0] | [26.0, 28.0, 27.0] | [355, 330, 355] |
p02761 | u586662847 | 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 resolve():\n N, M = map(int, input().split())\n\n req = [list(map(int, input().split())) for i in range(M)]\n\n min_range = 10 ** (N - 1)\n max_range = 10 ** (N)\n\n for i in range(min_range, max_range):\n st = str(i)\n ok = True\n for s, c in req:\n if int(st[s - 1]) != int(c):\n ok = False\n if ok:\n print(st)\n return\n\n print(-1)', "def resolve():\n N, M = map(int, input().split())\n\n checked = [False] * N\n ans = ['0'] * N\n\n for i in range(M):\n ss, cc = input().split()\n index = int(ss) - 1\n\n if checked[index] and ans[index] != cc:\n print(-1)\n return\n\n ans[index] = cc\n checked[index] = True\n\n int_ans = int(''.join(ans))\n\n diff = N - len(list(str(int_ans)))\n\n if diff == 0:\n print(ans)\n return\n\n if diff > 0:\n ans = int(''.join(ans))\n if diff == 2:\n print('10' + str(ans))\n return\n if diff == 1:\n print('1' + str(ans))\n return\n\n print(-1)\n\nresolve()", 'n, m = map(int, input().split())\nreq = [list(map(int, input().split())) for i in range(m)]\nfor i in range(10000):\n\tst = str(i)\n\tif len(st) != n:\n\t\tcontinue\n\tok = True\n\tfor s, c in req:\n\t\tif int(st[s-1]) != int(c):\n\t\t\tok = False\n\tif ok:\n\t\tprint(st)\n\t\texit(0)\n\nprint(-1)\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s102940930', 's172961910', 's394402988'] | [3064.0, 3064.0, 3060.0] | [17.0, 17.0, 21.0] | [416, 681, 269] |
p02761 | u591143370 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["N,M = map(int, input().split())\ns = [0] * M\nc = [0] * M\n\nfor i in range(M):\n s[i], c[i]= map(int, input().split())\n \nn=[-1]*N\nw=True\nfor i in range(M):\n if n[s[i]-1]==-1:\n n[s[i]-1]=c[i]\n if n[s[i]-1]!=-1 and n[s[i]-1]==c[i]:\n n[s[i]-1]=c[i]\n if n[s[i]-1]!=-1 and n[s[i]-1]!=c[i]:\n w=False\nif n[0]==0 and N!=1:\n w=False\nif n[0]==-1 and N!=1:\n n[0]=1\nif n[0]==-1 and N==1:\n n[0]=0\nif N=3:\n if n[1]==-1:\n n[1]=0\n if n[2]==-1:\n n[2]=0\nif N=2:\n if n[1]==-1:\n n[1]=0\nnum=''\nfor i in n:\n num+=str(i)\nif w:\n print(num)\nelse:\n print('-1')", "N,M = map(int, input().split())\ns = [0] * M\nc = [0] * M\n\nfor i in range(M):\n s[i], c[i]= map(int, input().split())\n \nn=[-1]*N\nw=True\nfor i in range(M):\n if n[s[i]-1]==-1:\n n[s[i]-1]=c[i]\n if n[s[i]-1]!=-1 and n[s[i]-1]==c[i]:\n n[s[i]-1]=c[i]\n if n[s[i]-1]!=-1 and n[s[i]-1]!=c[i]:\n w=False\nif n[0]==0 and N!=1:\n w=False\nif n[0]==-1 and N!=1:\n n[0]=1\nif n[0]==-1 and N==1:\n n[0]=0\nif N==3:\n if n[1]==-1:\n n[1]=0\n if n[2]==-1:\n n[2]=0\nif N==2:\n if n[1]==-1:\n n[1]=0\nnum=''\nfor i in n:\n num+=str(i)\nif w:\n print(num)\nelse:\n print('-1')"] | ['Runtime Error', 'Accepted'] | ['s609105196', 's737876422'] | [3064.0, 3064.0] | [17.0, 17.0] | [616, 618] |
p02761 | u593364182 | 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\nt=[-1]*N\nfor i in range(m):\n s,c=map(int,input().split())\n s-=1\n if t[s] != -1 and t[s] != c:\n print(-1)\n exit()\n t[s]=c\n\nif n != 1:\n if t[0] == 0:\n print(-1)\n exit()\n if t[0] == -1:\n t[0]=1\n for i in range(1,n):\n if t[i] == -1:\n t[i] = 0\nelse:\n if t[0] == -1:\n t[0] = 0\nprint(''.join(map(str,t)))", "n,m=map(int,input().split())\n\nt=[-1]*n\nfor i in range(m):\n s,c=map(int,input().split())\n s-=1\n if t[s] != -1 and t[s] != c:\n print(-1)\n exit()\n t[s]=c\n\nif n != 1:\n if t[0] == 0:\n print(-1)\n exit()\n if t[0] == -1:\n t[0]=1\n for i in range(1,n):\n if t[i] == -1:\n t[i] = 0\nelse:\n if t[0] == -1:\n t[0] = 0\nprint(''.join(map(str,t)))\n"] | ['Runtime Error', 'Accepted'] | ['s372167755', 's051697747'] | [3064.0, 3064.0] | [18.0, 19.0] | [361, 362] |
p02761 | u595064211 | 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\nN, M = map(int, input().split())\n\nA = []\nbit = []\nfor i in range(N):\n A.append(9)\n bit.append(0)\n# print(A)\n\nans = "0"\nif N==1 and M==0:\n ans = "-1"\n\nfor j in range(M):\n s, c = map(int, input().split())\n if ans == "-1":\n continue\n if bit[s-1]==1 and A[s-1] != c:\n ans = "-1"\n continue\n elif bit[s-1]==1 and A[s-1] == c:\n continue\n ans = "0"\n A[s-1] = min(c, A[s-1])\n bit[s-1] = 1\n\n# print(A)\n# print(ans)\n\nfor k in range(N):\n if bit[k]==0 and k != N-1:\n A[k]=1\n elif bit[k]==0:\n A[k]=0\n# print(A)\n\nif ans != "-1" and (( A[0] != 0 and N>1) or (N==1 )) :\n print(int("".join(map(str,A))))\nelse:\n print("-1")', 'N, M = map(int, input().split())\n\nA = []\nbit = []\nfor i in range(N):\n A.append(9)\n bit.append(0)\n# print(A)\n\nans = "0"\n\nfor j in range(M):\n s, c = map(int, input().split())\n if ans == "-1":\n continue\n if bit[s-1]==1 and A[s-1] != c:\n ans = "-1"\n continue\n elif bit[s-1]==1 and A[s-1] == c:\n continue\n ans = "0"\n A[s-1] = min(c, A[s-1])\n bit[s-1] = 1\n\n# print(A)\n# print(ans)\n\nfor k in range(N):\n if bit[k]==0:\n A[k]=0\n \nprint(A)\n\nif ans != "-1" and (( A[0] != 0 and N>1) or (N==1)) :\n print(int("".join(map(str,A))))\nelse:\n print("-1")', 'N, M = map(int, input().split())\n\nA = []\nbit = []\nfor i in range(N):\n A.append(9)\n bit.append(0)\n# print(A)\n\nans = "0"\n\nfor j in range(M):\n s, c = map(int, input().split())\n if ans == "-1":\n continue\n if bit[s-1]==1 and A[s-1] != c:\n ans = "-1"\n continue\n elif bit[s-1]==1 and A[s-1] == c:\n continue\n ans = "0"\n A[s-1] = min(c, A[s-1])\n bit[s-1] = 1\n\n# print(A)\n# print(ans)\n\nfor k in range(N):\n if bit[k]==0:\n A[k]=0\n \nprint(A)\nif ans != "-1" and (( A[0] != 0 and N>0) or (N==1)) :\n print(int("".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 \nans = [-1] * n\n \nfor s, c in sc:\n t = s - 1\n if ans[t] == -1:\n ans[t] = c\n elif ans[t] != c:\n print(-1)\n exit()\n \nif n == 1:\n if ans[0] == -1:\n ans[0] = '0'\n else:\n ans[0] = str(ans[0])\nelif ans[0] == 0:\n print(-1)\n exit()\nelse:\n ans[0] = str(max(1, ans[0]))\nfor i in range(1, n):\n ans[i] = str(max(0, ans[i]))\n \nprint(''.join(ans))"] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s131303908', 's656632457', 's883085516', 's947783361'] | [3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 17.0, 17.0, 18.0] | [821, 617, 616, 486] |
p02761 | u595289165 | 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())\nans = [-1]*n\nfor _ in range(m):\n s, c = map(int, input().split())\n if ans[s-1] == -1 or ans[s-1] == c:\n ans[s-1] = c\n if s == 0 and c == 0:\n print(-1)\n sys.exit()\n else:\n print(-1)\n sys.exit()\n\nif ans[0] == -1:\n x = "1"\nelse:\n x = str(ans[0])\nfor i in range(1, n):\n if ans[i] == -1:\n x += "0"\n else:\n x += str(ans[i])\nprint(x)', 'import sys\nn, m = map(int, input().split())\nans = [-1]*n\nfor _ in range(m):\n s, c = map(int, input().split())\n if ans[s-1] == -1 or ans[s-1] == c:\n ans[s-1] = c\n if s == 1 and c == 0:\n print(-1)\n sys.exit()\n else:\n print(-1)\n sys.exit()\n\nif ans[0] == -1:\n x = "1"\nelse:\n x = str(ans[0])\nfor i in range(1, n):\n if ans[i] == -1:\n x += "0"\n else:\n x += str(ans[i])\nprint(x)', 'import sys\nn, m = map(int, input().split())\ncheck = [list(map(int, input().split())) for i in range(m)]\n\nfor i in range(1000):\n x = str(i)\n if len(x) != n:\n continue\n flg = True\n for s, c in check:\n if x[s-1] == str(c):\n pass\n else:\n flg = False\n if flg:\n print(i)\n sys.exit()\nprint(-1)'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s531832923', 's975014470', 's073353546'] | [3064.0, 3064.0, 3060.0] | [17.0, 17.0, 18.0] | [443, 443, 358] |
p02761 | u596505843 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["import sys\ninput = sys.stdin.readline\n\nN, M = map(int, input().split())\nnum = [1] * N\nseen = {}\nfor i in range(M):\n\ts, c = map(int, input().split())\n\tif s in seen:\n\t\tif seen[s] != c:\n\t\t\tprint(-1)\n\t\t\texit()\n\tif s == 1 and c == 0:\n\t\tif N == 1:\n\t\t\tprint(0)\n\t\t\texit()\n\t\telse:\n\t\t\tprint(-1)\n\t\t\texit()\n\tnum[s-1] = c\n\tseen[s] = c\nprint(int(''.join(map(str, num))))\n\n\n", "import sys\ninput = sys.stdin.readline\n\nN, M = map(int, input().split())\nnum = [0] * N\nseen = {}\nfor i in range(M):\n\ts, c = map(int, input().split())\n\tif s in seen:\n\t\tif seen[s] != c:\n\t\t\tprint(-1)\n\t\t\texit()\n\tif s == 1 and c == 0:\n\t\tif N == 1:\n\t\t\tprint(0)\n\t\t\texit()\n\t\telse:\n\t\t\tprint(-1)\n\t\t\texit()\n\tnum[s-1] = c\n\tseen[s] = c\nif N != 1 and num[0] == 0:\n\tnum[0] = 1\nprint(int(''.join(map(str, num))))\n\n\n"] | ['Wrong Answer', 'Accepted'] | ['s489239778', 's012167184'] | [3064.0, 3064.0] | [17.0, 17.0] | [359, 398] |
p02761 | u597622207 | 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())\nresult = [0] * N\n\nfor i in range(M):\n s,c = map(int, input().split())\n if s == 1 and c == 0 and N != 1:\n print(-1)\n exit()\n if result[s-1] != 0:\n print(-1)\n exit()\n else:\n result[s-1] = c\n\nif len(result) >= 2 and result[0] == 0:\n result[0] = 1\n\nprint("".join(map(str, result)))', 'N, M = map(int, input().split())\nresult = [0] * N\n\nfor i in range(M):\n s,c = map(int, input().split())\n if s == 1 and c == 0 and N != 1:\n print(-1)\n exit()\n if result[s-1] != 0 and result[s-1] != c:\n print(-1)\n exit()\n else:\n result[s-1] = c\n\nif len(result) >= 2 and result[0] == 0:\n result[0] = 1\n\nprint("".join(map(str, result)))'] | ['Wrong Answer', 'Accepted'] | ['s213044129', 's935907129'] | [3064.0, 3064.0] | [18.0, 18.0] | [360, 381] |
p02761 | u599114793 | 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) | ['ans = [-1] * n\nfor i in range(m):\n if ans[sc[i][0]-1] == -1 or ans[sc[i][0]-1] == sc[i][1]:\n ans[sc[i][0]-1] = sc[i][1]\n else:\n print(-1)\n exit()\nif n == 1 and ans[0] != -1:\n print(ans[0])\n exit()\nif ans[0] == 0:\n print(-1)\n exit()\nif n == 2 and ans[0] != -1 and ans[1] != -1:\n map_ans = map(str, ans)\n print("".join(map_ans))\nelif n == 2 and ans == [-1, -1]:\n print(-1)\nelif n == 2:\n ans[0] = 1\n map_ans = map(str, ans)\n print("".join(map_ans))\nelif n == 3 and ans == [-1, -1, -1]:\n print(-1)\nelif n == 3:\n for i in range(3):\n if i == 0 and ans[i] == -1:\n ans[i] = 1\n if ans[i] == -1:\n ans[i] = 0\n map_ans = map(str, ans)\n print("".join(map_ans))\n\n', 'n,m = map(int,input().split())\nans = 0\nsc = []\nfor i in range(m):\n s, c = map(int,input().split())\n sc.append([s,c])\nfor i in range(1000):\n flag = True\n if len(str(i)) != n:\n continue\n else:\n for j in range(len(sc)):\n if str(i)[sc[j][0]-1] != str(sc[j][1]):\n flag = False\n if flag:\n print(i)\n exit()\nprint(-1)\n'] | ['Runtime Error', 'Accepted'] | ['s463338362', 's137887977'] | [3064.0, 3064.0] | [17.0, 19.0] | [754, 382] |
p02761 | u602773379 | 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())\nlines=[]\nlines_s=[]\nans=0\nfor line in range(M):\n\ts,c=map(int,input().split())\n\tif N>=s and s not in lines_s:\n\t\tans+=c*(10**(N-s))\n\t\tlines.append([s,c])\n\t\tlines_s.append(s)\n\telif [s,c] in lines:\n\t\tprint("repeat")\n\t\tcontinue\n\n\telse:\n\t\tans=-1\n\t\tbreak\nprint(lines_s)\nfor i in range(N-1):\n\tif i+1 not in lines_s:\n\t\tans+=10**(N-(i+1))\n\nif len(str(ans))==N:\n\tprint(ans)\nelse:\n\tprint(False)\n\n', 'N,M=map(int,input().split())\nlines=[]\nlines_s=[]\nans=0\nfor line in range(M):\n\ts,c=map(int,input().split())\n\tif N>=s and s not in lines_s:\n\t\tans+=c*(10**(N-s))\n\t\tlines.append([s,c])\n\t\tlines_s.append(s)\n\telif [s,c] in lines:\n\t\tcontinue\n\n\telse:\n\t\tbreak\n\nif len(ans)==N:\n\tprint(ans)\nelse:\n\tprint(-1)\n\n', 'N,M=map(int,input().split())\nlines=[]\nlines_s=[]\nans=0\nfor line in range(M):\n\ts,c=map(int,input().split())\n\tif N>=s and s not in lines_s:\n\t\tans+=c*(10**(N-s))\n\t\tlines.append([s,c])\n\t\tlines_s.append(s)\n\telif [s,c] in lines:\n\t\tcontinue\n\n\telse:\n\t\tans=-1\n\t\tbreak\n\t\t\nif ans!=-1:\n\tfor i in range(N-1):\n\t\tif i+1 not in lines_s:\n\t\t\tans+=10**(N-(i+1))\n\nif len(str(ans))==N:\n\tprint(ans)\nelse:\n\tprint(-1)\n\n', '\ndef input2():\n\treturn map(int,input().split())\n\n\ndef input_array():\n\treturn list(map(int,input().split()))\n\n\n\n\n\nn,m=input2()\nsc_list=[]\nfor _ in range(m):\n\tsc_list.append(input_array())\n\nresult=0\nflag=True\nresult_dict={}\nfor sc in sc_list:\n\tsc0=sc[0]\n\tsc1=sc[1]\n\tif n!=1 and sc0==1 and sc1==0:\n\t\t\n\t\tflag=False\n\t\tbreak\n\telif sc0 in result_dict:\n\t\tif result_dict[sc0]==sc1:\n\t\t\t\n\t\t\tcontinue\n\t\telse:\n\t\t\t\n\t\t\tflag=False\n\t\t\tbreak\n\telse:\n\t\tresult+=10**(n-sc0)*sc1\n\t\tresult_dict[sc0]=sc1\n\nif len(str(result))<n:\n\tresult+=10**(n-1)\n\nif flag:\n\tprint(result)\nelse:\n\tprint(-1)'] | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s032911435', 's304730624', 's848938665', 's019836763'] | [3064.0, 3064.0, 3064.0, 3064.0] | [18.0, 17.0, 17.0, 18.0] | [413, 297, 395, 709] |
p02761 | u603958124 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["n, m = map(int, input().split())\ns = [0]*m\nc = [0]*m\nnum = ['']*n\nfor i in range(m):\n s[i], c[i] = map(int, input().split())\n if s[i]==1 and c[i]==0:\n print(-1)\n exit()\n elif num[s[i]-1] == '':\n num[s[i]-1] = c[i]\n elif num[s[i]-1] != c[i]:\n print(-1)\n exit()\nfor i in range(m):\n if num[i]=='':\n num[i] = 1\nprint(''.join(map(str,num)))", 'n, m = map(int, input().split())\ns = [0]*m\nc = [0]*m\nnum = [\'\']*n\nfor i in range(m):\n s[i], c[i] = map(int, input().split())\n if s[i]==1 and c[i]==0:\n print(-1)\n exit()\n elif num[s[i]-1] == \'\':\n num[s[i]-1] = c[i]\n elif num[s[i]-1] != c[i]:\n print(-1)\n exit()\nfor i in range(m):\n if num[i]==\'\':\n num[i] = 1\nprint(\'\'.join(map(str,num)), end="")', "from math import ceil,floor,comb,factorial,gcd,pow,sqrt,log2,cos,sin,tan,pi,inf\nfrom itertools import accumulate,permutations,combinations,product,combinations_with_replacement\nfrom collections import deque,defaultdict,Counter\nfrom bisect import bisect_left,bisect_right\nfrom operator import itemgetter\nfrom heapq import heappop,heappush\nfrom copy import deepcopy\nfrom time import time\nimport string\nimport sys\nsys.setrecursionlimit(10 ** 7)\ndef input() : return sys.stdin.readline().strip()\ndef INT() : return int(input())\ndef MAP() : return map(int,input().split())\ndef LIST() : return list(MAP())\n\nn, m = MAP()\nans = [-1]*n\n\nfor i in range(m):\n s, c = MAP()\n s -= 1\n if ans[s] == -1 or ans[s] == c:\n ans[s] = c\n else:\n print(-1)\n exit()\n\nif ans[0] == 0:\n if n == 1:\n print(0)\n else:\n print(-1)\n exit()\nelse:\n for i in range(n):\n if ans[i] == -1:\n if n != 1 and i == 0:\n ans[i] = 1\n else:\n ans[i] = 0\n print(*ans, sep='')"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s223191861', 's975593618', 's617971895'] | [9232.0, 9128.0, 9948.0] | [29.0, 25.0, 38.0] | [392, 400, 1049] |
p02761 | u606090886 | 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 for i in range(n)]\n\nfor i in range(m):\n r,s = map(int,input().split())\n if r-1 == 0 and s = 0:\n ans = [-1]\n break\n if ans[r-1] != 0 and ans[r-1] != s:\n ans = [-1]\n break\n ans[r-1] = s\nif ans[0] == 0:\n ans[0] = 1\nsum = ""\nfor i in range(len(ans)):\n sum += str(ans[i])\nprint(sum)', 'n, m = map(int,input().split())\n\nans = [0 for i in range(n)]\n\nfor i in range(m):\n r,s = map(int,input().split())\n if n != 1 and r-1 == 0 and s == 0:\n ans = [-1]\n break\n if ans[r-1] != 0 and ans[r-1] != s:\n ans = [-1]\n break\n ans[r-1] = s\nif n != 1 and ans[0] == 0:\n ans[0] = 1\nsum = ""\nfor i in range(len(ans)):\n sum += str(ans[i])\nprint(sum)'] | ['Runtime Error', 'Accepted'] | ['s420688727', 's290815970'] | [2940.0, 3064.0] | [17.0, 17.0] | [365, 388] |
p02761 | u606146341 | 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 s, c = map(int, input().split())\n lst.append([s-1,c])\n \nans = []\nfor _ in range(10**(n)):\n i = 1\n nums = list(str(_))\n while len(nums) < n:\n nums.insert(0,'0')\n for s in lst:\n if nums[s[0]] != str(s[1]): \n i = 0\n break\n if n > 1 and nums[3-(n+1)] == '0':\n pass\n elif i == 1:\n ans.append(_)\nprint(ans)\nif ans:\n print(min(ans))\nelse:\n print(-1)", 'n, m = map(int, input().split())\nlst = []\nfor _ in range(m):\n s, c = map(int, input().split())\n lst.append([s-1,c])\n \nans = []\nfor _ in range(10**(n)):\n i = 1\n nums = list(str(_))\n while len(nums) < n:\n nums.insert(0,[])\n for s in lst:\n if nums[s[0]] != str(s[1]): \n i = 0\n break\n if i == 1:\n ans.append(_)\nprint(ans)\nif ans:\n print(min(ans))\nelse:\n print(-1)', 'n, m = map(int, input().split())\nlst = [[] for _ in range(n)]\nfor _ in range(m):\n s, c = map(int, input().split())\n lst[s-1].append(c)\n \ndef has_duplicates(seq):\n return len(seq) != len(set(seq))\n\nprint(lst)\n\ni = 0\nans= 0\nfor _ in lst:\n if has_duplicates(_) is False and len(set(_)) >1:\n i = -1\nif n > 1 and len(lst[0]) == 1 and 0 in lst[0]:\n i = -1\nif i != -1:\n for _ in range(n):\n if _ == 0:\n lst[_].append(1)\n else:\n lst[_].append(0)\n ans += max(lst[_]) * 10 ** (n -(_+1))\n print(ans)\nelse:\n print(i)', 'n, m = map(int, input().split())\nlst = [[] for _ in range(n)]\nfor _ in range(m):\n s, c = map(int, input().split())\n lst[s-1].append(c)\n \ndef has_duplicates(seq):\n return len(seq) != len(set(seq))\n\nprint(lst)\n\ni = 0\nans= 0\nfor _ in lst:\n if has_duplicates(_) is False and len(set(_)) >1:\n i = -1\nif n > 1 and len(set(lst[0])) == 1 and 0 in lst[0]:\n i = -1\nif i != -1:\n for _ in range(n):\n if _ == 0:\n lst[_].append(1)\n else:\n lst[_].append(0)\n ans += max(lst[_]) * 10 ** (n -(_+1))\n print(ans)\nelse:\n print(i)', 'n, m = map(int, input().split())\nlst = []\nfor _ in range(m):\n s, c = map(int, input().split())\n lst.append([s-1,c])\n\nans = []\nfor _ in range(10**(n)-1):\n i = 1\n nums = list(str(_))\n while len(nums) < n:\n nums.insert(0,[])\n for s in lst:\n if nums[s[0]] != s[1]:\n i = 0\n break\n if i:\n ans.append(_)\nif ans:\n print(min(ans))\nelse:\n print(-1)', 'n, m = map(int, input().split())\nlst = []\nfor _ in range(m):\n s, c = map(int, input().split())\n lst.append([s-1,c])\n \nans = []\nfor _ in range(10**(n)):\n i = 1\n nums = list(str(_))\n while len(nums) < n:\n nums.insert(0,[])\n for s in lst:\n if nums[s[0]] != str(s[1]): \n i = 0\n break\n if i == 1 and not [] in nums:\n ans.append(_)\n\nif ans:\n print(min(ans))\nelse:\n print(-1)'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s067681184', 's617177340', 's681376552', 's691217780', 's798138913', 's866582945'] | [3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0] | [19.0, 18.0, 18.0, 17.0, 18.0, 18.0] | [488, 433, 584, 589, 416, 442] |
p02761 | u606523772 | 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 = []\ndic_A = {}\nflag = True\nfor i in range(M):\n A = list(map(int, input().split()))\n if A[0] in dic_A:\n if dic_A[A[0]]!=A[1]:\n flag = False\n else:\n dic_A[A[0]] = A[1]\n A_list.append(A)\nfor i in range(M):\n if A_list[i][0]==1 and A_list[i][1]==0:\n flag = False\nif flag == False:\n print(-1)\nelse:\n ans = ["0" for i in range(3)]\n for i, v in sorted(dic_A.items()):\n v = str(v)\n ans[i-1] = v\n if "".join(ans)[0] != "0":\n N, M = map(int, input().split())\nA_list = []\ndic_A = {}\nflag = True\nfor i in range(M):\n A = list(map(int, input().split()))\n if A[0] in dic_A:\n if dic_A[A[0]]!=A[1]:\n flag = False\n else:\n dic_A[A[0]] = A[1]\n A_list.append(A)\nfor i in range(M):\n if A_list[i][0]==1 and A_list[i][1]==0:\n flag = False\nif flag == False:\n print(-1)\nelse:\n ans = ["0" for i in range(3)]\n for i, v in sorted(dic_A.items()):\n v = str(v)\n ans[i-1] = v\n if "".join(ans)[0] != "0":\n print(int("".join(ans)))\n else:\n print(-1)', 'N, M = map(int, input().split())\nsc_list = []\nfor i in range(M):\n sc = list(map(int, input().split()))\n sc_list.append(sc)\nans = -1\nfor i in range(10**N):\n tmp = str(i)\n if len(tmp)==N:\n flag = True\n for j in sc_list:\n if int(tmp[j[0]-1])!=j[1]:\n flag = False\n if flag:\n ans = int(tmp)\n break\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s612930161', 's499428863'] | [3188.0, 3064.0] | [18.0, 19.0] | [1124, 384] |
p02761 | u607074939 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['N,M = map(int, input().split())\nS = []\nC = []\nfor i in range(M):\n s,c = map(int, input().split())\n S.append(s)\n C.append(c)\nfor n in range(1000):\n if len(str(n))==N:\n count = 0 \n if n==0:\n l=[0]\n else:\n l = []\n while n > 0:\n l.append(n%10)\n n //= 10\n l.reverse()\n \n for i in range(M): \n if(l[S[i]-1] == C[i]):\n count += 1\n \n if count == M:\n break\nelse:\n n=-1\n \nprint(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)\nfor n in range(1000):\n m=n\n if len(str(n))==N:\n count = 0 \n if n==0:\n l=[0]\n else:\n l = []\n while m > 0:\n l.append(m%10)\n m //= 10\n l.reverse()\n \n for i in range(M): \n if(l[S[i]-1] == C[i]):\n count += 1\n \n if count == M:\n break\nelse:\n n=-1\n \nprint(n) \n'] | ['Wrong Answer', 'Accepted'] | ['s238220774', 's679420061'] | [3188.0, 3064.0] | [19.0, 20.0] | [582, 595] |
p02761 | u607563136 | 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\n# sc = [list(map(int,input().split())) for _ in range(m)]\n\na = [""]*3\nrep = []\nans = 0\n\nfor i in range(m):\n s,c = input().split()\n if s in rep:\n if c != a[int(s)-1]:\n ans = -1\n rep.append(s)\n a[int(s)-1] = c\n \nprint(a)\n\nif ans == -1:\n print(ans)\nelse:\n if a[0] == "":\n if a[1] == "":\n print(int(a[2]))\n elif a[2]=="":\n a[2]="0"\n print("".join(a))\n else:\n if a[1] == "":\n print(0)\n elif a[2]=="":\n a[2]="0"\n print("".join(a))\n ', 'n, m = map(int,input().split())\n\na = [""]*3\nrep = []\nans = 0\n\nfor i in range(m):\n s,c = input().split()\n if s in rep:\n if c != a[int(s)-1]:\n ans = -1\n rep.append(s)\n a[int(s)-1] = c\n\nif ans == -1:\n print(ans)\nelse:\n if a[0] == "":\n if a[1] == "":\n print(int(a[2]))\n elif a[2]=="":\n a[2]="0"\n print("".join(a))\n else:\n if a[1] == "":\n print(0)\n elif a[2]=="":\n a[2]="0"\n print("".join(a))\n ', 'n, m = map(int,input().split())\nsc = [list(map(int,input().split())) for _ in range(m)]\n\nans = -1\n\nfor i in range(1000):\n s_i = str(i)\n if len(s_i) == n and all(int(s_i[s-1])==c for s,c in sc):\n ans = i\n break\n\nprint(ans)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s656366914', 's795770949', 's149766669'] | [9184.0, 9216.0, 9108.0] | [28.0, 28.0, 31.0] | [606, 533, 241] |
p02761 | u608178601 | 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)]\nfor i in range(1000):\n\tcount=0\n\tif len(str(i))==N:\n\t\tfor sc in SC:\n\t\t\ts,c=sc[0],sc[1]\n\t\t\tif s==1 and i//(100)==c and c!=0:\n\t\t\t\tcount+=1\n\t\t\tif s==2 and len(str(i))==2:\n\t\t\t\tif int(str(i)[0])==c and c!=0:\n\t\t\t\t\tcount+=1\n\t\t\tif s==2 and len(str(i))==3:\n\t\t\t\tif int(str(i)[1])==c:\n\t\t\t\t\tcount+=1\n\t\t\tif s==3 and i%10==c:\n\t\t\t\tcount+=1\n\t\t\telse:\n\t\t\t\tcontinue\n\t\tprint(i,count)\n\t\tif count==len(SC):\n\t\t\tprint(i)\n\t\t\texit()\n\nif M==0:\n\tif N==3:print(100)\n\telif N==2:print(10)\n\telif N==1:print(0)\n\nelse:print(-1)', 'N,M=map(int, input().split())\nSC=[list(map(int, input().split())) for _ in range(M)]\nnum=[-1]*N\n\nfor sc in SC:\n\ts,c=sc[0],sc[1]\n\t\n\tif s==1 and c==0 and N>1:\n\t\tprint(-1)\n\t\texit()\n\telif num[s-1]==c or num[s-1]==-1:\n\t\tnum[s-1]=c\n\telse:\n\t\tprint(-1)\n\t\texit()\n\nif N==3:\n\tif num[0]==-1:\n\t\tnum[0]=1\n\tif num[1]==-1:\n\t\tnum[1]=0\n\tif num[2]==-1:\n\t\tnum[2]=0\n\tprint(num[0]*100+num[1]*10+num[2])\nelif N==2:\n\tif num[0]==-1:\n\t\tnum[0]=1\n\tif num[1]==-1:\n\t\tnum[1]=0\n\tprint(num[0]*10+num[1])\nelse:\n\tif num[0]==-1:\n\t\tnum[0]=0\n\tprint(num[0])'] | ['Wrong Answer', 'Accepted'] | ['s608319554', 's208582297'] | [9136.0, 9168.0] | [27.0, 31.0] | [577, 518] |
p02761 | u608579392 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['N, M = [int(x) for x in input().split()]\ns, c = [], []\nans_array = [None for _ in range(N)]\n\nfor i in range(M):\n s_i, c_i = [int(x) for x in input().split()]\n s.append(s_i)\n c.append(c_i)\n\nfor i in range(M):\n if ans_array[s[i] - 1] is None:\n ans_array[s[i] - 1] = c[i]\n else:\n if ans_array[s[i] - 1] != c[i]:\n print(-1)\n exit()\n\nif ans_array[-1] is not None:\n print(ans_array)\n ans_array = [0 if num is None else num for num in ans_array]\nelse:\n print(-1)\n exit()\n\nans = int("".join([str(num) for num in ans_array]))\nprint(ans)', 'import math\n\nN, M = [int(x) for x in input().split()]\ns, c = [], []\n\nfor i in range(M):\n s_i, c_i = [int(x) for x in input().split()]\n s.append(s_i)\n c.append(c_i)\n\nfor num in range(10 ** N):\n num = str(num)\n if len(num) != N:\n continue\n for i in range(M):\n if num[s[i] - 1] != str(c[i]):\n break\n else:\n print(int(num))\n exit()\n\nprint(-1)'] | ['Wrong Answer', 'Accepted'] | ['s512114195', 's152307609'] | [3064.0, 3064.0] | [18.0, 18.0] | [590, 398] |
p02761 | u609814378 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["import sys\nN, M = map(int, input().split())\n\n\nSClis = [] \nfor _ in range(M):\n a, b = map(int, input().split())\n SClis.append([a,b])\n\nans = [-1]*N\n\nfor i in range(M):\n singlelis = SClis[i]\n S = (singlelis[0] - 1)\n C = (singlelis[1])\n \n if ans[S] != -1 and ans[S] != C:\n print(-1)\n sys.exit()\n else:\n ans[S] = C\n\n\n \nif N == 1:\n if ans[0] == -1:\n ans[0] = 0\n print(''.join(map(str, ans)))\n sys.exit()\n\nif N != 1:\n if ans[0] == 0:\n print(-1)\n sys.exit()", 'import sys\n\nN, M = map(int, input().split())\n \ns_lis = []\nc_lis = []\n \nfor _ in range(M):\n s, c = map(int, input().split())\n s_lis.append(s)\n c_lis.append(c)\n\nif N not in s_lis:\n print(-1)\n sys.exit()\n\n \n\n\nfor k in range(N):\n\n dup_lis = ([i for i, x in enumerate(s_lis) if x == k])\n \n if dup_lis != 0:\n for j in dup_lis:\n if c_lis[dup_lis[0]] != c_lis[j]:\n print(-1)\n sys.exit()\n ', 'import sys\nN, M = map(int, input().split())\n\nSClis = [] \nfor _ in range(M):\n a, b = map(int, input().split())\n SClis.append([a,b])\n\nans = [-1]*N\n\n\nfor singlelis in SClis:\n digits = singlelis[0]-1\n number = singlelis[1]\n\n if ans[digits] == -1 or ans[digits] == number:\n ans[digits] = number\n else:\n print(-1)\n sys.exit()\n\nif ans[0] == 0:\n print(-1)\n sys.exit()\n\n\nkotae = ""\nfor i in range(N):\n i_str = str(ans[i])\n\n if i == 0 and i_str == "-1":\n kotae = kotae + "1"\n \n\n if i_str == "-1" and i != 0:\n kotae = kotae + "0"\n elif i_str != "-1" and i != 0:\n kotae = kotae + i_str\n\nprint(int(kotae))\n \n\n', "import sys\nN, M = map(int, input().split())\n\n\nSClis = [] \nfor _ in range(M):\n a, b = map(int, input().split())\n SClis.append([a,b])\n\nans = [-1]*N\n\nfor i in range(M):\n singlelis = SClis[i]\n S = (singlelis[0] - 1)\n C = (singlelis[1])\n \n if ans[S] != -1 and ans[S] != C:\n print(-1)\n sys.exit()\n else:\n ans[S] = C\n\n\n \nif N == 1:\n if ans[0] == -1:\n ans[0] = 0\n print(''.join(map(str, ans)))\n sys.exit()\n\nif N != 1:\n if ans[0] == 0:\n print(-1)\n sys.exit()\n \n if ans[0] == -1:\n ans[0] = 1\n \n for i in range(1,N):\n if ans[i] == -1:\n ans[i] = 0\n\nprint(''.join(map(str, ans)))\n"] | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s036103584', 's103896278', 's736107597', 's915497894'] | [9248.0, 3064.0, 3064.0, 9152.0] | [27.0, 17.0, 18.0, 32.0] | [563, 462, 685, 718] |
p02761 | u610192658 | 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_list = []\n\ndef my_index(l, x, default=False):\n if x in l:\n return l.index(x)\n else:\n return default\n\nfor i in range(3):\n a, b, c = map(int, input().split())\n A_list.append(a)\n A_list.append(b)\n A_list.append(c)\n\nN = int(input())\nflag=True\n\nfor i in range(N):\n num = int(input())\n\n tmp = my_index(A_list, num)\n if tmp != False or tmp == 0:\n A_list[tmp] = -1\n \n if ((A_list[0] == A_list[3]) and (A_list[0] == A_list[6]) and (A_list[3] == A_list[6])) or ((A_list[1] == A_list[4]) and (A_list[1] == A_list[7]) and (A_list[4] == A_list[7])) or ((A_list[2] == A_list[5]) and (A_list[2] == A_list[8]) and (A_list[5] == A_list[8])) or ((A_list[0] == A_list[4]) and (A_list[0] == A_list[8]) and (A_list[4] == A_list[8])) or ((A_list[2] == A_list[4]) and (A_list[2] == A_list[6]) and (A_list[4] == A_list[6])) or ((A_list[0] == A_list[1]) and (A_list[0] == A_list[2]) and (A_list[1] == A_list[2])) or ((A_list[3] == A_list[4]) and (A_list[3] == A_list[5]) and (A_list[4] == A_list[5])) or ((A_list[6] == A_list[7]) and (A_list[6] == A_list[8]) and (A_list[7] == A_list[8])):\n print("Yes")\n flag=False\n break\n\nif flag:\n print("No")\n', 'N, M = map(int, input().split())\nnum_list = [0]*N\n\nflag=True\n\nfor _ in range(M):\n s, c = map(int, input().split())\n\n if (s == 1 and c == 0 and N != 1):\n print(-1)\n flag=False\n break\n\n if (num_list[s-1] == 0):\n num_list[s-1] = c\n else:\n if num_list[s-1] != c:\n print(-1)\n flag=False\n break\n\nif flag:\n if num_list[0] == 0 and N != 1:\n num_list[0] = 1\n\n ans = ""\n for i in num_list:\n ans += str(i)\n\n print(ans)'] | ['Runtime Error', 'Accepted'] | ['s384085482', 's017203116'] | [3188.0, 3064.0] | [18.0, 17.0] | [1165, 451] |
p02761 | u612975321 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['print(-1)', 'n, m = map(int,input().split())\nsc = [list(map(int,input().split())) for i in range(m)]\n\nflg = True\nfor ci in range(0, 10**n):\n cis = str(ci)\n if len(cis) != n:\n continue\n for j in range(m):\n s, c = sc[j][0]-1, sc[j][1]\n if int(cis[s]) != sc[j][1]:\n flg = False\n break\n \n if j == m-1:\n flg = True\n if flg == True:\n break\nprint(ci) if flg else print(-1) '] | ['Wrong Answer', 'Accepted'] | ['s435710128', 's232942895'] | [9036.0, 9156.0] | [26.0, 29.0] | [9, 451] |
p02761 | u613920660 | 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 guess(N,M,S,C,guess_num):\n no_num=False\n if len(guess_num)!=1:\n guess_num[0]=1\n else:\n pass\n\n for m in range(M):\n if guess_num[S[m]-1]==0 or guess_num[S[m]-1]==C[m]:\n guess_num[S[m]-1]=C[m]\n else:\n no_num=True\n break\n \n if len(guess_num)!=1 and (no_num==True or guess_num[0]==0):\n return -1\n else:\n return int("".join(map(str,guess_num)))\n\ndef main():\n #initialize\n NM=[]\n SC=[]\n #input\n NM=list(map(int,input().strip().split()))\n N=NM[0]\n M=NM[1]\n for n in range(M):\n SC.append(list(map(int,input().strip().split())))\n S=[SC[i][0] for i in range(M)]\n C=[SC[j][1] for j in range(M)]\n\n guess_num=[0 for n in range(N)]\n \n print(guess(N,M,S,C,guess_num))\n\nmain()', 'def guess(N,M,S,C,guess_num):\n no_num=False\n if len(guess_num)!=1:\n guess_num[0]=1\n else:\n pass\n\n num_input=[0 for n in range(N)]\n for m in range(M):\n if num_input[S[m]-1]==0 or guess_num[S[m]-1]==C[m]:\n guess_num[S[m]-1]=C[m]\n num_input[S[m]-1]=1\n else:\n no_num=True\n break\n \n if no_num==True or (len(guess_num)!=1 and guess_num[0]==0):\n return -1\n else:\n return int("".join(map(str,guess_num)))\n\ndef main():\n #initialize\n NM=[]\n SC=[]\n #input\n NM=list(map(int,input().strip().split()))\n N=NM[0]\n M=NM[1]\n for n in range(M):\n SC.append(list(map(int,input().strip().split())))\n S=[SC[i][0] for i in range(M)]\n C=[SC[j][1] for j in range(M)]\n\n guess_num=[0 for n in range(N)]\n \n print(guess(N,M,S,C,guess_num))\n\nmain()'] | ['Wrong Answer', 'Accepted'] | ['s360239570', 's494349252'] | [3064.0, 3064.0] | [18.0, 18.0] | [805, 873] |
p02761 | u614181788 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['n,m = map(int,input().split())\ns = [0]*m\nc = [0]*m\n\nfor i in range(m):\n s[i],c[i] = map(int,input().split())\n\nsw = [[0]*2]*m\nnum = [0]*m\nans = 0\nss = [0]*m\nfor i in range(m):\n if s[i] == 1 and c[i] == 0:\n ans = 1\n break\n if sw[s[i]-1][0] == 1 and sw[s[i]-1][1] - 1 != c[i]:\n ans = 1\n break\n ss[s[i]-1] = c[i]\n sw[s[i]-1][0] = 1\n sw[s[i]-1][1] = c[i] + 1\nif ans ==1:\n print(-1)\nelse:\n for i in range(m):\n print(ss[i], end="")\nprint()', 'n,m = map(int,input().split())\ns = [0]*m\nc = [0]*m\n\nfor i in range(m):\n s[i],c[i] = map(int,input().split())\n\nsw = [[0]*2]*m\nnum = [0]*m\nans = 0\nss = [0]*m\nfor i in range(m):\n if s[i] == 1 and c[i] == 0:\n ans = 1\n break\n if sw[s[i]-1][0] == 1 and sw[s[i]-1][1] - 1 != c[i]:\n ans = 1\n break\n ss[s[i]-1] = c[i]\n sw[s[i]-1][0] = 1\n sw[s[i]-1][1] = c[i] + 1\nif ans ==1:\n print(-1)\nelse:\n for i in range(m):\n print(ss[i], end="")\n print()', 'n,m = map(int,input().split())\nsc = [0]*m\nfor i in range(m):\n sc[i] = list(map(int,input().split()))\nans = 10**5\nz = 10**5\nif n == 1:\n z = 0\nfor i in range(min(10**(n-1),z),10**n):\n x = list(str(i))\n sw = 1\n for j in range(m):\n if x[sc[j][0]-1] == str(sc[j][1]):\n pass\n else:\n sw = 0\n break\n if sw == 1:\n ans = min(ans,i)\nif ans == 10**5:\n print(-1)\nelse:\n print(ans)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s433926161', 's481797860', 's129015064'] | [3064.0, 3064.0, 3064.0] | [18.0, 17.0, 19.0] | [491, 495, 445] |
p02761 | u616382321 | 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 _ in range(M):\n s, c = map(int, input().split())\n S.append(s)\n C.append(c)\n \n\nn = int('9'*N)\nans = []\n\nfor i in range(n+1):\n if len(str(i)) == 1:\n I = '00'+str(i)\n elif len(str(i)) == 2:\n I = '0'+str(i)\n else:\n I = str(i)\n for m in range(M):\n if N >= 2 and S[m] == 1 and C[m] == 0:\n break\n if I[S[m]-1] != str(C[m]):\n break\n else:\n ans.append(I)\n\nif len(ans) == 0:\n print(-1)\n exit()\n\nans_map = list(map(int,ans))\n\nprint(ans_map)\n\nprint(min(ans_map))\n", "N, M = map(int, input().split())\nS = []\nC = []\nfor _ in range(M):\n s, c = map(int, input().split())\n S.append(s)\n C.append(c)\n \n\nn = int('9'*N)\nif N > 1:\n start = int('1' + '0'*(N-1))\nelse:\n start = 0\nans = []\n\nfor i in range(start, n+1):\n I = str(i)\n for m in range(M):\n if N >= 2 and S[m] == 1 and C[m] == 0:\n break\n if S[m] <= len(I):\n if I[S[m]-1] != str(C[m]):\n break\n else:\n ans.append(I)\n\nif len(ans) == 0:\n print(-1)\n exit()\n\nans_map = list(map(int,ans))\n\nprint(min(ans_map))\n"] | ['Wrong Answer', 'Accepted'] | ['s091248763', 's352051586'] | [9180.0, 9172.0] | [33.0, 26.0] | [599, 575] |
p02761 | u619144316 | 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 = []\nfor _ in range(M):\n SC.append([int(i) for i in input().split(' ')])\n\nfor n in range(10**(N-1),10**N):\n n = list(str(n))\n flg = 0\n for s,c in SC:\n if not n[s-1] == str(c):\n flg = 1\n\n if flg == 0:\n print(''.formatjoin(n))\n exit()", "N, M = [int(i) for i in input().split(' ')]\nSC = []\nfor _ in range(M):\n SC.append([int(i) for i in input().split(' ')])\n\nch = [-1] * N\nfor s,c in SC:\n if N >1:\n if s == 1 and c == 0:\n print(-1)\n exit()\n\n if ch[s-1] == -1 or ch[s-1] == c:\n ch[s-1] = c\n else:\n print(-1)\n exit()\ns = 10**(N-1) if N >1 else 0\nf = 10 ** N if N >1 else 10\nfor n in range(s,f):\n n = list(str(n))\n flg = 0\n for s,c in SC:\n if not n[s-1] == str(c):\n flg = 1\n\n if flg == 0:\n print(''.join(n))\n exit()"] | ['Runtime Error', 'Accepted'] | ['s979962616', 's945169303'] | [3064.0, 3064.0] | [19.0, 19.0] | [326, 580] |
p02761 | u619819312 | 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=[-1]*n\nfor i in range(m):\n s,c=map(int,input().split())\n if p[s-1]==-1:\n p[s-1]=c\n else:\n if c!=p[s-1]:\n print(-1)\n break\nelse:\n if p[0]==0 or p[0]!=-1:\n print(-1)\n else:\n s=""\n for i in range(n):\n if p[i]==-1:\n s+="0"\n else:\n s+=str(p[i])\n print(s)', 'n,m=map(int,input().split())\np=[-1]*n\nfor i in range(m):\n s,c=map(int,input().split())\n if p[s-1]==-1:\n p[s-1]=c\n else:\n if c!=p[s-1]:\n print(-1)\n break\nelse:\n if n==1 and (p[0]==0 or p[0]==-1):\n print(0)\n elif p[0]==0:\n print(-1)\n else:\n s=""\n for i in range(n):\n if p[i]==-1:\n if i==0:\n s+="1"\n else:\n s+="0"\n else:\n s+=str(p[i])\n print(s)'] | ['Wrong Answer', 'Accepted'] | ['s662016167', 's059528157'] | [3064.0, 3064.0] | [18.0, 17.0] | [411, 535] |
p02761 | u620238824 | 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 i in range(M)] 、複数行複数列\n\nA = [0] * N\n\nfor i, j in S:\n if i - 1 == 0 and j == 0:\n print(-1)\n exit() \n elif A[i-1] == 0 or A[i-1] == j:\n A[i - 1] = j\n else:\n print(-1)\n exit()\n\nif A[0] == 0:\n A[0] = 1\nelse:\n A = [str(i) for i in A]\n print(''.join(A))", "N, M = map(int, input().split()) \nS = [list(map(int, input().split())) for i in range(M)] 、複数行複数列\n\nA = [0] * N\n\nfor i, j in S:\n if A[i-1] == 0 or A[i-1] == j:\n A[i-1] = j\n else:\n print(-1)\n exit()\n\nif A[0] == 0 and len(A) > 1:\n print(-1)\nelse:\n A = [str(i) for i in A]\n print(''.join(A))", "n, m = map(int, input().split())\nnumber = [0] * n\ncou = [0] * n\n\n\nfor i in range(m):\n s, c = map(int, input().split())\n s -= 1\n if cou[s] > 0 and c != number[s]:\n print(-1)\n exit()\n else:\n cou[s] += 1\n number[s] = c\n \n\nif n > 1 and number[0] == 0 and cou[0] >= 1:\n print(-1)\n exit()\nelif n > 1 and number[0] == 0:\n number[0] = 1\n\nnumber = map(str, number)\nprint(''.join(number))"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s252381790', 's321102758', 's166593751'] | [3064.0, 3064.0, 9116.0] | [17.0, 18.0, 25.0] | [421, 366, 512] |
p02761 | u622847899 | 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=[]\nnum=[0]*N\n \n \nfor i in range(M):\n array=list(map(int,input().split()))\n s.append(array[0])\n c.append(array[1])\n \nfor i in range(1000):\n num=str(i)\n if N != len(num):\n continue\n \n for m in range(M):\n if num[s[m]-1] != str(c[m]):\n break\n\n print(num)\n exit()\n \nprint(-1)', "n,m = map(int, input().split())\nsc = [ list(map(int,input().split())) for _ in range(m)]\n\nans = [0] * n\nchange_cnt = [0] * n\nif n >= 2:\n ans[0]=1\nfor i in range(n):\n for j in range(m):\n if i+1 == sc[j][0]:\n if ans[i] != sc[j][1]:\n ans[i] = sc[j][1]\n change_cnt[i] += 1\n if change_cnt[i] > 1:\n print(-1)\n exit()\n\nif n>=2:\n if ans[0]==0:\n print(-1)\n exit()\n\nanswer = ''\nfor i in range(len(ans)):\n answer += str(ans[i])\n\nprint(int(answer))\n"] | ['Wrong Answer', 'Accepted'] | ['s639544648', 's092158838'] | [3064.0, 3064.0] | [17.0, 17.0] | [329, 564] |
p02761 | u624613992 | 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_list = [0] * n\nlist1 = []\nfor i in range(m):\n s, c = map(int, input().split())\n a = [s, c]\n list1.append(a)\nlist1.sort(reverse=True)\nfor i in range(m):\n s = list1[i][0]\n c = list1[i][1]\n if c == 0:\n ans_list[s - 1] = 0\n elif ans_list[s - 1] == 0 or ans_list[s - 1] > c:\n ans_list[s - 1] = c\n elif ans_list[s - 1] < c:\n pass\n else:\n print(-1)\n exit()\nif ans_list[0] == 0:\n print(-1)\n exit()\nans = map(str, ans_list)\nprint("".join(ans))', 'n,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 and ans[s-1] != c:\n print(-1)\n exit()\n elif n != 1 and s == 1 and c == 0:\n print(-1)\n exit()\n else:\n ans[s-1] = c\nans_f = "".join((map(str,ans)))\nif n>1 and ans_f[0] == "0":\n print("1"+ans_f[1::])\nelse:\n print(ans_f)'] | ['Wrong Answer', 'Accepted'] | ['s858545153', 's554979467'] | [3064.0, 9220.0] | [17.0, 27.0] | [539, 349] |
p02761 | u624617831 | 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 \n ans = []\n check = []\n false_flg = 0\n for i in range(n):\n ans.append(\'0\')\n check.append(0)\n\n for j in range(m):\n s, c = input().split()\n if check[int(s)-1] == 0:\n check[int(s)-1] = 1\n ans[int(s)-1] = c\n else:\n false_flg = 1\n \n tmp = int("".join(ans))\n \n if tmp // 10**(n-1) > 0 and false_flg != 1:\n print(tmp)\n else:\n print(-1)\n\n\nif __name__ == \'__main__\':\n main()\n', 'def main():\n n, m = map(int, input().split())\n \n ans = []\n check = []\n check_once = []\n false_flg = 0\n for i in range(n):\n ans.append(\'0\')\n check.append(0)\n check_once.append(0)\n\n for j in range(m):\n s, c = input().split()\n\n if int(s) == 1 and int(c) == 0:\n false_flg = 1\n\n if check[int(s)-1] == 0:\n ans[int(s)-1] = c\n check[int(s)-1] = 1\n\n elif check[int(s)-1] == 1 and ans[int(s)-1] == c:\n ans[int(s)-1] == c:\n\n else:\n false_flg = 1\n \n tmp = int("".join(ans))\n \n if tmp // 10**(n-1) > 0 and false_flg != 1:\n print(tmp)\n elif false_flg != 1:\n tmp_ = 10**(n-1) + int(tmp)\n print(tmp_)\n else:\n print(-1)\n\n\nif __name__ == \'__main__\':\n main()\n', 'def main():\n n, m = map(int, input().split())\n \n ans = []\n for i in range(n):\n ans.append(\'0\')\n\n for j in range(m):\n s, c = input().split()\n ans[int(s)-1] = c\n \n tmp = int("".join(ans))\n\n if tmp // 10**n > 0:\n print(tmp)\n else:\n print(-1)\n\n\nif __name__ == \'__main__\':\n main()\n', 'def main():\n n, m = map(int, input().split())\n \n ans = []\n check = []\n check_once = []\n false_flg = 0\n for i in range(n):\n ans.append(\'0\')\n check.append(0)\n check_once.append(0)\n\n for j in range(m):\n s, c = input().split()\n\n if int(s) == 1 and int(c) == 0 and n != 1:\n false_flg = 1\n\n if check[int(s)-1] == 0:\n ans[int(s)-1] = c\n check[int(s)-1] = 1\n\n elif check[int(s)-1] == 1 and ans[int(s)-1] == c:\n ans[int(s)-1] = c\n\n else:\n false_flg = 1\n \n tmp = int("".join(ans))\n \n if tmp // 10**(n-1) > 0 and false_flg != 1:\n print(tmp)\n\n elif false_flg != 1:\n if tmp == 0 and n == 1:\n print(0)\n else:\n tmp_ = 10**(n-1) + int(tmp)\n print(tmp_)\n else:\n print(-1)\n\n\nif __name__ == \'__main__\':\n main()\n'] | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s133121323', 's221786038', 's776236180', 's342289566'] | [3064.0, 3064.0, 3060.0, 3064.0] | [19.0, 18.0, 17.0, 18.0] | [534, 823, 341, 909] |
p02761 | u624696727 | 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\nsys.setrecursionlimit(10 ** 6)\nint1 = lambda x: int(x) - 1\nprintV = lambda x: print(*x, sep="\\n")\nprintH = lambda x: print(" ".join(map(str,x)))\ndef IS(): return sys.stdin.readline()[:-1]\ndef II(): return int(sys.stdin.readline())\ndef MI(): return map(int, sys.stdin.readline().split())\ndef LI(): return list(map(int, sys.stdin.readline().split()))\ndef LI1(): return list(map(int1, sys.stdin.readline().split()))\ndef LII(rows_number): return [II() for _ in range(rows_number)]\ndef LLI(rows_number): return [LI() for _ in range(rows_number)]\ndef LLI1(rows_number): return [LI1() for _ in range(rows_number)]\n\ndef main():\n\tN,M = MI()\n\tNUM = [-1]*N\n\tch = True\n\tfor i in range(M):\n\t\ts,c = MI()\n\t\ts = s-1\n\t\tif(NUM[s]!=-1 and NUM[s]!=c):\n\t\t\tch = False\n\t\tNUM[s]=c\n\tif(NUM[0]==0 and N!=1):\n\t\tch=False\n\tif(ch==False):\n\t\tprint(-1)\n\telse:\n\t\tans = 0\n\t\tt = 10**(N-1)\n\t\tfor i in range(N):\n\t\t\tif(NUM[i]==-1 and (i==0 or N!=1)):\n\t\t\t\tans += t\n\t\t\telif(NUM[i]!=-1):\n\t\t\t\tans += (t * NUM[i])\n\t\t\tt //= 10\n\n\t\tprint(ans)\n\n\n\n\nif __name__ == \'__main__\':\n\tmain()', 'import sys\n\nsys.setrecursionlimit(10 ** 6)\nint1 = lambda x: int(x) - 1\nprintV = lambda x: print(*x, sep="\\n")\nprintH = lambda x: print(" ".join(map(str,x)))\ndef IS(): return sys.stdin.readline()[:-1]\ndef II(): return int(sys.stdin.readline())\ndef MI(): return map(int, sys.stdin.readline().split())\ndef LI(): return list(map(int, sys.stdin.readline().split()))\ndef LI1(): return list(map(int1, sys.stdin.readline().split()))\ndef LII(rows_number): return [II() for _ in range(rows_number)]\ndef LLI(rows_number): return [LI() for _ in range(rows_number)]\ndef LLI1(rows_number): return [LI1() for _ in range(rows_number)]\n\ndef main():\n\tN,M = MI()\n\tNUM = [-1]*N\n\tch = True\n\tfor i in range(M):\n\t\ts,c = MI()\n\t\ts = s-1\n\t\tif(NUM[s]!=-1 and NUM[s]!=c):\n\t\t\tch = False\n\t\tNUM[s]=c\n\tif(NUM[0]==0 and N!=1):\n\t\tch=False\n\tif(ch==False):\n\t\tprint(-1)\n\telse:\n\t\tans = 0\n\t\tt = 10**(N-1)\n\t\tfor i in range(N):\n\t\t\tif(NUM[i]==-1 and i==0):\n\t\t\t\tif(N!=1):\n\t\t\t\t\tans += t\n\t\t\telif(NUM[i]!=-1):\n\t\t\t\tans += (t * NUM[i])\n\t\t\tt //= 10\n\n\t\tprint(ans)\n\n\n\n\nif __name__ == \'__main__\':\n\tmain()'] | ['Wrong Answer', 'Accepted'] | ['s209233916', 's776882456'] | [3064.0, 3064.0] | [18.0, 19.0] | [1047, 1052] |
p02761 | u625963200 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["n,m=map(int,input().split())\nSC=[list(map(int,input().split())) for _ in range(m)]\n\nif n==0:\n ans=[0]\n for s,c in SC:\n if ans[s-1]==0:\n ans[s-1]=c\n else:\n if ans[s-1]!=c:\n prin\n t(-1)\n exit()\nelse:\n ans=[0]*n\n ans[0]=1\n for s,c in SC:\n if ans[s-1]==0:\n ans[s-1]=c\n else:\n if ans[s-1]!=c:\n print(-1)\n exit()\n if ans[0]==0:\n ans[0]=1\n \nprint(*ans,sep='')", "n,m=map(int,input().split())\nSC=[list(map(int,input().split())) for _ in range(m)]\n\nif n==0:\n print(0)\n exit()\nans=[0]*n\nans[0]=1\nfor s,c in SC:\n if ans[s-1]==0:\n ans[s-1]=c\n else:\n if ans[s-1]!=c:\n print(-1)\n exit()\nif ans[0]==0:\n ans[0]=1\nprint(*ans,sep='')", "n,m=map(int,input().split())\nSC=[list(map(int,input().split())) for _ in range(m)]\n\nfor i in range(999):\n i=list(str(i))\n flag=True\n for s,c in SC:\n if s-1>=len(i): break\n if int(i[s-1])!=c: break\n else:\n if len(i)==n:\n print(*i,sep='')\n exit()\nprint(-1)\n"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s906762104', 's952305413', 's939923142'] | [3064.0, 3064.0, 3064.0] | [17.0, 17.0, 19.0] | [429, 280, 278] |
p02761 | u626464560 | 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())\nslist = []\nclist = []\n\ndef check(numlist, slist, clist):\n for i in range(m):\n if int(numlist[slist[i]]) != clist[i]:\n return False\n return True\n\nfor i in range(m):\n s,c = map(int, input().split())\n slist.append(s-1)\n clist.append(c)\nflag = 0\n# if m > n:\n# print(-1)\n# else:\n for num in range(10**(n-1), 10**n):\n numstring = str(num)\n numlist = list(numstring)\n if check(numlist, slist, clist):\n print(num)\n flag = 1\n break\n if not flag:\n print(-1)\n\n', 'n, m = map(int, input().split())\nslist = []\nclist = []\n\ndef check(numlist, slist, clist):\n for i in range(m):\n if int(numlist[slist[i]]) != clist[i]:\n return False\n return True\n\nfor i in range(m):\n s,c = map(int, input().split())\n slist.append(s-1)\n clist.append(c)\nflag = 0\n# if m > n:\n# print(-1)\n# else:\n for num in range(10**(n-1), 10**n):\n numstring = str(num)\n numlist = list(numstring)\n if check(numlist, slist, clist):\n print(num)\n flag = 1\n break\n if not flag:\n print(-1)\n\n', 'n, m = map(int, input().split())\nslist = []\nclist = []\n\ndef check(numlist, slist, clist):\n for i in range(m):\n if int(numlist[slist[i]]) != clist[i]:\n return False\n return True\n\nfor i in range(m):\n s,c = map(int, input().split())\n slist.append(s-1)\n clist.append(c)\n\nstart = 10**(n-1)\nend = 10**n\nif n == 1:\n start = 0\nflag = 0\nfor num in range(start, end):\n numstring = str(num)\n numlist = list(numstring)\n if check(numlist, slist, clist):\n print(num)\n flag = 1\n break\nif not flag:\n print(-1)\n\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s295745215', 's802890974', 's101994598'] | [2940.0, 2940.0, 3064.0] | [17.0, 18.0, 19.0] | [586, 586, 564] |
p02761 | u626881915 | 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+1)\n\nans = 0\nfor i in range(m):\n s,c=map(int,input().split())\n if a[s] == -1 or a[s] == c:\n a[s] = c\n else:\n print(-1)\n exit()\n\nif a[1] == 0:\n if n>1:\n print(-1)\n exit()\n else:\n print(ans)\nelse:\n ans = max(1, a[1])\n for i in range(2, n+1)\n ans = ans*10+max(0, a[i])\nprint(ans)', 'n,m=map(int,input().split())\na = [-1]*(n+1)\n\nans = 0\nfor i in range(m):\n s,c=map(int,input().split())\n if a[s] == -1 or a[s] == c:\n a[s] = c\n else:\n print(-1)\n exit()\nif n == 1:\n print(max(0, a[1]))\n exit()\nif a[1] == 0:\n if n>1:\n print(-1)\n exit()\n else:\n print(ans)\nelse:\n ans = max(1, a[1])\n for i in range(2, n+1):\n ans = ans*10+max(0, a[i])\nprint(ans)\n'] | ['Runtime Error', 'Accepted'] | ['s548353100', 's170787720'] | [3064.0, 3064.0] | [18.0, 18.0] | [344, 387] |
p02761 | u628581330 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['n,m = map(int,input().split())\ndigit = [\'-2\']*n\nfor i in range(m):\n s,c = input().split()\n s = int(s)\n if digit[s-1] == \'-2\' or digit[s-1] == c:\n digit[s-1] = c\n else:\n digit[s-1] = \'-1\'\nif (\'-1\' in digit) or (len(digit)!=1 and digit[0] == \'0\'):\n print(-1)\nelse:\n print("".join(digit.replace(\'-2\',\'0\')))', 'n,m = map(int,input().split())\ndigit = [\'-2\']*n\nfor i in range(m):\n s,c = input().split()\n s = int(s)\n if digit[s-1] == \'-2\' or digit[s-1] == c:\n digit[s-1] = c\n else:\n digit[s-1] = \'-1\'\nif (\'-1\' in digit) or (len(digit)!=1 and digit[0] == \'0\'):\n print(-1)\nelse:\n if digit[0] != \'-2\' or (len(digit)==1 and digit[0] == \'-2\'):\n print("".join(digit).replace(\'-2\',\'0\'))\n else:\n digit[0] = \'1\'\n print("".join(digit).replace(\'-2\',\'0\'))'] | ['Runtime Error', 'Accepted'] | ['s215371447', 's136043492'] | [3064.0, 3064.0] | [17.0, 18.0] | [335, 485] |
p02761 | u629350026 | 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=["a"]*n\nfor i in range(0,m):\n s,c=map(int,input().split())\n if ans[s-1]=="a" or ans[s-1]==c:\n ans[s-1]=c\n else:\n print(-1)\n break\nelse:\n for i in range(0,n):\n if ans[i]=="a":\n ans[i]=0\n if ans[0]==0:\n print(-1)\n else:\n if n==3:\n ans=int(ans[0])*100+int(ans[1])*10+int(ans[2])\n print(ans)\n elif n==2:\n ans=int(ans[0])*10+int(ans[1])\n else:\n ans=int(ans[0])\n print(ans)', 'n,m=map(int,input().split())\nans=["a"]*n\nfor i in range(0,m):\n s,c=map(int,input().split())\n if ans[s-1]=="a" or ans[s-1]==c:\n ans[s-1]=c\n else:\n print(-1)\n break\nelse:\n if n==1 and ans[0]=="a":\n ans[0]=0\n elif ans[0]=="a":\n ans[0]=1\n for i in range(0,n):\n if ans[i]=="a":\n ans[i]=0\n if i>=2 and ans[0]==0:\n print(-1)\n else:\n if n==3:\n ans=int(ans[0])*100+int(ans[1])*10+int(ans[2])\n elif n==2:\n ans=int(ans[0])*10+int(ans[1])\n else:\n ans=int(ans[0])\n print(ans)'] | ['Wrong Answer', 'Accepted'] | ['s870308625', 's759247268'] | [3064.0, 3064.0] | [17.0, 18.0] | [458, 523] |
p02761 | u631755487 | 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(\' \'))\nsayi = []\nfor i in range(n):\n sayi.append(\'*\')\n\nfor i in range(m):\n s, t = map(int, input().split(\' \'))\n print(s, t)\n if s == 1 and t == 0:\n print(-1)\n break\n if sayi[s-1] == "*" or sayi[s-1] == str(t):\n sayi[s-1] = str(t)\n else:\n print(-1)\n break\nfor i in range(len(sayi)):\n if sayi[i] == \'*\':\n if i == 0:\n sayi[i] = \'1\'\n else:\n sayi[i] = \'0\'\nprint(\'\'.join(sayi))', "n, m = map(int, input().split(' '))\nsayi = '*'\nfor i in range(n-1):\n sayi += '*'\nfor i in range(m):\n s, t = map(int, input().split(' '))\n if s == 1 and t == 0:\n print(-1)\n break\n if sayi[s-1] == '*' or sayi[s-1] == str(t):\n sayi[s-1] == str(t)\n else:\n print(-1)\n break\nfor i in range(len(sayi)):\n if sayi[i] == '*':\n if i == 0:\n sayi[i] == '1'\n else:\n sayi[i] == '0'\nprint(sayi)\n \nprint()\n ", "n, m = map(int, input().split(' '))\nsayi = '*'\nfor i in range(n-1):\n sayi += '*'\nfor i in range(m):\n s, t = map(int, input().split(' '))\n if s == 1 and t == 0:\n print(-1)\n break\n if sayi[s-1] == '*' or sayi[s-1] == str(t):\n sayi[s-1] == str(t)\n else:\n print(-1)\n break\nfor i in range(len(sayi)):\n if sayi[i] == '*':\n if i == 0:\n sayi[i] == '1'\n else:\n sayi[i] == '0'\nprint(sayi)", 'n, m = map(int, input().split(\' \'))\nsayi = []\nfor i in range(n):\n sayi.append(\'*\')\n\nfor i in range(m):\n s, t = map(int, input().split(\' \'))\n if n >= 2 and s == 1 and t == 0:\n print(-1)\n exit()\n if sayi[s-1] == "*" or sayi[s-1] == str(t):\n sayi[s-1] = str(t)\n else:\n print(-1)\n exit()\nfor i in range(len(sayi)):\n if sayi[i] == \'*\':\n if n>=2 and i == 0:\n sayi[i] = \'1\'\n else:\n sayi[i] = \'0\'\nprint(\'\'.join(sayi))'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s049397152', 's888334567', 's898504931', 's443129378'] | [3064.0, 3064.0, 3064.0, 3188.0] | [19.0, 18.0, 17.0, 19.0] | [492, 431, 415, 498] |
p02761 | u634079249 | 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 os\nimport math\n\nii = lambda: int(sys.stdin.buffer.readline().rstrip())\nil = lambda: list(map(int, sys.stdin.buffer.readline().split()))\niln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]\n\niss = lambda: sys.stdin.buffer.readline().decode().rstrip()\nisn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]\n\n\ndef main():\n if os.getenv("LOCAL"):\n sys.stdin = open("input.txt", "r")\n\n N, M = il()\n SC = [il() for _ in range(M)]\n mi = pow(10, N-1)-1\n mx = pow(10, N)+1\n\n ret = float(\'inf\')\n for n in range(mi, mx):\n isSC = True\n for sc in SC:\n s, c = sc\n if str(n)[s-1] != str(c):\n isSC = False\n\n if isSC:\n ret = min(ret, n)\n\n print(ret if ret < mx+1 else -1)\n\n\nif __name__ == \'__main__\':\n main()\n', 'import sys\nimport os\nimport math\n\nii = lambda: int(sys.stdin.buffer.readline().rstrip())\nil = lambda: list(map(int, sys.stdin.buffer.readline().split()))\niln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]\n\niss = lambda: sys.stdin.buffer.readline().decode().rstrip()\nisn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]\n\n\ndef main():\n if os.getenv("LOCAL"):\n sys.stdin = open("input.txt", "r")\n\n N, M = il()\n SC = [il() for _ in range(M)]\n mi = pow(10, N-1)\n mx = pow(10, N)\n\n ret = float(\'inf\')\n for n in range(mi, mx):\n print(n)\n isSC = True\n for sc in SC:\n s, c = sc\n if str(n)[s-1] != str(c):\n isSC = False\n\n if isSC:\n ret = min(ret, n)\n\n print(ret if ret < mx else -1)\n\n\nif __name__ == \'__main__\':\n main()\n', 'import sys\nimport os\nimport math\n\nii = lambda: int(sys.stdin.buffer.readline().rstrip())\nil = lambda: list(map(int, sys.stdin.buffer.readline().split()))\niln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]\n\niss = lambda: sys.stdin.buffer.readline().decode().rstrip()\nisn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]\n\n\ndef main():\n if os.getenv("LOCAL"):\n sys.stdin = open("input.txt", "r")\n\n N, M = il()\n SC = [il() for _ in range(M)]\n mi = pow(10, N - 1)-1\n mx = pow(10, N)\n\n for n in range(mi, mx):\n isSC = True\n for s, c in SC:\n if str(n)[s - 1] != str(c):\n isSC = False\n\n if isSC:\n print(n)\n exit()\n\n print(-1)\n\n\nif __name__ == \'__main__\':\n main()\n', 'import sys\nimport os\n\n\ndef main():\n if os.getenv("LOCAL"):\n sys.stdin = open("input.txt", "r")\n\n N, M = list(map(int, sys.stdin.readline().split()))\n lines = [list(map(int, sys.stdin.readline().split())) for _ in range(M)]\n\n print(lines)\n ret = -1\n for n in range(0, pow(10, N)):\n if len(str(n)) != N:\n continue\n flg = True\n for s, c in lines:\n if str(n)[s - 1] != str(c):\n flg = False\n\n if flg:\n ret = n\n break\n\n print(ret)\n\n\nif __name__ == \'__main__\':\n main()\n', 'import sys\nimport os\nimport math\n\nii = lambda: int(sys.stdin.buffer.readline().rstrip())\nil = lambda: list(map(int, sys.stdin.buffer.readline().split()))\niln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]\n\niss = lambda: sys.stdin.buffer.readline().decode().rstrip()\nisn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]\n\n\ndef main():\n if os.getenv("LOCAL"):\n sys.stdin = open("input.txt", "r")\n\n N, M = il()\n SC = [il() for _ in range(M)]\n mi = pow(10, N-1)\n mx = pow(10, N)\n\n ret = float(\'inf\')\n isRet = False\n for n in range(1, mx):\n isSC = True\n for sc in SC:\n s, c = sc\n if str(n)[s-1] != str(c):\n isSC = False\n\n if isSC:\n ret = min(ret, n)\n isRet = True\n\n print(ret if isRet else -1)\n\n\nif __name__ == \'__main__\':\n main()\n', 'import sys\nimport os\n\nii = lambda: int(sys.stdin.buffer.readline().rstrip())\nil = lambda: list(map(int, sys.stdin.buffer.readline().split()))\niln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]\n\niss = lambda: sys.stdin.buffer.readline().decode().rstrip()\nisn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]\n\n\ndef main():\n if os.getenv("LOCAL"):\n sys.stdin = open("input.txt", "r")\n\n N, M = il()\n SC = [il() for _ in range(M)]\n\n for n in range(pow(10, N)):\n tmp = str(n)\n if len(tmp) == N and all(tmp[s - 1] == str(c) for s, c in SC):\n print(n)\n exit()\n else:\n print(-1)\n\n\nif __name__ == \'__main__\':\n main()\n'] | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s176436818', 's276924799', 's400059367', 's449677732', 's528399523', 's742616737'] | [3064.0, 3188.0, 3064.0, 3192.0, 3064.0, 3064.0] | [18.0, 19.0, 18.0, 18.0, 18.0, 19.0] | [865, 876, 811, 580, 898, 731] |
p02761 | u636251914 | 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 numpy as np\n\nN, M = [int(_) for _ in input().split()]\nS, C = np.array([[int(_) for _ in input().split()] for i in range(M)]).T\n\nprint("no")\n# ans = [-1] * N\n\n\n# j = int(S[i]) - 1\n# if ans[j] == -1 or ans[j] == C[i]:\n# ans[j] = C[i]\n# else:\n# print("-1")\n# sys.exit()\n\n# if ans[0] == -1:\n# ans[0] = 1\n\n\n# if ans[i] == -1:\n# ans[i] = 0\n\n# s = "".join(map(str, ans))\n\n# if int(s) == 0:\n# print("-1")\n# else:\n# print(s)\n', 'import sys\n\nN, M = [int(_) for _ in input().split()]\nSC = [[int(_) for _ in input().split()] for i in range(M)]\n\nif N == 1:\n start = 0\n end = 10\nelse:\n start = 10 ** (N - 1)\n end = 10 ** N\n\nfor i in range(start, end):\n ans = list(map(int, str(i)))\n valid = True\n for s, c in SC:\n if ans[s-1] != c:\n valid = False\n break\n if valid:\n print(i)\n sys.exit()\n\nprint(-1)\n'] | ['Runtime Error', 'Accepted'] | ['s484015344', 's824370296'] | [27052.0, 9132.0] | [116.0, 30.0] | [537, 431] |
p02761 | u638282348 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['N, M = map(int, input().split())\nans = [None] * N\nfor _ in range(M):\n s, c = map(int, input().split())\n if ans[s - 1] in [None, c]:\n ans[s - 1] = c\n else:\n print(-1)\n quit()\n\nans = "".join(map(lambda i, n :str(n) if n else "0" if i else "1", enumerate(ans)))\nif N > 1 and ans[0] == "0":\n print(-1)\n quit()\n\nprint(ans)\n', 'N, M = map(int, input().split())\nans = [None] * N\nfor _ in range(M):\n s, c = map(int, input().split())\n if ans[s - 1] in [None, c]:\n ans[s - 1] = c\n else:\n print(-1)\n quit()\n\nans = "".join(map(lambda pair :str(pair[1]) if pair[1] != None else "0" if pair[0] or N == 1 else "1", enumerate(ans)))\nif N > 1 and ans[0] == "0":\n print(-1)\n quit()\n\nprint(ans)\n'] | ['Runtime Error', 'Accepted'] | ['s557886522', 's295189885'] | [3060.0, 3064.0] | [17.0, 17.0] | [354, 390] |
p02761 | u640603056 | 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)]\nans="-1"\ntmp=0\nfor i in range(0,1000):\n\ts = str(\'{:0=3}\'.format(i))\n\tfor j in range(M):\n\t\tif sc[j][0]==1 and sc[j][1] == 0:\n\t\t\tprint(-1)\n\t\t\texit()\n\t\tif s[len(s)-N+sc[j][0]-1]!=str(sc[j][1]):\n\t\t\tbreak\n\telse:\n\t\tif s[0]=="0":\n\t\t\ts=str(int(s)+100)\n\t\t\tans=s\n\t\tbreak\nprint(ans)\n', 'N, M = map(int, input().split())\nsc = [list(map(int, input().split()))for i in range(M)]\nans="-1"\ntmp=0\nfor i in range(0,10**N):\n\tif N>2:\n\t\ts = str(\'{:0=3}\'.format(i))\n\telif N>1:\n\t\ts = str(\'{:0=2}\'.format(i))\n\telse:\n\t\ts = str(i)\n\t#print(s)\n\tfor j in range(M):\n\t\tif s[sc[j][0]-1]!=str(sc[j][1]):\n\t\t\tbreak\n\telse:\n\t\tif N>0 and s[0]!="0" or N==1:\n\t\t\tans=s\n\t\t\tbreak\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s574962445', 's917336822'] | [3064.0, 3064.0] | [19.0, 19.0] | [361, 371] |
p02761 | u640922335 | 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())\nINF=10**18\nA=[INF]*N\nans=0\nfor _ in range(M):\n s,c=map(int,input().split())\n s-=1\n if A[s]==INF:\n A[s]=c\n else:\n if A[s]!=c:\n print(-1)\n exit()\n else:\n continue\n\nif A[0]==0:\n print(-1)\n exit()\nelif A[0]==INF:\n A[0]=1\n\nfor num in A:\n if num==INF:\n num=0\n \nA=[str(a) for a in A]\nprint(''.join(A))", "N,M=map(int,input().split())\nINF=10**18\nA=[INF]*N\nans=0\nfor _ in range(M):\n s,c=map(int,input().split())\n s-=1\n if A[s]==INF:\n A[s]=c\n else:\n if A[s]!=c:\n print(-1)\n exit()\n else:\n continue\n\nif N==1:\n if A[0]==INF:\n A[0]=0\nelse: \n if A[0]==0:\n print(-1)\n exit()\n elif A[0]==INF:\n A[0]=1\n\n for num in A:\n if num==INF:\n num=0\n \nA=[str(a) for a in A]\nprint(''.join(A))", "N,M=map(int,input().split())\nINF=10**18\nA=[INF]*N\nans=0\nif M>=1:\n for _ in range(M):\n s,c=map(int,input().split())\n s-=1\n if A[s]==INF:\n A[s]=c\n else:\n if A[s]!=c:\n print(-1)\n exit()\n else:\n continue\n\nif N==1:\n if A[0]==INF:\n A[0]=0\nelse: \n if A[0]==0:\n print(-1)\n exit()\n elif A[0]==INF:\n A[0]=1\n\n for num in A:\n if num==INF:\n num=0\n \nA=[str(a) for a in A]\nprint(''.join(A))", 'N,M=map(int,input().split())\nA=[]\nif M==0:\n if N==1:\n print(0)\n exit()\n elif N==2:\n print(10)\n exit()\n else:\n print(100)\n exit()\n \nelse:\n for _ in range (M):\n s,c=map(int,input().split())\n A.append([s,c])\n\n for i in range(1000):\n i=str(i)\n if len(i)!=N:\n continue\n ans=0\n for X in A:\n x=X[0]\n y=X[1]\n x-=1\n if i[x]!=str(y):\n ans=1\n break\n else:\n continue\n if ans==0:\n print(i)\n exit()\nprint(-1)\n '] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s228760200', 's231046159', 's384490498', 's214384739'] | [9224.0, 9200.0, 9232.0, 9216.0] | [29.0, 26.0, 27.0, 28.0] | [415, 499, 552, 645] |
p02761 | u641460756 | 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\ne = []\nfor i in range(m):\n si, ci = map(int, input().split())\n e += [[si, ci]]\n for j in range(len(e)):\n if e[j][0] == si and e[j][1] != ci:\n print(-1)\n exit()\n ans[si - 1] = ci\nif len(ans) == 1 and ans[0] == 0:\n print(0)\n exit()\nelif len(ans) != 1 and ans[0] == 0:\n ans[0] = 1\nfor i in range(len(e)):\n if (e[i][0] == 1 and e[i][1] == 0 ans not (len(ans) == 1)):\n print(-1)\n exit()\nans = map(str, ans)\nprint("".join(ans))', 'n, m = map(int, input().split())\nans = [0] * n\ne = []\nfor i in range(m):\n si, ci = map(int, input().split())\n e += [[si, ci]]\n for j in range(len(e)):\n if e[j][0] == si and e[j][1] != ci:\n print(-1)\n exit()\n if si == 1 and ci == 0 and n != 1:\n print(-1)\n exit()\n ans[si - 1] = ci\nif len(ans) == 1 and ans[0] == 0:\n print(0)\n exit()\nelif len(ans) != 1 and ans[0] == 0:\n ans[0] = 1\nans = map(str, ans)\nprint("".join(ans))'] | ['Runtime Error', 'Accepted'] | ['s264338464', 's647044498'] | [3064.0, 3064.0] | [18.0, 18.0] | [535, 486] |
p02761 | u643679148 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["n, m = map(int, input().split())\nsc = []\nfor i in range(m):\n sc.append(tuple(map(int, input().split())))\n\n\nfor i in range(10**(n-1), 10**n):\n s = str(i)\n flag = True\n if len(s) == n and all([s[sc[j][0]-1] == str(sc[j][1]) for j in range(m))]:\n print(s)\n exit(0)\n\n\nprint('-1')\n\n\n#\n\n# if list(zip(*sc))[0].count(i) > 1:\n# print('-1')\n# exit(0)\n#\n#\n# if min(list(zip(*sc))[0]) != 1:\n# print('-1')\n# exit(0)\n#\n\n# if i[0] == 1 and i[1] == 0 and n > 1:\n# print('-1')\n# exit(0)\n#\n\n\n# ind, val = i[0]-1, i[1]\n# if ans[ind] != 0:\n# ans[ind] = min(ans[ind], val)\n# else:\n# ans[ind] = val\n#\n#print(''.join(list(map(str, ans))))\n", "n, m = map(int, input().split())\nsc = []\nfor i in range(m):\n sc.append(list(map(int, input().split())))\n\nfor i in range(1, n+1):\n if list(zip(*sc))[0].count(i) > 1:\n print('-1')\n exit(0)\n\nfor i in sc:\n if i[0] == 1 and i[1] == 0 and n > 1:\n print('-1')\n exit(0)\n\n\nans = [0, 0, 0]\nfor i in sc:\n ind, val = i[0]-1, i[1]\n if ans[ind] != 0:\n ans[ind] = min(ans[ind], val)\n else:\n ans[ind] = val\n\nprint(''.join(list(map(str, ans))))\n", "n, m = map(int, input().split())\nsc = []\nfor i in range(m):\n sc.append(tuple(map(int, input().split())))\n\n\nfor i in range(10**(n-1), 10**n):\n s = str(i)\n flag = True\n if len(s) == n and all([s[sc[j][0]-1] == str(sc[j][1])] for j in range(m)):\n print(s)\n exit(0)\n\n\nprint('-1')\n\n\n#\n\n# if list(zip(*sc))[0].count(i) > 1:\n# print('-1')\n# exit(0)\n#\n#\n# if min(list(zip(*sc))[0]) != 1:\n# print('-1')\n# exit(0)\n#\n\n# if i[0] == 1 and i[1] == 0 and n > 1:\n# print('-1')\n# exit(0)\n#\n\n\n# ind, val = i[0]-1, i[1]\n# if ans[ind] != 0:\n# ans[ind] = min(ans[ind], val)\n# else:\n# ans[ind] = val\n#\n#print(''.join(list(map(str, ans))))\n", "n, m = map(int, input().split())\nsc = []\nfor i in range(m):\n sc.append(list(map(int, input().split())))\n\n\nfor i in range(10**n):\n s = str(i)\n if len(s) == n and all([s[sc[j][0]-1] == str(sc[j][1]) for j in range(m)]):\n print(s)\n exit(0)\n\n\nprint('-1')\n\n\n#\n\n# if list(zip(*sc))[0].count(i) > 1:\n# print('-1')\n# exit(0)\n#\n#\n# if min(list(zip(*sc))[0]) != 1:\n# print('-1')\n# exit(0)\n#\n\n# if i[0] == 1 and i[1] == 0 and n > 1:\n# print('-1')\n# exit(0)\n#\n\n\n# ind, val = i[0]-1, i[1]\n# if ans[ind] != 0:\n# ans[ind] = min(ans[ind], val)\n# else:\n# ans[ind] = val\n#\n#print(''.join(list(map(str, ans))))\n"] | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s048140960', 's151987647', 's977408402', 's657379117'] | [8908.0, 9236.0, 9192.0, 9048.0] | [25.0, 27.0, 29.0, 28.0] | [775, 488, 775, 747] |
p02761 | u645487439 | 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 = ['X'] * n\n\ndef ans():\n return 0 if n == 1 and m == 0\n for i in range(m):\n set = list(map(str, input().split()))\n if set[0] == '1' and set[1] == '0' and n != 1:\n return -1\n else:\n if num_list[int(set[0]) - 1] == 'X':\n num_list[int(set[0]) - 1] = set[1]\n elif num_list[int(set[0]) - 1] == set[1]:\n continue\n else:\n return -1\n\n for i in range(n):\n if num_list[i] == 'X':\n num_list[i] = '1' if i == 0 else '0'\n\n return ''.join(num_list)\n\nprint(ans())\n", "n, m = map(int, input().split())\nnum_list = ['X'] * n\n\ndef ans():\n if n == 1 and m == 0:\n return 0\n for i in range(m):\n set = list(map(str, input().split()))\n if set[0] == '1' and set[1] == '0' and n != 1:\n return -1\n else:\n if num_list[int(set[0]) - 1] == 'X':\n num_list[int(set[0]) - 1] = set[1]\n elif num_list[int(set[0]) - 1] == set[1]:\n continue\n else:\n return -1\n\n for i in range(n):\n if num_list[i] == 'X':\n num_list[i] = '1' if i == 0 else '0'\n\n return ''.join(num_list)\n\nprint(ans())\n"] | ['Runtime Error', 'Accepted'] | ['s538728830', 's990969611'] | [2940.0, 3064.0] | [17.0, 17.0] | [631, 640] |
p02761 | u646110634 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['import sys\nN, M = map(int, input().split())\n\nnum = []\nfor i in range(N) :\n num.append([0])\n\nsc = []\nfor i in range(M) :\n sc.append(list(map(int, input().split()))) \n\nans = ""\n\nfor n in sc :\n if n[1] not in num[n[0]-1] :\n num[n[0]-1].append(n[1])\n\nif N >= and [1, 0] in sc :\n print(\'-1\')\n sys.exit()\nelif N >= 2 and num[0] == [0] :\n num[0].append(1)\n\nfor m in num :\n if len(m) >= 3 :\n print(\'-1\')\n sys.exit()\n\nif len(num[0]) == 1 :\n print(\'-1\')\n sys.exit()\nelse :\n for l in range(N) :\n ans = ans + str(max(num[l]))\n\nprint(ans)', 'import sys\nN, M = map(int, input().split())\n\nnum = []\nfor i in range(N) :\n num.append([0])\n\nsc = []\nfor i in range(M) :\n sc.append(list(map(int, input().split()))) \n\nans = ""\n\nfor n in sc :\n if n[1] not in num[n[0]-1] :\n num[n[0]-1].append(n[1])\n\nif N >= 2 and [1, 0] in sc :\n print(\'-1\')\n sys.exit()\nelif N == 1 and num[0] == [0] :\n print(\'0\')\n sys.exit() \nelif N >= 2 and num[0] == [0] :\n num[0].append(1)\n\nfor m in num :\n if len(m) >= 3 :\n print(\'-1\')\n sys.exit()\n\nif len(num[0]) == 1 :\n print(\'-1\')\n sys.exit()\nelse :\n for l in range(N) :\n ans = ans + str(max(num[l]))\n\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s945887857', 's718869546'] | [2940.0, 3064.0] | [17.0, 19.0] | [547, 609] |
p02761 | u651109406 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["n, m = map(int, input().split())\ns, c = [], []\nfor i in range(m):\n a, b = map(int, input().split())\n s.append(a), c.append(b)\n\nans = [0 for i in range(n)]\nb = 0\n\nfor i in range(m):\n if ans[s[i] - 1] == c[i]:\n ans[s[i] - 1] = c[i]\n else:\n print('-1')\n break\n\n if i == m - 1:\n # print(ans)\n for j in range(n):\n b += ans[n - j - 1] * (10 ** j)\n if b >= 10 ** (n - 1) and b <= (10 ** n) - 1:\n print(''.join(map(str, ans)))\n else:\n print('-1')\n", "n, m = map(int, input().split())\ns, c = [], []\nfor i in range(m):\n a, b = map(int, input().split())\n s.append(a), c.append(b)\n \nans = [0, 0, 0]\nfor i in range(m):\n if ans[s[i] - 1] == 0 or ans[s[i] - 1] == c[i]:\n ans[s[i] - 1] = c[i]\n else:\n print('-1')\n break\n\n if i == m - 1 and ans[0] * 100 + ans[1] * 10 + ans[2] > 10 ** n - 1:\n print(''.join(map(str, ans)))\n\n else:\n print('-1')\n", "s, c = [], []\nfor i in range(m):\n a, b = map(int, input().split())\n s.append(a), c.append(b)\n\ndicts = {}\n\nans = [0 for i in range(n)]\nb = 0\n\nfor i in range(m):\n if s[i] not in dicts:\n dicts[s[i]] = c[i]\n elif s[i] in dicts and dicts[s[i]] != c[i]:\n print('-1')\n break\n\n\n if i == m - 1:\n for j in range(n + 1):\n if j in dicts:\n ans[j - 1] = dicts[j]\n # print(ans)\n for j in range(n):\n b += ans[n - j - 1] * (10 ** j)\n \n if b >= 10 ** (n - 1) and b <= (10 ** n) - 1:\n print(b)\n else:\n print('-1')\n", "n, m = map(int, input().split())\ns, c = [], []\nfor i in range(m):\n a, b = map(input().split())\n s.append(a), c.append(b)\nloop = True\n\nfor i in range(10 ** (n - 1), 10 ** n):\n string = str(i)\n for j in range(m):\n if string[s[j] - 1] != c[j]:\n break\n if j == m - 1:\n print(string)\n loop = False\n if loop == False:\n break\n if i == 10 ** n - 1:\n print('-1')\n ", "n, m = map(int, input().split())\ns, c = [], []\nfor i in range(m):\n a, b = map(int, input().split())\n s.append(a), c.append(b)\n\ndicts = {}\n\nans = [0 for i in range(n)]\nb = 0\n\nfor i in range(m):\n if s[i] == 1 and c[i] == 0:\n print('-1')\n break\n if s[i] not in dicts:\n dicts[s[i]] = c[i]\n elif s[i] in dicts and dicts[s[i]] != c[i]:\n print('-1')\n break\n\n if i == m - 1:\n for j in range(n + 1):\n if j in dicts:\n ans[j - 1] = dicts[j]\n # print(ans)\n for j in range(n):\n b += ans[n - j - 1] * (10 ** j)\n print(b)\n if b >= 10 ** (n - 1) and b <= (10 ** n) - 1:\n print(b)\n elif b == 0 and n == 1:\n print(b)\n else:\n print(b + 10 ** (n - 1)) ", "n, m = map(int, input().split())\ns, c = [], []\nfor i in range(m):\n a, b = map(int, input().split())\n s.append(a), c.append(b)\n\n\nfor i in range(0, 10 ** n):\n loop = True\n string = str(i)\n if len(string) != n:\n continue\n for j in range(m):\n if string[s[j] - 1] != str(c[j]):\n loop = False\n if loop:\n print(string)\n exit()\n\nprint('-1')"] | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s007863670', 's367766198', 's464931098', 's823616670', 's918108454', 's596188864'] | [3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0] | [18.0, 19.0, 18.0, 18.0, 17.0, 18.0] | [535, 440, 632, 441, 807, 392] |
p02761 | u652522621 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["import numpy as np\nN = []\nFLAGS = True\nfor i in range(3):\n N1 = list(map(int, input().split(' ')))\n N.append(N1)\n\nN = np.array(N)\n\nM = int(input())\n\nfor i in range(M):\n a = int(input())\n \n for j in range(3):\n for k in range(3):\n if N[j, k] == a:\n N[j, k] = 0\n if (np.all(N == 0, axis = 0).any(0)) or (np.all(N == 0, axis = 1).any(0)) or (np.all(np.diag(N) == 0).any(0)) or (np.all(np.diag(N) == 0).any(0)):\n #if (N[0, :].all() == 0) or (N[1, :].all() == 0) or (N[2, :].all() == 0) or (N[:, 0].all() == 0) or (N[:, 1].all() == 0) or (N[:, 2].all() == 0) or (np.diag(N).all() == 0) or (np.diag(np.transpose(N)).all() == 0):\n print('Yes')\n FLAGS = True\n break\n else:\n FLAGS = False\n continue\n \nif FLAGS == False: \n print('No')\n \n ", "N, M = map(int, input().split(' '))\n\ns_old = []\ns_c_old =[]\nresult = 0\nFLAGS = True\nfor i in range(M):\n s, c = map(int, input().split(' '))\n\n if (N != 1) & (s == 1) & (c == 0):\n print('-1')\n FLAGS = False\n break\n elif (s in s_old):\n if ([s,c] in s_c_old):\n s_old.append(s)\n s_c_old.append([s,c])\n else:\n print('-1')\n FLAGS = False\n break\n else:\n result += c*10**(N - s)\n s_old.append(s)\n s_c_old.append([s,c])\n\nif (N == 1) and (M == 0):\n result = 0\nelif 1 in s_old:\n result = result\n#elif N != 1:\nelse:\n result += 1*10**(N - 1)\n \nif FLAGS == True:\n print(result)\n\n"] | ['Runtime Error', 'Accepted'] | ['s100461981', 's344759706'] | [12504.0, 3192.0] | [153.0, 18.0] | [862, 622] |
p02761 | u652583512 | 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] = input().split()\n\nans = -1\nfor i in range(10 * (N - 1) + 1, 10 * N):\n for s, c in zip(S, C):\n if not str(i)[int(s) - 1] == c:\n break\n else:\n ans = i\n break\n if not ans == -1:\n break\n', "N, M = map(int, input().split())\n\nK = [0, -1, -1, -1]\nans = -1\nfor i in range(M):\n s, c = map(int, input().split())\n if not N == 1 and s == 1 and c == 0:\n break\n if K[s] >= 0 and not K[s] == c:\n break\n K[s] = c\nelse:\n if K[1] == -1 and N >= 2:\n K[1] = 1\n if K[1] == -1 and N == 1:\n K[1] = 0\n if K[2] == -1:\n K[2] = 0\n if K[3] == -1:\n K[3] = 0\n\n ans = ''.join(map(str, K[1:N + 1]))\n\nprint(ans)\n"] | ['Runtime Error', 'Accepted'] | ['s208810912', 's320193247'] | [3060.0, 3064.0] | [17.0, 17.0] | [324, 462] |
p02761 | u656391577 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["import sys\ninput = sys.stdin.readline\n\ndef main():\n\n N, M = map(int, input().split())\n Set = []\n for i in range(M):\n Set.append(list(map(int, input().split())))\n\n for i in range(10**N):\n num = str(i)\n if len(i) == N and all(num[s-1]==str(c) for s,c in Set):\n print(i)\n break\n else:\n print(-1)\n\n\nif __name__ == '__main__':\n main()", "import sys\ninput = sys.stdin.readline\n\ndef main():\n\n N, M = map(int, input().split())\n Set = [list(map(int,input().split())) for i in range(M)]\n\n for i in range(10**N):\n num = str(i)\n if len(num) == N and all(num[s-1]==str(c) for s,c in Set):\n print(i)\n break\n else:\n print(-1)\n\n\nif __name__ == '__main__':\n main()"] | ['Runtime Error', 'Accepted'] | ['s800414380', 's199852668'] | [3064.0, 3064.0] | [18.0, 18.0] | [397, 372] |
p02761 | u658801777 | 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())\nr = list([None]*N)\nfor i in range(M):\n s, c = map(int, input().split())\n if r[s-1] is not None:\n print("-1")\n exit()\n r[s-1] = c\n\nif N > 1 and r[0] == 0:\n print("-1")\n exit()\n\nfor i in range(len(r)):\n if r[i] is None:\n if N > 1 and i == 0:\n r[i] = 1\n else:\n r[i] = 0\n\nprint("".join(map(str, r)))', 'N, M = map(int, input().split())\nr = list([None]*N)\nfor i in range(M):\n s, c = map(int, input().split())\n if r[s-1] is not None and r[s-1] != c:\n print("-1")\n exit()\n r[s-1] = c\n\nif N > 1 and r[0] == 0:\n print("-1")\n exit()\n\nfor i in range(len(r)):\n if r[i] is None:\n if N > 1 and i == 0:\n r[i] = 1\n else:\n r[i] = 0\n\nprint("".join(map(str, r)))'] | ['Wrong Answer', 'Accepted'] | ['s363971868', 's317604268'] | [3064.0, 3064.0] | [18.0, 19.0] | [404, 420] |
p02761 | u658915215 | 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\nfor i in range(m):\n s, c = map(int,input().split())\n if s == 1 and c == 0 and n != 1:\n print(-1)\n break\n if ans[s-1] != '0' and c != ans[s-1]:\n print(-1)\n break\n ans[s-1] = c\nelse:\n if n == 1 and int(ans[0]) == 0:\n print(0)\n break\n elif ans[0] == '0':\n ans[0] = '1'\n ans = map(str, ans)\n print(''.join(ans))", "n, m = map(int, input().split())\nans = ['0'] * n\nfor i in range(m):\n s, c = map(int,input().split())\n if s == 1 and c == 0 and n != 1:\n print(-1)\n break\n if ans[s-1] != '0' and c != ans[s-1]:\n print(-1)\n break\n ans[s-1] = c\nelse:\n if n == 1 and int(ans[0]) == 0:\n print(0)\n exit()\n elif ans[0] == '0':\n ans[0] = '1'\n ans = map(str, ans)\n print(''.join(ans))"] | ['Runtime Error', 'Accepted'] | ['s878957609', 's490296732'] | [9172.0, 9120.0] | [24.0, 34.0] | [429, 430] |
p02761 | u661439250 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["n, m = map(int, input().split())\nn_list = []\nfor i in range(n):\n n_list.append(0)\n\nfor i in range(m):\n s, c = map(int, input().split())\n n_list[s-1] = c\nans_list = map(str, n_list)\nans = ''.join(ans_list)\nprint(ans[::-1])", 'n,m = map(int, input().split()) \nsc = [list(map(int, input().split())) for _ in range(m)]\ndef check(num):\n num_str = str(num)\n if len(num_str) != n:\n return False\n for s, c in sc:\n if num_str[s-1] != str(c):\n return False\n return True\n\nfor i in range(1000):\n if check(i):\n \tprint(i)\n \texit()\n\nprint(-1)\n'] | ['Wrong Answer', 'Accepted'] | ['s211847417', 's363942341'] | [3060.0, 2940.0] | [19.0, 18.0] | [230, 351] |
p02761 | u663710122 | 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\nres = ['x' for _ in range(N)]\n\nfor i in range(M):\n s, c = map(int, input().split())\n\n if s == 1 and c == 0:\n print(-1)\n exit()\n elif res[s-1] == 'x' or res[s-1] == str(c):\n res[s-1] = str(c)\n else:\n print(-1)\n exit()\n\nr = ''.join(res)\nprint(int(r.replace('x', '1')))\n", 'N, M = map(int, input().split())\n\nQ = [list(map(int, input().split())) for _ in range(M)]\n\nif M == 0:\n if N == 1:\n print(0)\n else:\n print(10**(N-1))\n exit()\n\nfor i in range(10 ** (N - 1), 10 ** N):\n t = list(str(i))\n\n f = True\n for s, c in Q:\n f &= t[s - 1] == str(c)\n\n if f:\n print(i)\n exit()\n\nif N == 1:\n f = True\n for _, c in Q:\n f &= c == 0\n\n if f:\n print(0)\n exit()\n\nprint(-1)\n'] | ['Wrong Answer', 'Accepted'] | ['s327902098', 's904801112'] | [3064.0, 3064.0] | [17.0, 18.0] | [348, 468] |
p02761 | u667084803 | 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_str = str(N)\nflag = 1\nkettei = [-1 for i in range(N)]\nfor i in range(M):\n s, c = map(int, input().split())\n if kettei[s-1] == -1:\n kettei[s-1] = c\n elif kettei[s-1] != c:\n flag = 0\nif kettei[0] == 0 :\n flag = 0\n \nans = ""\n\nfor i in range(N):\n if kettei[i] == -1:\n ans += "1"\n else:\n ans += kettei[i]\nif flag:\n print(ans)\nelse:\n print(-1)', 'N, M = map(int, input().split())\n\nS, C = [], []\nfor i in range(M):\n s, c = map(int, input().split())\n S += [s-1]\n C += [str(c)]\n \nif N == 1:\n for i in range(10):\n flag = 1\n for m in range(M):\n if i_str[S[m]] != C[m]:\n flag = 0\n break\n if flag:\n print(i)\n break\n else:\n print(-1) \nelse:\n for i in range(10**(N-1), 10**N):\n flag = 1\n i_str = str(i)\n for m in range(M):\n if i_str[S[m]] != C[m]:\n flag = 0\n break\n if flag:\n print(i)\n break\n else:\n print(-1)', 'N, M = map(int, input().split())\n\nS, C = [], []\nfor i in range(M):\n s, c = map(int, input().split())\n S += [s-1]\n C += [str(c)]\n \nif N == 1:\n for i in range(10):\n flag = 1\n for m in range(M):\n if str(i) != C[m]:\n flag = 0\n break\n if flag:\n print(i)\n break\n else:\n print(-1) \nelse:\n for i in range(10**(N-1), 10**N):\n flag = 1\n i_str = str(i)\n for m in range(M):\n if i_str[S[m]] != C[m]:\n flag = 0\n break\n if flag:\n print(i)\n break\n else:\n print(-1)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s049814055', 's423546468', 's611571062'] | [3064.0, 2940.0, 3064.0] | [17.0, 17.0, 18.0] | [395, 544, 541] |
p02761 | u669812251 | 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\nN, M = [int(i) for i in input().split()]\n\nS = []\nfor i in range(M):\n S.append([int(i) for i in input().split()])\n\nanswer = "0" * N\n\nfor s in S:\n if answer[int(s[0])-1] != s[1]:\n print(-1)\n else:\n answer = answer[:int(s[0])-1] + str(s[1]) + answer[int(s[0]):]\nif answer[0] == "0":\n print(-1)\nelse:\n print(answer)\n', '# -*- coding: utf-8 -*-\ndef main():\n N, M = [int(i) for i in input().split()]\n\n S = []\n for i in range(M):\n S.append([int(i) for i in input().split()])\n\n answer = "0" * N\n\n for s in S:\n if answer[int(s[0])-1] == "0":\n answer = answer[:int(s[0])-1] + str(s[1]) + answer[int(s[0]):]\n #print(answer)\n elif answer[int(s[0])-1] != str(s[1]):\n #print(answer)\n print(-1)\n return\n else:\n continue\n\n if answer[0] == "0" && len(answer) != 1:\n print(-1)\n else:\n print(answer)\n\nif __name__ == "__main__":\n main()\n', '# -*- coding: utf-8 -*-\ndef main():\n N, M = [int(i) for i in input().split()]\n\n S = []\n for i in range(M):\n S.append([int(i) for i in input().split()])\n\n S.sort(reverse=True)\n #print(S)\n answer = "0" * N\n if N != 1 and [1, 0] in S:\n print(-1)\n return\n\n for s in S:\n if answer[int(s[0])-1] == "0":\n answer = answer[:int(s[0])-1] + str(s[1]) + answer[int(s[0]):]\n #print(answer)\n elif answer[int(s[0])-1] != str(s[1]):\n #print(answer)\n print(-1)\n return\n else:\n continue\n\n if answer[0] == "0" and len(answer) != 1:\n print("1" + answer[1:])\n else:\n print(answer)\n\nif __name__ == "__main__":\n main()\n'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s213696657', 's386987245', 's920428846'] | [3188.0, 3064.0, 3064.0] | [18.0, 18.0, 18.0] | [367, 634, 752] |
p02761 | u674052742 | 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"""\nCreated on Wed Mar 4 01:52:13 2020\n\n@author: Kanaru Sato\n"""\n\nN,M = list(map(int, input().split()))\nsc = []\n[sc.append(list(map(int, input().split()))) for i in range(0, M)]\n\nfound_flag = 0\n\nfor i in range(10**(N-1),10**N): \n str_num = str(i)\n flag_i = 0\n for j in range(0,M):\n if int(str_num[sc[j][0]-1]) == sc[j][1]:\n flag_i += 1\n print(flag_i)\n if flag_i == M:\n found_flag = 1\n int_num = i\n break\n\nif N == 1:\n str_num = "0"\n flag_i = 0\n for j in range(0,M):\n if int(str_num[sc[j][0]-1]) == sc[j][1]:\n flag_i += 1\n if flag_i == M:\n found_flag = 1\n int_num = 0\n\nif found_flag == 0:\n print("-1")\nelif found_flag == 1:\n print(int_num)', '# -*- coding: utf-8 -*-\n"""\nCreated on Wed Mar 4 01:52:13 2020\n\n@author: Kanaru Sato\n"""\n\nN,M = list(map(int, input().split()))\nsc = []\n[sc.append(list(map(int, input().split()))) for i in range(0, M)]\n\nfound_flag = 0\n\nfor i in range(10**(N-1),10**N): \n str_num = str(i)\n flag_i = 0\n for j in range(0,M):\n if int(str_num[sc[j][0]-1]) == sc[j][1]:\n flag_i += 1\n if flag_i == M:\n found_flag = 1\n int_num = i\n break\n\nif N == 1:\n str_num = "0"\n flag_i = 0\n for j in range(0,M):\n if int(str_num[sc[j][0]-1]) == sc[j][1]:\n flag_i += 1\n if flag_i == M:\n found_flag = 1\n int_num = 0\n\nif found_flag == 0:\n print("-1")\nelif found_flag == 1:\n print(int_num)'] | ['Wrong Answer', 'Accepted'] | ['s997198561', 's395487022'] | [3064.0, 3188.0] | [18.0, 20.0] | [809, 783] |
p02761 | u674588203 | 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+1)\nfor i in range(M):\n s,c=map(int,input().split())\n if ans[s]==-1 :\n ans[s]=c\n elif ans[s]==c :\n pass\n else:\n print('-1')\n exit()\nif N>=2 and ans[1]==-1:\n print('-1')\n exit()\nelif N>=2 and ans[1]==0:\n print('-1')\n exit()\nelse:\n pass\n# FA=ans[1:]\n# FA=''.join(FA)\nfor a in ans:\n if a==-1:\n a=0\nFA=0\nfor j in range(len(ans)-1):\n FA+=10**j *ans[(-1)*(j+1)]\nprint(FA)", "N,M=map(int,input().split())\nans=[-1]*(N+1)\nfor i in range(M):\n s,c=map(int,input().split())\n if ans[s]==c :\n ans[s]=c\n elif ans[s]==-1 :\n ans[s]==c\n else:\n print('-1')\n exit()\nif N>1 and ans[1]==-1:\n print('-1')\n exit()\nelif N>1 and ans[1]==0:\n print('-1')\n exit()\nelse:\n pass\n# FA=ans[1:]\n# FA=''.join(FA)\nfor a in ans:\n if a==-1:\n a=0\nFA=0\nfor j in range(len(ans)-1):\n FA+=10**j *ans[(-1)*(j+1)]\nprint(FA)", "N,M=map(int,input().split())\nans=['A']*(N+1)\nfor i in range(M):\n s,c=map(str,input().split())\n s=int(s)\n if ans[s]=='A' or ans[s]==c :\n ans[s]=c\n else:\n print('-1')\n exit()\nif N>1 and ans[1]=='A':\n print('-1')\nFA=''.join(FA)\nFA=FA[1:]\nif FA.count('A')>0:\n print(FA.replace('A','0'))\nprint(int(FA))\n", "N,M=map(int,input().split())\nans=[-1]*(N+1)\nfor i in range(M):\n s,c=map(int,input().split())\n if ans[s]==-1 :\n ans[s]=c\n elif ans[s]==c :\n pass\n else:\n print('-1')\n exit()\n\nif N>=2 and ans[1]==0:\n print('-1')\n exit() \nelif N>=2 and ans[1]==-1: \n ans[1]==1\nelif N==1:\n if ans[1]==-1 0r ans[1]==0:\n print(0)\n\nelse:\n pass\n\nfor j in range(len(ans)):\n if ans[j] == -1:\n ans[j] = 0\n\nif N==1:\n FA=ans[-1]\nelif N==2:\n FA=10*ans[-2]+ans[-1]\nelse:\n FA=100*ans[-3]+10*ans[-2]+ans[-1]\nprint(FA)", "N,M=map(int,input().split())\nans=[-1]*(N+1)\nfor i in range(M):\n s,c=map(int,input().split())\n if ans[s]==c :\n ans[s]=c\n elif ans[s]==-1 :\n ans[s]==c\n else:\n print('-1')\n exit()\nif N>1 and ans[1]==-1:\n print('-1')\n exit()\nelse:\n pass\n# FA=ans[1:]\n# FA=''.join(FA)\nfor a in ans:\n if a==-1:\n a=0\nFA=0\nfor j in range(len(ans)-1):\n FA+=10**j *ans[(-1)*(j+1)]\nprint(FA)", "N,M=map(int,input().split())\nans=[-1]*(N+1)\nfor i in range(M):\n s,c=map(int,input().split())\n if ans[s]==c :\n ans[s]=c\n elif ans[s]==-1 :\n ans[s]==c\n else:\n print('-1')\n exit()\nif N>1 and ans[1]==-1:\n print('-1')\n exit()\nelse:\n pass\n# FA=ans[1:]\n# FA=''.join(FA)\nfor a in ans:\n if a==-1:\n a=0\nFA=0\nfor j in range(len(ans)-1):\n FA+=10**j *ans[(-1)*(j+1)]\nprint(FA)", "N,M=map(int,input().split())\nans=[-1]*(N+1)\nfor i in range(M):\n s,c=map(int,input().split())\n if ans[s]==c :\n ans[s]=c\n elif ans[s]==-1 :\n ans[s]==c\n else:\n print('-1')\n exit()\nif N>1 and ans[1]==-1:\n print('-1')\n exit()\nelse:\n pass\n# FA=ans[1:]\n# FA=''.join(FA)\nfor a in ans:\n if a==-1:\n a=0\nFA=0\nfor j in range(len(ans)-1):\n FA+=10**j *ans[(-1)*(j+1)]\nprint(FA)", "N,M=map(int,input().split())\nans=[-1]*(N+1)\nfor i in range(M):\n s,c=map(int,input().split())\n if ans[s]==c :\n ans[s]=c\n elif ans[s]==-1 :\n ans[s]==c\n else:\n print('-1')\n exit()\nif N>1 and ans[1]==-1:\n print('-1')\n exit()\nelse:\n pass\n# FA=ans[1:]\n# FA=''.join(FA)\nfor a in ans:\n if a==-1:\n a=0\nFA=0\nfor j in range(len(ans)-1):\n FA+=10**j *ans[(-1)*(j+1)]\nprint(FA)", "N,M=map(int,input().split())\nans=[-1]*(N+1)\nfor i in range(M):\n s,c=map(int,input().split())\n if ans[s]==-1 :\n ans[s]=c\n elif ans[s]==c :\n pass\n else:\n print('-1')\n exit()\n\nif N>=2 and ans[1]==0:\n print('-1')\n exit()\nelif N>=2 and ans[1]==-1: \n ans[1]=1\nelse:\n pass\n\nfor j in range(len(ans)):\n if ans[j] == -1:\n ans[j] = 0\n\nif N==1:\n FA=ans[-1]\nelif N==2:\n FA=10*ans[-2]+ans[-1]\nelse:\n FA=100*ans[-3]+10*ans[-2]+ans[-1]\nprint(FA)"] | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s268396058', 's348605363', 's376968624', 's398463033', 's640342064', 's784392894', 's894557928', 's971422462', 's091950862'] | [3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3188.0, 3064.0] | [17.0, 17.0, 18.0, 17.0, 17.0, 17.0, 17.0, 19.0, 18.0] | [473, 476, 337, 594, 425, 425, 425, 425, 528] |
p02761 | u678167152 | 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\ndef solve():\n N, M = map(int, input().split())\n d = defaultdict(lambda: -1)\n for i in range(M):\n x,y = map(int, input().split())\n if d[x]>=0 and d[x]!=y:\n return -1\n if N>1 and x==1 and y==0:\n return -1\n d[x] = y\n if N==1 and d[1]==-1:\n return 0\n if d[0]==-1:\n d[1] = 1\n for i in range(2,N+1):\n if d[i]==-1:\n d[i] = 0\n ans = ''\n for i in range(1,N+1):\n ans += str(d[i])\n return ans\nprint(solve())", "from collections import defaultdict\ndef solve():\n N, M = map(int, input().split())\n d = defaultdict(lambda: -1)\n for i in range(M):\n x,y = map(int, input().split())\n if d[x]>=0 and d[x]!=y:\n return -1\n if N>1 and x==1 and y==0:\n return -1\n d[x] = y\n if N==1 and d[1]==-1:\n return 0\n if d[1]==-1:\n d[1] = 1\n for i in range(2,N+1):\n if d[i]==-1:\n d[i] = 0\n ans = ''\n for i in range(1,N+1):\n ans += str(d[i])\n return ans\nprint(solve())"] | ['Wrong Answer', 'Accepted'] | ['s927307113', 's447504261'] | [9472.0, 9404.0] | [31.0, 34.0] | [480, 480] |
p02761 | u680851063 | 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 _ in range(m)]\n\np = [[],[],[]]\nfor i in range(m):\n if l[i][0]== 1:\n p[0].append(l[i][1])\n elif l[i][0]== 2:\n p[1].append(l[i][1])\n else:\n p[2].append(l[i][1])\n\n#print(p)\n\nif len(p[0]) == 0:\n p[0].insert(0,1)\n#print(p)\n\nfor j in range(len(p)):\n if len(p[j]) == 0:\n p[j].append(0)\n\n#print(p)\n\nif len(set(p[0])) > 1 or len(set(p[1])) > 1 or len(set(p[2])) > 1:\n print('-1')\n exit()\n\nq = []\nfor k in range(len(p)):\n q.append(str(p[k][0]))\n#print(q)\nif n = 1 and q[0] == '0':\n print(0)\n exit()\n \n\nif q[0] == '0':\n print('-1')\n exit()\n\nif q[0] == '0' and q[1] == '0':\n print('-1')\n exit()\n\nif q[0] == '0' and q[1] == '0' and q[2] == '0':\n print(0)\n exit()\n\nprint(''.join(q))\n\n", "n, m = map(int, input().split())\ns_c = [list(map(int, input().split())) for i in range(m)]\n\nfor i in range(0, 10**n):\n if len(str(i)) == n:\n tmp = '@' + str(i) # '@' Dummy \n for j in range(m):\n if tmp[s_c[j][0]] != str(s_c[j][1]):\n break\n else:\n print(i)\n exit()\nelse:\n print(-1)"] | ['Runtime Error', 'Accepted'] | ['s056326699', 's984543470'] | [3064.0, 3064.0] | [18.0, 18.0] | [825, 354] |
p02761 | u687135117 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["import numpy as np\n\n\nn,m= map(int, input().split())\n#print(n,m)\n\nA=[]\nfor i in range(0,m):\n input_1= list(map(int, input().split()))\n A.append(input_1)\n#print(A)\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\n\n\nB=get_unique_list(A)\n\n\nAnswer=0\ncount=0\nfor i in range(0,len(B)):\n Answer+=pow(10,n-B[i][0])*B[i][1]\n count+=pow(10,n-B[i][0])\n \nprint(count)\ncount1=[] \nfor i in range(1,len(str(count))):\n count1.append(count//(pow(10,i-1)))\nprint(count1)\n\ncount2=list(set(count1))\n\nfor i in range(0,len(count2)):\n if count2[i]==0 :#or count1!=1:\n del(count2[i])\n count2.append('')\n if count2[i]==1:\n del(count2[i])\n count2.append('')\n\ncount3=list(set(count2))\nprint(count3)\n\nif count3==['']:\n print(Answer)\nelse:\n print(-1)", 'import sys\nn,m = map(int, input().split())\nA = [list(map(int, input().split())) for _ in range(m)]\n \nb=[]\nfor i in range(0,m):\n \n if A[i][0]==1 and A[i][1]==0:\n print(-1)\n sys.exit()\n else:\n b.append(A[i][1]*pow(10,m-A[i][0]))\n\nif n>1:\n b.remove(0)\n \nb=list(set(b))\n \nc=[]\nfor i in range(len(b)):\n c.append(len(str(b[i])))\n \nc=list(set(c))\n\n\n \nif len(b)==len(c) and len(str(sum(b)))==n:\n print(sum(b))\nelse:\n print(-1)', 'import sys\nn,m = map(int, input().split())\nA = [list(map(int, input().split())) for _ in range(m)]\n\nif n>1:\n b=[pow(10,n-1)]\nelse:\n b=[0]\n \ncount=[]\nfor i in range(0,n):\n count.append(0)\n\ncount0=[]\nfor i in range(0,n):\n count0.append(0)\n\nfor i in range(0,m):\n b.append(A[i][1]*pow(10,n-A[i][0]))\n count[A[i][0]-1]+=1\n \n if A[i][1]==0:\n count0[A[i][0]-1]+=1\n\nfor i in range(0,n):\n if count0[i]!=0 and count0[i]!=count[i]:\n print(-1)\n sys.exit()\n\nif count[0]>0 and n>1:\n b.remove(pow(10,n-1))\nelif count[0]>0 and n<=1:\n b.remove(0)\n \nb=list(set(b))\n\nif n>1:\n b=[i for i in b if i != 0]\n\nc=[]\nfor i in range(len(b)):\n c.append(len(str(b[i])))\nc=list(set(c))\n\nif len(b)==len(c) and len(str(sum(b)))==n:\n print(sum(b))\nelse:\n print(-1)'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s190815632', 's734438062', 's435145754'] | [12436.0, 3064.0, 3192.0] | [151.0, 18.0, 18.0] | [953, 466, 1589] |
p02761 | u688219499 | 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()]\n\nA = []\nanswer=[0]*M\nfor i in range(M):\n A.append(list(map(int,input().split())))\nj=0\nfor i in range(M):\n if answer[int(A[i][0])-1] == 0:\n answer[int(A[i][0])-1] = int(A[i][1])\n elif answer[int(A[i][0])-1] == int(A[i][1]):\n answer[int(A[i][0])-1] = int(A[i][1])\n else:\n print(-1)\n j=j+1\n break\nseisu=0\nif answer[0]==0:\n j=j+1\n print(-1)\n\nif j==0:\n for i in range(M):\n seisu=answer[M-1-i]*(10**(M-i-1))+seisu\n print(seisu)\n', 'N,M =map(int,input().split())\nSC = [list(map(int,input().split())) for m in range(M)]\n\nfor i in range(1000):\n answer = str(i)\n if len(answer) == N and all( answer[s-1]==str(c) for s,c in SC):\n print(i)\n exit(0)\n\nprint(-1)'] | ['Runtime Error', 'Accepted'] | ['s790437377', 's442052824'] | [3064.0, 3060.0] | [17.0, 19.0] | [559, 241] |
p02761 | u688375653 | 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 input_int():\n return map(int, input().split())\n\ndef one_int():\n return int(input())\n\ndef one_str():\n return input()\n\ndef many_int():\n return list(map(int, input().split()))\n\nN,M = input_int()\n\ndata = []\nfor i in range(M):\n s,c = input_int()\n data.append([s,c])\n\noutput = [0 for i in range(N)]\n\ndef solve(N, data):\n mins = 100000000000\n for i in range(10**N):\n\n temp = str(i)\n flg = True\n for d in data:\n if temp[d[0]-1] != str(d[1]) and len(temp)==N:\n flg = False\n break\n if flg==True:\n return temp\n return -1\n\noutput = solve(N,data)\nprint(output)', 'def input_int():\n return map(int, input().split())\n\ndef one_int():\n return int(input())\n\ndef one_str():\n return input()\n\ndef many_int():\n return list(map(int, input().split()))\n\nN,M = input_int()\n\ndata = []\nfor i in range(M):\n s,c = input_int()\n data.append([s,c])\n\ndef solve(N, data):\n mins = 100000000000\n for i in range(10**N):\n\n temp = str(i)\n flg = True\n if len(temp)==N:\n for d in data:\n print(len(temp))\n\n if temp[d[0]-1] != str(d[1]):\n flg = False\n break\n if flg==True:\n return temp\n return -1\n\noutput = solve(N,data)\nprint(output)', 'def input_int():\n return map(int, input().split())\n\ndef one_int():\n return int(input())\n\ndef one_str():\n return input()\n\ndef many_int():\n return list(map(int, input().split()))\n\nN,M = input_int()\n\ndata = []\nfor i in range(M):\n s,c = input_int()\n data.append([s,c])\n\ndef solve(N, data):\n mins = 100000000000\n for i in range(10**N):\n\n temp = str(i)\n flg = True\n if len(temp)==N:\n for d in data:\n if temp[d[0]-1] != str(d[1]):\n flg = False\n break\n if flg==True:\n return temp\n return -1\n\noutput = solve(N,data)\nprint(output)'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s942725388', 's958123061', 's530422541'] | [3064.0, 3188.0, 3064.0] | [17.0, 19.0, 19.0] | [659, 692, 658] |
p02761 | u692453235 | 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+1)\nFlag = True\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 ans[s-1] == c:\n continue\n else:\n Flag = False\n\nif N > 1:\n if ans[0] == 0:\n Flag = False\n elif ans[0] == -1:\n ans[0] = 1\n \n ans = [0 if i == -1 else i for i in ans]\n\nans = ans[:N]\n\nif Flag:\n print(int("".join([str(i) for i in ans])))\nelse:\n print(-1)', 'N, M = map(int, input().split())\nans = ["0"] * (N)\nFlag = True\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 ans[s-1] == c:\n continue\n else:\n Flag = False\n\nif N > 1:\n if ans[0] == 0:\n Flag = False\n elif ans[0] == "0":\n ans[0] = 1\n\nif Flag:\n print(int("".join([str(i) for i in ans])))\nelse:\n print(-1)'] | ['Runtime Error', 'Accepted'] | ['s414747195', 's668341967'] | [3064.0, 3064.0] | [17.0, 17.0] | [488, 372] |
p02761 | u692515710 | 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\nN, M = map(int, input().split())\nNUMS = [list(map(int, input().split())) for _ in range(M)]\n\n\ndef solve():\n if M == 0:\n print("-1")\n return\n\n for n in range(10 ** (N - 1), 10 ** (N)):\n res = 0\n for s, c in NUMS:\n if str(n)[s - 1] == str(c):\n res += 1\n \n if res == M:\n print(n)\n return\n \n print("-1")', 'import sys\nimport math\nN, M = map(int, input().split())\nNUMS = [list(map(int, input().split())) for _ in range(M)]\n\n\ndef solve():\n for n in range(10 ** (N - 1) if N > 1 else 0, 10 ** (N)):\n res = 0\n for s, c in NUMS:\n if str(n)[s - 1] == str(c):\n res += 1\n \n if res == M:\n print(n)\n return\n \n print("-1")\n \nsolve()'] | ['Wrong Answer', 'Accepted'] | ['s020197812', 's043433307'] | [3064.0, 3060.0] | [18.0, 18.0] | [432, 410] |
p02761 | u692691139 | 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 pysnooper\n#import numpy\n\n#from collections import Counter,deque\n#from operator import itemgetter,mul\n#from itertools import accumulate,combinations,groupby,combinations_with_replacement,permutations\nfrom sys import stdin,setrecursionlimit\n\n#from copy import deepcopy\n#import heapq\n#import math\n#import string\n#from time import time\n#from functools import lru_cache,reduce\n#from math import factorial,hypot\n#import sys\n#from fractions import gcd\nsetrecursionlimit(10**6+1)\ninput=stdin.readline\n\nn,m=map(int,input().split())\nans=["" for _ in range(n)]\nfor _ in range(m):\n s,c=map(int,input().split())\n if ans[s-1]==c:\n continue\n elif ans[s-1]=="":\n ans[s-1]=c\n else:\n print(-1)\n exit()\nif ans[0]==0:\n print(-1)\n exit()\nfor i in range(n):\n if ans[i]=="":\n ans[i]=1\nprint("".join(ans)', '#import pysnooper\n#import numpy\n\n#from collections import Counter,deque\n#from operator import itemgetter,mul\n#from itertools import accumulate,combinations,groupby,combinations_with_replacement,permutations\nfrom sys import stdin,setrecursionlimit\n\n#from copy import deepcopy\n#import heapq\n#import math\n#import string\n#from time import time\n#from functools import lru_cache,reduce\n#from math import factorial,hypot\n#import sys\n#from fractions import gcd\nsetrecursionlimit(10**6+1)\ninput=stdin.readline\n\nn,m=map(int,input().split())\nans=["" for _ in range(n)]\nfor _ in range(m):\n s,c=map(int,input().split())\n if ans[s-1]==c:\n continue\n elif ans[s-1]=="":\n ans[s-1]=c\n else:\n print(-1)\n exit()\nif ans[0]==0:\n print(-1)\n exit()\nfor i in range(n):\n if ans[i]=="":\n ans[i]=1\nprint("".join(map(str,ans)))', '#import pysnooper\n#import numpy\n\n#from collections import Counter,deque\n#from operator import itemgetter,mul\n#from itertools import accumulate,combinations,groupby,combinations_with_replacement,permutations\nfrom sys import stdin,setrecursionlimit\n\n#from copy import deepcopy\n#import heapq\n#import math\n#import string\n#from time import time\n#from functools import lru_cache,reduce\n#from math import factorial,hypot\n#import sys\n#from fractions import gcd\nsetrecursionlimit(10**6+1)\ninput=stdin.readline\n\nn,m=map(int,input().split())\na=[list(map(int,input().split())) for _ in range(m)]\nfor i in range(1000):\n now=str(i)\n if len(now)!=n:\n continue\n ch=True\n for j in range(m):\n #print(now[a[j][0]-1],a[j][1])\n if int(now[a[j][0]-1])!=a[j][1]:\n ch=False\n break\n if ch:\n print(i)\n exit()\nprint(-1)'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s585129010', 's733460877', 's300613563'] | [3064.0, 3064.0, 3064.0] | [17.0, 18.0, 19.0] | [914, 924, 934] |
p02761 | u692746605 | 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=[-1 for _ in range(N)]\nfor m in range(M):\n s,c=map(int,input().split())\n if d[s-1]==-1:\n d[s-1]=c\n elif d[s-1]!=c:\n print(-1)\n exit()\n\nif N>1:\n\tif d[0]==0:\n print(-1)\n exit()\n elif d[0]==-1:\n \td[0]=1\n\nA=0\nfor i in range(N):\n A=A*10+(d[i] if d[i]!=-1 else 0)\n\nprint(A)\n', 'N,M=map(int,input().split())\nd=[-1 for _ in range(N)]\nfor m in range(M):\n s,c=map(int,input().split())\n if d[s-1]==-1:\n d[s-1]=c\n elif d[s-1]!=c:\n print(-1)\n exit()\n\nif N>1:\n if d[0]==0:\n print(-1)\n exit()\n elif d[0]==-1:\n \td[0]=1\n\nA=0\nfor i in range(N):\n A=A*10+(d[i] if d[i]!=-1 else 0)\n\nprint(A)\n'] | ['Runtime Error', 'Accepted'] | ['s809262058', 's092173844'] | [2940.0, 3064.0] | [18.0, 17.0] | [320, 321] |
p02761 | u695261159 | 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 x in range(m)]\n\nans = ['0']*(n+1)\nans[1] = '1'\nflg = 0\nfor i in range(m):\n print(sc[i][1])\n if ans[sc[i][0]] == '0' or int(ans[sc[i][0]]) >= sc[i][1]:\n if sc[i][1] != 0 and flg == 0:\n ans[sc[i][0]] = str(sc[i][1])\n flg = 1\n else:\n continue\n else:\n continue\nif ans[1] == '0' and len(ans) != 2:\n print(-1)\nelse:\n print(int(''.join(ans)))", "n,m=map(int, input().split())\nsc = [list(map(int, input().split())) for x in range(m)]\n\nans = ['0']*(n+1)\nflg = 0\nfor i in range(m):\n if ans[sc[i][0]] == '0':\n if sc[i][1] != 0:\n ans[sc[i][0]] = str(sc[i][1])\n if sc[i][0] == 1:\n flg = 1\n elif sc[i][0] == 1 and sc[i][1] == 0 and flg == 0:\n ans[sc[i][0]] = str(sc[i][1])\n flg = 1\n else:\n continue\n elif ans[sc[i][0]] == str(sc[i][1]):\n continue\n else:\n print(-1)\n exit()\nif flg == 0 and len(ans) != 2:\n ans[1] = '1'\n print(int(''.join(ans)))\nelif ans[1] == '0' and len(ans) != 2:\n print(-1)\nelse:\n print(int(''.join(ans)))\n"] | ['Wrong Answer', 'Accepted'] | ['s820489337', 's276505771'] | [3064.0, 3064.0] | [18.0, 18.0] | [476, 705] |
p02761 | u697386253 | 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 i in range(m)]\n\ncount = float('inf')\nif n == 3:\n for i in range(100, 1000):\n a = str(i)\n if all(int(a[s[j][0]-1]) == int(s[j][1]) for j in range(m)):\n if i < count:\n count = i\nelif n == 2:\n for i in range(10, 100):\n a = str(i)\n if all(int(a[s[j][0]-1]) == int(s[j][1]) for j in range(m)):\n if i < count:\n count = i\nelif n == 1:\n for i in range(0, 10):\n a = str(i)\n if all(int(a[s[j][0]-1]) == int(s[j][1]) for j in range(m)):\n if i < count:\n count = i\n\nif count == float('inf'):\n print(-1)\nelse:\n print(", "n,m = map(int, input().split())\ns = [list(map(int, input().split())) for i in range(m)]\n\ncount = float('inf')\nif n == 3:\n for i in range(100, 1000):\n a = str(i)\n if all(int(a[s[j][0]-1]) == int(s[j][1]) for j in range(m)):\n if i < count:\n count = i\nelif n == 2:\n for i in range(10, 100):\n a = str(i)\n if all(int(a[s[j][0]-1]) == int(s[j][1]) for j in range(m)):\n if i < count:\n count = i\nelif n == 1:\n for i in range(0, 10):\n a = str(i)\n if all(int(a[s[j][0]-1]) == int(s[j][1]) for j in range(m)):\n if i < count:\n count = i\n\nif count == float('inf'):\n print(-1)\nelse:\n print(count)\n"] | ['Runtime Error', 'Accepted'] | ['s006431216', 's066808843'] | [3064.0, 3188.0] | [17.0, 21.0] | [712, 719] |
p02761 | u697559326 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['N, M = map(int, input().split())\nsc = []\nfor _ in range(M):\n sc.append(list(map(int, input().split())))\n\nketa = [-1]*N\nflag = 0\nfor i in range(M):\n for j in range(1,N+1):\n print(i,j,sc[i][0], keta)\n if sc[i][0] == j:\n if keta[j-1] == -1:\n keta[j-1] = sc[i][1]\n elif keta[j-1] == sc[i][1]:\n continue\n else:\n flag = 1\n break\n if flag == 1:\n print(-1)\n break\n\nans = 0\nif flag == 0:\n if N == 3 and keta[0] == 0:\n print(-1)\n elif N == 2 and keta[0] == 0:\n print(-1)\n elif N == 3:\n if keta[0] == -1:\n keta[0] = 1\n if keta[1] == -1:\n keta[1] = 0\n if keta[2] == -1:\n keta[2] = 0\n print(keta[0]*100+keta[1]*10+keta[2])\n elif N == 2:\n if keta[0] == -1:\n keta[0] = 1\n if keta[1] == -1:\n keta[1] = 0\n print(keta[0]*10+keta[1])\n elif N == 1:\n if keta[0] == -1:\n keta[0] = 0\n print(keta[0])\n\n#print(keta)', 'N, M = map(int, input().split())\nsc = []\nfor _ in range(M):\n sc.append(list(map(int, input().split())))\n\nketa = [-1]*N\nflag = 0\nfor i in range(M):\n for j in range(1,N+1):\n #print(i,j,sc[i][0], keta)\n if sc[i][0] == j:\n if keta[j-1] == -1:\n keta[j-1] = sc[i][1]\n elif keta[j-1] == sc[i][1]:\n continue\n else:\n flag = 1\n break\n if flag == 1:\n print(-1)\n break\n\nans = 0\nif flag == 0:\n if N == 3 and keta[0] == 0:\n print(-1)\n elif N == 2 and keta[0] == 0:\n print(-1)\n elif N == 3:\n if keta[0] == -1:\n keta[0] = 1\n if keta[1] == -1:\n keta[1] = 0\n if keta[2] == -1:\n keta[2] = 0\n print(keta[0]*100+keta[1]*10+keta[2])\n elif N == 2:\n if keta[0] == -1:\n keta[0] = 1\n if keta[1] == -1:\n keta[1] = 0\n print(keta[0]*10+keta[1])\n elif N == 1:\n if keta[0] == -1:\n keta[0] = 0\n print(keta[0])\n\n#print(keta)'] | ['Wrong Answer', 'Accepted'] | ['s672650514', 's294541500'] | [3064.0, 3064.0] | [18.0, 17.0] | [1078, 1079] |
p02761 | u698849142 | 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 = [None]*n\nmsg=''\nfor _ in range(m):\n s, c = input().split()\n index = int(s)-1\n if l[index] is None:\n l[index] = c\n else:\n if l[index] == c:\n continue\n else:\n msg=-1\n break\nl = list(map(lambda x: '0' if x in None else x, l))\nif msg == -1:\n print(msg)\nelif l[0] == '0' and len(l) >1:\n print(-1)\nelse:\n print(msg.join(l))\n", "n,m=map(int, input().split())\nl = ['0']*n\nmsg=''\nfor _ in range(m):\n s, c = input().split()\n index = int(s)-1\n if l[index] == '0':\n\tl[index] = c\n else:\n if l[index] == c:\n continue\n\telse:\n msg=-1\n break\nif msg == -1:\n print(msg)\nelif l[0] == '0' and len(l) >1:\n print(-1)\nelse:\n print(msg.join(l))\n\n", "n,m=map(int, input().split())\nl = [None]*n\nmsg=''\nfor _ in range(m):\n s, c = input().split()\n index = int(s)-1\n if l[index] is None:\n l[index] = c\n else:\n if l[index] == c:\n continue\n else:\n msg=-1\n break\nif l[0] is None and len(l) != 1:\n l[0]='1'\nl = list(map(lambda x: '0' if x is None else x, l))\nif msg == -1:\n print(msg)\nelif l[0] == '0' and len(l) != 1:\n print(-1)\nelse:\n print(msg.join(l))\n\n"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s402460581', 's881413704', 's113079669'] | [3064.0, 2940.0, 3064.0] | [17.0, 17.0, 17.0] | [427, 360, 476] |
p02761 | u699089116 | 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)]\nsc = list(map(list, set(map(tuple, sc))))\n\nl = list()\nfor i in range(1000):\n i = str(i)\n flg = True\n for j in sc:\n if i[j[0]-1] != j[1]:\n flg = False\n if flg:\n l.append(int(i))\n\nprint(min(l))', 'n, m = map(int, input().split())\nsc = [list(map(int, input().split())) for i in range(m)]\nsc = list(map(list, set(map(tuple, sc))))\n\nl = list()\nfor i in range(1000):\n i = str(i)\n flg = True\n for j in sc:\n if i[j[0]-1] != j[1]:\n flg = False\n if flg:\n l.append(i)\n\nprint(min(l))', 'n, m = map(int, input().split())\nsc = [list(map(int, input().split())) for i in range(m)]\nsc = list(map(list, set(map(tuple, sc))))\n\nans = [-1] * n\nfor i in sc:\n if i[0] == 1 and i[1] == 0 and n == 1:\n print(0)\n exit()\n if i[0] == 1 and i[1] == 0:\n print(-1)\n exit()\n if i[0] > n or ans[i[0]-1] != -1:\n print(-1)\n exit()\n ans[i[0]-1] = i[1]\n\nfor i, val in enumerate(ans):\n if val == -1:\n ans[i] = 0\n\nif (m == 0 and n != 1) or (ans[0] == 0 and n != 1):\n ans[0] = 1\n\nflg = False\nfor i in ans:\n if i != 0:\n flg = True\nif not flg:\n print(0)\n exit()\n\nans = map(lambda x: str(x), ans)\nprint("".join(ans))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s648629808', 's923075261', 's731004223'] | [3064.0, 3064.0, 3064.0] | [18.0, 18.0, 18.0] | [318, 313, 681] |
p02761 | u703442202 | 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_list = []\nfor i in range(m):\n s_c_list.append(list(map(int,input().split())))\ncheck = False\n\nfor i in range(10**n-1,10**n):\n counter = 0\n list_i = list(str(i))\n for j in range(m):\n if list_i[s_c_list[j][0] - 1] == s_c_list[j][1]:\n counter += 1\n if counter ==m:\n print(i)\n check = True\nif check == False:\n print(-1)', 'n,m = map(int,input().split())\ns_c_list = []\nfor i in range(m):\n s_c_list.append(list(map(int,input().split())))\ncheck = False\nif n == 1:\n for i in range(10):\n con = 0\n list_i = list(str(i))\n ch_list = [0 for i in range(m)]\n for j in range(m):\n if int(list_i[s_c_list[j][0] - 1]) == s_c_list[j][1]:\n ch_list[j] = 1\n if sum(ch_list) == m:\n print(i)\n check = True\n break\nelse:\n \n for i in range(10**(n-1),10**n):\n con = 0\n list_i = list(str(i))\n ch_list = [0 for i in range(m)]\n for j in range(m):\n if int(list_i[s_c_list[j][0] - 1]) == s_c_list[j][1]:\n ch_list[j] = 1\n if sum(ch_list) == m:\n print(i)\n check = True\n break\nif check == False:\n print(-1)\n \n\n\n'] | ['Wrong Answer', 'Accepted'] | ['s826956180', 's775266428'] | [3064.0, 3064.0] | [17.0, 20.0] | [369, 749] |
p02761 | u703823201 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['import sys\nN, M = map(int, input().split())\n\nif N == 1:\n sc = []\n for m in range(M):\n s, c = map(int, input().split())\n sc.append(c)\n sc = set(sc)\n if len(sc) == 0:\n print(0)\n sys.exit(0)\n elif len(sc) == 1:\n print(sc[0])\n sys.exit(0)\n else:\n print(-1)\n sys.exit(0)\n \nif N == 2:\n sc = []\n for m in range(M):\n s, c = map(int, input().split())\n sc.append([s, c])\n sc = list(map(list, set(map(tuple, sc))))\n \n l1 = []\n for m in range(M):\n if sc[m][0] == 1 and sc[m][1] > 0:\n l1.append(sc[m][1])\n if len(l1) == 0 or len(l1) > 1:\n print(-1)\n sys.exit(0)\n else:\n lank1 = min(l1)\n \n l2 = []\n for m in range(M):\n if sc[m][0] == 2:\n l2.append(sc[m][1])\n if len(l2) == 0:\n lank2 = 0\n elif len(l2) == 1:\n lank2 = min(l2)\n else:\n print(-1)\n sys.exit(0)\n \n ans = lank1 * 10 + lank2\n print(ans)\n sys.exit(0)\n \nif N == 3:\n sc = []\n for m in range(M):\n s, c = map(int, input().split())\n sc.append([s, c])\n sc = list(map(list, set(map(tuple, sc)))) \n \n l1 = []\n for m in range(M):\n if sc[m][0] == 1 and sc[m][1] > 0:\n l1.append(sc[m][1])\n if len(l1) == 0 or len(l1) > 1:\n print(-1)\n sys.exit(0)\n else:\n lank1 = min(l1)\n \n l2 = []\n for m in range(M):\n if sc[m][0] == 2:\n l2.append(sc[m][1])\n if len(l2) == 0:\n lank2 = 0\n elif len(l2) == 1:\n lank2 = min(l2)\n else:\n print(-1)\n sys.exit(0)\n \n l3 = []\n for m in range(M):\n if sc[m][0] == 3:\n l3.append(sc[m][1])\n if len(l3) == 0:\n lank3 = 0\n elif len(l3) == 1:\n lank3 = min(l3)\n else:\n print(-1)\n sys.exit(0)\n \n ans = lank1 * 100 + lank2 * 10 + lank3\n print(ans)\n sys.exit(0)', 'import sys\nN, M = map(int,input().split())\ns = []\nc = []\nfor m 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):\n Str = str(i)\n\n if len(Str) == N and all([Str[s[m] - 1] == str(c[m]) for m in range(M)]):\n print(Str)\n sys.exit(0)\n\nprint(-1)'] | ['Runtime Error', 'Accepted'] | ['s631291055', 's242680972'] | [3192.0, 3064.0] | [18.0, 18.0] | [1961, 316] |
p02761 | u704284486 | 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 for _ in range(N)]\nfor i in range(M):\n s,c = map(int,input().split(" "))\n if ans[s-1] != -1 and ans[s-1] != c:\n print(-1)\n exit()\n else:\n ans[s-1] = c\nif ans[0] == 0:\n print(-1)\n exit() \nfor i in range(N):\n if ans[i] == -1:\n if i != 0:\n ans[i] = 0\n else:\n ans[i] = 1\n ans[i] = str(ans)\nans = \'\'.join(ans)\nprint(int(ans))', 'N,M = map(int,input().split(" "))\nans = [-1 for _ in range(N)]\nflag = 0\nfor i in range(M):\n s,c = map(int,input().split(" "))\n if ans[s-1] != -1 and ans[s-1] != c:\n flag = 1\n else:\n ans[s-1] = c\nif N != 1 and ans[0] == 0:\n flag = 1\nelif N == 1 and ans[0] == 0:\n print(0)\n exit()\nif N == 1:\n if ans[0] == -1:\n print(0)\n exit()\nfor 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[i] = str(ans[i])\nans = \'\'.join(ans)\nif flag == 1:\n print(-1)\n exit()\nprint(int(ans))\n'] | ['Runtime Error', 'Accepted'] | ['s346247068', 's580022463'] | [3064.0, 3064.0] | [17.0, 19.0] | [443, 593] |
p02761 | u707712609 | 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 = []\nc = []\nfor _ in range(M):\n tmp1, tmp2 = map(int, input().split())\n s.append(tmp1-1)\n c.append(tmp2)\n\ndigit = [-1, -1, -1]\n\nfor i in range(M):\n if digit[s[i]] < 0:\n digit[s[i]] = c[i]\n else:\n print("-1")\n exit()\n\nif (N == 1) and (digit[0] == 0):\n print("0")\n exit()\n \nif (digit[0] == 0) or (digit[0] == -1):\n print("-1")\n exit()\n\noutput = ""\n \nfor i in range(N):\n if digit[i] == -1:\n output += "0"\n continue\n output += str(digit[i])\n \nprint(output)\n ', 'N, M = map(int, input().split())\n\ns = []\nc = []\nfor _ in range(M):\n tmp1, tmp2 = map(int, input().split())\n s.append(tmp1-1)\n c.append(tmp2)\n\ndigit = [-1, -1, -1]\n\nfor i in range(M):\n if digit[s[i]] < 0:\n digit[s[i]] = c[i]\n else:\n if not(digit[s[i]] == c[i]):\n print("-1")\n exit()\n\nif M==0:\n if N==1:\n print("0")\n exit()\n print(str(10**(N-1)))\n exit()\n \nif ((N == 1) and (digit[0] == 0)):\n print("0")\n exit()\n \nif digit[0] == 0:\n print("-1")\n exit()\n\nif digit[0] < 0:\n digit[0] = 1\n \noutput = ""\n \nfor i in range(N):\n if digit[i] < 0:\n output += "0"\n continue\n output += str(digit[i])\n \nprint(output)\n '] | ['Wrong Answer', 'Accepted'] | ['s787627132', 's996991201'] | [3064.0, 3064.0] | [17.0, 18.0] | [522, 658] |
p02761 | u710659690 | 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()))\nB = {}\nfor i in range(M):\n k, v = input().split()\n if (k in B) and (B.get(k)!=v):\n print(-1)\n exit()\n else:\n B[k] = v\nif (N!=1) and (B.get("1", "0")=="0"):\n print(-1)\n exit()\nans = B.get("1", "1")\nfor i in range(2, N+1):\n ans = ans + str(B.get(i, 0))\nprint(ans)', 'N, M = list(map(int, input().split()))\nif (N==1) and (M==0):\n print(0)\n exit()\nB = {}\nfor i in range(M):\n k, v = input().split()\n if (k in B) and (B.get(k)!=v):\n print(-1)\n exit()\n else:\n B[k] = v\nif (N!=1) and (B.get("1", "99")=="0"):\n print(-1)\n exit()\nans = B.get("1", "1")\nfor i in range(2, N+1):\n ans = ans + str(B.get(str(i), 0))\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s125003520', 's573263517'] | [3064.0, 3064.0] | [18.0, 17.0] | [315, 363] |
p02761 | u711693740 | 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'] * N\nnum[0] = '1'\nerror = False\n\nfor i in range(M):\n s, c = input().split()\n if num[int(s)-1] in ['0', c]:\n num[int(s)-1] = c\n else:\n error = True\n break\n\nif num[0] == '0' or error:\n print(-1)\nelse:\n print(''.join(num))\n", "N, M = map(int, input().split())\nnum = ['0'] * N\ns1 = False\nerror = False\n\nfor i in range(M):\n s, c = input().split()\n if num[int(s)-1] in ['0', c]:\n num[int(s)-1] = c\n if s == '1':\n s1 = True\n else:\n error = True\n break\n\nif N != 1 and not s1:\n num[0] = '1'\nif (N != 1 and num[0] == '0') or error:\n print(-1)\nelse:\n if N != 1 and not s1:\n num[0] = '1'\n print(''.join(num))\n"] | ['Wrong Answer', 'Accepted'] | ['s876549867', 's110776924'] | [3060.0, 3064.0] | [18.0, 17.0] | [300, 440] |
p02761 | u716043626 | 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\nnum = [-1]*n\n\nans = True\n\nfor i in range(m):\n if num[sc[i][0]-1] == -1:\n num[sc[i][0]-1] = sc[i][1]\n elif num[sc[i][0]-1] == sc[i][1]:\n continue\n else:\n ans = False\n \nif num[0] == 0:\n if len(num) > 1:\n ans = False\n elif len(num) == 1:\n ans = True\nelse:\n for i in range(n):\n if num[i] == -1:\n if i == 0:\n if len(num) > 1:\n num[i] = 1\n else:\n num[i] = 0\n else:\n num[i] = 1\nif ans:\n print(*num)\nelse:\n print('-1')\n ", "n, m = map(int,input().split())\nsc = [list(map(int,input().split())) for i in range(m)]\n\nnum = [0]*n\nans = True\n\nfor i in range(m):\n if sc[i][0] == 1 and sc[i][1] == 0:\n ans = False\n break\n if sc[i][0] > n:\n ans = False\n break\n if num[sc[i][0]-1] != 0:\n if num[sc[i][0]-1] == sc[i][1]:\n continue\n else:\n ans = False\n break\n else:\n num[sc[i][0]-1] = sc[i][1]\n\nif num[0] == 0 and len(num) > 1:\n num[0] = 1\n\nif ans:\n print(*num)\nelse:\n print('-1')", "n, m = map(int,input().split())\nsc = [list(map(int,input().split())) for i in range(m)]\n\nnum = [0]*n\nans = True\n\nfor i in range(m):\n if sc[i][0] == 1 & sc[i][1] == 0:\n ans = False\n break\n if num[sc[i][0]-1] != 0:\n if num[sc[i][0]-1] == sc[i][1]:\n continue\n else:\n ans = False\n break\n else:\n num[sc[i][0]-1] = sc[i][1]\n\nif num[0] == 0:\n num[0] = 1\n\nif ans:\n print(*num)\nelse:\n print('-1')", "n, m = map(int,input().split())\nsc = [list(map(int,input().split())) for i in range(m)]\n\nnum = [-1]*n\n\nans = True\n\nfor i in range(m):\n if num[sc[i][0]-1] == -1:\n num[sc[i][0]-1] = sc[i][1]\n elif num[sc[i][0]-1] == sc[i][1]:\n continue\n else:\n ans = False\nif num[0] == 0:\n ans = False\nelse:\n for i in range(n):\n if num[i] == -1:\n if i != 0:\n num[i] = 0\n else:\n num[i] = 1\nif ans:\n print(*num)\nelse:\n print('-1')\n ", "n, m = map(int,input().split())\nsc = [list(map(int,input().split())) for i in range(m)]\n\nnum = [0]*n\nans = True\n\nfor i in range(m):\n if sc[i][0] == 1 and sc[i][1] == 0:\n ans = False\n break\n if num[sc[i][0]-1] != 0:\n if num[sc[i][0]-1] == sc[i][1]:\n continue\n else:\n ans = False\n break\n else:\n num[sc[i][0]-1] = sc[i][1]\n\nif num[0] == 0:\n num[0] = 1\n\nif ans:\n print(*num)\nelse:\n print('-1')", "n, m = map(int,input().split())\nsc = [list(map(int,input().split())) for i in range(m)]\n\nnum = [0]*n\nans = True\n\nfor i in range(m):\n if sc[i][0] == 1 and sc[i][1] == 0:\n ans = False\n break\n if num[sc[i][0]-1] != 0:\n if num[sc[i][0]-1] == sc[i][1]:\n continue\n else:\n ans = False\n break\n else:\n num[sc[i][0]-1] = sc[i][1]\n\nif num[0] == 0 and len(num) > 1:\n num[0] = 1\n\nif ans:\n print(*num)\nelse:\n print('-1')", 'N, M = map(int, input().split())\nC = [tuple(map(int, input().split())) for _ in range(M)]\nans = 10 ** (N - 1) if N != 1 else 0\nwhile ans < 10 ** N:\n for s, c in C:\n if str(ans)[s - 1] == str(c):\n continue\n else:\n break\n else:\n print(ans)\n break\n ans += 1\nelse:\n print(-1)'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s125948944', 's204129903', 's276514580', 's376419285', 's606363533', 's986335503', 's315170412'] | [3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 18.0, 18.0, 18.0, 18.0, 17.0, 18.0] | [690, 547, 473, 523, 475, 492, 333] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.