We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.

order=set(map(int,input().split()))
array=(map(int,input().split()))
a=set(map(int,input().split()))
b=set(map(int,input().split()))
res=0
if a.isdisjoint(b):
for i in array:
if i in a:
res+=1
if i in b:
res-=1
print(res)

There is a horizontal row of cubes. The length of each cube is given. You need to create a new vertical pile of cubes. The new pile should follow these directions: if is on top of then .

When stacking the cubes, you can only pick up either the leftmost or the rightmost cube each time. Print Yes if it is possible to stack the cubes. Otherwise, print No.

Example

Result: No

After choosing the rightmost element, , choose the leftmost element, . After than, the choices are and . These are both larger than the top block of size .

Result: Yes

Choose blocks from right to left in order to successfully stack the blocks.

Input Format

The first line contains a single integer , the number of test cases.
For each test case, there are lines.
The first line of each test case contains , the number of cubes.
The second line contains space separated integers, denoting the sideLengths of each cube in that order.

Constraints

Output Format

For each test case, output a single line containing either Yes or No.

In the first test case, pick in this order: left - , right - , left - , right - , left - , right - .
In the second test case, no order gives an appropriate arrangement of vertical cubes. will always come after either or .

Language
Pypy 3
More
1

Enter your code here. Read input from STDIN. Print output to STDOUT

order=set(map(int,input().split())) array=(map(int,input().split())) a=set(map(int,input().split())) b=set(map(int,input().split())) res=0 if a.isdisjoint(b): for i in array: if i in a: res+=1 if i in b: res-=1 print(res)

There is a horizontal row of cubes. The length of each cube is given. You need to create a new vertical pile of cubes. The new pile should follow these directions: if is on top of then .

When stacking the cubes, you can only pick up either the leftmost or the rightmost cube each time. Print Yes if it is possible to stack the cubes. Otherwise, print No.

Example

Result: No

After choosing the rightmost element, , choose the leftmost element, . After than, the choices are and . These are both larger than the top block of size .

Result: Yes

Choose blocks from right to left in order to successfully stack the blocks.

Input Format

The first line contains a single integer , the number of test cases. For each test case, there are lines. The first line of each test case contains , the number of cubes. The second line contains space separated integers, denoting the sideLengths of each cube in that order.

Constraints

Output Format

For each test case, output a single line containing either Yes or No.

Sample Input

STDIN Function ----- -------- 2 T = 2 6 blocks[] size n = 6 4 3 2 1 3 4 blocks = [4, 3, 2, 1, 3, 4] 3 blocks[] size n = 3 1 3 2 blocks = [1, 3, 2] Sample Output

Yes No Explanation

In the first test case, pick in this order: left - , right - , left - , right - , left - , right - . In the second test case, no order gives an appropriate arrangement of vertical cubes. will always come after either or .

Language Pypy 3 More 1

## Enter your code here. Read input from STDIN. Print output to STDOUT

Line: 1 Col: 70

Test against custom input BlogScoring

The secret to this one is in the instructions:

lengths = list(map(int,input().split(" "))) current_array = list(map(int,input().split(" "))) a = set(map(int,input().strip().split(" "))) b = set(map(int,input().strip().split(" "))) happiness = 0

for i, n in enumerate(current_array): if n in a: happiness += 1 elif n in b: happiness -= 1

print(happiness)