CF1776H.Beppa and SwerChat

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

Beppa and her circle of geek friends keep up to date on a group chat in the instant messaging app SwerChat TM^{\text{TM}} .

The group has nn members, excluding Beppa. Each of those members has a unique ID between 11 and nn . When a user opens a group chat, SwerChat TM^{\text{TM}} displays the list of other members of that group, sorted by decreasing times of last seen online (so the member who opened the chat most recently is the first of the list). However, the times of last seen are not displayed.

Today, Beppa has been busy all day: she has only opened the group chat twice, once at 9:00 and once at 22:00. Both times, she wrote down the list of members in the order they appeared at that time. Now she wonders: what is the minimum number of other members that must have been online at least once between 9:00 and 22:00?

Beppa is sure that no two members are ever online at the same time and no members are online when Beppa opens the group chat at 9:00 and 22:00.

输入格式

Each test contains multiple test cases. The first line contains an integer tt ( 1t100001 \leq t \leq 10\,000 ) — the number of test cases. The descriptions of the tt test cases follow.

The first line of each test case contains an integer nn ( 1n1051 \leq n \leq 10^5 ) — the number of members of the group excluding Beppa.

The second line contains nn integers a1,a2,,ana_1, \, a_2, \, \dots, \, a_n ( 1ain1 \le a_i \le n ) — the list of IDs of the members, sorted by decreasing times of last seen online at 9:00.

The third line contains nn integers b1,b2,,bnb_1, \, b_2, \, \dots, \, b_n ( 1bin1 \le b_i \le n ) — the list of IDs of the members, sorted by decreasing times of last seen online at 22:00.

For all 1i<jn1\le i < j\le n , it is guaranteed that aiaja_i \ne a_j and bibjb_i \ne b_j .

It is also guaranteed that the sum of the values of nn over all test cases does not exceed 10510^5 .

输出格式

For each test case, print the minimum number of members that must have been online between 9:00 and 22:00.

输入输出样例

  • 输入#1

    4
    5
    1 4 2 5 3
    4 5 1 2 3
    6
    1 2 3 4 5 6
    1 2 3 4 5 6
    8
    8 2 4 7 1 6 5 3
    5 6 1 4 8 2 7 3
    1
    1
    1

    输出#1

    2
    0
    4
    0

说明/提示

In the first test case, members 4,54, 5 must have been online between 9:00 and 22:00.

In the second test case, it is possible that nobody has been online between 9:00 and 22:00.

首页