[问题分解]UVa11054 - Wine trading in Gergovia
来源:互联网 发布:炼数成金 大数据分析师 编辑:程序博客网 时间:2024/06/06 04:05
#include<bits/stdc++.h>using namespace std;struct pp { int x1,x2,y1,y2,x,y,num;}B[5050];bool cmp1(pp a,pp b) { if(a.x2==b.x2) return a.x1<b.x1; else return a.x2<b.x2; }bool cmp2(pp a,pp b) { if(a.y2==b.y2) return a.y1<b.y1; else return a.y2<b.y2; }bool cmp3(pp a,pp b) { return a.num<b.num; }int main(){ int n; while(scanf("%d",&n)&&n){ for(int i=0;i<n;i++) { scanf("%d%d%d%d",&B[i].x1,&B[i].y1,&B[i].x2,&B[i].y2); B[i].x=0; B[i].y=0; B[i].num=i+1; } sort(B,B+n,cmp1); int AA=0,BB=0; for(int i=1;i<=n;i++) for(int j=0;j<n;j++) { if(B[j].x1<=i &&B[j].x2>=i &&!B[j].x) { B[j].x=i; AA++; break; } } sort(B,B+n,cmp2); for(int i=1;i<=n;i++) for(int j=0;j<n;j++) { if(B[j].y1<=i &&B[j].y2>=i &&!B[j].y) { B[j].y=i; BB++; break; } } if(AA==n&&BB==n){ sort(B,B+n,cmp3); for(int i=0;i<n;i++) printf("%d %d\n",B[i].x,B[i].y); } else printf("IMPOSSIBLE\n"); } return 0;}
0 0
- [问题分解]UVa11054 - Wine trading in Gergovia
- uva11054 - Wine trading in Gergovia
- UVA11054 Wine trading in Gergovia
- uva11054 - Wine trading in Gergovia
- UVa11054 Wine trading in Gergovia
- [贪心]UVA11054 Wine trading in Gergovia
- UVa11054 - Wine trading in Gergovia UVA
- [等价转换]UVa11054 - Wine trading in Gergovia
- UVa11054--Wine trading in Gergovia(贪心)
- Uva11054——Wine trading in Gergovia
- Gergovia的酒交易(Uva11054,Wine trading in Gergovia)
- UVA11054:Wine trading in Gergovia(Gergovia的酒交易)
- UVA - 11054 Wine trading in Gergovia 问题分解
- uva11054 - Wine trading in Gergovia(葡萄酒交易)
- UVa11054 poj2940 sdut2370 Wine trading in Gergovia(贪心)
- 解题报告 之 UVA11054 Wine trading in Gergovia
- Uva11054 Wine trading in Gergovia【例题8-5】【等价转换】
- UVa11054 Wine trading in Gergovia(贪心+思路)
- vector容器v1、v2之间相互赋值的三种方法及易错点详解
- IOS开发之实现App消息推送
- [Hash思想]UVa1152 - 4 Values whose Sum is 0
- POJ - 4047 Garden(线段树成段更新,查询最值)
- iOS实现倒计时功能
- [问题分解]UVa11054 - Wine trading in Gergovia
- [等价转换]UVa11054 - Wine trading in Gergovia
- [极角排序 扫描法]UVa1606 - Amphiphilic Carbon Molecules
- HDU 4123 Bob’s Race(树形DP+RMQ)
- POJ - 3468 A Simple Problem with Integers(线段树成段更新,查询区间和)
- C++英文单词统计小程序
- java 内存模型
- 涵盖各种编程语言的深度学习库整理大全
- [LeetCode 223] Rectangle Area