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 | u716270596 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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\n\nn, m = list(map(int, input().split()))\n\n# c = []\n# idx = 0\n\n\ndef solve(n, m):\n sc = dict()\n\n for _ in range(m):\n si, ci = list(map(int, input().split()))\n if si in sc.keys() and sc[si] != ci:\n return -1\n else:\n sc[si] = ci\n\n # print(sc)\n\n answer = ""\n for i in range(1, n + 1, 1):\n if i in sc.keys():\n if i == 1 and sc[i] == 0:\n return -1\n answer += str(sc[i])\n else:\n if i == 1 and n > 1:\n answer += "1"\n else:\n answer += "0"\n\n return answer', '# from collections import defaultdict\n\nn, m = list(map(int, input().split()))\n\n# c = []\n# idx = 0\n\n\ndef solve(n, m):\n sc = dict()\n\n for _ in range(m):\n si, ci = list(map(int, input().split()))\n if si in sc.keys() and sc[si] != ci:\n return -1\n else:\n sc[si] = ci\n\n # print(sc)\n\n answer = ""\n for i in range(1, n + 1, 1):\n if i in sc.keys():\n if i == 1 and n > 1 and sc[i] == 0:\n return -1\n answer += str(sc[i])\n else:\n if i == 1 and n > 1:\n answer += "1"\n else:\n answer += "0"\n\n return answer\n\n\nprint(solve(n, m))'] | ['Wrong Answer', 'Accepted'] | ['s508117775', 's128189117'] | [3064.0, 3064.0] | [17.0, 17.0] | [653, 684] |
p02761 | u718949306 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["N, M = map(int, input().split())\nres = True\nA = [0]*N\nB = ''\nS = []\nC = []\nfor m in range(M):\n s, c = map(int, input().split())\n S.append(s)\n C.append(c)\nT = max(S)\ncnt = -1\nman = False\nfor n in range(1, 1000):\n num = str(n)\n res = True\n for m in range(M):\n if len(num) != N:\n res = False\n continue\n if num[S[m]-1] != str(C[m]):\n res = False\n if res:\n cnt = int(num)\n man = True\nif man:\n print(cnt)\nelse:\n print(cnt)", "N, M = map(int, input().split())\nA = []\nB = [0]*N\nfor m in range(M):\n s, c = map(int, input().split())\n A.append([s, c])\nres = True\nfor a in A:\n if a[0] == 1:\n if B[0] != 0:\n if B[0] != a[1]:\n res = False\n break\n else:\n B[0] = a[1]\n elif a[0] == 2:\n if B[1] != 0:\n if B[1] != a[1]:\n res = False\n break\n else:\n B[1] = a[1]\n elif a[0] == 3:\n if B[2] != 0:\n if B[2] != a[1]:\n res = False\n break\n else:\n B[2] = a[1]\nfor b in range(len(B)-2):\n if B[b] == 0 and B[b+1] == 0 and B[b+2] == 0:\n res = False\nif res:\n print(B)\nelse:\n print('-1')", 'N, 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)\ncnt = -1\nman = False\nfor n in range(1000):\n num = str(n)\n res = True\n if len(num) != N:\n res = False\n continue\n for m in range(M):\n if num[S[m]-1] != str(C[m]):\n res = False\n if res:\n cnt = int(num)\n man = True\n break\nif man:\n print(cnt)\nelse:\n print(cnt)'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s534574872', 's892759669', 's070473842'] | [3064.0, 3064.0, 3188.0] | [20.0, 17.0, 19.0] | [504, 763, 464] |
p02761 | u726615467 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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 = ['A'] * N\nfor i, (si, ci) in enumerate(sc):\n if ans[si - 1] != 'A' and ans[si - 1] != str(ci):\n ans = -1\n break\n #\n ans[si - 1] = str(ci)\n\nif ans == -1:\n print(ans)\nelse:\n ans = ''.join(ans).replace('A', '1')\n if ans[0] == '0':\n if N == 1:\n print(ans)\n else:\n print(-1)\n else:\n print(ans)", "N, M = map(int, input().split())\nsc = [list(map(int, input().split())) for _ in range(M)]\n\nans = ['A'] * N\nfor i, (si, ci) in enumerate(sc):\n if ans[si - 1] != 'A' and ans[si - 1] != str(ci):\n ans = -1\n break\n #\n ans[si - 1] = str(ci)\n\nif ans == -1:\n print(ans)\nelse:\n for i in range(N):\n if ans[i] == 'A':\n if N == 1:\n ans[i] = '0'\n else:\n ans[i] = '1' if i == 0 else '0'\n #\n if ans[0] == '0':\n if N == 1:\n print(0)\n else:\n print(-1)\n else:\n print(''.join(ans))"] | ['Wrong Answer', 'Accepted'] | ['s017778281', 's388160410'] | [3064.0, 3064.0] | [17.0, 17.0] | [463, 602] |
p02761 | u727407185 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["File Edit Options Buffers Tools Python Help \nn, m = [int(x) for x in input().split()]\nsc = [[int(x) for x in input().split()] for i in range(m)]\nr = [-1] * n\ndef solution():\n for s, c in sc:\n if r[s - 1] >= 0 and r[s - 1] != c or (s == 1 and c == 0 and n != 1):\n return '-1'\n r[s - 1] = c\n for i in range(n):\n if r[i] < 0:\n if i == 0:\n r[i] = 1\n else:\n r[i] = 0\n return ''.join(str(r[i]) for i in range(n))\n\nprint(solution())", "n, m = [int(x) for x in input().split()]\nsc = [[int(x) for x in input().split()] for i in range(m)]\nr = [-1] * n\ndef solution():\n for s, c in sc:\n if s == 1 and c == 0 and n != 1:\n return '-1'\n if r[s - 1] >= 0 and r[s - 1] != c:\n return '-1'\n r[s - 1] = c\n for i in range(n):\n if r[i] < 0:\n if i == 0 and n != 1:\n r[i] = 1\n else:\n r[i] = 0\n return ''.join(str(r[i]) for i in range(n))\n\nprint(solution())"] | ['Runtime Error', 'Accepted'] | ['s368569319', 's803916752'] | [2940.0, 3064.0] | [17.0, 17.0] | [562, 515] |
p02761 | u727787724 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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())\nc=[]\nfor i in range(m):\n c.append(list(map(int,input().split())))\nans=[-1 for i in range(n)]\ncnt=0\nfor i in range(m):\n if ans[c[i][0]-1]==-1:\n ans[c[i][0]-1]=c[i][1]\n else:\n if ans[c[i][0]-1]==c[i][1]:\n continue\n else:\n cnt+=1\n break\nif cnt!=0:\n print(-1)\nelse:\n if [1,0] in c and n!=1:\n print(-1)\n else:\n if ans[0]==-1 and m!=0:\n ans[0]=1\n else:\n ans[0]=0\n for i in range(n):\n if ans[i]==-1:\n ans[i]=0\n ans[i]=str(ans[i])\n aa=''.join(ans)\n print(aa)", "n,m=map(int,input().split())\nc=[]\nfor i in range(m):\n c.append(list(map(int,input().split())))\nans=[-1 for i in range(n)]\ncnt=0\nif m==0:\n cnt=2\nfor i in range(m):\n if ans[c[i][0]-1]==-1:\n ans[c[i][0]-1]=c[i][1]\n else:\n if ans[c[i][0]-1]==c[i][1]:\n continue\n else:\n cnt+=1\n break\nif cnt==1:\n print(-1)\nelif cnt==2:\n if n==1:\n print(0)\n else:\n c='1'\n for i in range(n-1):\n c+='0'\n print(c)\nelse:\n if [1,0] in c and n!=1:\n print(-1)\n else:\n if ans[0]==-1:\n ans[0]=1\n for i in range(n):\n if ans[i]==-1:\n ans[i]=0\n ans[i]=str(ans[i])\n aa=''.join(ans)\n print(aa)"] | ['Wrong Answer', 'Accepted'] | ['s029135708', 's711175984'] | [3064.0, 3064.0] | [17.0, 18.0] | [652, 759] |
p02761 | u728120584 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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 = [input().split() for i in range(M)]\n\nk3 = 10\nk2 = 10\nk1 = 10\n\n\nfor i in range(M):\n if P[i][0] == '3':\n k1 = min(k1, int(P[i][1]))\n elif P[i][0] == '2':\n k2 = min(k2, int(P[i][1]))\n else:\n k3 = min(k3, int(P[i][1]))\n\nans = k3 * 100 + k2 * 10 + k1 if M > 0 else -1\n\nif N == 3:\n if len(str(ans)) == 3:\n print(ans)\n else:\n print(-1)\nelif N == 2:\n if len(str(ans)) == 2:\n print(ans)\n else:\n print(-1)\nelse:\n if len(str(ans)) == 1:\n print(ans)\n else:\n print(-1)\n ", '\ndef solve(x):\n x = str(x)\n if len(x) != N:\n return False\n for s, c in P:\n if x[s - 1] != str(c):\n return False\n return True\n\nif __name__ == "__main__":\n N, M = map(int, input().split())\n P = [list(map(int, input().split())) for i in range(M)]\n ans = 10**N\n for i in range(10 ** N - 1, -1, -1):\n if solve(i):\n ans = min(ans, i)\n \n print(ans if ans != 10**N else -1)'] | ['Wrong Answer', 'Accepted'] | ['s982390342', 's327083364'] | [3064.0, 3064.0] | [17.0, 18.0] | [587, 446] |
p02761 | u728473456 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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\na = [0] * n\nfor i in range(m):\n s[i],c[i] = map(int,input().split())\n#\nans = 0\nfor j in range(m):\n if n != 1:\n if s[j] == 1 and c[j] == 0:\n ans = -1\n else:\n if a[s[j] - 1] == 0:\n a[s[j] - 1] = c[j]\n else:\n if a[s[j] - 1] != c[j]:\n ans = -1\n break\n\n#\n\nif m == 0:\n if n != 1 :\n ans = 10 ** (n - 1)\n else:\n ans = 0\nelif ans != -1:\n if n != 1:\n if a[0] == 0:\n ans = 10 **(n - 1)\n for i in range(n):\n ans += a[i] * 10 **(n - i - 1)\n else:\n for i in range(n):\n ans += a[i] * 10 **(n - i - 1)\n\nprint(ans)\n', 'n,m = map(int,input().split())\ns = [0] * m\nc = [0] * m\na = [-1] * n\nfor i in range(m):\n s[i],c[i] = map(int,input().split())\n#\nans = 0\nif m == 0:\n if n == 1:\n ans = 0\n else:\n ans = 10 ** (n - 1)\nelif n >= 2:\n for j in range(m):\n \n if s[j] == 1 and c[j] == 0:\n ans = -1\n break\n elif a[s[j] - 1] != -1 and a[s[j] - 1] != c[j]:\n ans = -1\n break\n else:\n a[s[j] - 1] = c[j]\n if ans != -1:\n if a[0] != -1:\n for k in range(n):\n if a[k] != -1:\n ans += a[k] * 10 ** (n - k - 1)\n else:\n ans = 10 ** (n - 1)\n for k in range(n):\n if a[k] != -1:\n ans += a[k] * 10 ** (n - k - 1)\n\nelif n == 1 and m == 0:\n ans = 0\nelse:\n for j in range(m):\n if a[0] == -1:\n a[0] = c[j]\n elif a[0] != c[j]:\n ans = -1\n break\n ans = a[0]\n\n\n\n\n\n\n\n\nprint(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s745161138', 's992756484'] | [3064.0, 3064.0] | [18.0, 17.0] | [786, 1059] |
p02761 | u729938879 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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\nflg = True\nfor i in range(m):\n s, c = map(int,input().split())\n if a[s-1] == -1:\n a[s-1] = c\n else:\n flg = False\n break\nif a[0] == 0:\n flg = False\nelif a[0] == -1:\n a[0] = 1\n\nif flg:\n num = 0\n for i in range(len(a)):\n if a[i] != -1:\n num += a[i] * (10**(m-i-1))\n print(num)\nelse:\n print(-1)', 'n, m =map(int,input().split())\na = [-1] * n\nflg = True\nfor i in range(m):\n s, c = map(int,input().split())\n if a[s-1] == -1:\n a[s-1] = c\n elif a[s-1] == c:\n pass\n else:\n flg = False\n break\n \nif n >= 2:\n if a[0] == 0:\n flg = False\n elif a[0] == -1:\n a[0] = 1\nelse:\n if a[0] == -1:\n a[0] = 0\n \nif flg:\n num = 0\n for i in range(len(a)):\n if a[i] != -1:\n num += a[i] * (10**(n-i-1))\n print(num)\nelse:\n print(-1)'] | ['Wrong Answer', 'Accepted'] | ['s888495053', 's888619827'] | [3064.0, 3064.0] | [17.0, 18.0] | [400, 517] |
p02761 | u731322489 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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 = [list(map(int, input().split())) for _ in range(m)]\n\nans = -1\nfor i in range(10 ** (n - 1) - 1, 10 ** n):\n tmp = str(i)\n flg = False\n for l in lst:\n if tmp[l[0] - 1] == str(l[1]):\n flg = True\n break\n if flg == True:\n ans = i\n break\n\nprint(ans)', 'import sys\nimport os\nf = open("input.txt", "r")\nsys.stdin = f\n\nn, m = map(int, input().split())\nlst = [list(map(int, input().split())) for _ in range(m)]\n\nfor i in range(m):\n for j in range(m):\n if i != j and lst[i][0] == lst[j][0] and lst[i][1] != lst[j][1]:\n print(-1)\n exit()\n\nans = "0" * n\nfor l in lst:\n if l[0] == 1 and l[1] == 0:\n print(-1)\n exit()\n ans = ans[: l[0] - 1] + str(l[1]) + ans[l[0]: ]\n\nif ans[0] == "0":\n ans = "1" + ans[1: ]\n\nprint(ans)\n', 'n, m = map(int, input().split())\nlst = [list(map(int, input().split())) for _ in range(m)]\n\nans = -1\nfor i in range(10 ** n):\n tmp = str(i)\n if len(tmp) == n:\n flg = False\n for l in lst:\n print(i, l)\n if tmp[l[0] - 1] == str(l[1]):\n flg = True\n break\n if flg == True:\n ans = i\n break\n\nprint(ans)', 'n, m = map(int, input().split())\nlst = [list(map(int, input().split())) for _ in range(m)]\n\nans = -1\nfor i in range(10 ** n):\n tmp = str(i)\n if len(tmp) == n:\n flg = False\n for l in lst:\n if tmp[l[0] - 1] == str(l[1]):\n flg = True\n break\n if flg == True:\n ans = i\n break\n\nprint(ans)', 'n, m = map(int, input().split())\nlst = [list(map(int, input().split())) for _ in range(m)]\nans = -1\nfor i in range(10 ** n):\n tmp = str(i)\n if len(tmp) == n:\n flg = True\n for l in lst:\n if tmp[l[0] - 1] != str(l[1]):\n flg = False\n break\n if flg == True:\n ans = i\n break\nprint(ans)'] | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s175205294', 's678874825', 's697432546', 's814073517', 's542022765'] | [3064.0, 3064.0, 3316.0, 3064.0, 3064.0] | [18.0, 18.0, 20.0, 18.0, 18.0] | [337, 513, 396, 372, 370] |
p02761 | u731436822 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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\nflag = False\nl = [0]*3\nfor i in range(m):\n l[SC[i][0]-1] = SC[i][1]\n if flag == True:\n break\n for j in range(1,m-i):\n if SC[i][0] == SC[j][0]:\n if l[SC[i][0]-1] != l[SC[j][0]-1]:\n print('-1')\n flag = True\n break\n \nif flag == False: \n lr = l[::-1] \n if (lr[n-1] == 0):\n print('-1')\n else:\n l = l[:n]\n print(l)\n s = ''\n for i in l:\n s += str(i)\n print(int(s))", "n,m = map(int,input().split())\nSC = [list(map(int,input().split())) for __ in range(m)]\n\nflag = False\nl = [0]*n\nfor i in range(m):\n l[SC[i][0]-1] = SC[i][1]\n if flag == True:\n break\n for j in range(1,m-i):\n if SC[i][0] == SC[j][0]:\n if l[SC[i][0]-1] != l[SC[j][0]-1]:\n print('-1')\n flag = True\n break\n \nif flag == False: \n if (l[0] == 0):\n print('-1')\n else:\n l = l[:n]\n print(l)\n s = ''\n for i in l:\n s += str(i)\n print(int(s))", "n,m = map(int,input().split())\nSC = [list(map(int,input().split())) for __ in range(m)]\n\nflag = False\nl = [0]*3\nfor i in range(m):\n l[SC[i][0]-1] = SC[i][1]\n if flag == True:\n break\n for j in range(1,m-i):\n if SC[i][0] == SC[j][0]:\n if l[SC[i][0]-1] != l[SC[j][0]-1]:\n print('-1')\n flag = True\n break\n \nif flag == False \n if (l[n-1] == 0):\n print('-1')\n else:\n l = l[:n]\n s = ''\n for i in l:\n s += str(i)\n print(int(s))", "n,m = map(int, input().split())\n \nsc = [tuple(map(int, input().split())) for _ in range(m)]\n \nfor i in range(1000):\n k = str(i)\n \n \n if len(k) == n and all([k[s-1]==str(c) for s,c in sc]):\n print(k)\n exit()\n \nprint('-1')"] | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s205251431', 's840758937', 's995182855', 's803185666'] | [3064.0, 3064.0, 3064.0, 3064.0] | [18.0, 17.0, 17.0, 19.0] | [592, 571, 556, 379] |
p02761 | u736470924 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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 - 1)\n C.append(c)\n\nnum = ['*'] * N\n\nfor s, c in zip(S, C):\n if s == 0 and c == 0 and N != 1:\n print(-1)\n exit()\n if num[s] == '*':\n num[s] = str(c)\n elif num[s] != str(c):\n print(-1)\n exit()\n\nprint(''.join(num).replace('*', '1'))", 'print(-1)', "N, M = map(int, input().split())\nS = []\nC = []\nfor _ in range(M):\n s, c = map(int, input().split())\n S.append(s - 1)\n C.append(c)\n\nnum = ['*'] * N\n\nfor s, c in zip(S, C):\n if s == 0 and c == 0 and N != 1:\n print(-1)\n exit()\n if num[s] == '*':\n num[s] = str(c)\n elif num[s] != str(c):\n print(-1)\n exit()\n\nif num[0] == '*' and N != 1:\n num[0] = '1'\nprint(''.join(num).replace('*', '0'))\n"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s278152728', 's300591155', 's626987509'] | [3064.0, 3068.0, 3064.0] | [19.0, 18.0, 18.0] | [362, 9, 407] |
p02761 | u736848749 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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())\nchk = [-1] * N \nans=0\n\n\nfor m in range(M):\n s,c = map(int,input().split())\n if s==1 and c==0 and N!=1: \n print(-1)\n exit()\n if chk[s-1] == -1: \n chk[s-1]=c\n elif chk[s-1] != -1: \n if chk[s-1] != c: \n print(-1)\n exit()\n\nfor i in range(N):\n if chk[i] == -1: \n if i==0:\n chk[i] = 1\n else:\n chk[i] = 0\n print(ans,(N-(i+1)))\n ans += chk[i]*(10**(N-(i+1)))\nprint(ans)', 'N,M = map(int,input().split())\nchk = [-1] * N \nans=0\n\n\nfor m in range(M):\n s,c = map(int,input().split())\n if s==1 and c==0 and N!=1: \n print(-1)\n exit()\n if chk[s-1] == -1: \n chk[s-1]=c\n elif chk[s-1] != -1: \n if chk[s-1] != c: \n print(-1)\n exit()\n\nfor i in range(N):\n if chk[i] == -1: \n if i==0 and N!=1:\n chk[i] = 1\n else:\n chk[i] = 0\n #print(ans,(N-(i+1)))\n ans += chk[i]*(10**(N-(i+1)))\nprint(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s938564051', 's273789163'] | [3064.0, 3064.0] | [18.0, 17.0] | [815, 826] |
p02761 | u737298927 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['n, m = map(int, input().split())\n\nans = [None] * n\nfor i in range(m):\n s, c = map(int, input().split())\n if ans[s - 1] is None:\n ans[s - 1] = c\n else:\n print(ans[s-1],c)\n ans[s - 1] = min(ans[s - 1], c)\n print(ans)\n\nansp = ""\nif ans[0] is None and n == 1:\n print("0")\nif ans[0] is None or ans[0] == 0:\n print("-1")\nelse:\n for i in range(n):\n if ans[i] is None:\n ans[i] = 0\n ansp += str(ans[i])\n print(ansp)\n\n', 'n, m = map(int, input().split())\nsc = []\nfor i in range(m):\n sc.append(list(map(int, input().split())))\n\nif n == 1:\n x = 0\nelif n == 2:\n x = 10\nelse:\n x = 100\n\nfor i in range(x,1000):\n flag = True\n i_str = str(i)\n for j in range(m):\n a = int(i_str[sc[j][0] - 1])\n b = sc[j][1]\n if a != b:\n flag = False\n if flag:\n print(i)\n exit()\nprint("-1")\n'] | ['Wrong Answer', 'Accepted'] | ['s510606230', 's482690872'] | [3064.0, 3064.0] | [17.0, 19.0] | [478, 413] |
p02761 | u737321654 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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())\nrules = [list(map(int, input().split())) for i in range(M)]\nans = '-1'\nnum = '1' + '0'*(N-1)\nidxes = []\n\nfor rule in rules:\n num = num[:rule[0]-1] + str(rule[1]) + num[rule[0]:]\n\nif num[0] != '0':\n ans = num\nelif num[0] == '0' and N == 1:\n ans = '0'\n \nfor rule in rules:\n idxes.append(rule[0])\n\nidxes_set = set(idxes)\nif len(idxes) != len(idxes_set):\n ans = '-1'\n\nprint(ans)", "N,M = map(int, input().split())\nrules = [list(map(int, input().split())) for i in range(M)]\nans = '-1'\nif N != 0:\n num = '0'\nelse:\n num = '1' + '0'*(N-1)\nidxes = []\nvalues = []\n\nfor rule in rules:\n num = num[:rule[0]-1] + str(rule[1]) + num[rule[0]:]\n\nif num[0] != '0':\n ans = num\nelif num[0] == '0' and N == 1:\n ans = '0'\n \nfor rule in rules:\n if rule not in values:\n values.append(rule)\n\nfor i in values:\n idxes.append(i[0])\n\nidxes_set = set(idxes)\nif len(idxes) != len(idxes_set):\n ans = '-1'\n\nif len(num) != N:\n ans = '-1'\n\nprint(ans)", "N,M = map(int, input().split())\nrules = [list(map(int, input().split())) for i in range(M)]\nans = '-1'\nif N == 1:\n num = '0'\nelse:\n num = '1' + '0'*(N-1)\nidxes = []\nvalues = []\n\nfor rule in rules:\n num = num[:rule[0]-1] + str(rule[1]) + num[rule[0]:]\n\nif num[0] != '0':\n ans = num\nelif num[0] == '0' and N == 1:\n ans = '0'\n \nfor rule in rules:\n if rule not in values:\n values.append(rule)\n\nfor i in values:\n idxes.append(i[0])\n\nidxes_set = set(idxes)\nif len(idxes) != len(idxes_set):\n ans = '-1'\n\nif len(num) != N:\n ans = '-1'\n\nprint(ans)"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s054964665', 's165988276', 's539529446'] | [3064.0, 3064.0, 3064.0] | [17.0, 18.0, 18.0] | [424, 575, 575] |
p02761 | u740284863 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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())\nquery = [list(map(int,input().split())) for _ in range(m)]\nfor i in range(10**n):\n k = str(i)\n flag = True\n for s,c in query:\n if k[s-1] != c:\n flag = False\n if flag and len(k) == n:\n print(i)\n exit()\nprint(-1)', 'n,m = map(int,input().split())\nif m == 0:\n if n == 1:\n print(0)\n exit()\n if n == 2:\n print(10)\n exit()\n if n == 3:\n print(100)\n exit()\na = [-1]*n\nfor _ in range(m):\n s,c = map(int,input().split())\n if s == 1 and c == 0 and n == 3:\n print(-1)\n exit()\n if s == 1 and c == 0 and n == 2:\n print(-1)\n exit()\n if a[s-1] == -1:\n a[s-1] = c\n else:\n if a[s-1] != c:\n print(-1)\n exit()\n\nans = ""\nfor i in range(n):\n if a[i] == -1:\n if i == 0 or i == 1:\n ans += "1"\n else:\n ans += "0"\n else:\n ans += str(a[i])\n#print(ans)\nif ans[0] == "0" and n > 1:\n print(-1)\nelse:\n print(ans)', 'n,m = map(int,input().split())\nquery = [list(map(int,input().split())) for _ in range(m)]\nfor i in range(10**n):\n k = str(i)\n flag = True\n for s,c in query:\n if k[s-1] != str(c):\n flag = False\n if flag and len(k) == n:\n print(i)\n exit()\nprint(-1)', 'n,m = map(int,input().split())\nif m == 0:\n if n == 1:\n print(0)\n exit()\n if n == 2:\n print(10)\n exit()\n if n == 3:\n print(100)\n exit()\na = [-1]*n\nfor _ in range(m):\n s,c = map(int,input().split())\n if s == 1 and c == 0 and n == 3:\n print(-1)\n exit()\n if s == 1 and c == 0 and n == 2:\n print(-1)\n exit()\n if a[s-1] == -1:\n a[s-1] = c\n else:\n if a[s-1] != c:\n print(-1)\n exit()\n\nans = ""\nfor i in range(n):\n if a[i] == -1:\n if i == 0 or i == 1:\n ans += "1"\n else:\n ans += "0"\n else:\n ans += str(a[i])\n#print(ans)\nif ans[0] == "0" and n > 1:\n print(-1)\nelse:\n print(ans)', 'n,m = map(int,input().split())\nquery = [list(map(int,input().split())) for _ in range(m)]\nif n == 1:\n for i in range(10):\n k = str(i)\n flag = True\n for s,c in query:\n if int(k) != c:\n flag = False\n if flag:\n print(i)\n exit()\nelse:\n for i in range(10**(n-1),10**n):\n k = str(i)\n flag = True\n for s,c in query:\n if k[s-1] != str(c):\n flag = False\n if flag and len(k) == n:\n print(i)\n exit()\nprint(-1)'] | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s235345549', 's550597845', 's569369726', 's958703355', 's082193394'] | [3064.0, 3064.0, 3060.0, 3064.0, 3064.0] | [18.0, 17.0, 18.0, 17.0, 18.0] | [285, 752, 290, 752, 556] |
p02761 | u740909619 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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())\nsl = []\ncl = []\nfor i in range(M):\n s,c = map(int,input().split())\n s -= 1\n sl.append(s)\n cl.append(c)\nfor i in range(1000):\n digit = list(str(i))\n if len(digit) != N:\n continue\n flag = True\n\n for j in range(M):\n print(sl[j])\n print(digit[sl[j]])\n if int(digit[sl[j]]) != cl[j]:\n flag = False\n if flag:\n print(i)\n exit()\nprint(-1)', 'N,M = map(int,input().split())\nsl = []\ncl = []\nfor i in range(M):\n s,c = map(int,input().split())\n s -= 1\n sl.append(s)\n cl.append(c)\nfor i in range(1000):\n digit = list(str(i))\n if len(digit) != N:\n continue\n flag = True\n\n for j in range(M):\n if int(digit[sl[j]]) != cl[j]:\n flag = False\n if flag:\n print(i)\n exit()\nprint(-1)'] | ['Wrong Answer', 'Accepted'] | ['s218324776', 's986451534'] | [3572.0, 3064.0] | [22.0, 19.0] | [441, 392] |
p02761 | u744115306 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["n,m = map(int,input().split())\n\nl = ['a']*(n+1)\nfor i in range(m):\n s,c = map(int,input().split())\n if l[s-1] == 'a':\n l[s-1] = c\n else:\n if l[s-1] != c:\n l[n] = 1\n\nif l[0] == 'a' or '0':\n l[n] = 1\n\nif l[n] == 1:\n print(-1)\nelse:\n for i in range(n):\n if l[i] == 'a':\n l[i] = 0\n del l[-1]\n ans = map(str,l)\n ans = ''.join(ans)\n print(ans)", "n,m = map(int,input().split())\n\nl = ['a']*(n+1)\nfor i in range(m):\n s,c = map(int,input().split())\n if l[s-1] == 'a':\n l[s-1] = c\n else:\n if l[s-1] != c:\n l[n] = 'N'\n\n \nif n == 1 and l[n] =='a':\n if l[0] == 'a':\n print(0)\n else:\n print(l[0])\nelse:\n if l[0] == 'a':\n l[0] = 1\n if l[0] ==0:\n l[n] = 'N'\n if l[n] == 'N':\n print('-1')\n \n else:\n for i in range(n):\n if l[i] == 'a':\n l[i] = 0\n del l[-1]\n ans = map(str,l)\n ans = ''.join(ans)\n print(ans)"] | ['Wrong Answer', 'Accepted'] | ['s617690860', 's589401137'] | [3064.0, 3064.0] | [17.0, 17.0] | [410, 605] |
p02761 | u746419473 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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 _s, _c = map(int, input().split())\n s.append(_s)\n c.append(_c)\n\nfor i in range(1000):\n *t, = map(int, list(str(i)))\n\n if len(t) != n:\n continue\n\n ok = True\n for j in range(m):\n if t[s[j]] != c[j]:\n ok = False\n break\n\n if ok:\n print(i)\n quit()\n\nprint(-1)\n', 'n, m = map(int, input().split())\ns, c = [], []\nfor i in range(m):\n _s, _c = map(int, input().split())\n s.append(_s-1)\n c.append(_c)\n\nfor i in range(1000):\n *t, = map(int, list(str(i)))\n\n if len(t) != n:\n continue\n\n ok = True\n for j in range(m):\n if t[s[j]] != c[j]:\n ok = False\n break\n\n if ok:\n print(i)\n quit()\n\nprint(-1)\n'] | ['Runtime Error', 'Accepted'] | ['s786393396', 's503229081'] | [3064.0, 3064.0] | [19.0, 20.0] | [395, 397] |
p02761 | u746849814 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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\nflag = False\n\nused = []\nd = [0]*n\nfor _ in range(m):\n s, c = map(int, input().split())\n if n > 1 and (s == 1 and c == 0):\n flag = True\n if s in used:\n flag = True\n else:\n d[s-1] = c\n used.append(s)\n \nif flag:\n print(-1)\nelse:\n if d[0] == 0:\n d[0] = 1\n print(''.join(map(str, d)))", "n, m = map(int, input().split())\n\nflag = False\n\nused = []\nd = [0]*n\nfor _ in range(m):\n s, c = map(int, input().split())\n if n > 1 and (s == 1 and c == 0):\n flag = True\n if (s in used) and d[s-1] != c:\n flag = True\n else:\n d[s-1] = c\n used.append(s)\n \nif flag:\n print(-1)\nelse:\n if n != 1 and d[0] == 0: \n d[0] = 1\n print(''.join(map(str, d)))"] | ['Wrong Answer', 'Accepted'] | ['s954708379', 's029341678'] | [3064.0, 3064.0] | [17.0, 17.0] | [372, 402] |
p02761 | u747703115 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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 = pow(10, n-1)\nS = []\nC = []\nfor i in range(m):\n s, c = map(int, input().split())\n if s in S:\n if C[S.index(s)] != c:\n r = -1\n break\n if s==1 and c==0:\n r = -1\n break\n else:\n S.append(s)\n C.append(c)\n if s==1:\n r += (c-1)*pow(10, n-s)\n else:\n r += c*pow(10, n-s)\nprint(r)', 'n, m = map(int, input().split())\nif n==1 and m==0:\n print(0)\n exit()\nr = pow(10, n-1)\nS = []\nC = []\nfor i in range(m):\n s, c = map(int, input().split())\n if s in S:\n if C[S.index(s)] != c:\n r = -1\n break\n else:\n continue\n if s==1 and c==0:\n if n==1:\n r = 0\n S.append(s)\n C.append(c)\n else:\n r = -1\n break\n else:\n S.append(s)\n C.append(c)\n if s==1:\n r += (c-1)*pow(10, n-s)\n else:\n r += c*pow(10, n-s)\nprint(r)'] | ['Wrong Answer', 'Accepted'] | ['s415606231', 's429198230'] | [3064.0, 3064.0] | [17.0, 17.0] | [411, 593] |
p02761 | u749770850 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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 = []\nfor i in range(m):\n s.append(list(map(int, input().split())))\n\nif n == 1:\n a = [str(i) for i in range(10)]\nelif n == 2:\n a = [str(i) for i in range(10:100)]\nelif n == 3:\n a = [str(i) for i in range(100:1000)]\n\nans = []\n\nfor i in a:\n b = True\n for j in s:\n if int(i[j[0]-1]) != j[1]:\n b = False\n break\n if b:\n ans.append(i)\n\nif len(ans) == 0:\n print(-1)\nelse:\n print(min(ans))\n\n', 'n, m = map(int, input().split())\n\ns = []\nfor i in range(m):\n s.append(list(map(int, input().split())))\n\nif n == 1:\n a = [str(i) for i in range(10)]\nelif n == 2:\n a = [str(i) for i in range(10,100)]\nelif n == 3:\n a = [str(i) for i in range(100,1000)]\n\nans = []\n\nfor i in a:\n b = True\n for j in s:\n if int(i[j[0]-1]) != j[1]:\n b = False\n break\n if b:\n ans.append(i)\n\nif len(ans) == 0:\n print(-1)\nelse:\n print(min(ans))\n\n'] | ['Runtime Error', 'Accepted'] | ['s537383696', 's051364714'] | [2940.0, 3064.0] | [17.0, 19.0] | [481, 481] |
p02761 | u760771686 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['hashmap = {}\nN, M = map(int,input().split()) \nP = [list(map(int,input().split())) for i in range(M)]\n\n# N, M = 3, 2\n# P = [[2,1],[2,3]]\n\ndef func():\n for l in P:\n if l[0] in hashmap and hashmap[l[0]]!=l[1]:\n return -1\n else:\n hashmap[l[0]]=l[1]\n\n ans = ""\n if 1 not in hashmap:\n ans+="1"\n else:\n ans+=str(hashmap[1])\n\n for i in range(2,N+1):\n if i not in hashmap:\n ans+="0"\n else:\n ans+=str(hashmap[i])\n\n return int(ans)', 'hashmap = {}\nN, M = map(int,input().split()) \nP = [list(map(int,input().split())) for i in range(M)]\n\n# N, M = 3, 3\n# p = [[1,7],[3,2],[1,7]]\n\nfor l in P:\n if l[0] in hashmap and hashmap[l[0]]!=l[1]:\n print(-1)\n else:\n hashmap[l[0]]=l[1]\nprint(hashmap) \n\nans = ""\nif 1 not in hashmap:\n ans+="1"\nelse:\n ans+=str(hashmap[1])\n \nfor i in range(2,N+1):\n if i not in hashmap:\n ans+="0"\n else:\n ans+=str(hashmap[i])\n\nprint(int(ans))', 'def main():\n N, M = map(int,input().split())\n dct = {}\n ans = [0]*N\n for _ in range(M):\n s, c = map(int,input().split())\n ans[s-1]=c\n if s==1 and c==0 and N>=2:\n print(-1)\n return\n elif s not in dct:\n dct[s] = c\n else:\n if dct[s]!=c:\n print(-1)\n return \n if ans[0]==0 and N>=2:\n ans[0]=1\n res = 0\n for i in ans:\n res*=10\n res+=i\n print(res)\n return\nmain()'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s905906940', 's994199386', 's475947607'] | [3064.0, 3064.0, 9212.0] | [17.0, 17.0, 30.0] | [524, 477, 422] |
p02761 | u760794812 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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 = ['a']*N\nfor _ in range(M):\n s,c = map(int,input().split())\n if A[s-1] !='a' and A[s-1] != c:\n print(-1)\n exit()\n else:\n A[s-1] = c\n\nfor i in range(N):\n if A[0] == 'a' and N==3:\n A[0] = 1\n else A[i] == 'a':\n A[i] = 0\nAnswer = ''.join(map(str,A))\n\nif Answer != '0' and len(Answer) != N:\n Answer = -1\nif Answer == '000':\n Answer = -1\nprint(Answer)\n", "N,M = map(int,input().split())\nA = ['a']*N\nfor _ in range(M):\n s,c = map(int,input().split())\n A[s-1] = c\n\nfor i in range(N):\n if A[i] == 'a':\n A[i] = 9\nAnswer = ''.join(map(str,A))\n\nif Answer != 0 and len(Answer) != N:\n Answer = -1\n\nprint(Answer)", "N,M = map(int,input().split())\nret = ['a']*N\nfor _ in range(M):\n s,c = map(int,input().split())\n if ret[s-1] not in ['a', c]:\n print(-1)\n exit()\n ret[s-1] = c\nif ret[0] == 0:\n if N != 1:\n print(-1)\n exit()\nans = ''\nfor i in range(N):\n if ret[i] != 'a':\n ans += str(ret[i])\n else:\n if i == 0 and N > 1:\n ans += '1'\n else:\n ans += '0'\nprint(int(ans))"] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s473509749', 's811153911', 's634754735'] | [3064.0, 3064.0, 9112.0] | [18.0, 17.0, 27.0] | [402, 254, 385] |
p02761 | u764956288 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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\n# S = input()\n# N, M = map(int, input().split())\n# As = [int(input()) for _ in range(N)]\n# nums = list(map(int, input().split()))\n# nums_2d = [list(map(int, input().split())) for _ in range(N)]\n\n\ndef main():\n print(solve())\n\n\ndef solve():\n N, M = map(int, input().split())\n\n scs = [list(map(int, input().split())) for _ in range(M)]\n\n minimum = 10 ** (N-1)\n if minimum == 1:\n minimum = 0\n maximum = 10 ** N - 1\n\n ans = -1\n for i in range(minimum, maximum+1):\n candidate = str(i)\n ok = True\n for s, c in scs:\n if candidate[s-1] != c:\n ok = False\n break\n if ok:\n ans = int(candidate)\n break\n\n return ans\n\n\nif __name__ == '__main__':\n main()\n", "import sys\n\n# S = input()\n# N, M = map(int, input().split())\n# As = [int(input()) for _ in range(N)]\n# nums = list(map(int, input().split()))\n# nums_2d = [list(map(int, input().split())) for _ in range(N)]\n\n\ndef main():\n print(solve())\n\n\ndef solve():\n N, M = map(int, input().split())\n\n scs = [list(map(int, input().split())) for _ in range(M)]\n\n minimum = 10 ** (N-1)\n if minimum == 1:\n minimum = 0\n maximum = 10 ** N - 1\n\n ans = -1\n for i in range(minimum, maximum+1):\n candidate = str(i)\n ok = True\n for s, c in scs:\n if candidate[s-1] != str(c):\n ok = False\n break\n if ok:\n ans = int(candidate)\n break\n\n return ans\n\n\nif __name__ == '__main__':\n main()\n"] | ['Wrong Answer', 'Accepted'] | ['s774781755', 's745863059'] | [3064.0, 3064.0] | [17.0, 17.0] | [779, 784] |
p02761 | u765865533 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['\nN,M=map(int,input().split())\nSC=[]\nfor i in range(M):\n SC.append(list(map(int,input().split())))\n\nimport numpy as np\nSC=np.array(SC)\n\n\nketa=np.unique(SC[:,0])\nflag=0\nfor i in keta:\n if len(np.unique(SC[SC[:,0]==i]))>=3:\n flag=1\nfor x in SC[SC[:,0]==1]:\n if x[1]==0:\n flag=1\n\nans=[0]*N\nans[0]=1\nif flag!=1:\n for i in keta:\n ans[i-1]=np.unique(SC[SC[:,0]==i])[1]\n ans2=""\n for a in ans:\n ans2+=str(a)\n print(ans2)\nelse:\n print(-1)', 'N,M=map(int,input().split())\nans=[0]*N\nSC=[0]*N\nflag=0\nflag2=0\nfor i in range(M):\n s,c=map(int,input().split())\n if s-1==0:\n flag2=1\n if SC[s-1]==1:\n if ans[s-1]!=c:\n flag=1\n else:\n SC[s-1]=1\n ans[s-1]=c\n\nif flag2==0 and N!=1:\n ans[0]=1\n\nif ans[0]==0 and N!=1:\n flag=1\n\nif flag==0:\n ans2=""\n for a in ans:\n ans2+=str(a)\n print(ans2)\nelse:\n print(-1)'] | ['Runtime Error', 'Accepted'] | ['s281753258', 's373734794'] | [12452.0, 3064.0] | [151.0, 17.0] | [481, 425] |
p02761 | u767664985 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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\nans_flag = [0] * N \n\nfor _ in range(M):\n s, c = map(int, input().split())\n if N != 1 and s == 1 and c == 0: \n print(-1)\n exit()\n elif ans_flag[s-1] == 1 and ans[s-1] != c:\n print(-1)\n exit()\n else:\n ans[s-1] = c\n ans_flag[s-1] = 1\n\nprint(ans)\nprint(ans_flag)\n\nif N != 1 and ans[0] == 0: \n ans[0] = 1\n\nprint(int("".join(map(str, ans))))\n', 'N, M = map(int, input().split())\nans = [0] * N\nans_flag = [0] * N \n\nfor _ in range(M):\n s, c = map(int, input().split())\n if N != 1 and s == 1 and c == 0: \n print(-1)\n exit()\n elif ans_flag[s-1] == 1 and ans[s-1] != c:\n print(-1)\n exit()\n else:\n ans[s-1] = c\n ans_flag[s-1] = 1\n\nif N != 1 and ans[0] == 0: \n ans[0] = 1\n\nprint(int("".join(map(str, ans))))\n'] | ['Wrong Answer', 'Accepted'] | ['s062288390', 's515801269'] | [3064.0, 3064.0] | [17.0, 19.0] | [583, 555] |
p02761 | u769870836 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['n,m=map(int,input().split())\nl=[]\nfor i in range(m):\n a,b=map(int,input().split())\n l.append([a,b])\nfor i in range(10**(n-1)-1,10**n):\n x=str(i)\n c=0\n for i in range(m):\n if x[l[i][0]-1]==str(l[i][1]):\n c+=1\n if c==m:\n print(x)\n quit()\nprint(-1)', 'n,m=map(int,input().split())\nl=[]\nfor i in range(m):\n a,b=map(int,input().split())\n l.append([a,b])\nfor i in range(10**n):\n x=str(i)\n if len(x)<n:pass\n else:\n c=0\n for i in range(m):\n if x[l[i][0]-1]==str(l[i][1]):\n c+=1\n if c==m:\n print(x)\n quit()\nprint(-1)'] | ['Runtime Error', 'Accepted'] | ['s069070450', 's783860683'] | [3064.0, 3064.0] | [18.0, 19.0] | [265, 294] |
p02761 | u771383254 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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, c = [], []\nfor _ in range(m):\n s_, c_ = map(int, input().split())\n s.append(s_)\n c.append(c_)\n\nflg = False\nfor i in range(10**n):\n for j in range(m):\n if str(i)[s[j]-1] != str(c[j]):\n break\n else:\n print(i)\n flg = True\n break\nif not flg:\n print(-1)', 'n, m = map(int, input().split())\n\ns, c = [], []\nfor _ in range(m):\n s_, c_ = map(int, input().split())\n s.append(s_)\n c.append(c_)\n\nfor i in range(10**n):\n ans = str(i)\n if len(ans) == n and all([ans[s[j]-1] == str(c[j]) for j in range(m)]):\n print(ans)\n exit()\n\nprint(-1)'] | ['Runtime Error', 'Accepted'] | ['s883528604', 's482669401'] | [9200.0, 9168.0] | [27.0, 29.0] | [308, 283] |
p02761 | u777496561 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["def solve(dic, n, bad):\n if bad:\n return -1\n\n li = [-1]*n\n for k, v in dic.items():\n li[k-1] = v\n\n if n==1:\n if li[0] == -1: ## unset\n return 0\n else: ## li is obviously set by dictionary\n st = map(str, li)\n return int(''.join(st))\n\n else:\n if li[0] == 0:\n ## well not possible for a n digit number\n return -1\n if li[0] == -1:\n ## no one asked to set this so take any one\n li[0] = 1\n for i in range(1, n):\n if li[i] == -1:\n li[i] = 0\n\n st = map(str, li)\n return int(''.join(st))\n else:\n for i in range(1, n):\n if li[i] == -1:\n li[i] = 0\n st = map(str, li)\n return int(''.join(st))\n \n\nn, m = map(int, input().split())\n\ndic = {}\nbad = False\nfor i in range(m):\n s, c = map(int, input().split())\n if dic.get(s, -1)==-1:\n dic[s] = c\n else:\n bad = True\n if s > n:\n bad = True\n\nprint(solve(dic, n, bad))\n", "def solve(dic, n, bad):\n if bad:\n return -1\n\n li = [-1]*n\n for k, v in dic.items():\n li[k-1] = v\n\n print(li)\n if n==1:\n if li[0] == -1: ## unset\n return 1\n else: ## li is obviously set by dictionary\n st = map(str, li)\n return int(''.join(st))\n\n else:\n if li[0] == 0:\n ## well not possible for a n digit number\n return -1\n if li[0] == -1:\n ## no one asked to set this so take any one\n li[0] = 1\n for i in range(1, n):\n if li[i] == -1:\n li[i] = 0\n\n st = map(str, li)\n return int(''.join(st))\n else:\n for i in range(1, n):\n if li[i] == -1:\n li[i] = 0\n st = map(str, li)\n return int(''.join(st))\n \n\nn, m = map(int, input().split())\n\ndic = {}\nbad = False\nfor i in range(m):\n s, c = map(int, input().split())\n if dic.get(s, -1)==-1:\n dic[s] = c\n else:\n bad = True\n\nprint(solve(dic, n, bad))\n", "def solve(dic, n, bad):\n if bad:\n return -1\n\n li = [-1]*n\n for k, v in dic.items():\n li[k-1] = v\n\n if n==1:\n if li[0] == -1: ## unset\n return 0\n else: ## li is obviously set by dictionary\n st = map(str, li)\n return int(''.join(st))\n\n else:\n if li[0] == 0:\n ## well not possible for a n digit number\n return -1\n if li[0] == -1:\n ## unset; so take any one one digit\n li[0] = 1\n for i in range(1, n):\n if li[i] == -1:\n li[i] = 0\n\n st = map(str, li)\n return int(''.join(st))\n else:\n for i in range(1, n):\n if li[i] == -1:\n li[i] = 0\n st = map(str, li)\n return int(''.join(st))\n \n\nn, m = map(int, input().split())\n\ndic = {}\nbad = False\nfor i in range(m):\n s, c = map(int, input().split())\n if dic.get(s, -1)==-1:\n dic[s] = c\n else:\n bad = True\n\nprint(solve(dic, n, bad))\n", "def solve(dic, n, bad):\n if bad:\n return -1\n\n li = [-1]*n\n for k, v in dic.items():\n li[k-1] = v\n\n if n==1:\n if li[0] == -1: ## unset\n return 0\n else: ## li is obviously set by dictionary\n st = map(str, li)\n return int(''.join(st))\n\n else:\n if li[0] == 0:\n ## well not possible for a n digit number\n return -1\n if li[0] == -1:\n ## unset; so take any one one digit\n li[0] = 1\n for i in range(1, n):\n if li[i] == -1:\n li[i] = 0\n\n st = map(str, li)\n return int(''.join(st))\n else:\n for i in range(1, n):\n if li[i] == -1:\n li[i] = 0\n st = map(str, li)\n return int(''.join(st))\n \n\nn, m = map(int, input().split())\n\ndic = {}\nbad = False\nfor i in range(m):\n s, c = map(int, input().split())\n if dic.get(s, -1) == -1: \n dic[s] = c\n else:\n if dic[s] != c:\n bad = True\n\nprint(solve(dic, n, bad))\n"] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s310337731', 's618355622', 's641915501', 's831066993'] | [3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 17.0, 17.0, 17.0] | [1112, 1093, 1071, 1124] |
p02761 | u779728630 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['N, M = map(int, input().split())\n\nif N == 1:\n ans = "*"\nelif N == 2:\n ans = "**"\nelse: #N==3\n ans = "***"\n\n \nng = False\nfor i in range(M):\n s, c = input().split()\n s = int(s)\n if ans[s] != \'*\' or ans[s] != c:\n ng = True\n break\n else:\n ans[s] = c\n\nif N == 1 and ans == "*":\n ans = "0"\nif N == 2:\n if ans[0] == "*":\n ans[0] = "1"\n if ans[1] == "*":\n ans[1] = "0"\nif N == 3:\n if ans[0] == "*":\n ans[0] = "1"\n if ans[1] == "*":\n ans[1] = "0"\n if ans[2] == "*":\n ans[2] = "0"\n\nif ng:\n print(-1)\nelse:\n print(int(ans))', 'N, M = map(int, input().split())\n\nif N == 1:\n ans = ["*"]\nelif N == 2:\n ans = ["*","*"]\nelse: #N==3\n ans = ["*","*","*"]\n \nng = False\nfor i in range(M):\n s, c = input().split()\n s = int(s)-1\n if ans[s] != \'*\' and ans[s] != c:\n ng = True\n break\n elif s==0 and c=="0" and N>1:\n ng = True\n break\n else:\n ans[s] = c\n\nif N == 1 and ans[0] == "*":\n ans[0] = "0"\nif N == 2:\n if ans[0] == "*":\n ans[0] = "1"\n if ans[1] == "*":\n ans[1] = "0"\nif N == 3:\n if ans[0] == "*":\n ans[0] = "1"\n if ans[1] == "*":\n ans[1] = "0"\n if ans[2] == "*":\n ans[2] = "0"\n\nif ng:\n print(-1)\nelse:\n print("".join(ans))'] | ['Runtime Error', 'Accepted'] | ['s171832593', 's851551755'] | [3064.0, 3064.0] | [17.0, 17.0] | [552, 635] |
p02761 | u785578220 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["dp = [[0]*3 for i in range(3)]\nL = []\na = list(map(int,input().split()))\nb = list(map(int,input().split()))\nc = list(map(int,input().split()))\nL = [a,b,c]\nn = int(input())\nl = []\nfor i in range(n):\n l.append(int(input()))\n\nflag = 0 \n\nfor i in range(3):\n for j in range(3):\n if L[i][j] in l:\n dp[i][j] = 1\n# dp = [[1,1,0],[0,1,0],[1,0,1]]\nfor i in range(3):\n if sum(dp[i]) ==3:\n flag = 1\n\nfor j in range(3):\n s = 0\n for i in range(3):\n s+= dp[i][j]\n if s == 3:\n flag = 1\ns = 0\nt = 0\nfor i in range(3):\n s+= dp[i][i]\n t+= dp[i][2-i]\nif s==3 or t == 3:\n flag = 1\n \nif flag:\n print('Yes')\nelse:\n print('No')\n# print(dp)", ",m = map(int,input().split())\n\nl = []\n\nfor i in range(m):\n ta,tb = map(int,input().split())\n l.append((ta-1,tb))\nans = [0]*n\nl.sort()\nif m ==0 and n==1:\n print(0)\n exit()\nelif m ==0:\n print('1'+'0'*(n-1))\n exit()\nelif n == 1:\n if len(set(l)) ==1:\n print(l[0][1])\n else:\n print(-1)\n exit()\nelif l[0][1] == 0 and l[0][0]==0:\n print(-1)\n exit()\nelse:\n l = set(l)\n for i,j in l:\n if ans[i] ==0:\n ans[i] = j\n else:\n # print(i,j)\n print(-1)\n exit()\na = ''\nfor i in ans:\n a+=str(i)\nif a[0]=='0':\n a='1'+a[1:]\nprint(a)\n\n \n \n", "\nn,m = map(int,input().split())\n\nl = []\n\nfor i in range(m):\n ta,tb = map(int,input().split())\n l.append((ta-1,tb))\nans = [0]*n\nl.sort()\nif m ==0 and n==1:\n print(0)\n exit()\nelif m ==0:\n print('1'+'0'*(n-1))\n exit()\nelif n == 1:\n if len(set(l)) ==1:\n print(l[0][1])\n else:\n print(-1)\n exit()\nelif l[0][1] == 0 and l[0][0]==0:\n print(-1)\n exit()\nelse:\n l = set(l)\n for i,j in l:\n if ans[i] ==0:\n ans[i] = j\n else:\n # print(i,j)\n print(-1)\n exit()\na = ''\nfor i in ans:\n a+=str(i)\nif a[0]=='0':\n a='1'+a[1:]\nprint(a)\n\n \n \n"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s288807752', 's697986446', 's819337638'] | [3064.0, 2940.0, 3188.0] | [17.0, 17.0, 20.0] | [691, 647, 649] |
p02761 | u787131053 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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 No():\n print("-1")\n exit()\n\nN,M = map(int, input().split(" "))\n\n# print(N+M)\n \nS = []\nC = []\nFlag = True\n\nfor i in range(0,M):\n s,c = map(int, input().split(" "))\n for j in range(0, len(S)):\n if s == S[j] and c != C[j]:\n Flag = False\n S.append(s)\n C.append(c)\n\nif Flag is False:\n No()\noutput = 0\nflag = [False,False,False]\nprint(S)\nprint(C)\n# if S.count(1) == 0:\n# print(S.count(1))\n# No()\n\nfor i in range(0,len(S)):\n \n if S[i] == 1 and flag[0]==False:\n if C[i] == 0 and N != 1:\n No()\n output += 100 * C[i]\n flag[0]=True\n \n if S[i] == 2 and flag[1]==False:\n output += 10 * C[i]\n flag[1]=True\n \n if S[i] == 3 and flag[2] == False:\n output += C[i]\n flag[2]=True\n \nif (N == 3 or N == 2) and flag[0]==False:\n output += 100\n\noutput = int(output / (10 ** (3-N)))\n# print(output)\nif output < 10 ** (N-1) and output != 0:\n No()\nprint(output)', 'def No():\n print("-1")\n exit()\n\nN,M = map(int, input().split(" "))\n\n# print(N+M)\n \nS = []\nC = []\nFlag = True\n\nfor i in range(0,M):\n s,c = map(int, input().split(" "))\n for j in range(0, len(S)):\n if s == S[j] and c != C[j]:\n Flag = False\n S.append(s)\n C.append(c)\n\nif Flag is False:\n No()\noutput = 0\nflag = [False,False,False]\n# print(S)\n# print(C)\n# if S.count(1) == 0:\n# print(S.count(1))\n# No()\n\nfor i in range(0,len(S)):\n \n if S[i] == 1 and flag[0]==False:\n if C[i] == 0 and N != 1:\n No()\n output += 100 * C[i]\n flag[0]=True\n \n if S[i] == 2 and flag[1]==False:\n output += 10 * C[i]\n flag[1]=True\n \n if S[i] == 3 and flag[2] == False:\n output += C[i]\n flag[2]=True\n \nif (N == 3 or N == 2) and flag[0]==False:\n output += 100\n\noutput = int(output / (10 ** (3-N)))\n# print(output)\nif output < 10 ** (N-1) and output != 0:\n No()\nprint(output)'] | ['Wrong Answer', 'Accepted'] | ['s691787626', 's469820875'] | [3064.0, 3064.0] | [17.0, 17.0] | [986, 990] |
p02761 | u790048565 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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\nguess = []\nfor _ in range(M):\n s, c = map(int, input().split())\n guess.append([s, c])\n\nfor n in range(pow(10, N)):\n if (len(str(n)) != N):\n continue\n \n valid = True\n for s_c in guess:\n keta = s_c[0]\n index = keta - 1\n if (str(n)[index] != str(s_c[1])):\n valid = False\n break\n \n if (valid == False):\n continue\n else:\n print(n)\n return\n\nprint(-1)', 'N, M = map(int, input().split())\n\nguess = []\nfor _ in range(M):\n s, c = map(int, input().split())\n guess.append([s, c])\n\nresult = -1\nfor n in range(pow(10, N)):\n if (len(str(n)) != N):\n continue\n \n valid = True\n for s_c in guess:\n keta = s_c[0]\n index = keta - 1\n if (str(n)[index] != str(s_c[1])):\n valid = False\n break\n \n if (valid == False):\n continue\n else:\n result = n\n break\n\nprint(result)'] | ['Runtime Error', 'Accepted'] | ['s240100305', 's508628911'] | [3064.0, 3064.0] | [17.0, 18.0] | [418, 435] |
p02761 | u794066762 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["n,m= map(int,input().split(' '))\narr=[0 for i in range(n)]\n\nim= False\nfor i in range(m):\n\tx,y= map(int,input().split(' '))\n\tif x==1 and y==0:\n\t\tim=True\n\tif arr[x-1]!=-1 and arr[x-1]!=y:\n\t\tim=True\n\tarr[x-1]=y\nif arr[0]==0:\n\tarr[0]=1\nif im:\n\tprint(-1)\nelse:\n\tprint(''.join(str(i) for i in arr))", "n,m= map(int,input().split(' '))\narr=[0 for i in range(n)]\n\nim= False\nfor i in range(m):\n\tx,y= map(int,input().split(' '))\n\tif x==1 and y==0 and n>1:\n\t\tim=True\n\tif arr[x-1]!=0 and arr[x-1]!=y:\n\t\tim=True\n\tarr[x-1]=y\nif arr[0]==0 and n>1:\n\tarr[0]=1\nif im:\n\tprint(-1)\nelse:\n\tprint(''.join(str(i) for i in arr))"] | ['Wrong Answer', 'Accepted'] | ['s461756857', 's792107980'] | [3064.0, 3188.0] | [19.0, 20.0] | [292, 307] |
p02761 | u796842765 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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 = ["x"]*N\nfor a, b in zip(S, C):\n if A[a-1] == "x":\n A[a-1] = b\n else:\n if b == A[a-1]:\n A[a-1] = b\n else:\n print(-1)\n exit()\n\nif N != 1 and A[0] == "x":\n A[0] = 1\n\nif A[0] == "x":\n if N != 1:\n print(-1)\n exit()\nif A[0] == 0 and N != 1:\n print(-1)\n exit()\n\nfor a in range(N):\n if A[a-1] == "x":\n A[a-1] = 0\nfor a in A:\n print(a, end="")', 'N, M = map(int, input().split())\nS = []\nC = []\nfor i in range(M):\n s, c = input().split()\n S.append(int(s))\n C.append(int(c))\n\nA = [0]*N\nfor a, b in zip(S, C):\n A[a-1] = b\n\nif len(A) != 1 and A[0] == 0:\n print(-1)\nelse:\n for a in A:\n print(a, end="")\n', 'N, M = map(int, input().split())\nS = []\nC = []\nfor i in range(M):\n s, c = input().split()\n S.append(int(s))\n C.append(int(c))\n\nA = [0]*N\nfor a, b in zip(S, C):\n if a == 1 and b == 0:\n if N != 1:\n print(-1)\n exit()\n if a == 2 and b == 0:\n if N != 3:\n print(-1)\n exit()\n A[a-1] = b\n\nif N == 3 and A[0] == 0:\n A[0] = 1\n\nif N == 2 and A[0] == 0:\n A[0] = 1\nfor a in A:\n print(a, end="")\n', 'N,M = map(int,input().split())\nS = []\nC = []\n\nfor a in range(M):\n s,c = map(int,input().split())\n S.append(s)\n C.append(c)\n\na = ["0"]*N\ne = []\nfor b,d in zip(S,C):\n if b in e:\n if str(d) != a[b-1]:\n print(-1)\n exit()\n elif b == 1 and d == 0:\n if N != 1:\n print(-1)\n exit()\n else:\n e.append(b)\n a[b-1] = str(d)\n\nif a[0] == "0" and N != 1:\n a[0] = "1"\nanswer = \'\'.join(a)\nanswer = int(answer)\nprint(answer)'] | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s157964277', 's902457566', 's947720056', 's447730111'] | [3064.0, 3064.0, 3064.0, 9208.0] | [19.0, 18.0, 20.0, 30.0] | [437, 276, 467, 497] |
p02761 | u797572808 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['s = input().split()\nn = int(s[0])\nm = int(s[1])\n\n\ninit = list(input().split() for _ in range(m))\n\nn_box = list(False for _ in range(n))\n\nflag = 0\n\n\n\n\nfor i in range(m):\n if(n_box[int(init[i][0])-1] == False or n_box[int(init[i][0])-1] == init[i][1]):\n n_box[int(init[i][0])-1] = init[i][1]\n else:\n flag = 1\n break\n \nn_box = [int(i) for i in n_box]\n\nmoji =""\n\n#print(n_box)\n#print(flag)\n\nif(n_box[0] != 0 and flag == 0):\n for i in n_box:\n moji += str(i)\n if(int(moji) >= 10**(n-1)):\n print(moji)\n else:\n flag = 1\nelse:\n flag = 1\n\n\nif(flag == 1):\n print(-1)', 'def solve():\n\n n,m = [int(i) for i in input().split()]\n \n \n s = [-1 for _ in range(m)]\n c = [-1 for _ in range(m)]\n \n for i in range(m):\n s[i],c[i] = [int(j) for j in input().split()]\n \n res = [-1 for _ in range(n)]\n \n for i in range(m):\n if(s[i] == 1 and c[i] == 0 and n != 1):\n print(-1)\n return\n elif(res[s[i]-1] != -1 and res[s[i]-1] != c[i]):\n print(-1)\n return\n \n else:\n res[s[i]-1] = c[i]\n \n if(res[0] == -1 and n!=1):\n res[0] = 1\n \n if(res[0] == 0 and n==1):\n print(0)\n return\n \n for i in range(n):\n if(res[i] == -1):\n res[i] = 0\n \n \n res = [str(_a) for _a in res]\n res = "".join(res)\n print(res)\n\nif __name__ == "__main__":\n solve()'] | ['Wrong Answer', 'Accepted'] | ['s403073801', 's670305381'] | [3064.0, 3064.0] | [18.0, 17.0] | [641, 839] |
p02761 | u798818115 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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# Your code here!\nN,M=map(int,input().split())\n\nl=[]\nfor _ in range(M):\n s,t=map(int,input().split())\n l.append([s,t])\n\nfor i in range(10**(N-1),10**N):\n #print(i)\n temp=list(str(i))\n judge=True\n for s,t in l:\n if temp[N-s]!=str(t):\n judge=False\n if judge:\n print(i)\n exit()\n\nprint(-1)\n', '# coding: utf-8\n# Your code here!\nN,M=map(int,input().split())\n\nl=[]\nfor _ in range(M):\n s,t=map(int,input().split())\n l.append([s,t])\n\nfor i in range(10**(N-1) if N!=1 else 0,10**N):\n temp=list(str(i))\n judge=True\n for s,t in l:\n if temp[s-1]!=str(t):\n judge=False\n if judge:\n print(i)\n exit()\n \nprint(-1)\n'] | ['Wrong Answer', 'Accepted'] | ['s849492060', 's729898819'] | [3060.0, 3060.0] | [19.0, 18.0] | [353, 362] |
p02761 | u799215419 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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())\nexists = True\ndigits = [-1]*N\n\nfor i in range(M):\n s, c = map(int, input().split())\n if digits[s-1] == -1 or digits[s-1] == c:\n digits[s-1] = c\n else:\n exists = False\n break\n\nans = 0\ndigits = list(reversed(digits))\nprint(digits)\nfor i in range(N):\n if digits[i] == -1:\n if i == N-1:\n digits[i] = 1\n else:\n digits[i] = 0\n if i == N-1:\n if digits[i] == 0:\n exists = False\n break\n elif digits[i] == -1:\n digits[i] = 1\n ans += (10 ** i)*digits[i]\n else:\n ans += (10 ** i)*digits[i]\n else:\n ans += (10 ** i)*digits[i]\n\nif exists:\n print(ans)\nelse:\n print(-1)\n', 'N, M = map(int, input().split())\nexists = True\ndigits = [-1]*N\nfor i in range(M):\n s, c = map(int, input().split())\n if N > 1 and s == 1 and c == 0:\n exists = False\n break\n elif digits[s-1] == -1 or digits[s-1] == c:\n digits[s-1] = c\n else:\n exists = False\n break\nif exists:\n ans = 0\n digits = list(reversed(digits))\n for i in range(N):\n if digits[i] == -1:\n digits[i] = 0\n ans += (10 ** i)*digits[i]\n print(digits)\n print(ans)\nelse:\n print(-1)\n', 'N, M = map(int, input().split())\nexists = True\ndigits = [-1]*N\nfor i in range(M):\n s, c = map(int, input().split())\n if N > 1 and s == 1 and c == 0:\n exists = False\n break\n elif digits[s-1] == -1 or digits[s-1] == c:\n digits[s-1] = c\n else:\n exists = False\n break\nif exists:\n ans = 0\n digits = list(reversed(digits))\n for i in range(N):\n if digits[i] == -1:\n if i == N - 1 and N > 1:\n digits[i] = 1\n else:\n digits[i] = 0\n ans += (10 ** i)*digits[i]\n print(ans)\nelse:\n print(-1)\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s713607056', 's895673153', 's490168297'] | [3064.0, 3064.0, 3064.0] | [17.0, 17.0, 17.0] | [751, 535, 606] |
p02761 | u799691369 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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 = [10 for _ in range(N)]\n\nfor i in range(M):\n s, c = map(int, input().split())\n s -= 1\n\n A[s] = min(A[s], c)\n\nfor i in range(N):\n if A[i] == 10:\n A[i] = 0\n A[i] = str(A[i]) \n\nprint(A)\nans = int(''.join(A))\n\nif len(str(ans)) == N: print(ans)\nelse: print(-1)", "N, M = map(int, input().split())\nSC = [[] for _ in range(N)]\n\nerror = False\nfor _ in range(M):\n s, c = map(int, input().split())\n s -= 1\n if SC[s] and SC[s] != c:\n error = True\n break\n else:\n SC[s] = c\n\nif error:\n print(-1)\nelif SC[0] == 0 and len(SC) > 1:\n print(-1)\nelse:\n if not SC[0] and len(SC) == 1:\n SC[0] = 0\n if not SC[0] and len(SC) > 1:\n SC[0] = 1\n if len(SC) > 1 and not SC[1]:\n SC[1] = 0\n if len(SC) > 2 and not SC[2]:\n SC[2] = 0\n print(''.join(map(str,SC)))\n"] | ['Wrong Answer', 'Accepted'] | ['s442872577', 's938260378'] | [3064.0, 3064.0] | [17.0, 18.0] | [313, 554] |
p02761 | u800058906 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["import sys\nn,m=map(int,input().split())\nsc=[list(map(int,input().split())) for i in range(m)]\n\nnum=[0]*n\n\nfor i in range(m):\n if sc[i][0]==0:\n print('-1')\n sys.exit()\n if num[sc[i][0]-1]!=0 and num[sc[i][0]-1]!=sc[i][1]:\n print('-1')\n sys.exit()\n else:\n num.insert(sc[i][0]-1,sc[i][1])\n\nc=0\n\nif num[0]==0:\n num.insert(0,1)\n for i in range(n):\n c+=num[i]*(10**(n-i-1))\n\nelse:\n for i in range(n):\n c+=num[i]*(10**(n-i-1))\n \nprint(c)", "import sys\nn,m=map(int,input().split())\nsc=[list(map(int,input().split())) for i in range(m)]\n\nnum=['_']*n\n\nif n==1 and m==0:\n print('0')\n sys.exit()\n\nif n==1 and m==1 and sc[0][1]==0:\n print('0')\n sys.exit()\n\nfor i in range(m):\n if num[sc[i][0]-1]!='_' and num[sc[i][0]-1]!=sc[i][1]:\n print('-1')\n sys.exit()\n else:\n num[sc[i][0]-1]=sc[i][1]\n\nif num[0]==0:\n print('-1')\n sys.exit()\n \nif num[0]=='_':\n num[0]=1\n \nfor i in range(1,n):\n if num[i]=='_':\n num[i]=0\n \nprint(''.join(map(str,num)))"] | ['Wrong Answer', 'Accepted'] | ['s015099103', 's836794604'] | [9228.0, 9240.0] | [31.0, 29.0] | [508, 538] |
p02761 | u801049006 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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 s = []\n c = []\n for i in range(M):\n si, ci = map(int, input().split(\' \'))\n s.append(si)\n c.append(ci)\n \n ans = [0]*N\n flag = False\n for i in range(M):\n if ans[s[i]-1] == 0:\n ans[s[i]-1] = c[i]\n elif ans[s[i]-1] == c[i]:\n ans[s[i]-1] = c[i]\n else:\n flag = True\n \n ans.reverse()\n if flag:\n print("-1")\n elif ans[0] == 0:\n print("-1")\n else:\n for i in range(N):\n print(ans[i], end=\'\')\n print(\'\')\n\nif __name__ == \'__main__\':\n main()\n', 'def main():\n N, M = map(int, input().split(\' \'))\n s = []\n c = []\n for i in range(M):\n si, ci = map(int, input().split(\' \'))\n s.append(si)\n c.append(ci)\n \n ans = [0]*N\n flag = False\n for i in range(M):\n if ans[N-s[i]] == 0:\n ans[N-s[i]] = c[i]\n elif ans[N-s[i]] == c[i]:\n ans[N-s[i]] = c[i]\n else:\n flag = True\n \n if flag:\n print("-1")\n elif ans[0] == 0:\n print("-1")\n else:\n for i in range(N):\n print(ans[i], end=\'\')\n print(\'\')\n\nif __name__ == \'__main__\':\n main()', "def main():\n N, M = map(int, input().split())\n\n t = [-1] * N\n for _ 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 \n if N != 1:\n if t[0] == 0:\n print(-1)\n exit()\n \n if t[0] == -1:\n t[0] = 1\n\n for i in range(1, N):\n if t[i] == -1:\n t[i] = 0\n else:\n if t[0] == -1:\n t[0] = 0\n \n print(''.join(map(str,t)))\n\nif __name__ == '__main__':\n main()"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s685268960', 's739784867', 's918245908'] | [3064.0, 3064.0, 3064.0] | [17.0, 17.0, 17.0] | [635, 616, 592] |
p02761 | u805011545 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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 = np.full(N+1, -1)\nfor i in range(M):\n if(ans[s[i]]==-1):\n ans[s[i]] = c[i]\n elif(ans[s[i]]!=c[i]):\n print(-1)\n sys.exit()\n\nif(ans[1]==0)and(N!=1):\n print(-1)\n sys.exit()\nif(ans[1]==-1)and(n!=1):\n ans[1] = 1\nans = np.where(ans==-1, 0, ans)\nAns = 0\nfor i in range(1, N+1):\n Ans += 10**(N-i)*ans[i]\nprint(int(Ans))', 'import numpy as np\nimport sys\nN, M = [int(x) for x in input().split()]\ns = []\nc = []\nfor i in range(M):\n a, b = [int(x) for x in input().split()]\n s.append(a)\n c.append(b)\n \nans = np.full(N+1, -1)\nfor i in range(M):\n if(ans[s[i]]==-1):\n ans[s[i]] = c[i]\n elif(ans[s[i]]!=c[i]):\n print(-1)\n sys.exit()\nif(ans[1]==-1)and(N>1):\n ans[1] = 1\nans = np.where(ans==-1, 0, ans)\n \nif(ans[1]==0)and(N!=1):\n print(-1)\n sys.exit()\nAns = 0\nfor i in range(1, N+1):\n Ans += 10**(N-i)*ans[i]\nprint(int(Ans))'] | ['Runtime Error', 'Accepted'] | ['s691238947', 's536992412'] | [9164.0, 27200.0] | [30.0, 120.0] | [331, 509] |
p02761 | u813174766 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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 time\nn,m=map(int,input().split())\nif m>0:\n time.sleep(2.1)\nelse:\n if n==1:\n print(0)\n elif n==2:\n print(10)\n elif(n==3):\n print(100)', 'n,m=map(int,input().split())\ns=[]\nt=[]\nfor i in range(m):\n u,v=input().split()\n s.append(int(u)-1)\n t.append(v)\nans=-1\nfor i in range(1000):\n x=str(i)\n if len(x)!=n:\n continue\n flag=True\n for j in range(m):\n if x[s[j]] != t[j]:\n flag = False\n if flag:\n ans=i\n break\nprint(ans)'] | ['Time Limit Exceeded', 'Accepted'] | ['s571831178', 's353461604'] | [3060.0, 3188.0] | [2104.0, 20.0] | [152, 301] |
p02761 | u814271993 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["a,b=map(int, input().split())\ns = [list(map(int, input().split())) for i in range(b)]\ns = sum(s, [])\nL = [-1]*[0]*(a-1)\nans = 0\nab = 10**(a-1)\n\nfor i in range(b):\n if L[s[i*2]-1] == 0:\n L[s[i*2]-1] = s[i*2+1]\n if L[s[i*2]-1] != 0 and L[s[i*2]-1] == s[i*2+1]:\n pass\n if L[s[i*2]-1] != 0 and L[s[i*2]-1] != s[i*2+1]:\n ans += 1\n\nif ans == 0:\n if a == 1 and b == 0:\n print(0)\n if a != 1 and b == 0:\n print(ab)\n if b !=0 and L[0] == 0:\n print('-1')\n if b !=0 and L[0] == -1:\n T = ''.join(map(str,L[1:a]))\n ab = ab + int(T)\n print(ab)\n if b !=0 and L[0] != -1:\n T = ''.join(map(str,L))\n print(T)\nif ans != 0:\n print('-1')", 'import sys\n \nn, m = map(int, input().split())\nsc = [list(map(int, input().split())) for f in range(m)]\nif n == 1:\n start = 0\n end = 10\nelse:\n start = 10**(n-1)\n end = 10**n\nfor i in range(start, end):\n x = False\n for j in sc:\n if str(i)[j[0]-1] != str(j[1]):\n x = True\n break\n if x:\n continue\n print(i)\n sys.exit()\nprint(-1) '] | ['Runtime Error', 'Accepted'] | ['s151788735', 's038988498'] | [9228.0, 9128.0] | [30.0, 27.0] | [719, 359] |
p02761 | u814885356 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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())\ncandidate = [-1]*N\nflag = False\nif N == 1:\n if M == 0:\n candidate = [0]\n else:\n s_temp,c_temp = map(int, input().split())\n candidate = [c_temp]\nelse:\n for i in range(M):\n s_temp,c_temp = map(int, input().split())\n s_temp = s_temp - 1\n if candidate[s_temp] == -1:\n candidate[s_temp] = c_temp\n elif candidate[s_temp] == c_temp:\n pass\n elif candidate[s_temp] != c_temp:\n flag = True\n break\nif flag == True:\n print(-1)\nelse:\n print(int(''.join(map(str, candidate))))", 'N,M = map(int, input().split())\ncandidate = [-1]*N\nflag = False\nif N == 1:\n if M == 0:\n candidate = [0]\n else:\n s_temp,c_temp = map(int, input().split())\n candidate = [c_temp]\nelse:\n for i in range(M):\n s_temp,c_temp = map(int, input().split())\n s_temp = s_temp - 1\n if candidate[s_temp] == -1:\n candidate[s_temp] = c_temp\n elif candidate[s_temp] == c_temp:\n pass\n elif candidate[s_temp] != c_temp:\n flag = True\n break\nif flag == True:\n print(-1)\nelse:\n candidate = [0 if i == -1 else i for i in candidate]\n print(candidate)', "N,M = map(int, input().split())\ncandidate = [-1]*N\nflag = False\nfor i in range(M):\n s_temp,c_temp = map(int, input().split())\n if candidate[s_temp-1] == -1:\n candidate[s_temp-1] = c_temp\n elif candidate[s_temp-1] == c_temp:\n pass\n else:\n flag = True\n break\nif flag == True or candidate[0] == 0:\n print(-1)\nelse:\n print(candidate)\n if candidate[0] == -1:\n candidate[0] = 1\n output_list = [0 if i == -1 else i for i in candidate]\n print(int(''.join(map(str, output_list))))", 'N, M = map(int, input().split())\nflag = True\nex = [-1]*N\nfor i in range(M):\n S,C = map(int, input().split())\n if ex[S-1]==-1 or ex[S-1]==C:\n ex[S-1] = C\n else:\n flag = False\n break\nif N>1 and ex[0]==0:\n flag = False\nif flag:\n for i in range(1,N):\n if ex[i]==-1:\n ex[i] = 0\n if ex[0]==-1 and N>1:\n ex[0] = 1\n elif ex[0]==-1:\n ex[0] = 0\n print(int("".join(map(str, ex))))\nelse:\n print(-1)'] | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s393477044', 's580286793', 's792211169', 's885688995'] | [3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 17.0, 18.0, 17.0] | [543, 574, 495, 418] |
p02761 | u814986259 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['N,M=map(int,input().split())\nd = dict()\nfor i in range(M):\n a,b=map(int,input().split())\n if a not in d:\n d[a]=b\n else:\n if d[a]!=b:\n print(-1)\n exit(0)\ntmp=0\nfor i in range(10):\n if N==3 and i ==0:\n continue\n for j in range(10):\n if N==2 and j ==0:\n continue\n for k in range(10):\n if 1 in d and d[1] != i:\n continue\n if 2 in d and d [2] != j:\n continue\n if 3 in d and d[3]!= j:\n continue\n print((str(i)+str(j)+str(k))[3-N:])\n exit(0)\n \n \n ', 'N, M = map(int, input().split())\nans = [-1]*N\n\nfor i in range(M):\n s, c = map(int, input().split())\n if ans[s-1] > 0:\n if ans[s-1] == c:\n continue\n else:\n print(-1)\n exit(0)\n else:\n if s == 1 and c == 0 and N != 1:\n print(-1)\n exit(0)\n ans[s-1] = c\n\nfor i in range(N):\n if ans[i] == -1:\n if i == 0 and N != 1:\n ans[i] = 1\n else:\n ans[i] = 0\n\nprint("".join(map(str, ans)))\n'] | ['Wrong Answer', 'Accepted'] | ['s521054937', 's779825799'] | [3064.0, 3064.0] | [18.0, 17.0] | [536, 503] |
p02761 | u815763296 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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 = {}\nansstr = []\nfor _ in range(M):\n S, C = map(int, input().split())\n if S == 1 and C == 0:\n print(\'-1\')\n sys.exit()\n elif S > N:\n print(\'-1\')\n sys.exit()\n elif S in ans:\n if ans[S] != C:\n print(\'-1\')\n sys.exit()\n else:\n ans[S] = C\nfor i in range(1, N+1):\n if i in ans:\n ansstr.append(ans[i])\n else:\n ansstr.append(0)\nif ansstr[0]==0:\n ansstr[0]=1\n\nfor i in range(N):\n print(ansstr[i], end="")\n', 'import sys\n\n\ndef LI():\n return list(map(int, input().split()))\n\n\nN, M = LI()\nans = [-1]*N\nfor _ in range(M):\n a, b = LI()\n if ans[a-1] == b or ans[a-1] == -1:\n ans[a-1] = b\n else:\n print(-1)\n sys.exit()\nif ans[0] == -1:\n if N==1:\n print(0)\n sys.exit()\n ans[0] = 1\nif ans[0] == 0:\n if N == 1:\n print(0)\n else:\n print(-1)\n sys.exit()\nS = ""\nfor i in range(N):\n if ans[i] == -1:\n ans[i] = 0\n S += str(ans[i])\nprint(S)\n'] | ['Wrong Answer', 'Accepted'] | ['s248069700', 's826591285'] | [9224.0, 8968.0] | [28.0, 32.0] | [548, 504] |
p02761 | u821775079 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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=[]\nans=-1\nfor i in range(M):\n s_i,c_i=input().split()\n s.append(int(s_i))\n c.append(c_i)\nfor i in range(int("1"+"0"*(N-1)),int("9"*N)+1):\n ans_bool=True\n for j in range(M):\n ans_bool=ans_bool and str(i)[s[j]-1]==str(c[j])\n if ans_bool:\n ans=i\n \nprint(ans)\n', 'N,M= map(int,input().split())\ns=[]\nc=[]\nans=-1\nfor i in range(M):\n s_i,c_i=input().split()\n s.append(int(s_i))\n c.append(c_i)\nif N==1:\n for i in range(10):\n ans_bool=True\n for j in range(M):\n ans_bool=ans_bool and str(i)[s[j]-1]==str(c[j])\n if ans_bool:\n ans=i\n break\nelse:\n for i in range(int("1"+"0"*(N-1)),int("9"*N)+1):\n ans_bool=True\n for j in range(M):\n ans_bool=ans_bool and str(i)[s[j]-1]==str(c[j])\n if ans_bool:\n ans=i\n break\n \nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s443658921', 's828069350'] | [3064.0, 3064.0] | [18.0, 18.0] | [332, 578] |
p02761 | u826785572 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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\nnum = [-1] * n\n\nfor _ 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 num[s-1] == -1 or num[s-1] == c:\n num[s-1] = c\n else:\n print(-1)\n exit()\n\nfor i in range(n):\n if i == 1 and num[i] == -1:\n num[i] == 1\n elif i != 1 and num[i] == -1:\n num[i] = 0\n\nprint(''.join(map(str, num)))\n\n", "n , m = map(int, input().split())\n\nnum = [-1] * n\n\nfor _ 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 num[s-1] == -1 or num[s-1] == c:\n num[s-1] = c\n else:\n print(-1)\n exit()\n\nfor i in range(n):\n if i == 0 and num[i] == -1:\n if n > 1:\n num[i] = 1\n else:\n num[i] = 0\n elif i != 0 and num[i] == -1:\n num[i] = 0\n\nprint(''.join(map(str, num)))\n\n"] | ['Wrong Answer', 'Accepted'] | ['s017568709', 's355421692'] | [3064.0, 3064.0] | [17.0, 17.0] | [437, 495] |
p02761 | u826929627 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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_list = [-1]*(N+1)\n\nfor m in range(M):\n s,c = map(int, input().split())\n \n \n if _list[s] != -1 and _list[s] != c:\n print(-1)\n exit()\n \n else:\n _list[s] = c\n \nans = ''\nfor idx, _ in ennumerate(_list[1:]):\n if _ == -1:\n \n if idx != 0:\n ans += '0'\n else:\n ans += '1'\n else:\n ans += str(_)\n\n\nif N > 1 and ans[0] == '0':\n print(-1)\n exit()\nelse:\n print(int(ans))", "N,M = map(int, input().split())\n\n_list = [-1]*(N+1)\n\nfor m in range(M):\n s,c = map(int, input().split())\n \n if _list[s] != -1 and _list[s] != c:\n print(-1)\n exit()\n else:\n _list[s] = c\n \nans = ''\nfor idx, _ in enumerate(_list[1:]):\n if _ == -1:\n \n if idx != 0:\n ans += '0'\n else:\n ans += '1'\n else:\n ans += str(_)\n\n\nif N > 1 and ans[0] == '0':\n print(-1)\nelif M == 0:\n if N == 1:\n print(0)\n elif N == 2:\n print(10)\n elif N == 3:\n print(100)\nelse:\n print(int(ans))"] | ['Runtime Error', 'Accepted'] | ['s520391032', 's423568690'] | [3064.0, 3064.0] | [17.0, 20.0] | [535, 617] |
p02761 | u827646026 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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_line = [int(i) for i in input().split(" ")]\nn = input_line[0]\nm = input_line[1]\n\nans = ["1"] + ["0"] * (n - 1)\nflag = 0\nfor i in range(m):\n input_line = input().split(" ")\n if int(input_line[0]) == 1 and flag == 0:\n ans[int(input_line[0]) - 1] = input_line[1]\n flag = 1\n continue\n elif int(input_line[0]) == 1 and flag == 1:\n print(-1)\n sys.exit()\n if ans[int(input_line[0]) - 1] == "0" or ans[int(input_line[0]) - 1] == input_line[1]:\n ans[int(input_line[0]) - 1] = input_line[1]\n else:\n print(-1)\n sys.exit()\n\nans_num = int("".join(ans))\nif n == len(str(ans_num)):\n print(ans_num)\nelse:\n print(-1)\n', 'import sys\ninput_line = [int(i) for i in input().split(" ")]\nn = input_line[0]\nm = input_line[1]\n\nans = ["0"] * n\nfor i in range(m):\n input_line = input().split(" ")\n if ans[int(input_line[0] - 1)] == "0" or ans[int(input_line[0] - 1)] == input_line[1]:\n ans[int(input_line[0] - 1)] = input_line[1]\n else:\n print(-1)\n sys.exit()\n\nif m == 0:\n ans[0] = "1"\n\nans_num = int("".join(ans))\nif n == len(str(ans_num)):\n print(ans_num)\nelse:\n print(-1)\n', 'import sys\ninput_line = [int(i) for i in input().split(" ")]\nn = input_line[0]\nm = input_line[1]\n\nans = ["1"] + ["0"] * (n - 1)\nflag = 0\nfor i in range(m):\n input_line = input().split(" ")\n if int(input_line[0]) == 1 and flag == 0:\n ans[int(input_line[0]) - 1] = input_line[1]\n flag = 1\n continue\n elif int(input_line[0]) == 1 and flag == 1:\n print(-1)\n sys.exit()\n if ans[int(input_line[0]) - 1] == "0" or ans[int(input_line[0]) - 1] == input_line[1]:\n ans[int(input_line[0]) - 1] = input_line[1]\n else:\n print(-1)\n sys.exit()\n\nif m == 0:\n ans[0] = "0"\n\nans_num = int("".join(ans))\nif n == len(str(ans_num)):\n print(ans_num)\nelse:\n print(-1)\n', 'import sys\ninput_line = [int(i) for i in input().split(" ")]\nn = input_line[0]\nm = input_line[1]\n\nans = ["1"] + ["0"] * (n - 1)\nflag = 0\nfor i in range(m):\n input_line = input().split(" ")\n if int(input_line[0]) == 1 and flag == 0:\n ans[int(input_line[0]) - 1] = input_line[1]\n flag = 1\n continue\n elif int(input_line[0]) == 1 and flag == 1:\n print(-1)\n sys.exit()\n if ans[int(input_line[0]) - 1] == "0" or ans[int(input_line[0]) - 1] == input_line[1]:\n ans[int(input_line[0]) - 1] = input_line[1]\n else:\n print(-1)\n sys.exit()\n\nif m == 0 and n == 1:\n ans[0] = "0"\n\nans_num = int("".join(ans))\nif n == len(str(ans_num)):\n print(ans_num)\nelse:\n print(-1)\n', 'import sys\ninput_line = [int(i) for i in input().split(" ")]\nn = input_line[0]\nm = input_line[1]\n\nans = ["1"] + ["0"] * (n - 1)\nflag = 0\nfor i in range(m):\n input_line = input().split(" ")\n if int(input_line[0]) == 1 and flag == 0:\n ans[int(input_line[0]) - 1] = input_line[1]\n flag = 1\n continue\n elif int(input_line[0]) == 1 and flag == 1:\n if input_line[1] != ans[0]:\n print(-1)\n sys.exit()\n\n if ans[int(input_line[0]) - 1] == "0" or ans[int(input_line[0]) - 1] == input_line[1]:\n ans[int(input_line[0]) - 1] = input_line[1]\n else:\n print(-1)\n sys.exit()\n\nif m == 0 and n == 1:\n ans[0] = "0"\n\nans_num = int("".join(ans))\nif n == len(str(ans_num)):\n print(ans_num)\nelse:\n print(-1)\n'] | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s168667871', 's187786524', 's494733600', 's960157263', 's319576108'] | [3064.0, 3064.0, 3064.0, 3064.0, 3188.0] | [18.0, 17.0, 17.0, 17.0, 17.0] | [694, 483, 723, 734, 779] |
p02761 | u830054172 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['n, m = list(map(int, input().split()))\n\na = [list(map(int, input().split())) for _ in range(m)]\n\nans = [0 for _ in range(n)]\ncheck = [False for _ in range(n)]\n\nflag = 0\n\nfor i, j in a:\n if check[i-1] == 0 or ans[i-1] == j:\n ans[i-1] = j\n check[i-1] = True\n else:\n flag = 1\n \nif check[0] == False or m != 0:\n ans[0] = 1\n\nc = ""\nfor k in ans:\n c+=str(k)\n\nif flag == 1 or len(str(int(c))) != n:\n print(-1)\nelse:\n print(c)', 'n, m = list(map(int, input().split()))\n\na = [list(map(int, input().split())) for _ in range(m)]\n\nans = [0 for _ in range(n)]\ncheck = [False for _ in range(n)]\n\nflag = 0\n\nfor i, j in a:\n if i == 1 and j == 0:\n flag = 1\n elif check[i-1] == 0 or ans[i-1] == j:\n ans[i-1] = j\n check[i-1] = True\n else:\n flag = 1\n \nif not flag:\n ans[0] = 1\n\nc = ""\nfor k in ans:\n c+=str(k)\n\nif flag == 1:\n print(-1)\nelse:\n print(c)', 'n, m = list(map(int, input().split()))\n\na = [list(map(int, input().split())) for _ in range(m)]\n\nans = [0 for _ in range(n)]\ncheck = [False for _ in range(n)]\n\nflag = 0\n\nfor i, j in a:\n if check[i-1] == 0 or ans[i-1] == j:\n ans[i-1] = j\n check[i-1] = True\n else:\n flag = 1\n \nif check[0] == False and ans[0] == 0 and m != 0:\n ans[0] = 1\nelif m == 0 and n != 1:\n ans[3-n] = 1\n\nc = ""\nfor k in ans:\n c += str(k)\nprint(c)\nif flag == 1 or len(str(int(c))) != n:\n print(-1)\nelse:\n print(c)\n', 'n, m = list(map(int, input().split()))\n\na = [list(map(int, input().split())) for _ in range(m)]\n\nans = [0 for _ in range(n)]\ncheck = [False for _ in range(n)]\n\nflag = 0\n\nfor i, j in a:\n if check[i-1] == 0 or ans[i-1] == j:\n ans[i-1] = j\n check[i-1] = True\n else:\n flag = 1\n \nif check[0] == False ans m != 0:\n ans[0] = 1\n\nc = ""\nfor k in ans:\n c+=str(k)\n\nif flag == 1 or len(str(int(c))) != n:\n print(-1)\nelse:\n print(c)', 'n, m = list(map(int, input().split()))\n\na = [list(map(int, input().split())) for _ in range(m)]\n\nans = [0 for _ in range(n)]\ncheck = [False for _ in range(n)]\n\nflag = 0\n\nfor i, j in a:\n if check[i-1] == 0 or ans[i-1] == j:\n ans[i-1] = j\n check[i-1] = True\n else:\n flag = 1\n \nif check[0] == False and ans[0] == 0 and m != 0:\n ans[0] = 1\nelif m == 0 and n != 1:\n ans[3-n] = 1\n\nc = ""\nfor k in ans:\n c += str(k)\n\nif flag == 1 or len(str(int(c))) != n:\n print(-1)\nelse:\n print(c)\n'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s051425526', 's127078472', 's415239423', 's571725631', 's957428404'] | [3064.0, 3064.0, 3064.0, 3064.0, 3064.0] | [18.0, 17.0, 17.0, 17.0, 18.0] | [463, 464, 532, 464, 524] |
p02761 | u833738197 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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 ss,cc = map(int,input().split())\n s.append(ss)\n c.append(cc)\nfor i in range(10**(n-1) if n>1 else 0,10**n):\n ans = str(i)\n for j in range(m):\n if ans[s[j]-1] != str(c[j]):\n break\n else:\n print(ans)\nprint(-1)', 'n,m = map(int,input().split())\ns = []\nc = []\nfor i in range(m):\n ss,cc = map(int,input().split())\n s.append(ss)\n c.append(cc)\nfor i in range(10**(n-1) if n!=1 else 0,10**n):\n ans = str(i)\n for j in range(m):\n if ans[s[j]-1] != str(c[j]):\n break\n else:\n print(ans)\n break\nelse: \n print(-1)'] | ['Wrong Answer', 'Accepted'] | ['s776552529', 's253528435'] | [3064.0, 3064.0] | [18.0, 18.0] | [323, 348] |
p02761 | u836737505 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | [',m = map(int, input().split())\nsc = [list(map(int, input().split())) for _ in range(m)]\nfor i in range(1001):\n if m == 0 and n == 1:\n print(0)\n break\n elif m==0:\n print("1"*n)\n break\n\n for j,k in sc:\n if len(str(i)) < j or len(str(i)) != n:\n break\n elif int(str(i)[j-1]) != k:\n break\n\n else:\n print(i)\n break\nelse:\n print(-1)', 'n,m = map(int, input().split())\nl = [list(map(int, input().split())) for _ in range(m)]\nfor i in range(10001):\n if len(str(i)) != n:\n continue\n for j in l:\n if str(i)[j[0]-1] != str(j[1]):\n break\n else:\n print(i)\n exit()\nelse:\n print(-1)'] | ['Runtime Error', 'Accepted'] | ['s423109598', 's530773255'] | [2940.0, 3064.0] | [17.0, 20.0] | [419, 288] |
p02761 | u838786721 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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())\nc = [[] for _ in range(n)]\nfor i in range(m):\n s,x = map(int,input().split())\n c[s-1].append(x)\n\nr = 0\nd = [-1 for _ in range(n)]\n\nfor i in range(n):\n if len(set(c[i])) > 1:\n r = -1\n break\n elif len(c[i]) == 0:\n continue\n elif i == 0 and n > 1:\n if c[i][0] == 0:\n r = -1\n break\n else:\n d[i] = c[i][0]\n\nif r == -1:\n print(r)\nelse:\n if n == 3:\n if d[0] == -1:\n d[0] = 1\n if d[1] == -1:\n d[1] = 0\n if d[2] == -1:\n d[2] = 0\n elif n == 2:\n if d[0] == -1:\n d[0] = 1\n if d[1] == -1:\n d[1] = 0\n else:\n if d[0] == -1:\n d[0] = 0\n print(''.join(map(str,d)))", "n,m = map(int,input().split())\nc = [[] for _ in range(n)]\nfor i in range(m):\n s,x = map(int,input().split())\n c[s-1].append(x)\n\nr = 0\nd = [-1 for _ in range(n)]\n\nfor i in range(n):\n if len(set(c[i])) > 1:\n r = -1\n break\n elif len(c[i]) == 0:\n continue\n else:\n if i == 0 and n > 1 and c[i][0] == 0:\n r = -1\n break\n d[i] = c[i][0]\n\nif r == -1:\n print(r)\nelse:\n if n == 3:\n if d[0] == -1:\n d[0] = 1\n if d[1] == -1:\n d[1] = 0\n if d[2] == -1:\n d[2] = 0\n elif n == 2:\n if d[0] == -1:\n d[0] = 1\n if d[1] == -1:\n d[1] = 0\n else:\n if d[0] == -1:\n d[0] = 0\n print(''.join(map(str,d)))"] | ['Wrong Answer', 'Accepted'] | ['s031608366', 's897521376'] | [3064.0, 3064.0] | [18.0, 17.0] | [775, 769] |
p02761 | u840958781 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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 ans[s-1]=c\n if c!=0 and ans[s-1]==0:\n ans[s-1]=c \n pans="0"\n else:\n pans="-1"\n \nans = [str(i) for i in ans]\nif pans != "-1":\n pans="".join(ans)\n if pans[0]=="0":\n pans=\'1\' + pans[1:]\nprint(pans)', 'n,m=map(int,input().split())\nd=["a"]*n\nans=""\nif n==1 and m==0:\n print(0)\n exit()\nfor i in range(m):\n s,c=map(str,input().split())\n if s=="1" and c=="0" and n==1:\n print(0)\n exit()\n s=int(s)\n if d[s-1]=="a" or d[s-1]==c:\n d[s-1]=c \n else:\n ans="-1"\n print(ans)\n break\nif d[0]!="0" and ans!="-1":\n if d[0]=="a" or d[0]=="0":\n print("".join(["1"]+d[1:]).replace("a","0"))\n else:\n print(("".join(d)).replace("a","0"))\nelif d[0]=="0":\n print(-1)'] | ['Runtime Error', 'Accepted'] | ['s264648785', 's541956254'] | [3064.0, 3064.0] | [17.0, 17.0] | [344, 540] |
p02761 | u841599623 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["N, M = map(int, input().split())\nlis = [0]*N\nSC = []\nERROR = False\nfor _ in range(M):\n sc = list(map(int, input().split()))\n SC.append(sc)\nfor i in range(len(SC)-1):\n for j in range(i+1,len(SC)):\n print(SC[i][0], SC[i][1], SC[j][0], SC[j][1])\n if SC[i][0] == SC[j][0] and SC[i][1] != SC[j][1]:\n ERROR = True\nif ERROR:\n print(-1)\nelse:\n output = ''\n for i in range(len(SC)):\n lis[SC[i][0]-1] = SC[i][1]\n if N > 1 and lis[0] == 0:\n print(-1)\n else:\n for i in range(N):\n output += str(lis[i])\n print(int(output))", "N, M = map(int, input().split())\nlis = [0]*N\nSC = []\nERROR = False\nfor _ in range(M):\n sc = list(map(int, input().split()))\n SC.append(sc)\nfor i in range(len(SC)-1):\n for j in range(i+1,len(SC)):\n if SC[i][0] == SC[j][0] and SC[i][1] != SC[j][1]:\n ERROR = True\nfor i in range(len(SC)):\n if N > 1 and SC[i][0] == 1 and SC[i][1] == 0:\n ERROR = True\nif ERROR:\n print(-1)\nelse:\n output = ''\n for i in range(M):\n lis[SC[i][0]-1] = SC[i][1]\n if N > 1 and lis[0] == 0:\n lis[0] = 1\n for i in range(N):\n output += str(lis[i])\n print(int(output))"] | ['Wrong Answer', 'Accepted'] | ['s171203914', 's747689190'] | [3064.0, 3064.0] | [17.0, 19.0] | [545, 566] |
p02761 | u842170774 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['f=lambda:map(int,input().split())\nN,M=f()\nq=[list(f()) for _ in [0]*M]\nres=-1\nA=range(10**(N-1),10**N)\nif N==1:A+=[0]\nfor i in :\n for j in range(M):\n if str(i)[q[j][0]-1]!=str(q[j][1]):\n break\n else:\n res=i\n break\nprint(res)', 'f=lambda:map(int,input().split())\nN,M=f()\nq=[list(f()) for _ in [0]*M]\nres=-1\nA=list(range(10**(N-1),10**N))\nif N==1:A=[0]+A\nfor i in A:\n for j in range(M):\n if str(i)[q[j][0]-1]!=str(q[j][1]):\n break\n else:\n res=i\n break\nprint(res)'] | ['Runtime Error', 'Accepted'] | ['s026303458', 's802844900'] | [8920.0, 9148.0] | [26.0, 28.0] | [262, 270] |
p02761 | u842388336 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['n, m = map(int, input().split())\ns_li_ = []\nc_li_ = []\n\nfor _ in range(m):\n s, c = map(int, input().split())\n s_li_.append(s)\n c_li_.append(c)\n\ndef func(n, m, s_li, c_li):\n if m==0:\n return -1\n \n if n==1:\n if (s_li[0]==1) & (c_li[0]==0):\n return 0\n \n for i in range(10**(n-1), 10**n):\n cnt = 0\n for s, c in zip(s_li, c_li):\n if str(i)[s-1] == str(c):\n cnt+=1\n if cnt==len(m):\n return i\n \n return -1\n\nprint(func(n, s_li_, c_li_))', 'n, m = map(int, input().split())\ns_li_ = []\nc_li_ = []\n\nfor _ in range(m):\n s, c = map(int, input().split())\n s_li_.append(s)\n c_li_.append(c)\n\ndef func(n, m, s_li, c_li):\n if m==0:\n return -1\n \n if n==1:\n if (s_li[0]==1) & (c_li[0]==0):\n return 0\n \n for i in range(10**(n-1), 10**n):\n cnt = 0\n for s, c in zip(s_li, c_li):\n if str(i)[s-1] == str(c):\n cnt+=1\n if cnt==len(m):\n return i\n \n return -1\n\nprint(func(n, m, s_li_, c_li_))', 'n, m = map(int, input().split())\ns_li_ = []\nc_li_ = []\n\nfor _ in range(m):\n s, c = map(int, input().split())\n s_li_.append(s)\n c_li_.append(c)\n\ndef func(n, m, s_li, c_li):\n if m==0:\n if n==1:\n return 0\n else:\n return 10**(n-1)\n \n if n==1:\n if (s_li[0]==1) & (c_li[0]==0):\n return 0\n \n for i in range(10**(n-1), 10**n):\n cnt = 0\n for s, c in zip(s_li, c_li):\n if str(i)[s-1] == str(c):\n cnt+=1\n if cnt==m:\n return i\n \n return -1\n\nprint(func(n, m, s_li_, c_li_))\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s514936728', 's990043187', 's605120146'] | [9160.0, 9164.0, 9132.0] | [26.0, 26.0, 28.0] | [477, 480, 523] |
p02761 | u845620905 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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 = ["0"] * N\nb = [False] * N\nansFlag = True\n\nfor i in range(M):\n s, c = map(int, input().split())\n if b[s-1] == True and a[s-1] != str(c):\n ansFlag = False\n\n if s == 1 and c == 0 and N > 1:\n ansFlag = False\n\n if b[s-1] == False:\n b[s-1] = True\n a[s-1] = str(c)\n\nif ansFlag and int("".join(a)) >= 10**N:\n print(int("".join(a)))\nelse:\n print(-1)\n\n', 'N, M = map(int, input().split())\nS = []\nC = []\nfor i in range(M):\n s, c = map(int, input().split())\n S.append(s-1)\n C.append(str(c))\nans = []\nfor i in range(10 ** N):\n a = list(str(i))\n if len(a) != N:\n continue\n ansFlag = True\n for i in range(M):\n if a[S[i]] != C[i]:\n ansFlag = False\n if ansFlag:\n ans = a\n break\n\nif ans == []:\n print(-1)\nelse:\n print("".join(ans))\n\n\n'] | ['Wrong Answer', 'Accepted'] | ['s255598940', 's240035616'] | [3188.0, 3064.0] | [18.0, 19.0] | [425, 439] |
p02761 | u848877025 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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\nsets = []\nfor i in range(M):\n s,c = input().split()\n sets.append((s,c))\n\nstart = 0\nif N != 1:\n start = 10**(N-1)\n\nfor n in range(start,10**N):\n print(n)\n for s,c in sets:\n if str(n)[int(s)-1] == c:\n continue\n else:\n break\n else:\n print(n)\n break\nelse:\n print(-1)', 'N,M = map(int, input().split())\n\nsets = []\nfor i in range(M):\n s,c = input().split()\n sets.append((s,c))\n\nstart = 0\nif N != 1:\n start = 10**(N-1)\n\nfor n in range(start,10**N):\n for s,c in sets:\n if str(n)[int(s)-1] == c:\n continue\n else:\n break\n else:\n print(n)\n break\nelse:\n print(-1)'] | ['Wrong Answer', 'Accepted'] | ['s477227478', 's713897019'] | [3188.0, 3064.0] | [18.0, 18.0] | [324, 313] |
p02761 | u851319680 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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 = [[0 for i in range(10)]for l in range(N)]\nans = ''\nend = False\nfor l in L:\n if l[0] == 1 & l[1] == 0:\n print(-1)\n end = True\n break\n else:\n A[l[0]-1][l[1]] = 1\nif not end:\n if any(sum(a) > 1 for a in A):\n print(-1)\n else:\n for i in range(N):\n if i == 0:\n if sum(A[i]) == 0:\n ans+='1'\n else:\n ans+=str(A[i].index(1))\n else:\n if sum(A[i]) == 0:\n ans+='0'\n else:\n ans+=str(A[i].index(1))\n\n print(ans)\n", 'N,M = map(int, input().split())\nL = []\nans = []\nfor i in range(M):\n\tL.append(list(map(int, input().split())))\n\tans.append(False)\n\nfor i in range(10**N):\n num = str(i)\n if len(num) == N:\n for j,l in enumerate(L):\n if num[l[0]-1] == str(l[1]):\n ans[j] = True \n continue\n else:\n break\n if all(ans):\n print(i)\n break\nif not all(ans):\n print(-1)'] | ['Runtime Error', 'Accepted'] | ['s714558822', 's860179526'] | [3064.0, 3064.0] | [18.0, 18.0] | [621, 450] |
p02761 | u852386636 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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\n\ndic = {}\nfor i in range(N):\n dic[i] = 0\n\n\ndic2= {}\nfor i in sc:\n if i[1] != 0:\n if (i[0]-1 not in dic2.keys()):\n dic2[i[0]-1] = i[1]\n elif i[0]-1 in dic2.keys():\n dic2= {}\n# update\ndic.update(dic2)\n\ns = ''\nfor k,v in dic.items():\n s += str(v)\n\nif len(str(int(s))) == N:\n print(int(s))\nelse:\n print(-1)", 'N,M = map(int,input().split())\nsc = [list(map(int,input().split())) for i in range(M)]\n\ndic = {}\ndic2= {}\ntry:\n for i in range(N):\n dic[i] = 0\n for i in sc:\n if (i[0]-1 not in dic2.keys()):\n dic2[i[0]-1] = i[1]\n elif (i[0]-1 in dic2.keys()) and (i[1] != dic2[i[0]-1]):\n raise ValueError("error!")\n \n if (N > 1) and (0 in dic2) and (dic2[0] == 0):\n raise ValueError("error!")\n\n dic.update(dic2)\n \n s = \'\'\n for v in dic.values():\n s += str(v)\n if (N > 1) and (s[0] == \'0\'):\n s = s.replace(\'0\',\'1\',1)\n print(s)\n\nexcept ValueError as e:\n print(-1)'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s127207255', 's403478303', 's587451952'] | [9128.0, 9144.0, 9240.0] | [26.0, 26.0, 32.0] | [1, 485, 648] |
p02761 | u852798899 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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 = [list(map(int, input().split())) for _ in range(m)]\n\nfor i in range(10**(n-1), 10**n):\n tmp = str(i)\n for s, c in digit:\n if tmp[s-1] != c:\n continue\n print(i)\n exit()\nprint(-1)\n \n', 'n, m = map(int, input().split())\n\ntmp = ["0" for i in range(n)]\ncheck = [0 for i in range(n)]\nfor i in range(m):\n s, c= map(str, input().split())\n check[int(s)-1]+=1\n tmp[int(s)-1] = c\nflag = True\n\nfor i in check:\n if i >= 2:\n flag = False\n \n \nans = int("".join(tmp))\nif len(str(ans)) == n and flag:\n print(ans)\nelse:\n print(-1)\n', 'n, m = map(int, input().split())\n\ntmp = ["0" for i in range(n)]\nfor i in range(m):\n s, c= map(str, input().split())\n if int(tmp[int(s)-1]) >= int(c) or int(tmp[int(s)-1]) == 0:\n tmp[int(s)-1] = c\n\nans = int("".join(tmp))\nprint(tmp)\nif len(str(ans)) == n:\n print(ans)\nelse:\n print(-1)\n', 'n, m = map(int, input().split())\n\ntmp = ["0" for i in range(n)]\ndigit = [[] for i in range(n)]\nfor i in range(m):\n s, c= map(str, input().split())\n digit[int(s)-1].append(c)\nfor i in range(n):\n if len(digit[i]) == 0:\n digit[i].append("0")\n \nprint(digit)\nans = []\nif n == 3:\n for i in range(len(digit[0])):\n for j in range(len(digit[1])):\n for k in range(len(digit[2])):\n t = int(digit[0][i] + digit[1][j]+digit[2][k])\n if len(str(t)) == n:\n ans.append(t) \nif n ==2:\n for i in range(len(digit[0])):\n for j in range(len(digit[1])):\n t = int(digit[0][i] + digit[1][j])\n if len(str(t)) == n:\n ans.append(t)\nif n == 1:\n for i in range(len(digit[0])):\n t = int(digit[0][i])\n ans.append(t)\n \nif len(ans) == 0:\n print(-1)\nelse:\n print(min(ans))\n \n', 'n, m = map(int, input().split())\ndigit = [list(map(int, input().split())) for _ in range(m)]\n\nfor i in range(10**n):\n tmp = str(i)\n if len(tmp) == n:\n flag = True\n for s, c in digit:\n if tmp[s-1] != str(c):\n flag = False\n break\n if flag:\n print(i)\n exit()\nprint(-1)\n \n'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s385556745', 's494384092', 's776844601', 's783107350', 's228744473'] | [2940.0, 3064.0, 3060.0, 3064.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 18.0] | [234, 344, 291, 813, 309] |
p02761 | u853547292 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['n,m = map(int,input().split())\nd = dict()\nfor i in range(m):\n k,v = map(int,input().split())\n if k in d:\n if d[k] !=v:\n print(-1)\n exit()\n else:\n d[k] = v\nres = ""\nfor i in (1,n+1):\n if i not in d:\n d[i] = 0\n res += str(d[i])\nres = int(res)\nif res == 0:\n print(-1)\n exit()\nprint(res)', "n, m = map(int, input().split())\nlst = [x for x in range(n)]\ndic = {}\nnot_found = False\nspecial_case = False\nfor i in range(m):\n a, b = map(int, input().split())\n if str(a) not in list(dic.keys()):\n dic[str(a)] = b\n else:\n if dic[str(a)] != b:\n not_found = True\n lst[a - 1] = b\nif m == 0:\n special_case = True\nif not_found:\n print(-1)\nelif special_case:\n if n == 1:\n print(0)\n elif n == 2:\n print(10)\n else:\n print(100)\nelse:\n for i in range(n):\n if str(i + 1) not in list(dic.keys()):\n if i + 1 == 1:\n lst[i] = 1\n else:\n lst[i] = 0\n lst = list(map(str, lst))\n res = ''.join(lst)\n if res[0] == '0' and len(res) > 1:\n print(-1)\n else:\n print(int(res))"] | ['Wrong Answer', 'Accepted'] | ['s785380294', 's597402681'] | [3064.0, 3064.0] | [17.0, 17.0] | [347, 811] |
p02761 | u853952087 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["n,m=map(int,input().split())\n\np = [[int(i) for i in input().split()] for _ in range(m)]\n\np.append([0,10])\n\np.sort(key=lambda x:(x[0],x[1]))\n\nA=[]\n\na=0\n\nfor i in range(m): \n if p[i][0]==p[i+1][0] and not(p[i][1]==p[i+1][1]):\n print(-1) \n a=1\n break\n elif not(p[i][0]==p[i+1][0]):\n B=p[i+1][0]-p[i][0]\n if B>1:\n for j in range(B-1):\n A.append(0)\n A.append(p[i+1][1])\n\nprint(A)\n \nS=''\n\nA.reverse()\n\nfor i in range(len(A)):\n S=S+str(A[i])\n\nif len(S)==n and a==0:\n print(int(S))\nelif a==0:\n for i in range(n-len(A)):\n S=str(1)+S\n print(int(S))", "n,m=map(int,input().split())\n\np = [[int(i) for i in input().split()] for _ in range(m)]\n\np.append([0,10])\n\np.sort(key=lambda x:(x[0],x[1]))\n\nA=[]\n\na=0\n\nfor i in range(m):\n if p[i+1][0]==1 and p[i+1][1]==0 and n>1:\n print(-1)\n a=1\n break\n if p[i][0]==p[i+1][0] and not(p[i][1]==p[i+1][1]):\n print(-1) \n a=1\n break\n elif not(p[i][0]==p[i+1][0]):\n B=p[i+1][0]-p[i][0]\n if B>1:\n for j in range(B-1):\n A.append(0)\n A.append(p[i+1][1])\n\n \n \nif len(A)==n:\n if A[0]==0 and n>1:\n A[0]=1\nelse:\n for i in range(n-len(A)):\n A.append(0)\n if A[0]==0 and n>1:\n A[0]=1\n \n\nS=''\n\nfor i in range(len(A)):\n S=S+str(A[i])\n\nif a==0:\n print(int(S)) "] | ['Wrong Answer', 'Accepted'] | ['s008386941', 's447340326'] | [3064.0, 3064.0] | [17.0, 18.0] | [646, 783] |
p02761 | u854685063 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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\nimport itertools as it\ndef i():return int(sys.stdin.readline().replace("\\n",""))\ndef i2():return map(int,sys.stdin.readline().replace("\\n","").split())\ndef s():return str(sys.stdin.readline().replace("\\n",""))\ndef l():return list(sys.stdin.readline().replace("\\n",""))\ndef intl():return [int(k) for k in sys.stdin.readline().replace("\\n","").split()]\ndef lx():return list(map(lambda x:int(x)*-1,sys.stdin.readline().replace("\\n","").split()))\ndef t():return tuple(map(int,sys.stdin.readline().replace("\\n","").split()))\n\nif __name__ == "__main__":pass\nn ,m = i2()\nl = [0]*n\nfor i in range(m):\n s,c = i2()\n if l[s-1] == 0 or l[s-1] == c:\n l[s-1] = c\n else:\n print(-1)\n exit()\nnum = ""\nfor i in range(n):\n if i == n-1:\n num = num + str(l[i])\n else:\n if l[i] == 0:\n num = num + "1"\n else:\n num = num + str(l[i])\nnum = int(num)\nprint(num if len(str(num)) == n else -1)', 'import sys\nimport math\nimport itertools as it\ndef i():return int(sys.stdin.readline().replace("\\n",""))\ndef i2():return map(int,sys.stdin.readline().replace("\\n","").split())\ndef s():return str(sys.stdin.readline().replace("\\n",""))\ndef l():return list(sys.stdin.readline().replace("\\n",""))\ndef intl():return [int(k) for k in sys.stdin.readline().replace("\\n","").split()]\ndef lx():return list(map(lambda x:int(x)*-1,sys.stdin.readline().replace("\\n","").split()))\ndef t():return tuple(map(int,sys.stdin.readline().replace("\\n","").split()))\n\nif __name__ == "__main__":pass\nn ,m = i2()\nl = [0]*n\nfor i in range(m):\n s,c = i2()\n if l[s-1] == 0:\n l[s-1] = c\n else:\n print(-1)\n exit()\nnum = ""\nfor i in l:\n num = num + str(i)\nnum = int(num)\nprint(num if len(str(num)) == n else -1)', 'import sys\nimport math\nimport itertools as it\ndef i():return int(sys.stdin.readline().replace("\\n",""))\ndef i2():return map(int,sys.stdin.readline().replace("\\n","").split())\ndef s():return str(sys.stdin.readline().replace("\\n",""))\ndef l():return list(sys.stdin.readline().replace("\\n",""))\ndef intl():return [int(k) for k in sys.stdin.readline().replace("\\n","").split()]\ndef lx():return list(map(lambda x:int(x)*-1,sys.stdin.readline().replace("\\n","").split()))\ndef t():return tuple(map(int,sys.stdin.readline().replace("\\n","").split()))\n\nif __name__ == "__main__":pass\nn ,m = i2()\nl = [0]*n\nfor i in range(m):\n s,c = i2()\n if s == 1 and c == 0 and n != 1:\n print(-1)\n exit()\n if l[s-1] == 0 or l[s-1] == c:\n l[s-1] = c\n else:\n print(-1)\n exit()\nnum = ""\nfor i in range(n):\n if i == 0 and l[i] == 0 and n != 1:\n num = num + "1"\n else:\n num = num + str(l[i])\nnum = int(num)\nprint(num if len(str(num)) == n else -1)'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s139315375', 's641732197', 's767792954'] | [3064.0, 3064.0, 3064.0] | [18.0, 18.0, 18.0] | [966, 812, 985] |
p02761 | u854992222 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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\nflg = [0] * n\nans = [0] * n\n\nfor i in range(m):\n if flg[s[i]-1] == 0:\n ans[s[i]-1] = c[i]\n flg[s[i]-1] = 1\n elif flg[s[i]-1] != 0 and ans[s[i]-1] != c[i]:\n print(-1)\n exit()\n elif flg[s[i]-1] != 0 and ans[s[i]-1] == c[i]:\n pass\n\nif len(ans) > 1 and ans[0] == 0:\n print(-1)\n exit()\n\nflg_str = [str(i) for i in flg]\nans_str = [str(i) for i in ans]\n\nprint(''.join(flg_str))\nprint(''.join(ans_str))", 'n, m = map(int, input().split())\ns = []\nc = []\nfor i in range(m):\n S, C = map(int, input().split())\n s.append(S)\n c.append(C)\n\nfor i in range(10 ** (n + 1)):\n tmp = str(i)\n if len(tmp) == n and all([tmp[s[j] - 1] == str(c[j]) for j in range(m)]):\n print(tmp)\n exit()\n\nprint(-1)'] | ['Wrong Answer', 'Accepted'] | ['s551435916', 's326662149'] | [9208.0, 9144.0] | [30.0, 29.0] | [569, 306] |
p02761 | u856775981 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["n, m = list(map(int, input().split()))\n\nans = 10 ** n\nnum = [-1] * n\n\nfor i in range(m):\n s, c = list(map(int, input().split()))\n if num[s - 1] == -1:\n num[s - 1] = c\n elif num[s - 1] != c:\n ans = -1\n break\n\nif ans != -1:\n \n if n == 1:\n ans = num[0]\n \n else:\n \n if num[0] == 0:\n ans = -1\n \n elif num[0] == -1:\n num[0] = 1\n\n \n for j in range(1, n):\n if num[j] == -1:\n num[j] = 0\n \n ans = int(''.join(list(map(str, num))))\n\nprint(ans)\n", "n, m = list(map(int, input().split()))\n\nans = 10 ** n\nnum = [-1] * n\n\nfor i in range(m):\n s, c = list(map(int, input().split()))\n if num[s - 1] == -1:\n num[s - 1] = c\n elif num[s - 1] != c:\n ans = -1\n break\n\nif ans != -1:\n \n if n == 1:\n if num[0] == -1:\n ans = 0\n else:\n ans = num[0]\n \n else:\n \n if num[0] == 0:\n ans = -1\n else:\n \n if num[0] == -1:\n num[0] = 1\n\n \n for j in range(1, n):\n if num[j] == -1:\n num[j] = 0\n \n ans = int(''.join(list(map(str, num))))\n\nprint(ans)\n"] | ['Wrong Answer', 'Accepted'] | ['s026642047', 's735133114'] | [9156.0, 9144.0] | [28.0, 28.0] | [728, 847] |
p02761 | u857293613 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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())\nlis = [list(map(int, input().split())) for _ in range(m)]\nans = -1\ni = 10**(n-1)\nwhile (ans == -1) and (i < 10**n):\n s = 0\n for j in lis:\n if str(i)[j[0]-1] == str(j[1]):\n s += 1\n else:\n s += 0\n if s == m:\n ans = i\n exit()\n else:\n i += 1\nprint(ans)', 'n, m = map(int, input().split())\nlis = [list(map(int, input().split())) for _ in range(m)]\nans = -1\nfor i in range(1000):\n if len(str(i)) != n:\n continue\n else:\n s = 0\n for j in lis:\n if str(i)[j[0]-1] == str(j[1]):\n s += 1\n print(s)\n if s == m:\n ans = i\n break\nprint(ans) ', 'n, m = map(int, input().split())\nlis = [list(map(int, input().split())) for _ in range(m)]\nans = -1\nfor i in range(1000):\n if len(str(i)) != n:\n continue\n else:\n s = 0\n for j in lis:\n if str(i)[j[0]-1] == str(j[1]):\n s += 1\n\n if s == m:\n ans = i\n break\nprint(ans) '] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s584133208', 's701319804', 's790631396'] | [3064.0, 3188.0, 3064.0] | [18.0, 19.0, 19.0] | [361, 357, 345] |
p02761 | u857346974 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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()))\nx = []\nans = [0]*m\nansw = 0\ns,c = [], []\n\ndef has_duplicates(seq):\n return len(seq) != len(set(seq))\n\nfor i in range(m):\n x.append(list(map(int,input().split())))\n \n\nx = list(map(list, set(map(tuple, x))))\n\nfor i,j in x:\n s.append(i)\n c.append(j)\n \n\nif m == 0:\n print(-1)\nelif has_duplicates(s):\n print(-1)\nelse:\n for i,j in x:\n ans[i-1] = j\n \n for i in range(len(ans)):\n answ += ans[i]*(10**(m-1-i))\n\n if ans[0] != 0:\n print(answ)\n else:\n print(-1)', 'n,m = list(map(int, input().split()))\nx = []\nans = [0]*n\nansw = 0\ns,c = [], []\n\ndef has_duplicates(seq):\n return len(seq) != len(set(seq))\n\nfor i in range(m):\n x.append(list(map(int,input().split())))\n \n\nx = list(map(list, set(map(tuple, x))))\n\nfor i,j in x:\n s.append(i)\n c.append(j)\n\nif (n == 1) and (m == 0):\n print(0)\nelif m == 0:\n ans[0] = 1\n for i in range(len(ans)):\n answ += ans[i]*(10**(n-1-i))\n \n print(answ)\nelif has_duplicates(s):\n print(-1)\nelif (n == 1) and (c.count(0) == 1):\n print(0)\nelse:\n for i,j in x:\n ans[i-1] = j\n \n if (ans[0] == 0) and (s.count(1) == 0):\n ans[0] = 1\n \n for i in range(len(ans)):\n answ += ans[i]*(10**(n-1-i))\n\n if ans[0] == 0:\n print(-1)\n else:\n print(answ)'] | ['Runtime Error', 'Accepted'] | ['s687467634', 's344122267'] | [3064.0, 3064.0] | [18.0, 18.0] | [584, 765] |
p02761 | u860002137 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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\nfrom collections import defaultdict\n\nn, m = map(int, input().split())\ntmp = [0] * n\nmemo = defaultdict(int)\n\nfor i in range(m):\n s, c = map(int, input().split())\n if i==0:\n memo[s] = c\n elif s in memo & memo[s]!=c:\n print(-1)\n sys.exit()\n elif (n==3 & s==1 & c==0):\n print(-1)\n sys.exit()\n else:\n tmp[s-1] = c\n \nprint(0) if sum(tmp) == 0 else print(*tmp, sep="")', 'import sys\nfrom collections import defaultdict\n\nN, M = map(int, input().split())\nd = defaultdict(int)\n\nfor i in range(M):\n s, c = map(int, input().split())\n if (d[s] != 0) & (d[s] != c): \n print(-1)\n sys.exit()\n elif ((s == 1) & (c == 0)) & (N > 1):\u3000\u3000\n print(-1)\n sys.exit()\n elif d[s] == 0:\u3000\u3000\n d[s] = c\n else:\n continue\n\n\nif N==1:\n print(d[1])\n sys.exit()\n\n\nans = ["1"] + ["0"] * (N - 1)\n\n\nfor s, c in d.items():\n ans[int(s) - 1] = str(c)\n\nprint("".join(ans))', 'import sys\nfrom collections import defaultdict\n\nN, M = map(int, input().split())\nd = defaultdict(int)\n\nfor i in range(M):\n s, c = map(int, input().split())\n if (d[s]!=0) & (d[s]!=c):\n print(-1)\n sys.exit()\n elif ((s==1) & (c==0)) | N != 1:\n print(-1)\n sys.exit()\n elif d[s]==0:\n d[s] = c\n else:\n continue\n\nans = ["1"] + ["0"] * (N - 1)\n\nfor s, c in d.items():\n ans[int(s) - 1] = str(c)\n\nprint("".join(ans))', 'import sys\n\nn, m = map(int, input().split())\nsc = [list(map(int, input().split())) for _ in range(m)]\nsc = [(s - 1, c) for s, c in sc]\n\nans = ["x"] * n\n\nfor s, c in sc:\n if n > 1 and s == 0 and c == 0:\n print(-1)\n sys.exit()\n elif ans[s] != "x" and ans[s] != c:\n print(-1)\n sys.exit()\n else:\n ans[s] = c\n\nif n > 1 and ans[0] == "x":\n ans[0] = 1\n\nfor i in range(n):\n if ans[i] == "x":\n ans[i] = 0\n\nans = [str(x) for x in ans]\n\nprint("".join(ans))'] | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s278117168', 's305550610', 's789791429', 's048306055'] | [3316.0, 2940.0, 3316.0, 9228.0] | [20.0, 17.0, 21.0, 30.0] | [433, 794, 466, 502] |
p02761 | u861071267 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["import sys\nN,M = map(int,input().split())\nsc = [list(map(int,input().split())) for i in range(M)]\n\nans = ['-1'] * N\n\nfor i in range(M):\n if ans[sc[i][0]-1] == sc[i][1]:\n continue\n elif ans[sc[i][0]-1] == '-1':\n ans[sc[i][0]-1] = sc[i][1]\n else:\n print('-1')\n sys.exit()\n\nif N >= 2:\n if ans[0] == '-1':\n ans[0] == 1\n elif ans[0] == 0:\n print('-1')\n sys.exit()\n\nfor i in range(N):\n if ans[i] == '-1':\n print(0)\n sys.exit()\n\nreal = 0\nfor i in ans:\n real = real * 10 + i\n\nprint(real)", "import sys\nN,M = map(int,input().split())\ns = [list(map(int,input().split())) for i in range(M)]\nans = 0\nans_list = [ 0 for i in range(M)]\n\nif M == 0:\n if N == 1:\n print('0')\n else:\n print(-1)\n sys.exit()\nimport sys\nN,M = map(int,input().split())\ns = [list(map(int,input().split())) for i in range(M)]\nans = 0\nans_list = [ 0 for i in range(M)]\n\nif M == 0:\n if N == 1:\n print('0')\n else:\n print(-1)\n sys.exit()\n\nfor i in range(M):\n ans_list[s[i][0]-1] = s[i][1]\n\nfor i in range(M):\n ans = ans * 10 + ans_list[i]\n\nif len(str(ans)) == N:\n print(ans)\nelse:\n print('-1')\nfor i in range(M):\n ans_list[s[i][0]-1] = s[i][1]\n\nfor i in range(M):\n ans = ans * 10 + ans_list[i]\n\nif len(str(ans)) == N:\n print(ans)\nelse:\n print('-1')", "import sys\nN,M = map(int,input().split())\nsc = [list(map(int,input().split())) for i in range(M)]\n\nans = ['-1'] * N\n\nfor i in range(M):\n if ans[sc[i][0]-1] == sc[i][1]:\n continue\n elif ans[sc[i][0]-1] == '-1':\n ans[sc[i][0]-1] = sc[i][1]\n else:\n print('-1')\n sys.exit()\n\nif N >= 2:\n if ans[0] == '-1':\n ans[0] = 1\n elif ans[0] == 0:\n print('-1')\n sys.exit()\nelse:\n if ans[0] == '-1':\n print(0)\n sys.exit()\n\nfor i in range(N):\n if ans[i] == '-1':\n ans[i] = 0\n\nreal = 0\nfor i in ans:\n real = real * 10 + i\n\nprint(real)"] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s367501019', 's636898703', 's548804257'] | [3064.0, 3064.0, 3064.0] | [19.0, 18.0, 19.0] | [563, 790, 610] |
p02761 | u861886710 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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\nfor X in range(10**N):\n X = str(X)\n \n \n if len(X) == N and all(X[s-1] == str(c) for s, c in SC):\n print(X[s-1])\n break\nelse:\n print(-1)', 'N, M = map(int, input().split())\nSC = [list(map(int, input().split())) for _ in range(M)]\n \nfor X in range(10**N):\n X = str(X)\n \n \n if len(X) == N and all(X[s-1] == str(c) for s, c in SC):\n print(X)\n break\nelse:\n print(-1)'] | ['Runtime Error', 'Accepted'] | ['s301125003', 's542280071'] | [9200.0, 9188.0] | [25.0, 29.0] | [281, 277] |
p02761 | u863370423 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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 f():\n n, m = list(map(int, input().split()))\n a = [-1, -1, -1, -1]\n\n for c in range(m):\n x = list(map(int, input().split()))\n if(a[x[0]] == -1):\n a[x[0]] = x[1]\n else:\n if(a[x[0]] != x[1]):\n return -1\n for y in range(4):\n if(a[y] == -1):\n a[y] = 1\n #print(a)\n \n s = 0\n for i in range(1,n+1):\n s *= 10\n s += a[i]\n \n #print(s)\n if(len(list(str(s))) != n):\n return -1\n return s\n\n \n\n\n\n\nx = f()\nif(x == -1):\n print("-1")\nelse:\n print(x)\n\n', "N , M = input().split()\nM = int(M)\nN = int(N)\nans = ['0' for i in range (N)]\nfl = True\n\nfor i in range (M) :\n s , c = input().split()\n s = int(s) - 1\n if (s == 0 and c == '0' and N != 1) :\n fl = False\n if (ans[s] != '0') :\n if (ans[s] != c) :\n fl = False\n else :\n ans[s] = c\n\nres = ''\n\nif (ans[0] == '0' and N != 1) :\n ans[0] = '1'\n\nfor i in ans :\n res += i\n\nprint (res if fl else -1)\n"] | ['Wrong Answer', 'Accepted'] | ['s277766804', 's058584106'] | [3064.0, 3064.0] | [18.0, 17.0] | [501, 438] |
p02761 | u863964720 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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())\nSi = []\nCi = []\ncheck1 = 0\ncheck2 = 0\ncheck3 = 0\nlastcheck = 0\nsum = 0\nfor i in range(M):\n S,C = map(int, input().split())\n Si.append(S)\n Ci.append(C)\nif N==1:\n for i in range (M):\n sum +=C[i]\n check3 = i\n if C[i] != C[check3]:\n lastcheck=0\nelif N==2:\n for i in range (M):\n if Si[i] == 2:\n sum +=C[i]*10\n check2 = i\n if C[i] != C[check2]:\n lastcheck=0\n else:\n sum +=C[i]\n check3=i\n if C[i] != C[check3]:\n lastcheck=0\nelse:\n for i in range (M):\n if Si[i] == 1:\n sum+=int(Ci[i]*100)\n check1 = i\n if int(C[i]) != int(C[check1]):\n lastcheck=0\n elif Si[i] == 2:\n sum +=C[i]*10\n check2 = i\n if C[i] != C[check2]:\n lastcheck=0\n else:\n sum +=C[i]\n check3=i\n if C[i] != C[check3]:\n lastcheck=0\nif lastcheck == 0:\n print('-1')\nelse:\n print(sum)\n ", "N,M = map(int, input().split())\nSi = [0]*M\nCi = [0]*M\nlastcheck = 1\nsum = 0\nfor i in range(M):\n Si[i], Ci[i] = map(int, input().split())\nif N==1:\n for i in range (M):\n sum +=C[i]\n if Si[i]==1 and Ci[i]==0:\n lastcheck=0\n for j in range(i+1,M):\n if Si[i]==Si[j]:\n sum-=int(Ci[i]*100)\n if Ci[i] != Ci[j]:\n lastcheck=0\nelif N==2:\n for i in range (M):\n if Si[i] == 1:\n if Si[i]==1 and Ci[i]==0:\n lastcheck=0\n sum +=C[i]*10\n for j in range(i+1,M):\n if Si[i]==Si[j]:\n sum-=int(Ci[i]*100)\n if Ci[i] != Ci[j]:\n lastcheck=0\n else:\n sum +=Ci[i]\n for j in range(i+1,M):\n if Si[i] == Si[j]:\n sum-=int(Ci[i]*100)\n if Ci[i] != Ci[j]:\n lastcheck=0\nelif N==1:\n for i in range (M):\n if Si[i] == 1:\n if Si[i]==1 and Ci[i]==0:\n lastcheck=0\n sum+=int(Ci[i]*100)\n for j in range(i+1,M):\n if Si[i]==Si[j]:\n sum-=int(Ci[i]*100)\n if Ci[i] != Ci[j]:\n lastcheck=0\n elif Si[i] == 2:\n sum +=Ci[i]*10\n for j in range(i+1,M):\n if Si[i] == Si[j]:\n sum-=int(Ci[i]*100)\n if Ci[i] != Ci[j]:\n lastcheck=0\n else:\n sum +=Ci[i]\n for j in range(i+1,M):\n if Si[i] == Si[j]:\n sum-=int(Ci[i]*100)\n if Ci[i] != Ci[j]:\n lastcheck=0\nelse:\n lastcheck = 0\nif lastcheck == 0:\n print('-1')\nelse:\n print(sum)", "N,M = map(int, input().split())\nSi = [0]*M\nCi = [0]*M\nlastcheck = 1\nsum = 0\nfor i in range(M):\n Si[i], Ci[i] = map(int, input().split())\nfor i in range (M):\n print(Si[i])\n print(Ci[i])\nif N==1:\n for i in range (M):\n sum +=C[i]\n if Si[i]==1 and Ci[i]==0:\n lastcheck=0\n for j in range(i+1,M):\n if Si[i]==Si[j]:\n sum-=int(Ci[i]*100)\n if Ci[i] != Ci[j]:\n lastcheck=0\nelif N==2:\n for i in range (M):\n if Si[i] == 1:\n if Si[i]==1 and Ci[i]==0:\n lastcheck=0\n sum +=C[i]*10\n for j in range(i+1,M):\n if Si[i]==Si[j]:\n sum-=int(Ci[i]*100)\n if Ci[i] != Ci[j]:\n lastcheck=0\n else:\n sum +=Ci[i]\n for j in range(i+1,M):\n if Si[i] == Si[j]:\n sum-=int(Ci[i]*100)\n if Ci[i] != Ci[j]:\n lastcheck=0\nelse:\n for i in range (M):\n if Si[i] == 1:\n if Si[i]==1 and Ci[i]==0:\n lastcheck=0\n sum+=int(Ci[i]*100)\n for j in range(i+1,M):\n if Si[i]==Si[j]:\n sum-=int(Ci[i]*100)\n if Ci[i] != Ci[j]:\n lastcheck=0\n elif Si[i] == 2:\n sum +=Ci[i]*10\n for j in range(i+1,M):\n if Si[i] == Si[j]:\n sum-=int(Ci[i]*100)\n if Ci[i] != Ci[j]:\n lastcheck=0\n else:\n sum +=Ci[i]\n for j in range(i+1,M):\n if Si[i] == Si[j]:\n sum-=int(Ci[i]*100)\n if Ci[i] != Ci[j]:\n lastcheck=0\nif lastcheck == 0:\n print('-1')\nelse:\n print(sum)\n ", "N,M = map(int, input().split())\nSi = [0]*M\nCi = [0]*M\nlastcheck = 1\nprecheck = 0\nsum = 0\nfor i in range(M):\n Si[i], Ci[i] = map(int, input().split())\nif N==1:\n for i in range (M):\n sum +=Ci[i]\n if Si[i]==1 and Ci[i]==0:\n sum =0\n for j in range(i+1,M):\n if Si[i]==Si[j]:\n sum-=int(Ci[i])\n if Ci[i] != Ci[j]:\n lastcheck=0\nelif N==2:\n for i in range (M):\n if Si[i] == 1:\n if Si[i]==1 and Ci[i]==0:\n lastcheck=0\n sum +=Ci[i]*10\n for j in range(i+1,M):\n if Si[i]==Si[j]:\n sum-=int(Ci[i]*10)\n if Ci[i] != Ci[j]:\n lastcheck=0\n else:\n sum +=Ci[i]\n for j in range(i+1,M):\n if Si[i] == Si[j]:\n sum-=int(Ci[i])\n if Ci[i] != Ci[j]:\n lastcheck=0\nelse:\n for i in range (M):\n if Si[i] == 1:\n if Si[i]==1 and Ci[i]==0:\n lastcheck=0\n sum+=int(Ci[i]*100)\n for j in range(i+1,M):\n if Si[i]==Si[j]:\n sum-=int(Ci[i]*100)\n if Ci[i] != Ci[j]:\n lastcheck=0\n elif Si[i] == 2:\n sum +=Ci[i]*10\n for j in range(i+1,M):\n if Si[i] == Si[j]:\n sum-=int(Ci[i]*10)\n if Ci[i] != Ci[j]:\n lastcheck=0\n else:\n sum +=Ci[i]\n for j in range(i+1,M):\n if Si[i] == Si[j]:\n sum-=int(Ci[i])\n if Ci[i] != Ci[j]:\n lastcheck=0\nfor i in range(M):\n if Si[i] == 1:\n precheck+=1\nif precheck == 0:\n if N == 3:\n sum +=100\n elif N == 2:\n sum +=10\n else:\n sum+=0\nif lastcheck == 0:\n print('-1')\nelse:\n print(sum)"] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s678129049', 's706723960', 's914319949', 's103708793'] | [3192.0, 3192.0, 3316.0, 3192.0] | [17.0, 18.0, 18.0, 18.0] | [1111, 1847, 1885, 1982] |
p02761 | u865119809 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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\nrest = []\nfor i in range(m):\n a,b = input().split()\n rest.apend((int(a),b))\n\ndone = False\n\nfor i in range(0,1000):\n x = str(i)\n if (len(x) == n):\n ok = True\n for t in rest:\n if (x[t[0] - 1] != t[1]):\n ok = False\n break\n if ok:\n print(i)\n done = True\n\nif not done:\n print(-1)', 'n,m = map(int,input().split())\n\nrest = []\nfor i in range(m):\n a,b = input().split()\n rest.append((int(a),b))\n\ndone = False\n\nfor i in range(0,1000):\n x = str(i)\n if (len(x) == n):\n ok = True\n for t in rest:\n if (x[t[0] - 1] != t[1]):\n ok = False\n break\n if ok:\n print(i)\n done = True\n break\n\nif not done:\n print(-1)'] | ['Runtime Error', 'Accepted'] | ['s318309977', 's816326684'] | [3188.0, 3064.0] | [18.0, 18.0] | [405, 424] |
p02761 | u865383026 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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 = [str(i) for i in range(1 * 10 ** (N - 1), 1 * 10 ** N)]\nif N == 1:\n A.append('0')\nfor i in range(M):\n t = list(map(int, input().split()))\n A = [A[j] for j in range(len(A)) if int(A[j][t[0] - 1]) == t[1]]\nprint(-1 if not A == True else min(A))", "N, M = map(int, input().split())\nA = [str(i) for i in range(1 * 10 ** (N - 1), 1 * 10 ** N)]\nif N == 1:\n A.append('0')\nfor i in range(M):\n t = list(map(int, input().split()))\n A = [A[j] for j in range(len(A)) if int(A[j][t[0] - 1]) == t[1]]\nprint(-1 if (not A) == True else min(A))"] | ['Wrong Answer', 'Accepted'] | ['s566634696', 's116014919'] | [3064.0, 3064.0] | [18.0, 18.0] | [282, 284] |
p02761 | u867826040 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['n,m = map(int,input().split())\nsc = [tuple(map(int,input().split())) for i in range(m)]\nl = [0]*n\nfor t in sc:\n l[t[0]-1] = t[1]\nif sc[0][0]!=1 and sc[0][1]==0:\n l[0]=1\n print("".join([str(s) for s in l]))\nelse:\n if l[0]==0:\n print(-1)', 'n,m = map(int,input().split())\nx = [tuple(map(int,input().split())) for i in range(m)]\nf=True\nfor i in range(0,1001):\n i = str(i)\n if len(i)==n:\n if all([i[t[0]-1]==str(t[1]) for t in x]):\n print(i)\n f=False\n break\nif f:\n print(-1)'] | ['Runtime Error', 'Accepted'] | ['s604777685', 's345024960'] | [3064.0, 3064.0] | [18.0, 18.0] | [254, 280] |
p02761 | u867848444 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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=set(tuple(map(int,input().split())) for i in range(m))\n\nS=['1']+['0']*(n-1)\nfor s,c in sc:\n if s==1 and c==0 and n>1:\n print(-1)\n exit()\n elif n>1 and S[0]!='1':\n print(-1)\n exit()\n elif s>1 and S[s-1]!='0':\n print(-1)\n exit()\n S[s-1]=str(c)\n #print(S)\nif n==1 and m==0:S='0'\nprint(*S,sep='')", "n,m=map(int,input().split())\nsc=set(tuple(map(int,input().split())) for i in range(m))\n\nS=['1']+['0']*(n-1)\nfor s,c in sc:\n if s==1 and c==0 and n>1:\n print(-1)\n exit()\n elif s==1 and S[0]!='1':\n print(-1)\n exit()\n elif s>1 and S[s-1]!='0':\n print(-1)\n exit()\n S[s-1]=str(c)\n #print(S)\nif n==1 and m==0:S='0'\nprint(*S,sep='')"] | ['Wrong Answer', 'Accepted'] | ['s273159426', 's149174613'] | [3064.0, 3064.0] | [17.0, 17.0] | [381, 382] |
p02761 | u868606077 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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\nlines = sys.stdin.readlines()\nline1 = lines.pop(0).split(' ')\n#print(line1)\nN = int(line1[0])\nM = int(line1[1])\n\n#print(N)\n#print(M)\n\nstr = [0] * N\nans = []\nflg = 0\nfor i in range(M):\n line = lines.pop(0).split(' ')\n# print(line)\n s = int(line[0])\n c = int(line[1])\n# print(s)\n# print(c)\n str[s-1] = c\n print('str = ')\n print(str)\n one = int(str[0])\n if N == 3:\n ret = one*100 + int(str[1])*10 + int(str[2])\n if int(str[1])>0 or int(str[2])>0:\n flg = 1\n elif N == 2:\n ret = one*10 + int(str[1])\n if int(str[1]) > 0:\n flg = 1\n else:\n if one > 0:\n ret = one\n ans.append(ret)\n\nprint(ans)\ndiv = 1\nif N == 3:\n div = 100\nelif N == 2:\n div = 10\n\nfor obj in ans[:]:\n if (obj / (10**(N-1))) < 1:\n ans.remove(obj)\n elif flg == 1:\n print('リムーブ候補')\n print(obj)\n print(div)\n a = obj % div\n print(a)\n if a == 0:\n print('リムーブ')\n\nif not ans:\n print('-1')\nelse:\n print(ans)\n print(min(ans))\n", "import sys\nimport math\nlines = sys.stdin.readlines()\nline1 = lines.pop(0).split(' ')\n#print(line1)\nN = int(line1[0])\nM = int(line1[1])\n\n#print(N)\n#print(M)\n\nstr = [10] * N\nprint(str)\nans = []\nflg = 0\nflg2 = 0\nfor i in range(M):\n line = lines.pop(0).split(' ')\n# print(line)\n s = int(line[0])\n c = int(line[1])\n# print(s)\n# print(c)\n# print(str[s-1])\n if str[s-1] > c:\n str[s-1] = c\n\n#print(str)\nstr = [0 if i == 10 else i for i in str]\n#print(str)\nif N == 3:\n ret = (int(str[0])*100 + int(str[1])*10 + int(str[2])) if int(str[0]) > 0 else -1\nelif N ==2:\n ret = (int(str[0])*10 + int(str[1])) if int(str[0]) > 0 else -1\nelif N ==1:\n ret = int(str[0])\n\nprint(ret)", "import sys\nimport math\nlines = sys.stdin.readlines()\nline1 = lines.pop(0).split(' ')\n#print(line1)\nN = int(line1[0])\nM = int(line1[1])\n#print(N)\n#print(M)\n\nif M == 0:\n print('-1')\n sys.exit()\n\n\nstr = [10] * N\n#print(str)\n\nfor i in range(M):\n line = lines.pop(0).split(' ')\n# print(line)\n s = int(line[0])\n c = int(line[1])\n# print(s)\n# print(c)\n# print(str[s-1])\n if str[s-1] > c:\n str[s-1] = c\n\n#print(str)\n\n#print(str)\nif N == 3:\n if str[0] == 10 and str[1] == 10:\n str[0] = 1\n str[1] = 0\n elif str[0] == 10 and str[1] != 10:\n str[0] = 1\n elif str[0] != 10 and str[1] == 10:\n str[1] = 1\n ret = (int(str[0])*100 + int(str[1])*10 + int(str[2])) if int(str[0]) > 0 else -1\nelif N ==2:\n str[0] = 1 if str[0] == 10 else str[0]\n ret = (int(str[0])*10 + int(str[1])) if int(str[0]) > 0 else -1\nelif N ==1:\n str[0] = 0 if str[0] == 10 else str[0]\n ret = int(str[0])\n\nprint(ret)\n", "import sys\nlines = sys.stdin.readlines()\nline1 = lines.pop(0).split(' ')\n#print(line1)\nN = int(line1[0])\nM = int(line1[1])\n\n#print(N)\n#print(M)\n\nstr = [0] * N\n\nans = []\n\na = 0\nb = 0\nc = 0\n\nfor i in range(M):\n line = lines.pop(0).split(' ')\n# print(line)\n s = int(line[0])\n c = int(line[1])\n# print(s)\n# print(c)\n str[s-1] = c\n if N == 3:\n ret = int(str[0])*100 + int(str[1])*10 + int(str[2])\n elif N == 2:\n ret = int(str[0])*10 + int(str[1])\n else:\n ret = int(str[0])\n \n ans.append(ret)\n \nfor obj in ans[:]:\n if (obj / (10**(N-1))) < 1:\n ans.remove(obj)\n\nprint(min(ans))\n", "import sys\nlines = sys.stdin.readlines()\nline1 = lines.pop(0).split(' ')\n#print(line1)\nN = int(line1[0])\nM = int(line1[1])\n\n#print(N)\n#print(M)\n\nstr = [0] * N\nans = []\nflg = 0\nflg2 = 0\nfor i in range(M):\n line = lines.pop(0).split(' ')\n# print(line)\n s = int(line[0])\n c = int(line[1])\n# print(s)\n# print(c)\n str[s-1] = c\n# print('str = ')\n# print(str)\n one = int(str[0])\n if N == 3:\n ret = one*100 + int(str[1])*10 + int(str[2])\n if int(str[1])>0:\n flg = 1\n if int(str[2])>0:\n flg2 = 1\n elif N == 2:\n ret = one*10 + int(str[1])\n if int(str[1]) > 0:\n flg = 1\n else:\n if one > 0:\n ret = one\n ans.append(ret)\n\n#print(ans)\n\nfor obj in ans[:]:\n if (obj / (10**(N-1))) < 1:\n ans.remove(obj)\n \n if N == 2:\n if flg == 1:\n a = obj % 10\n if a == 0:\n\n ans.remove(obj)\n\n elif N == 3:\n if flg == 1 and flg2 ==1:\n\n# print(obj)\n if obj % 100 == 0:\n\n ans.remove(obj)\n elif obj % 10 == 0:\n\n ans.remove(obj)\n elif flg == 0 and flg2 ==1:\n\n# print(obj)\n b = obj % 10\n print(b)\n if b == 0:\n\n ans.remove(obj)\n\nif not ans:\n print('-1')\nelse:\n# print(ans)\n print(min(ans))\n", "import sys\nimport math\nlines = sys.stdin.readlines()\nline1 = lines.pop(0).split(' ')\n#print(line1)\nN = int(line1[0])\nM = int(line1[1])\n#print(N)\n#print(M)\n\n\nstr = [10] * N\n#print(str)\n\nfor i in range(M):\n line = lines.pop(0).split(' ')\n# print(line)\n s = int(line[0])\n c = int(line[1])\n# print(s)\n# print(c)\n# print(str[s-1])\n# if str[s-1] > c:\n if str[s-1] == 10:\n str[s-1] = c\n elif(str[s-1] == c):\n \n pass\n else:\n \n print('-1')\n sys.exit()\n\n#print(str)\n\n#print(str)\nif N == 3:\n if str[0] == 10 and str[1] == 10:\n str[0] = 1\n str[1] = 0\n elif str[0] == 10 and str[1] != 10:\n str[0] = 1\n elif str[0] != 10 and str[1] == 10:\n str[1] = 0\n\n str[2] = 0 if str[2] == 10 else str[2]\n\n ret = (int(str[0])*100 + int(str[1])*10 + int(str[2])) if int(str[0]) > 0 else -1\nelif N ==2:\n str[0] = 1 if str[0] == 10 else str[0]\n str[1] = 0 if str[1] == 10 else str[1]\n ret = (int(str[0])*10 + int(str[1])) if int(str[0]) > 0 else -1\nelif N ==1:\n str[0] = 0 if str[0] == 10 else str[0]\n ret = int(str[0])\n\nprint(ret)\n"] | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s042685981', 's366677139', 's426139461', 's656441257', 's784265606', 's156123811'] | [3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 17.0, 18.0, 18.0, 18.0, 18.0] | [982, 675, 956, 597, 1384, 1211] |
p02761 | u870518235 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['lst = []\n\nfor i in range(10):\n for j in range(10):\n for k in range(10):\n lst.append(str(i)+str(j)+str(k))\n\nN, M = map(int, input().split())\nS = []\nC = []\nfor l in range(M):\n S.append(0)\n C.append(0)\n S[l], C[l] = map(int, input().split())\n C[l] = str(C[l])\n\nfor n in range(1000):\n for m in range(M):\n if lst[n][S[m]-1] != C[m]:\n lst[n] = "1000"\n lst[n] = int(lst[n])\n\nif min(list) == 1000:\n print(-1)\nelse:\n print(min(lst))', '# C - Guess The Number\nN, M = map(int, input().split())\nSC = [list(map(int, input().split())) for _ in range(M)]\n\nans = [0,0,0]\n\n\nfor i in range(M):\n for j in range(i+1,M):\n if (SC[i][0] == SC[j][0]) and (SC[i][1] != SC[j][1]):\n print(-1)\n quit()\n\n\nfor k in range(M):\n ans[SC[k][0]-(N-2)] = str(SC[k][1])\n\n\nif (ans[3-N] == "0") and (N == 1):\n print(0)\n quit()\nelif ans[3-N] == "0":\n print(-1)\n quit()\n\n\nans = [str(ans[i]) for i in range(3)]\nres = "".join(ans)\nres = res[(3-N):4]\n\n\nif (res[0] == "0") and (N == 1):\n res = "0"\nelif res[0] == "0":\n ref = list(res)\n ref[0] = "1"\n res = "".join(ref)\n\nprint(res)\n'] | ['Runtime Error', 'Accepted'] | ['s151682156', 's250346449'] | [3064.0, 9244.0] | [19.0, 30.0] | [486, 902] |
p02761 | u870559097 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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())\nZ = [None for _ in range(N)]\nfor i in range(M):\n s, c = map(int, input().split())\n if Z[s-1] == None or Z[s-1] == c:\n Z[s-1] = c\n else:\n print(-1)\n break\nelse:\n if Z[0] == 0:\n print(-1)\n elif Z[0] == None:\n Z[0] = 1\n for l in range(N):\n if Z[l] == None:\n Z[l] = 0\n print("".join(map(str, Z)))', 'N, M = map(int, input().split())\nZ = [None for _ in range(N)]\nfor i in range(M):\n s, c = map(int, input().split())\n if Z[s-1] == None or Z[s-1] == c:\n Z[s-1] = c\n else:\n print(-1)\n break\nelse:\n if N == 1 and (M == 0 or Z[0] == 0):\n print(0)\n elif Z[0] == 0:\n print(-1)\n elif Z[0] == None:\n Z[0] = 1\n for l in range(N):\n if Z[l] == None:\n Z[l] = 0\n print("".join(map(str, Z)))\n else:\n for p in range(N):\n if Z[p] == None:\n Z[p] = 0\n print("".join(map(str, Z)))\n'] | ['Wrong Answer', 'Accepted'] | ['s599042424', 's639389623'] | [3064.0, 3064.0] | [17.0, 17.0] | [363, 521] |
p02761 | u872538555 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['n, m = map(int, input().split())\n\nif 0 < m:\n s_c = [0] * (m * 2)\n for i in range(m):\n s_c[2 * i], s[2 * i + 1] = map(int, input().split())\n \n\nfor i in range(0, m * 2 , 2):\n s_c[i] -= 1\n\nnum = [-1] * n\nflag = False\nfor i in range(m):\n if num[s_c[2 * i]] != -1 and num[s_c[2 * i]] != s_c[2 * i + 1]:\n #print("diffrent")\n flag = True\n else:\n num[s_c[2 * i]] = s_c[2 * i + 1]\n \nfor i in range(n):\n if num[i] == -1:\n num[i] = 0\n \n#print(num)\n \nif 1 < n and num[0] == 0:\n #print("head is 0")\n flag = True\n\nif flag:\n print(-1)\nelse:\n print(\'\'.join([str(n) for n in num]))', 'n, m = map(int, input().split())\n\ns = [0] * m\nc = [0] * m\n\nfor i in range(m):\n s[i], c[i] = map(int, input().split())\n s[i] -= 1\n \nnum = [10] * n\n\nflag = False\nfor i in range(m):\n if num[s[i]] != 10 and num[s[i]] != c[i]:\n #print("dif")\n flag = True\n else:\n num[s[i]] = c[i]\n \nif 1 < n and num[0] == 0:\n #print("head is 0")\n flag = True\nelif 1 < n and num[0] == 10:\n num[0] = 1\n\nfor i in range(n):\n if num[i] == 10:\n num[i] = 0\n\nif flag:\n print(-1)\nelse:\n print(\'\'.join([str(n) for n in num]))'] | ['Runtime Error', 'Accepted'] | ['s088989230', 's074571367'] | [3064.0, 3064.0] | [17.0, 17.0] | [649, 561] |
p02761 | u876536031 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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\nS = [""]*N\nfor _ in range(M):\n s, c = map(int,input().split())\n else:\n if S[s-1] == "" or S[s-1] == c:\n S[s-1] = c\n elif S[s-1] != "" and S[s-1] != c:\n print(-1)\n exit(0)\nif N == 3:\n if S[0] == "":\n S[0] = 1\n if S[0] = 0:\n print(-1)\n exit(0)\n if S[1] == "":\n S[1] = 0\n if S[2] == "":\n S[2] = 0\n print(S[0],end="")\n print(S[1],end="")\n print(S[2])\nelif N == 2:\n if S[0] == "":\n S[0] = 1\n if S[0] == 0:\n print(-1)\n exit(0)\n if S[1] == "":\n S[1] = 0\n print(S[0],end="")\n print(S[1],end="")\nelif N == 1:\n if S[0] == "":\n print(0)\n', 'N,M = map(int, input().split())\nans = 0\nc1 = []\nc2 = []\nc3 = []\nfor _ in range(M):\n s, c = map(int,input().split())\n if s == 1 and c == 0:\n print(-1)\n exit(0)\n if N == 1:\n elif not c in c1:\n ans += c\n c1.append(c)\n if len(c1) > 1:\n print(-1)\n exit(0)\n if N == 2:\n elif s == 1 and not c in c2:\n ans += 10*c\n c2.append(c)\n if len(c2) > 1:\n print(-1)\n exit(0)\n elif s == 2 and not c in c3:\n ans += c\n c3.append(c)\n if len(c3) > 1:\n print(-1)\n exit(0)\n if N == 3:\n elif s == 1 and not c in c1:\n ans += 100*c\n c1.append(c)\n if len(c1) > 1:\n print(-1)\n exit(0)\n elif s == 2 and not c in c2:\n ans += 10*c\n c2.append(c)\n if len(c2) > 1:\n print(-1)\n exit(0)\n elif s == 3 and not c in c3:\n ans += c\n c3.append(c)\n if len(c3) > 1:\n print(-1)\n exit(0)\nprint(ans)', 'N,M = map(int, input().split())\nans = 0\nS = [""]*N\nfor _ in range(M):\n s, c = map(int,input().split())\n if S[s-1] == "" or S[s-1] == c:\n S[s-1] = c\n elif S[s-1] != "" and S[s-1] != c:\n print(-1)\n exit(0)\nif N == 3:\n if S[0] == "":\n S[0] = 1\n if S[0] == 0:\n print(-1)\n exit(0)\n if S[1] == "":\n S[1] = 0\n if S[2] == "":\n S[2] = 0\nelif N == 2:\n if S[0] == "":\n S[0] = 1\n if S[0] == 0:\n print(-1)\n exit(0)\n if S[1] == "":\n S[1] = 0\nelif N == 1:\n if S[0] == "":\n S[0] = 0\nprint(\'\'.join(map(str,S)))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s884630089', 's949424197', 's279649459'] | [2940.0, 2940.0, 3064.0] | [18.0, 17.0, 17.0] | [632, 955, 543] |
p02761 | u878129968 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['n, m = map(int, input().split())\n\ndigit = [None] * n\nfor ind in range(m):\n s, c = map(int, input().split())\n if digit[s-1] == None:\n digit[s-1] = c\n elif digit[s-1] != c:\n print("-1")\n exit()\nprint(digit)\nif n > 1 and digit[0] == 0:\n print("-1")\n exit()\nnums = [0] * n\nfor ind, num in enumerate(digit):\n if ind == 0 and num == None:\n nums[ind] = 1\n if num != None:\n nums[ind] = num\nresult = 0\nfor ind, num in enumerate(nums):\n result += 10**(n-ind-1) * num\nprint(result)', 'n, m = map(int, input().split())\nif n == 1 and m == 0:\n print(0)\n exit()\ndigit = [None] * n\nfor ind in range(m):\n s, c = map(int, input().split())\n if digit[s-1] == None:\n digit[s-1] = c\n elif digit[s-1] != c:\n print("-1")\n exit()\n\nif n > 1 and digit[0] == 0:\n print("-1")\n exit()\nnums = [0] * n\nfor ind, num in enumerate(digit):\n if ind == 0 and num == None:\n nums[ind] = 1\n if num != None:\n nums[ind] = num\nresult = 0\nfor ind, num in enumerate(nums):\n result += 10**(n-ind-1) * num\nprint(result)'] | ['Wrong Answer', 'Accepted'] | ['s831870551', 's511403055'] | [3064.0, 3064.0] | [17.0, 17.0] | [493, 535] |
p02761 | u879294842 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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 sc = {}\n N,M = map(int,input().split())\n for _ in range(M):\n s,c = input().split()\n s = int(s)\n if s not in sc:\n sc[s] = c\n return -1\n else:\n if sc[s] != c:\n return -1\n\n if 1 in sc and sc[1] == 0 and N != 1:\n return -1\n\n ans = ["0"] * N\n\n for k,n in sc.items():\n ans[k-1] = n\n\n result = \'\'.join(ans)\n if result[0] != \'0\' or result == \'0\':\n return result\n else:\n result = \'1\' + result[1:] \n return int(result)\n\n\nprint(main())', 'def main():\n sc = {}\n N,M = map(int,input().split())\n for _ in range(M):\n s,c = input().split()\n s = int(s)\n if s not in sc:\n sc[s] = c\n return -1\n else:\n if sc[s] != c:\n return -1\n\n if 1 in sc and sc[1] == 0:\n return -1\n ans = ["0"] * N\n\n for k,n in sc.items():\n ans[k-1] = n\n\n result = \'\'.join(ans)\n if result[0] != \'0\' or result == \'0\':\n return result\n else:\n result = \'1\' + result[1:] \n return int(result)\n\nFUCK = main()\nprint(FUCK) ', 'def main():\n sc = {}\n N,M = map(int,input().split())\n for _ in range(M):\n s,c = input().split()\n s = int(s)\n if s not in sc:\n sc[s] = c\n return -1\n else:\n if sc[s] != c:\n return -1\n\n #if 1 in sc and sc[1] == 0 and N != 1:\n #return -1\n\n ans = ["0"] * N\n\n for k,n in sc.items():\n ans[k-1] = n\n\n result = \'\'.join(ans)\n if result[0] != \'0\' or result == \'0\':\n return result\n else:\n result = \'1\' + result[1:] \n return int(result)\n\n\nprint(main())', 'def main():\n sc = {}\n N,M = map(int,input().split())\n for _ in range(M):\n s,c = input().split()\n s = int(s)\n if s not in sc:\n sc[s] = c\n else:\n if sc[s] != c:\n return -1\n\n if 1 in sc and sc[1] == \'0\' and N != 1:\n return -1\n\n ans = ["0"] * N\n\n for k,n in sc.items():\n ans[k-1] = n\n\n result = \'\'.join(ans)\n if result[0] != \'0\' or result == \'0\':\n return result\n else:\n result = \'1\' + result[1:] \n return int(result)\n\n\nprint(main())'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s202770361', 's795692007', 's906823634', 's582218170'] | [3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 18.0, 17.0, 17.0] | [578, 585, 580, 558] |
p02761 | u880480312 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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())\nt = [-1]*N\nfor i in range(M):\n s, c=map(int, input().split())\n s -= 1\n if t[s] != c:\n print(-1)\n exit()\n t[s] = c\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 \n', 'N,M = map(int,input().split())\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\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 \n'] | ['Wrong Answer', 'Accepted'] | ['s181973591', 's049484940'] | [3188.0, 3064.0] | [18.0, 17.0] | [415, 430] |
p02761 | u881116515 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['n,m = map(int,input().split())\na = [-1 for i in range(n)]\nans = True\nfor i in range(m):\n s,c = map(int,input().split())\n s -= 1\n if (n != 1 and s == 0 and c == 0) or (a[s] != -1 and a[s] != c):\n ans = False\n print(-1)\n break\n else:\n a[s] = c\nif ans:\n for i in range(n):\n if a[i] == -1:\n a[i] = 1\n a[i] = str(a[i])\n print("".join(a))', 'n,m = map(int,input().split())\na = [-1 for i in range(n)]\nans = True\nfor i in range(m):\n s,c = map(int,input().split())\n s -= 1\n if (n != 1 and s == 0 and c == 0) or (a[s] != -1 and a[s] != c):\n ans = False\n print(-1)\n break\n else:\n a[s] = c\nif ans:\n for i in range(n):\n if a[i] == -1 and (n == 1 or (n != 1 and i != 0)):\n a[i] = 0\n elif a[i] == -1:\n a[i] = 1\n a[i] = str(a[i])\n print("".join(a))\n'] | ['Wrong Answer', 'Accepted'] | ['s061078759', 's144175926'] | [3064.0, 3064.0] | [17.0, 17.0] | [361, 434] |
p02761 | u884323674 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['N, M = map(int, input().split())\nsc = [[int(i) for i in input().split()] for j in range(M)]\n\nnum_min = 10**(N-1)\nnum_max = 10**N\nif N > 1:\n i = num_min\nelse:\n i = 0\nans = -1\nwhile i < num_max:\n num_list = []\n rem = i\n for j in range(N, 0, -1):\n num_list.append(rem // 10**(j-1))\n rem = i % 10**(j-1)\n \n found = True\n for k in range(M):\n s, c = sc[k]\n if num_list[s-1] != c:\n found = False\n \n if found:\n ans = i\n break\n else:\n i += 1\n\nprint(num_list)\nprint(ans)', 'N, M = map(int, input().split())\nsc = [[int(i) for i in input().split()] for j in range(M)]\n\nnum_min = 10**(N-1)\nnum_max = 10**N\nif N > 1:\n i = num_min\nelse:\n i = 0\nans = -1\nwhile i < num_max:\n num_list = []\n rem = i\n for j in range(N, 0, -1):\n num_list.append(rem // 10**(j-1))\n rem = i % 10**(j-1)\n \n found = True\n for k in range(M):\n s, c = sc[k]\n if num_list[s-1] != c:\n found = False\n \n if found:\n ans = i\n break\n else:\n i += 1\n\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s329203965', 's877047171'] | [3064.0, 3064.0] | [21.0, 20.0] | [553, 537] |
p02761 | u884601206 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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 n==1:\n for i in range(10):\n \n flg=True\n for l in range(m):\n if str(i)[b[l][0]-1] != str(b[l][1]):\n flg=False\n if flg==True:\n print(i)\n break\n else:\n print(-1)\n \nelse: \n for i in range(10**(n-1),10**n):\n flg=True\n for j in range(m):\n if str(i)[b[j][0]-1] != str(b[j][1]):\n flg=False\n \n if flg==True:\n print(i)\n break\n if flg == False:\n print(-1)\n ', 'n,m=map(int,input().split())\n\nb=[list(map(int,input().split())) for i in range(m)]\n\nif n==1:\n for i in range(10):\n \n flg=True\n for l in range(m):\n if str(i)[b[l][0]-1] != str(b[l][1]):\n flg=False\n if flg==True:\n print(i)\n break\n else:\n print(-1)\n \nelse: \n for i in range(10**(n-1),10**n):\n flg=True\n for j in range(m):\n if str(i)[b[j][0]-1] != str(b[j][1]):\n flg=False\n \n if flg==True:\n print(i)\n break\n if flg == False:\n print(-1)\n '] | ['Runtime Error', 'Accepted'] | ['s423643510', 's115356327'] | [3064.0, 3064.0] | [18.0, 20.0] | [435, 519] |
p02761 | u886142147 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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()))\ntable = [input().split() for l in range(M)]\nans = 0\narray1 = []\narray2 = []\narray3 = []\nketa1 = -1\nketa2 = -1\nketa3 = -1\ns1 = 0\ns2 = 0\ns3 = 0\nfor k in range(M):\n for j in range(2):\n table[k][j] = int(table[k][j])\n\nfor k in range(M):\n if table[k][0] == 1:\n if table[k][1] == 0 or (not(table[k][1] in array1) and s1 == 1):\n keta1 = -1\n else:\n keta1 = table[k][1]\n s1 = 1\n array1.append(table[k][1])\n\n elif table[k][0] == 2:\n if not(table[k][1] in array2) and s2 ==1:\n keta2 = -1\n else:\n keta2 = table[k][1]\n s2 = 1\n array2.append(table[k][1])\n else:\n if not(table[k][1] in array3) and s3 == 1:\n keta3 = -1\n else:\n keta3 = table[k][1]\n s3 = 1\n array3.append(table[k][1])\n\nif s1 != 1:\n keta1 = 1\nif s2 != 1:\n keta2 = 1\nif s3 != 1:\n keta3 = 1\n\nif keta1 == -1 or keta2 == -1 or keta3 == -1:\n ans = -1\nelse:\n ans = keta1 * 100 + keta2 * 10 + keta3\n\nprint(ans)', 'n, m = map(int, input().split())\nT = [list(map(int, input().split())) for i in range(m)]\nans = 0\nstart = 0\n\nif n != 1:\n start = 10 ** (n - 1)\n\nfor i in range(start, 10 ** n):\n for j in range(m):\n ans = 0\n if (str(i))[(T[j][0] - 1)] != str(T[j][1]):\n ans = -1\n break\n if ans == 0:\n ans = i\n break\n\nprint(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s264529439', 's226201576'] | [3064.0, 3064.0] | [17.0, 18.0] | [1070, 367] |
p02761 | u886459614 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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={}\nswitch = 0\nans = 0\n\n\nfor i in range(m):\n\ta, b = map(int, input().split())\n\tif a in D:\n\t\tfor s in D:\n\t\t\tif a == s and b != D[s]:\n\t\t\t\tprint('-1')\n\t\t\t\tswitch+=1\n\t\t\t\tbreak\n\telse:\n\t\tD[a]=b\nfor a in D:\n\tans+=D[a]*10**(n-a)\nprint(ans)\n\nif switch==0:\n\tif ans>10**(n-1)-1 or ans==0:\n\t\tprint(ans)\n\telse:\n\t\tprint('-1')", "n, m = map(int, input().split())\nB=[]\nD={}\nswitch = 0\nans = 0\n\n\nif n==1:\n\tswitch+=1\n\tfor i in range(m):\n\t\ta, b = map(int, input().split())\n\t\tB.append(b)\n\tif len(set(B))>=2:\n\t\tprint(-1)\n\telif len(B)==0:\n\t\tprint(0)\n\telse:\n\t\tprint(B[0])\n\nif n>=2:\n\tfor i in range(m):\n\t\ta, b = map(int, input().split())\n\t\tif a==1 and b==0:\n\t\t\tprint(-1)\n\t\t\tswitch+=1\n\t\t\tbreak\n\t\tif a in D:\n\t\t\tfor s in D:\n\t\t\t\tif a == s and b != D[s]:\n\t\t\t\t\tprint('-1')\n\t\t\t\t\tswitch+=1\n\t\t\t\t\tbreak\n\t\telse:\n\t\t\tD[a]=b\nfor a in D:\n\tans+=D[a]*10**(n-a)\n\nif switch==0:\n\tif 10**(n-1)>ans:\n\t\tprint(ans+10**(n-1))\n\telse:\n\t\tprint(ans)"] | ['Wrong Answer', 'Accepted'] | ['s328629701', 's693280058'] | [3064.0, 3064.0] | [17.0, 17.0] | [492, 663] |
p02761 | u886655280 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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 = [0] * N\nN_set_list = [False] * N\n\nfor i in range(M):\n s, c = map(int, input().split())\n s -= 1\n \n if s > N -1 or (s == 0 and c == 0):\n print(-1)\n exit()\n\n elif N_set_list[s] and (N_list[s] != c):\n print(-1)\n exit()\n\n else:\n N_list[s] = c\n N_set_list[s] = True\n\nif N_list[0] == 0 and len(N_list) != 1\n N_list[0] = 1\n\nprint(''.join(map(str, N_list)))\n", "N, M = map(int, input().split())\nN_list = [0] * N\nN_set_list = [False] * N\n\nfor i in range(M):\n s, c = map(int, input().split())\n s -= 1\n \n if s > N -1 or (s == 0 and c == 0 and N != 1):\n print(-1)\n exit()\n\n elif N_set_list[s] and (N_list[s] != c):\n print(-1)\n exit()\n\n else:\n N_list[s] = c\n N_set_list[s] = True\n\nif N_list[0] == 0 and N != 1:\n N_list[0] = 1\n\nprint(''.join(map(str, N_list)))\n"] | ['Runtime Error', 'Accepted'] | ['s866501495', 's331209944'] | [3064.0, 3064.0] | [18.0, 18.0] | [416, 418] |
p02761 | u888881904 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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\nfor i in range(1000):\n ans = str(i)\n for s, c in sc:\n print(s, c, ans)\n if int(ans[s-1]) != c:\n break\n else:\n print(ans)\n exit()\n\nprint(-1)', 'n, m = map(int, input().split())\nsc = [list(map(int, input().split())) for _ in range(m)]\n\nfor i in range(1000):\n ans = str(i)\n if len(ans) != n:\n continue\n for s, c in sc:\n if int(ans[s-1]) != c:\n break\n else:\n print(ans)\n exit()\n\nprint(-1)'] | ['Runtime Error', 'Accepted'] | ['s206551097', 's294595228'] | [3572.0, 3064.0] | [20.0, 18.0] | [278, 292] |
p02761 | u892340697 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ["N,M = input().split()\ns,c,a = [],[],[]\nnumber = []\nfor i in range(int(M)):\n a_i = input().split()\n a.append(a_i)\n s.append(int(a_i[0]))\n c.append(int(a_i[1]))\nans = True\nfor i in range(int(N)):\n number.append('')\nfor i in range(int(M)):\n if (s[i]==1 and c[i]==0 and int(N)>1) or s[i] > N:\n if ans:\n print('-1')\n ans = False\n elif number[s[i]-1] == '' or number[s[i]-1] == c[i]:\n number[s[i]-1] = c[i]\n else:\n if ans:\n print('-1')\n ans = False\nfor i,elem in enumerate(number):\n if number[i] == '' and i == 0:\n number[i] = 1\n elif elem == '':\n number[i] = 0\nif ans:\n strs = '' \n for i in number:\n strs += str(i)\n print(int(strs))\n", "N,M = input().split()\ns,c,a = [],[],[]\nnumber = []\nfor i in range(int(M)):\n a_i = input().split()\n a.append(a_i)\n s.append(int(a_i[0]))\n c.append(int(a_i[1]))\nans = True\nfor i in range(int(M)):\n number.append('')\nfor i in range(int(M)):\n if s[i]==1 and c[i]==0:\n print('-1')\n ans = False\n elif number[s[i]-1] == '' or number[s[i]-1] == c[i]:\n number[s[i]-1] = c[i]\n else:\n print('-1')\n ans = False\nfor i,elem in enumerate(number):\n if elem == '' and i == 0:\n number[i] = 1\n if elem == '':\n number[i] = 0\nif ans:\n print(number)", "N,M = input().split()\ns,c,a = [],[],[]\nnumber = []\nfor i in range(int(M)):\n a_i = input().split()\n a.append(a_i)\n s.append(int(a_i[0]))\n c.append(int(a_i[1]))\nans = True\nfor i in range(int(N)):\n number.append('')\nfor i in range(int(M)):\n if s[i]==1 and c[i]==0 and int(N)>1:\n if ans:\n print('-1')\n ans = False\n elif s[i] > N:\n if ans:\n print('-1')\n ans = False\n elif number[s[i]-1] == '' or number[s[i]-1] == c[i]:\n number[s[i]-1] = c[i]\n else:\n if ans:\n print('-1')\n ans = False\nfor i,elem in enumerate(number):\n if number[i] == '' and i == 0:\n number[i] = 1\n elif elem == '':\n number[i] = 0\nif ans:\n strs = '' \n for i in number:\n strs += str(i)\n print(int(strs))\n", "N,M = input().split()\ns,c,a = [],[],[]\nnumber = []\nfor i in range(int(M)):\n a_i = input().split()\n a.append(a_i)\n s.append(int(a_i[0]))\n c.append(int(a_i[1]))\nans = True\nfor i in range(int(N)):\n number.append('')\nfor i in range(int(M)):\n if s[i]==1 and c[i]==0 and int(N)>1:\n if ans:\n print('-1')\n ans = False\n elif s[i] > int(N):\n if ans:\n print('-1')\n ans = False\n elif number[s[i]-1] == '' or number[s[i]-1] == c[i]:\n number[s[i]-1] = c[i]\n else:\n if ans:\n print('-1')\n ans = False\nfor i,elem in enumerate(number):\n if number[i] == '' and i == 0 and int(N) >1:\n number[i] = 1\n elif elem == '':\n number[i] = 0\nif ans:\n strs = '' \n for i in number:\n strs += str(i)\n print(int(strs))"] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s103384125', 's458950338', 's689261192', 's943149769'] | [3064.0, 3064.0, 3064.0, 3192.0] | [18.0, 17.0, 18.0, 17.0] | [753, 608, 822, 840] |
p02761 | u895408600 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['N,M=map(int,input().split())\nsc=[list(map(int,input().split())) for i in range(M)]\ns=[sc[i][0] for i in range(M)]\nc=[sc[i][1] for i in range(M)]\nsc.sort()\nif N==1:\n if 2 in s or 3 in s:\n ans=-1\n else:\n ans=sc[0][1]\nif N==2:\n if 3 in s:\n ans=-1\n else:\n if sc[0][0]==1:\n for i in range(1,M):\n if sc[i][0]==2:\n ans=sc[i][1]+sc[0][0]*10\n else:\n ans=sc[0][1]*10\nif N==3:\n if sc[0][0]==1:\n for i in range(1,M):\n if sc[i][0]==2:\n for j in range(i,M):\n if sc[j][0]==3:\n ans=sc[0][1]*100+sc[i][1]*10+sc[j][1]\n else:\n ans=sc[0][1]*100+sc[i][1]*10\n else:\n ans=sc[0][0]*100\nprint(ans)', 'N,M=map(int,input().split())\nsc=[list(map(int,input().split())) for i in range(M)]\ns=[sc[i][0] for i in range(M)]\nc=[sc[i][1] for i in range(M)]\n\nfor i in range(1000):\n if len(str(i)) == N:\n for j in range(M):\n if str(i)[s[j]-1] != str(c[j]):\n break\n else:\n print(i)\n break\nelse:\n print(-1)'] | ['Runtime Error', 'Accepted'] | ['s210795034', 's675041022'] | [3064.0, 3064.0] | [18.0, 18.0] | [813, 358] |
p02761 | u896941378 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other 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 fractions import gcd\nfrom collections import Counter, deque, defaultdict\nfrom heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge\nfrom bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort\nfrom itertools import product, combinations,permutations\nfrom copy import deepcopy\nimport sys\nsys.setrecursionlimit(4100000)\nINF = 1001001001\n\n\n\nif __name__ == '__main__':\n N, M = map(int, input().split())\n map_digit = [INF]*N\n for _ in range(M):\n s, c = map(int, input().split())\n s -= 1\n map_digit[s] = min(map_digit[s], c)\n num = []\n for m in map_digit:\n if m==INF:\n m = 0\n num.append(m)\n\n num.reverse()\n ans = 0\n\n for k in range(N):\n if num[0]== 0:\n print(-1)\n quit()\n else:\n ans += num[k]*pow(10, k)\n \n print(ans)", "from fractions import gcd\nfrom collections import Counter, deque, defaultdict\nfrom heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge\nfrom bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort\nfrom itertools import product, combinations,permutations\nfrom copy import deepcopy\nfrom math import log10\nimport sys\nsys.setrecursionlimit(4100000)\nINF = 1001001001\n\n\n\nif __name__ == '__main__':\n N, M = map(int, input().split())\n map_digit = [INF]*N\n for _ in range(M):\n s, c = map(int, input().split())\n s -= 1\n map_digit[s] = min(map_digit[s], c)\n num = []\n for m in map_digit:\n if m==INF:\n m = 0\n num.append(m)\n num.reverse()\n ans = 0\n for k in range(N):\n if num[0]== 0:\n print(-1)\n quit()\n else:\n ans += num[k]*pow(10, k)\n if int(log10(ans)+1 <N):\n print(-1)\n quit()\n print(ans)", "from fractions import gcd\nfrom collections import Counter, deque, defaultdict\nfrom heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge\nfrom bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort\nfrom itertools import product, combinations,permutations\nfrom copy import deepcopy\nfrom math import log10\nimport sys\nsys.setrecursionlimit(4100000)\nINF = 1001001001\n\n\n\nif __name__ == '__main__':\n N, M = map(int, input().split())\n map_digit = [INF]*N\n for _ in range(M):\n s, c = map(int, input().split())\n s -= 1\n map_digit[s] = min(map_digit[s], c)\n num = []\n for m in map_digit:\n if m==INF:\n m = 0\n num.append(m)\n num.reverse()\n ans = 0\n for k in range(N):\n if num[N-1]== 0:\n print(-1)\n quit()\n \n ans += num[k]*pow(10, k)\n print(ans)", "from fractions import gcd\nfrom collections import Counter, deque, defaultdict\nfrom heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge\nfrom bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort\nfrom itertools import product, combinations,permutations\nfrom copy import deepcopy\nimport sys\nsys.setrecursionlimit(4100000)\nINF = 1001001001\n\n\n\nif __name__ == '__main__':\n N, M = map(int, input().split())\n map_digit = [INF]*N\n for _ in range(M):\n s, c = map(int, input().split())\n s -= 1\n map_digit[s] = min(map_digit[s], c)\n num = []\n for m in map_digit:\n if m==INF:\n m = 0\n num.append(m)\n \n\n num.reverse()\n ans = 0\n\n for k in range(N):\n if num[0]== 0:\n print(-1)\n quit()\n else:\n ans += num[k]*pow(10, k)\n \n print(ans)", "from fractions import gcd\nfrom collections import Counter, deque, defaultdict\nfrom heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge\nfrom bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort\nfrom itertools import product, combinations,permutations\nfrom copy import deepcopy\nimport sys\nsys.setrecursionlimit(4100000)\nINF = 1001001001\n\n\n\nif __name__ == '__main__':\n N, M = map(int, input().split())\n map_digit = [INF]*N\n for _ in range(M):\n s, c = map(int, input().split())\n s -= 1\n if s>=N-1:\n print(-1)\n quit()\n map_digit[s] = min(map_digit[s], c)\n print(map_digit)\n num = []\n for m in map_digit:\n if m==INF:\n m = 0\n num.append(m)\n\n num.reverse()\n ans = 0\n\n for k in range(N):\n if num[0]== 0:\n print(-1)\n quit()\n else:\n ans += num[k]*pow(10, k)\n \n print(ans)", "if __name__ == '__main__':\n N, M = map(int, input().split())\n S = []\n C = []\n\n for i in range(M):\n s, c = map(int, input().split())\n s -= 1\n S.append(s)\n C.append(c)\n\n for num in range(pow(10, N-1)-1, pow(10, N)):\n st_num = str(num)\n cnt = 0\n for m in range(M):\n if int(st_num[S[m]])==C[m]:\n cnt += 1\n if cnt==M:\n print(st_num)\n quit()\n print(-1)", "from fractions import gcd\nfrom collections import Counter, deque, defaultdict\nfrom heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge\nfrom bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort\nfrom itertools import product, combinations,permutations\nfrom copy import deepcopy\nimport sys\nsys.setrecursionlimit(4100000)\nINF = 1001001001\n\n\n\nif __name__ == '__main__':\n N, M = map(int, input().split())\n map_digit = [INF]*N\n for _ in range(M):\n s, c = map(int, input().split())\n s -= 1\n map_digit[s] = min(map_digit[s], c)\n num = []\n for m in map_digit:\n if m==INF:\n m = 0\n num.append(m)\n num.reverse()\n ans = 0\n for k in range(N):\n if num[0]== 0:\n print(-1)\n quit()\n else:\n ans += num[k]*pow(10, k)\n \n print(ans)", "\nif __name__ == '__main__':\n N, M = map(int, input().split())\n S = []\n C = []\n\n for i in range(M):\n s, c = map(int, input().split())\n s -= 1\n S.append(s)\n C.append(c)\n\n for num in range(pow(10, N-1), pow(10, N)):\n st_num = str(num)\n cnt = 0\n for m in range(M):\n if int(st_num[S[m]])==C[m]:\n cnt += 1\n if cnt==M:\n #print(st_num)\n quit()\n print(-1)", "if __name__ == '__main__':\n N, M = map(int, input().split())\n S = []\n C = []\n\n for i in range(M):\n s, c = map(int, input().split())\n s -= 1\n S.append(s)\n C.append(c)\n\n for num in range(0, pow(10, N)):\n st_num = str(num)\n if len(str(st_num))!=N: continue\n cnt = 0\n for m in range(M):\n if int(st_num[S[m]])==C[m]:\n cnt += 1\n if cnt==M:\n print(st_num)\n quit()\n print(-1)\n"] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s283416939', 's460399115', 's515841590', 's678891972', 's850293769', 's860786793', 's893421242', 's937679104', 's128346419'] | [10420.0, 10580.0, 10592.0, 10544.0, 10500.0, 9160.0, 10460.0, 9216.0, 9092.0] | [40.0, 39.0, 44.0, 39.0, 39.0, 27.0, 39.0, 30.0, 31.0] | [885, 963, 890, 890, 966, 468, 883, 468, 497] |
p02761 | u899308536 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['N,M = list(map(int,input().split()))\n"""\nN=1 0~9\nN=2 10~99\nN=3 100~999\nN 10**(N-1)~10**N-1\n"""\nS = []\nC = []\nfor i in range(M):\n s,c = list(map(int,input().split()))\n S.append(s)\n C.append(c)\n\n# print(S)\n# print(C)\n\ny = 10**N\n\nif N == 1:\n L,R = 0,10\nelif N == 2:\n L,R = 10,100\nelif N == 3:\n L,R = 100,1000\n \nfor i in range(L,R):\n f = True\n print(i)\n for j in range(M):\n if str(i)[S[j]-1] != str(C[j]):\n f = False\n # print("False")\n break\n if f:\n y = min(y,i)\n \nif y == 10**N:\n y = -1\n\nprint(y)', 'N,M = list(map(int,input().split()))\n"""\nN=1 0~9\nN=2 10~99\nN=3 100~999\nN 10**(N-1)~10**N-1\n"""\nS = []\nC = []\nfor i in range(M):\n s,c = list(map(int,input().split()))\n S.append(s)\n C.append(c)\n\n# print(S)\n# print(C)\n\ny = 10**N\n\nif N == 1:\n L,R = 0,10\nelif N == 2:\n L,R = 10,100\nelif N == 3:\n L,R = 100,1000\n \nfor i in range(L,R):\n f = True\n # print(i)\n for j in range(M):\n if str(i)[S[j]-1] != str(C[j]):\n f = False\n # print("False")\n break\n if f:\n y = min(y,i)\n \nif y == 10**N:\n y = -1\n\nprint(y)'] | ['Wrong Answer', 'Accepted'] | ['s914105041', 's875233395'] | [3188.0, 3064.0] | [19.0, 19.0] | [585, 587] |
p02761 | u899953001 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right) | ['#!/usr/bin/env python\n\ndef func():\n n,m = [int(i) for i in input().split(" ")]\n pibot = 10**(m-1)\n dic = {}\n\n for i in range(m):\n tmp = [int(i) for i in input().split(" ")]\n\n if tmp[0] not in dic.keys():\n dic[tmp[0]] = tmp[1]\n else:\n if dic[tmp[0]] != tmp[1]:\n print("-1")\n return\n\n a = [0] * m\n for key in dic.keys():\n print(key)\n a[key-1] = dic[key]\n\n tmp_s = ""\n for i in a:\n tmp_s += str(i)\n\n if int(tmp_s) < pibot:\n print("-1")\n return\n else:\n print(tmp_s)\n\n print("")\n\nif __name__ == "__main__":\n func()', '#!/usr/bin/env python\n\ndef func():\n n,m = [int(i) for i in input().split(" ")]\n pibot = 10**(m-1)\n dic = {}\n same = 0\n\n for i in range(m):\n tmp = [int(i) for i in input().split(" ")]\n\n if tmp[0] not in dic.keys():\n dic[tmp[0]] = tmp[1]\n else:\n if dic[tmp[0]] != tmp[1]:\n print("No")\n return\n else:\n same += 1\n\n a = [0] * (m-same)\n for key in dic.keys():\n a[key-1] = dic[key]\n\n tmp_s = ""\n for i in a:\n tmp_s += str(i)\n\n if int(tmp_s) < pibot:\n print("No")\n return\n else:\n print(tmp_s)\n\n print("")\n\nif __name__ == "__main__":\n func()', '#!/usr/bin/env python\n\ndef func():\n n,m = [int(i) for i in input().split(" ")]\n dic = {}\n same = 0\n a = [0] * n\n\n for i in range(m):\n tmp = [int(i) for i in input().split(" ")]\n\n if tmp[0] not in dic.keys():\n dic[tmp[0]] = tmp[1]\n else:\n if dic[tmp[0]] != tmp[1]:\n print("No")\n return\n\n for key in dic.keys():\n a[key] = dic[key]\n\n if a[0] == 0:\n print("No")\n return\n \n for i in a:\n print(i, end = "")\n\n print("")\n\nif __name__ == "__main__":\n func()', '#!/usr/bin/env python\n\nif __name__ == "__main__":\n n,m = [int(i) for i in input().split(" ")]\n dic = {}\n same = 0\n a = [0] * n\n\n for i in range(m):\n tmp = [int(i) for i in input().split(" ")]\n\n if tmp[0] not in dic.keys():\n dic[tmp[0]] = tmp[1]\n else:\n if dic[tmp[0]] != tmp[1]:\n print("No")\n exit()\n\n for key in dic.keys():\n a[key] = dic[key]\n\n if a[0] == 0:\n print("No")\n exit()\n\n for i in a:\n print(i, end = "")\n\n print("")', '#!/usr/bin/env python\n\ndef func():\n n,m = [int(i) for i in input().split(" ")]\n dic = {}\n same = 0\n for i in range(m):\n tmp = [int(i) for i in input().split(" ")]\n\n if tmp[0] not in dic.keys():\n dic[tmp[0]] = tmp[1]\n else:\n if dic[tmp[0]] != tmp[1]:\n print("No")\n return\n else:\n same += 1\n a = [0] * (m-same)\n for key in dic.keys():\n print(key)\n a[key-1] = dic[key]\n\n if a[0] == 0:\n print("No")\n return\n\n for i in a:\n print(i, end = "")\n\n print("")\n\nif __name__ == "__main__":\n func()', '#!/usr/bin/env python\n\ndef func():\n n,m = [int(i) for i in input().split(" ")]\n pibot = 10**(m-1)\n dic = {}\n\n for i in range(m):\n tmp = [int(i) for i in input().split(" ")]\n\n if tmp[0] not in dic.keys():\n dic[tmp[0]] = tmp[1]\n else:\n if dic[tmp[0]] != tmp[1]:\n print("-1")\n return\n\n a = [0] * m\n for key in dic.keys():\n a[key-1] = dic[key]\n\n tmp_s = ""\n for i in a:\n tmp_s += str(i)\n\n if int(tmp_s) < pibot:\n print("-1")\n return\n else:\n print(tmp_s)\n\n print("")\n\nif __name__ == "__main__":\n func()', '#!/usr/bin/env python\n\nn, m = input().split(" ")\nn = int(n)\nm = int(m)\ns_len = []\nc_len = []\ndig = 10**(n-1)\n\nfor i in range(m):\n tmp = input().split(" ")\n s_len.append(int(tmp[0]))\n c_len.append(int(tmp[1]))\n\nfor i in range(0, dig*10):\n flag = False\n if len(str(i)) < n:\n continue\n for j,s in enumerate(s_len):\n if str(i)[s-1] != str(c_len[j]) and flag == False:\n flag = True\n break\n if flag==False:\n print(i)\n exit()\n\nprint("-1")'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s103543937', 's120505357', 's291744946', 's360133745', 's495666224', 's813423688', 's075569125'] | [3064.0, 3064.0, 3064.0, 3188.0, 3188.0, 3064.0, 3064.0] | [17.0, 18.0, 17.0, 19.0, 20.0, 17.0, 18.0] | [660, 705, 586, 554, 648, 641, 502] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.