Algorithm/luogu/njit-baidu2023/tc.py

42 lines
611 B
Python
Raw Normal View History

2023-07-08 14:01:55 +08:00
import io
import sys
sys.stdin = io.StringIO('''3
6
4 5 1 3 2 6
5
5 3 1 2 4
4
1 4 3 2''')
2023-07-08 15:08:10 +08:00
def fun(n, loc):
2023-07-08 14:01:55 +08:00
ans = [0] * n
2023-07-08 15:08:10 +08:00
ans[0] = 1
2023-07-08 14:01:55 +08:00
2023-07-08 15:08:10 +08:00
l, r = loc[1], loc[1]
for i in range(2, n + 1):
l = min(l, loc[i])
r = max(r, loc[i])
if r - l + 1 == i:
ans[i - 1] = 1
2023-07-08 14:01:55 +08:00
print(''.join(map(str, ans)))
t = int(input())
for _ in range(t):
n = int(input())
2023-07-08 15:08:10 +08:00
p = []
loc = [0] * (n + 1)
nums = input().split()
for i in range(n):
num = int(nums[i])
p.append(num)
loc[num] = i
fun(n, loc)
2023-07-08 14:01:55 +08:00
2023-07-08 15:08:10 +08:00
if __name__ == '__main__':
pass