CodeForces - 254A - Cards with Numbers

Petya has got 2n cards, each card contains some integer. The numbers on the cards can be the same. Let's index all cards by consecutive integers from 1 to 2n. We'll denote the number that is written on a card with number i, as ai. In order to play one entertaining game with his friends, Petya needs to split the cards into pairs so that each pair had equal numbers on the cards. Help Petya do that.

Input

The first line contains integer n (1 ≤ n ≤ 3·105). The second line contains the sequence of 2n positive integers a1, a2, ..., a2n (1 ≤ ai ≤ 5000) — the numbers that are written on the cards. The numbers on the line are separated by single spaces.

Output

If it is impossible to divide the cards into pairs so that cards in each pair had the same numbers, print on a single line integer -1. But if the required partition exists, then print n pairs of integers, a pair per line — the indices of the cards that form the pairs.

Separate the numbers on the lines by spaces. You can print the pairs and the numbers in the pairs in any order. If there are multiple solutions, print any of them.

Example
Input
3
20 30 10 30 20 10
Output
4 2
1 5
6 3
Input
1
1 2
Output
-1

队友A的此题,记录下这种二维数组的方法

代码:


#include <vector>
#include <cstdio>
using namespace std;
const int MAX=5010;
vector<int>p[MAX];
int main()
{
    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);
    int N, x;
    scanf("%d", &N);
    for(int i=1; i<=N*2; i++)
    {
        scanf("%d", &x);
        p[x].push_back(i);
    }
    int flag=0;
    for(int i=1; i<=MAX; i++)
    {
        if(p[i].size()%2==1)//奇数个
        {
            flag=1;
            break;
        }
    }
    if(flag==1)
    {
        printf("-1\n");
        return 0;
    }
    for(int i=1; i<=MAX; i++)
    {
        for(int j=0; j<p[i].size(); j+=2)
        {
            printf("%d %d\n", p[i][j], p[i][j+1]);
        }
    }
    return 0;
}


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值