2017 Wuhan University Programming Contest 现场赛G. Room
2017-04-17 17:25
357 查看
Room
题目链接:Room题意:有一个房间,给你n条线,每一条线的头和尾必定在房间的边上,然后有t个队伍,这t支队伍被n条线划分成了好几部分,这些队伍需要通过一些设备来联网,问最少需要多少个设备才能使得每一支队伍都能联网。一台设备只能在被线分成的一个部分内使用,多个队伍可同时使用一台设备。
思路:很明显,如果被线划分的这一部分有人,这一部分就肯定需要设备,所以直接记录下每支队伍相对于每条线的“位置”(上或下),最后有几个不同的位置就需要几台设备
代码:
#include<stdio.h> #include<set> #include<string> using namespace std; typedef long long LL; set<string>s; struct line { LL x1,y1,x2,y2; } a[100010]; struct point { LL x,y; } b[110]; LL judge(line q,point w)//根据Ax+By+C是否大于0来判断位置 { LL A=q.y1-q.y2; LL B=q.x2-q.x1; LL C=(-B*q.y1-A*q.x1); return A*w.x+B*w.y+C>0; } LL solve(LL n,LL t) { for(LL i=0; i<t; ++i) { string str=""; for(LL j=0; j<n; ++j) str+=judge(a[j],b[i])+'0'; s.insert(str); } return s.size(); } int main() { LL n,t; scanf("%lld",&n); for(LL i=0; i<n; ++i) scanf("%lld%lld%lld%lld",&a[i].x1,&a[i].y1,&a[i].x2,&a[i].y2); scanf("%lld",&t); for(LL i=0; i<t; ++i) scanf("%lld%lld",&b[i].x,&b[i].y); printf("%lld\n",solve(n,t)); return 0; }
ps:明白题意之后,算是第二道签到题吧。。。
cfc9
相关文章推荐
- 2017 Wuhan University Programming Contest 现场赛G. Room
- 2017 Wuhan University Programming Contest 现场赛G. Room
- 2017 Wuhan University Programming Contest 现场赛G. Room
- 2017 Wuhan University Programming Contest 现场赛G. Room
- 2017 Wuhan University Programming Contest 现场赛G. Room(set+思路)
- 2017 Wuhan University Programming Contest 现场赛G. Room
- 2017 Wuhan University Programming Contest 现场赛G. Room
- 2017 Wuhan University Programming Contest 现场赛G. Room
- 2017 Wuhan University Programming Contest 现场赛G. Room
- 2017 Wuhan University Programming Contest 现场赛G. Room
- 2017 Wuhan University Programming Contest 现场赛G. Room
- 2017 Wuhan University Programming Contest 现场赛G. Room
- 2017 Wuhan University Programming Contest 现场赛G. Room
- 2017 Wuhan University Programming Contest 现场赛G. Room
- 2017 Wuhan University Programming Contest 现场赛 K.Wifi Relay(最短路变形)
- 2017 Wuhan University Programming Contest 现场赛 K.Wifi Relay(最短路变形)
- 2017 Wuhan University Programming Contest 现场赛 K.Wifi Relay(最短路变形)
- 2017 Wuhan University Programming Contest 现场赛 I. A simple math problem(矩阵快速幂)
- 2017 Wuhan University Programming Contest 现场赛 K.Wifi Relay(最短路变形)
- 2017 Wuhan University Programming Contest 现场赛 I. A simple math problem(矩阵快速幂)