码迷,mamicode.com
首页 >  
搜索关键字:segment game    ( 7679个结果
HDU 1558 Segment set (并查集+线段非规范相交)
题目链接题意 : 如果两个线段相交就属于同一集合,查询某条线段所属集合有多少线段,输出。思路 : 先判断与其他线段是否相交,然后合并。 1 //1558 2 #include 3 #include 4 #include 5 #include 6 #define eps 1e-8 ...
分类:其他好文   时间:2014-08-15 17:30:29    阅读次数:172
HDU 3622 Bomb Game(二分+2SAT)
题意:有一个游戏,有n个回合,每回合可以在指定的2个区域之一放炸弹,炸弹范围是一个圈,要求每回合的炸弹范围没有重合。得分是炸弹半径最小的值。求可以得到的最大分数。思路:二分+2SAT。二分炸弹范围,再根据有无重合建图,用2SAT判定。#include #include #include #inclu...
分类:其他好文   时间:2014-08-15 17:17:49    阅读次数:191
POJ1733 - Parity game - 并查集
带权并查集一道不错的题,要用到离散化...
分类:其他好文   时间:2014-08-15 16:10:19    阅读次数:161
select sum(bytes) from dba_segment: waiting for 'gc cr request'
select sum(bytes) from dba_segments,等待时间0: waiting for 'gc cr request'...
分类:数据库   时间:2014-08-15 16:01:09    阅读次数:456
zoj 1008 Gnome Tetravex (dfs+枚举)
Gnome Tetravex Time Limit: 10 Seconds      Memory Limit: 32768 KB Hart is engaged in playing an interesting game, Gnome Tetravex, these days. In the game, at the beginning, the player is given...
分类:其他好文   时间:2014-08-15 16:00:49    阅读次数:270
HDU4939:Stupid Tower Defense(DP)
Problem Description FSF is addicted to a stupid tower defense game. The goal of tower defense games is to try to stop enemies from crossing a map by building traps to slow them down and towers whic...
分类:其他好文   时间:2014-08-15 14:42:48    阅读次数:188
POJ 2777 Count Color (线段树+位运算)
题意很简单了,对一个区间有两种操作: 1. "C A B C" Color the board from segment A to segment B with color C. //A~B涂上颜色C 2. "P A B" Output the number of different colors painted between segment A and segment B (includ...
分类:其他好文   时间:2014-08-15 14:39:58    阅读次数:292
poj 1733 Parity game 并查集 离散化
点击打开链接题目链接 Parity game Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 6249   Accepted: 2413 Description Now and then you play the following game with...
分类:其他好文   时间:2014-08-15 14:39:08    阅读次数:221
uva 10557 - XYZZY
Problem D: XYZZYADVENT: /ad?vent/, n. The prototypical computer adventure game, first designed by Will Crowther on the PDP-10 in the mid-1970s as an a...
分类:其他好文   时间:2014-08-15 14:34:08    阅读次数:194
poj 1733 Parity game【哈希+并查集】
这道题题意我不想说了,但是有一个条件必须的说,就是1-2其实是0-2这条边,3-4是2-4这条边,但是困惑了好久,其他就是哈希给他一个地址 ,然后把注解看下方   #include #include #define maxx 10001 int par[maxx]; int rank[maxx]; void init() { for(int i=0;i<=maxx;i++...
分类:其他好文   时间:2014-08-15 12:55:08    阅读次数:182
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!