编程介的小学生 2017-01-03 05:30 采纳率: 20.5%
浏览 878
已采纳

Pick-up sticks

Description

Stan has n sticks of various length. He throws them one at a time on the floor in a random way. After finishing throwing, Stan tries to find the top sticks, that is these sticks such that there is no stick on top of them. Stan has noticed that the last thrown stick is always on top but he wants to know all the sticks that are on top. Stan sticks are very, very thin such that their thickness can be neglected.
Input

Input consists of a number of cases. The data for each case start with 1 <= n <= 100000, the number of sticks for this case. The following n lines contain four numbers each, these numbers are the planar coordinates of the endpoints of one stick. The sticks are listed in the order in which Stan has thrown them. You may assume that there are no more than 1000 top sticks. The input is ended by the case with n=0. This case should not be processed.
Output

For each input case, print one line of output listing the top sticks in the format given in the sample. The top sticks should be listed in order in which they were thrown.

The picture to the right below illustrates the first case from input.
Sample Input

5
1 1 4 2
2 3 3 1
1 -2.0 8 4
1 4 8 2
3 3 6 -2.0
3
0 0 1 1
1 0 2 1
2 0 3 1
0
Sample Output

Top sticks: 2, 4, 5.
Top sticks: 1, 2, 3.

  • 写回答

1条回答

  • threenewbee 2017-01-09 15:53
    关注

    http://blog.csdn.net/Enjoying_Science/article/details/47768561

    本回答被题主选为最佳回答 , 对您是否有帮助呢?
    评论

报告相同问题？

  • Pick-up Sticks
    2017-03-24 11:10
    回答 2 已采纳 http://blog.csdn.net/itaskyou/article/details/51356970
  • Pick-up sticks
    2017-01-03 05:30
    回答 1 已采纳 http://blog.csdn.net/Enjoying_Science/article/details/47768561
  • Magic Sticks
    2017-12-10 13:32
    回答 1 已采纳 https://blog.csdn.net/Baiyi_destroyer/article/details/81271213
  • Pick-up sticks
    2022-01-25 19:12
    LHNC的博客 Pick-up sticks | JXNUOJ 翻译： 描述： Stan，有n个各种长度的木棒。他把他们一次随意的扔在地板上，扔完后，Stan，尝试着找到最顶上的木棒，就是没有其他木棒其在上面的木棒。Stan，知道最后一个扔出去的木棒...
  • Sticks
    2017-09-13 00:47
    回答 1 已采纳 http://blog.csdn.net/qq_32426313/article/details/52083559
  • Hiiragi's Sticks intellij-idea
    2017-08-05 13:36
    回答 1 已采纳 http://blog.csdn.net/wust_zjx/article/details/47036397
  • C/C++杭电1501题Wooden sticks 求挑错 算法
    2016-03-19 05:41
    回答 1 已采纳 http://blog.csdn.net/lishuhuakai/article/details/8117251
  • Pick-up Sticks
    2021-07-15 20:44
    N732的博客 输入样例 1 5 1 1 4 2 2 3 3 1 1 -2.0 8 4 1 4 8 2 3 3 6 -2.0 3 0 0 1 1 1 0 2 1 2 0 3 1 0 输出样例 1 Top sticks: 2, 4, 5. Top sticks: 1, 2, 3. #include #include #include #define eps 1e-8 using namespace...
  • Sticks Problem
    2016-12-16 08:39
    回答 1 已采纳 http://blog.csdn.net/guard_mine/article/details/45748253
  • Wooden Sticks
    2017-02-19 07:30
    回答 2 已采纳 http://blog.csdn.net/lishuhuakai/article/details/8117251
  • Pick-up sticks POJ - 2653
    2022-03-24 21:37
    int 我的博客 题目链接：POJ - 2653 首先这题... } printf("Top sticks:"); int now=(n+1)%2; while(!q[now].empty()){ printf(" %d%c",q[now].front().id,q[now].size()==1?'.':','); q[now].pop(); } printf("\n"); } return 0; }
  • Pick-up sticks——计算几何 两线段相交
    2020-08-14 23:16
    five_east_west的博客 Pick-up sticks Stan has n sticks of various length. He throws them one at a time on the floor in a random way. After finishing throwing, Stan tries to find the top sticks, that is these sticks such ...
  • Pick-up Sticks- 解析几何-点在直线左中右
    2023-03-27 22:32
    Z_Number的博客 Pick-up Sticks- 解析几何-点在直线左中右
  • 【POJ 2653】Pick-up sticks
    2019-02-02 22:14
    forever_dreams的博客 After finishing throwing, Stan tries to find the top sticks, that is these sticks such that there is no stick on top of them. Stan has noticed that the last thrown stick is always on top but he wants...
  • UVA10902 Pick-up Sticks
    2018-10-09 22:13
    波波i的博客 "Top sticks:" ) ; bool fl = 0 ; for ( int i = 1 ; i n ; i ++ ) scanf ( "%lf%lf%lf%lf" , & p1 [ i ] . x , & p1 [ i ] . y , & p2 [ i ] . x , & p2 [ i ] . y ) ; for ( int i = 1 ; i ...
  • 【计算几何】POJ 2653 Pick-up sticks
    2019-07-23 23:50
    lesileqin的博客 POJ 2653 Pick-up sticks 【传送门】 Time Limit:3000MS Memory Limit:65536K Total Submissions:15915 Accepted:5999 Description Stan has n sticks of various length. He throws them one ....
  • hdu-1147 Pick-up sticks（判断线段相交）
    2016-04-26 13:52
    acm_cxq的博客 题目链接：点击打开链接 Pick-up sticks Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2680 Accepted Submission(s): 978 Problem Descriptio
  • poj 2653 Pick-up sticks
    2017-09-26 08:30
    Singular__point的博客 Pick-up sticks Time Limit: 3000MS   Memory Limit: 65536K Total Submissions: 13844   Accepted: 5249 Description Stan has n sticks of various length. He throws them ...
  • UVa 10902 Pick-up Sticks (线段与线段相交)
    2016-05-09 22:42
    哎哟_不错哦的博客 题目： 有n根木条，一根一根的往一个... printf("Top sticks: "); while(li.size()>1) { printf("%d, ",li.front().i); li.pop_front(); } printf("%d.\n",li.front().i); } return 0; }
  • POJ-2653 Pick-up sticks
    2018-08-24 09:40
    _zlWang的博客 每次新放一根棍子时，判断与之前的棍子是否相交，... printf("Top sticks:"); for(int i=0;i;i++) { printf(" %d",top[i]+1); if(i==cnt-1) printf(".\n"); else printf(","); } } return 0; }  
  • 没有解决我的问题, 去提问

悬赏问题

  • ¥15 如何在scanpy上做差异基因和通路富集？
  • ¥20 关于#硬件工程#的问题，请各位专家解答！
  • ¥15 关于#matlab#的问题：期望的系统闭环传递函数为G(s)=wn^2/s^2+2¢wn+wn^2阻尼系数¢=0.707，使系统具有较小的超调量
  • ¥15 FLUENT如何实现在堆积颗粒的上表面加载高斯热源
  • ¥30 截图中的mathematics程序转换成matlab
  • ¥15 动力学代码报错，维度不匹配
  • ¥15 Power query添加列问题
  • ¥50 Kubernetes&Fission&Eleasticsearch
  • ¥15 報錯：Person is not mapped，如何解決？
  • ¥15 c++头文件不能识别CDialog