UVA 10763 Foreign Exchange 出国交换 pair+map
来源:互联网 发布:户外刀具能在淘宝买吗 编辑:程序博客网 时间:2024/05/02 04:51
题意:给出很多对数字,看看每一对(a,b)能不能找到对应的(b,a)。
放在贪心这其实有点像检索。
用stl做,map+pair。
记录每一对出现的次数,然后遍历看看对应的那一对出现的次数有没有和自己出现的此时一样即可。
代码:
/* * Author: illuz <iilluzen@gmail.com> * Blog: http://blog.csdn.net/hcbbt * File: uva10763.cpp * Lauguage: C/C++ * Create Date: 2013-08-25 09:47:55 * Descripton: UVA 10763 Foreign Exchange, map */#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <iostream>#include <list>#include <vector>#include <map>#include <set>#include <deque>#include <queue>#include <stack>#include <utility>#include <algorithm>using namespace std;#define rep(i, n) for (int i = 0; i < (n); i++)#define repu(i, a, b) for (int i = (a); i < (b); i++)#define repf(i, a, b) for (int i = (a); i <= (b); i++)#define repd(i, a, b) for (int i = (a); i >= (b); i--)#define swap(a, b) {int t = a; a = b; b = t;}#define mc(a) memset(a, 0, sizeof(a))#define ms(a, i) memset(a, i, sizeof(a))#define sqr(x) ((x) * (x))#define FI(i, x) for (typeof((x).begin()) i = (x).begin(); i != (x).end(); i++)typedef long long LL;typedef unsigned long long ULL;/****** TEMPLATE ENDS ******/const int MAXN = 500100;struct Pair {int x, y;Pair(int a, int b) : x(a), y(b) {}friend bool operator < (const Pair& a, const Pair& b) {return (a.x < b.x || (a.x == b.x && a.y < b.y));}};map<Pair, int> m;int n, a, b;int main() {while (scanf("%d", &n) && n) {m.clear();rep(i, n) { scanf("%d%d", &a, &b);m[Pair(a, b)]++;}bool flag = true;FI(i, m) { if (i->second != m[Pair(i->first.y, i->first.x)]) {flag = false;//break;}}if (flag) printf("YES\n");else printf("NO\n");}return 0;}
- UVA 10763 Foreign Exchange 出国交换 pair+map
- 交换学生(Foreign Exchange,UVa 10763)
- uva 10763 Foreign Exchange 交换生
- UVA 10763 Foreign Exchange 交换学生
- UVa 10763 交换学生(Foreign Exchange)
- Foreign Exchange (交换学生)UVA 10763
- UVa 10763 Foreign Exchange (map的应用)
- UVa10763-Foreign Exchange-交换学生--map映射和pair对的使用
- Uva Foreign Exchange map 映射
- UVa 10763 - Foreign Exchange
- UVa 10763 - Foreign Exchange
- uva 10763 - Foreign Exchange
- uva 10763 - Foreign Exchange
- Foreign Exchange uva 10763
- UVa 10763 - Foreign Exchange
- Uva-10763-Foreign Exchange
- UVa 10763 - Foreign Exchange
- UVa 10763 - Foreign Exchange
- 每日一题(80) - 最大子数组和(原数组为首尾相连)
- 栈的push和pop 序列
- 矩阵快速幂专题【完结】
- 太阳寒水多(寒气重),这样预防
- Data Structure(2)
- UVA 10763 Foreign Exchange 出国交换 pair+map
- http 连接复用
- 新的开始
- GCD的使用.
- ioc aop 框架
- sublime 配置
- java基础之IO流的应用
- 题目1531:货币面值 (wa)
- 通过sharedpreference两个程序共享数据