Detail of message

Online Judge

Problem Set

Authors

Online Contests

User

Web Board
Home Page
F.A.Qs
Statistical Charts

Current Contest
Past Contests
Scheduled Contests
Award Contest

做得好郁闷,才弄出A,B,E,wa无数...

Posted by twilight at 2008-12-07 17:03:37 and last updated at 2008-12-07 17:03:50
In Reply To:HUST校赛网络同步赛欢迎大家前来踢场子 http://acm.hust.edu.cn/thx/contest.php?cid=1028 Posted by:Sempr at 2008-12-06 23:17:41

Followed by:

弱问b怎么做？ (0) Jaakques 2008-12-07 17:48:05
- 在纸上画了半天... (125) twilight 2008-12-07 17:57:10
  - 传说图能否圈覆盖等价于判断拆点后二分图是否有完美匹配 (0) LiZhiXu 2008-12-07 18:03:43
    - 能否圈覆盖是说能否拆分成某几个圈的并么？ (23) wywcgs 2008-12-09 16:18:35
      - 不是这样的好像，一个点只能在一个圈中。 (27) chaeyeon 2008-12-09 19:42:33
        我没看题。我说的并是所有圈中边的并等于边集，您说的是点集？ (0) wywcgs 2008-12-09 21:31:14
        嗯，题目中说的是把点分开 (0) chaeyeon 2008-12-10 19:04:31
  - 不知偶理解的对不对: (74) Jaakques 2008-12-07 18:11:48
    - 呵呵,我的方法是有问题,没考虑这样的情况,匹配ac了 (94) twilight 2008-12-07 22:19:23
- 拆点，二分图匹配ac了 (0) nkzgm 2008-12-07 18:20:29
  - 奥~~了解了。。。:D (0) Jaakques 2008-12-07 18:29:23
    - 那d题,相乘中不要每次都取模,用long long读完后再取,时间由1267ms变为400ms左右,但不知第一怎搞的.. (0) huicpc035 2008-12-07 18:47:30
      - Re:那d题,相乘中不要每次都取模,用long long读完后再取,时间由1267ms变为400ms左右,但不知第一怎搞的.. (39) Jaakques 2008-12-07 18:54:32
        Re:先预处理n=2^k的所有状态的值,赞!!!!!好想法!!! (43) wzc1989 2008-12-07 22:14:17
  - Re:B题,貌似直接贪心度为1的也可以,度为1的只能和他的伙伴两个人一块 (72) wzc1989 2008-12-07 22:04:20
  - 弱弱的问是怎么拆点的啊。。想了半天 (0) conan1 2008-12-07 22:28:16
    - 最好能证明下。。实在想不出来。。谢谢 (0) conan1 2008-12-07 22:29:33
      - 就是X是1~n,Y也是1~n,对于边(u,v),增加X[u]->Y[v]和X[v]->Y[u] (0) twilight 2008-12-07 22:47:43
        用置换群理论即可证明。 (0) Jaakques 2008-12-07 22:53:08

Post your reply here:

Home Page Go Back To top

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator