CodeForces
来源:互联网 发布:淘宝商城阿依莲品牌店 编辑:程序博客网 时间:2024/06/05 23:03
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.
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.
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.
320 30 10 30 20 10
4 21 56 3
11 2
-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;}
- codeforces~~~
- Codeforces
- codeforces
- Codeforces
- codeforces
- codeforces
- Codeforces
- Codeforces
- CodeForces
- CodeForces
- CodeForces
- CodeForces
- CodeForces
- Codeforces
- Codeforces
- Codeforces
- Codeforces
- Codeforces
- FreeMarker优点和缺点与使用FreeMarker的10个理由
- 这10大科技,将彻底改变你的生活
- linux系统之网络防火墙(firewalld服务和iptables服务)
- tensorflow gpu使用说明
- 2017/12/02
- CodeForces
- 第九章:接口
- 基于sklearn的序列处理 : LabelEncoder 与 OneHotEncoder
- freemarker标签大全
- 【随机过程】动态概率 私人回顾
- kali MySQL下root@localhost任意密码登录问题
- day04_案例五六
- JavaScript基础
- MySQL insert into select锁表的问题(下)