G - Pairing Socks Kattis - pairingsocks 栈的应用

Simone’s mother often complains about how Simone never helps with chores at home. In return, Simone often points out that many of the chores her mother assigns her are NP-complete to perform optimally (like cleaning the house, seating her little brothers around the dinner table in a conflict-free way, splitting the brothers’ Halloween loot in a fair manner and so on).
Being a computer scientist, her mother finds this a fair objection. Looking over her list of potential chores, she picked one she thinks should be easy to solve – pairing a number of different kinds of socks.

In the beginning, there are 2n2n socks stacked in a pile. To pair the socks, Simone can repeatedly make one of three moves:

Move the sock from the top of the original pile to the top of an auxiliary pile (which is originally empty).

Move the sock from the top of the auxiliary pile to the top of the original pile.

Pair the top socks from each pile together, if they are of the same type.

Simone only has one auxiliary pile, for a total of two piles. There may be more than two socks of each type. In this case, Simone can pair them up however she wants.

Your task is to help Simone to determine the least number of moves she needs to pair the socks, if it is possible at all.

Input

The first line of input contains the integer nn (1≤n≤1051≤n≤105) as described above. The next line contains 2n2n integers a1,…,a2na1,…,a2n (1≤ai≤1091≤ai≤109 for each ii), where aiai denotes the type of sock number ii. Initially, sock 11 is at the top of the pile and sock 2n2n is at the bottom.

Output

If Simone can pair all the socks, output the least number of moves she needs to do this. If it is impossible to do so, output “impossible” (without the quotes).

Sample Input 1 Sample Output 1
2
1 2 2 1
4
Sample Input 2 Sample Output 2
1
3 7
impossible
Sample Input 3 Sample Output 3
3
5 5 5 5 5 5
6

水题，比赛的时候因为数组开成了1e5，导致这题卡了好久。

用栈

#include<iostream>
#include<stdio.h>
#include<cstring>
#include<stack>
using namespace std;
const int maxx = 2e5+10;
int a[maxx];
int b[maxx];

int main()
{
    int n;
    while(cin>>n)
    {
        int i;
        n*=2;
        for(i=0; i<n; i++)
        {
            scanf("%d",&a[i]);
        }
        int k = -1;
       i = 0;
       while(i<n)
       {
           if(k==-1)
           {
               b[++k] = a[i];
               i++;
           }
           else
           {
               if(b[k]==a[i])
               {
                   i++;
                   k--;
               }
               else
               {
                   b[++k] = a[i];
                   i++;
               }
           }
       }
       if(k==-1)
        printf("%d\n",n);
       else
        printf("impossible\n");
    }
    return 0;
}

#include<iostream>
#include<stdio.h>
#include<cstring>
#include<stack>
using namespace std;
const int maxx = 2e5+10;
int a[maxx];
int b[maxx];

int main()
{
    int n;
    cin>>n;
    int i;
    n*=2;
    int cnt = 0;
    for(i=0; i<n; i++)
    {
        scanf("%d",&a[i]);
        cnt++;
        if(a[i]==a[i-1]&&i>0)
        {
            i -=2;   //只要找到两个相同的就消除他们
        }
        if(cnt>=n)
            break;
    }
    if(i==-1)
        printf("%d\n",n);
    else
        printf("impossible\n");
    return 0;
}