Codeforces 995 B

最新推荐文章于 2021-02-15 17:14:24 发布

swqeaaa

最新推荐文章于 2021-02-15 17:14:24 发布

阅读量213

点赞数

本文链接：https://blog.csdn.net/qq_32259423/article/details/81269601

版权

CodeForces 专栏收录该内容

122 篇文章 0 订阅

订阅专栏

B. Suit and Tie

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Allen is hosting a formal dinner party. 2n2n people come to the event in nn pairs (couples). After a night of fun, Allen wants to line everyone up for a final picture. The 2n2n people line up, but Allen doesn't like the ordering. Allen prefers if each pair occupies adjacent positions in the line, as this makes the picture more aesthetic.

Help Allen find the minimum number of swaps of adjacent positions he must perform to make it so that each couple occupies adjacent positions in the line.

Input

The first line contains a single integer nn (1≤n≤1001≤n≤100), the number of pairs of people.

The second line contains 2n2n integers a1,a2,…,a2na1,a2,…,a2n. For each ii with 1≤i≤n1≤i≤n, ii appears exactly twice. If aj=ak=iaj=ak=i, that means that the jj-th and kk-th people in the line form a couple.

Output

Output a single integer, representing the minimum number of adjacent swaps needed to line the people up so that each pair occupies adjacent positions.

Examples

input

Copy

4
1 1 2 3 3 2 4 4

output

Copy

input

Copy

3
1 1 2 2 3 3

output

Copy

input

Copy

3
3 1 2 3 1 2

output

Copy

Note

In the first sample case, we can transform 11233244→11232344→1122334411233244→11232344→11223344 in two steps. Note that the sequence 11233244→11323244→1133224411233244→11323244→11332244 also works in the same number of steps.

The second sample case already satisfies the constraints; therefore we need 00 swaps.

#include<bits/stdc++.h>
using namespace std;

int main()
{
    int n;
    cin>>n;
    int a[205];
    for(int i=0; i<2*n; i++)
    {
        cin>>a[i];
    }
    int ans=0;
    for(int i=0; i<2*n-1; i++)
    {
        for(int j=i+1; j<2*n; j++)
        {
            if(a[j]==a[i])
            {
               // cout<<j<<i<<endl;
                ans+=j-i-1;
                for(int k=j;k>i;k--)
                swap(a[k],a[k-1]);
                break;
            }

        }
    }
    cout<<ans;
}