TOJ

toj 2299 Electricity 求无向图割点

题意：给出一个无向图，计算去掉一个点后所能得到的最大块数分析：dfs求出连通块的数量tot和删除每个点后能把该点所在的块分割成的块的数量s[i]，那么ans就是最大的sum-s[i]（我代码里的s[i]表示删除每个点后能把该点所在的块分割成的块的数量-1）代码：var n,m,e,t:longint; dfn,low,last,s:array[1..10000]oflongint; side:ar
qq_33229466·2016-04-21 19:00

toj 1026/2189 Network 求割点数量

题意：一个公司有一个网络，连接着从编号1到N共N个地方，然后给出一些边，表示哪两个地方相连。有些点一旦断开所有和它关联的边，那么图不再联通，称这样的点为“critical place”，求有多少个这样的点。分析：直接用dfs求割点数量就好了。代码：var e,t,s,n:longint; side:array[1..20000]ofrecord x,y,next:longint; end; v:a
qq_33229466·2016-04-19 21:00

一般图的匹配题集

最大匹配(带花树)URAL1099ZOJ3316GameHDU3446/TOJ3557daizhenyang'schessHDU3551hardproblem最大权匹配(求解中国邮路问题)http://
zchahaha·2016-04-10 10:00

【TOJ1132】Square Root，二次同余方程

传送门写在前面：ACdreamer大神太强辣！希望能达到他一半的高度啊！思路：ACdreamer’sblog裸题调了好久ORZ注意：关于(a+√w）^((p+1)/2)的求法，我至今都没太想明白……代码：#include"bits/stdc++.h" usingnamespacestd; intt,a,x,p,w; structos { intu,v; }; osmul(osa,osb) { os
xym_CSDN·2016-03-02 21:00

Excel文档保存的时候，提示“文档未保存”

--宏--录制新宏--确定--停止录制宏--宏-宏--编辑--复制以下程序Sub恢复保存()   name0=ActiveWorkbook.Name   j=Sheets.Count   Fori=1Toj
李只蚊·2016-01-26 09:00

Excel文档保存的时候，提示“文档未保存”

--宏--录制新宏--确定--停止录制宏--宏-宏--编辑--复制以下程序Sub恢复保存()   name0=ActiveWorkbook.Name   j=Sheets.Count   Fori=1Toj
李只蚊·2016-01-26 09:00

TOJ3660家庭关系(并查集+hash+图的连通性）

家庭关系    时间限制(普通/Java):1000MS/3000MS     运行内存限制:65536KByte 总提交: 38            测试通过: 9 描述   给定若干家庭成员之间的关系，判断2个人是否属于同一家庭，即2个人之间均可以通过这些关系直接
·2015-11-13 15:27

TOJ 2732存钱计划（三）（单源最短路）

存钱计划（三）    时间限制(普通/Java):1000MS/30000MS     运行内存限制:65536KByte 总提交: 18            测试通过: 16 描述   TZC的店铺比较多，上次WY随便走只要能走到就行，现在他学聪明了。WY去买东西的
·2015-11-13 15:24

TOJ3744（Transportation Costs）

Transportation Costs    Time Limit(Common/Java):2000MS/6000MS     Memory Limit:65536KByte Total Submit: 129            Accepted: 34 Description
·2015-11-13 15:22

TOJ1693（Silver Cow Party）

Silver Cow Party    Time Limit(Common/Java):2000MS/20000MS     Memory Limit:65536KByte Total Submit: 58            Accepted: 28 Description &n
·2015-11-13 15:20

toj 1017. Number Game

http://202.113.2.5:57778/toj/showp1017.html DP (状态压缩+记忆化搜索) + 博弈论 基本思路： 用状态压缩表示 那些是还可以选的 哪些是不可以选的
·2015-11-13 13:32

toj 1410. Euclid's Game

http://202.113.2.5:57778/toj/showp1410.html 找奇异状态 代码： import java.util.*; import java.math.*;
·2015-11-13 13:31

toj2867 Picking Problem

题目链接：http://acm.tju.edu.cn/toj/showp.php?
·2015-11-13 12:38

TOJ3660家庭关系(并查集+hash+图的连通性）

家庭关系    时间限制(普通/Java):1000MS/3000MS     运行内存限制:65536KByte 总提交: 38            测试通过: 9 描述   给定若干家庭成员之间的关系，判断2个人是否属于同一家庭，即2个人之间均可以通过这些关系直接
·2015-11-13 04:48

TOJ 2732存钱计划（三）（单源最短路）

存钱计划（三）    时间限制(普通/Java):1000MS/30000MS     运行内存限制:65536KByte 总提交: 18            测试通过: 16 描述   TZC的店铺比较多，上次WY随便走只要能走到就行，现在他学聪明了。WY去买东西的
·2015-11-13 04:46

TOJ3744（Transportation Costs）

Transportation Costs    Time Limit(Common/Java):2000MS/6000MS     Memory Limit:65536KByte Total Submit: 129            Accepted: 34 Description
·2015-11-13 04:43

TOJ1693（Silver Cow Party）

Silver Cow Party    Time Limit(Common/Java):2000MS/20000MS     Memory Limit:65536KByte Total Submit: 58            Accepted: 28 Description &n
·2015-11-13 04:41

TJU 3758. Jewel 【划分树，树状数组】

http://acm.tju.edu.cn/toj/showp3758.htmlTJU 3758.
·2015-11-12 22:36

TOJ 4325 RMQ with Shifts / 线段树单点更新

RMQ with Shifts 时间限制(普通/Java):1000MS/3000MS     运行内存限制:65536KByte 描述   In the traditional RMQ (Range Minimum Query) problem, we have a static array A. Then for each q
·2015-11-12 18:08

TOJ3651确定比赛名次

确定比赛名次    Time Limit(Common/Java):1000MS/3000MS     Memory Limit:65536KByte Total Submit: 23            Accepted: 19 Description   有N个比
·2015-11-12 14:45

TOJ3649欧拉回路

欧拉回路    Time Limit(Common/Java):1000MS/3000MS     Memory Limit:65536KByte Total Submit: 35            Accepted: 20 Description   欧拉回路是指
·2015-11-12 14:44

TOJ3650 Legal or Not

Legal or Not    Time Limit(Common/Java):1000MS/3000MS     Memory Limit:65536KByte Total Submit: 41            Accepted: 18 Description  
·2015-11-12 14:43

tju 3017 El Dorado（sdutacm 2384)

http://acm.tju.edu.cn/toj/showp3017.html http://acm.sdut.edu.cn/web/problem.php?
·2015-11-11 17:04

toj 2968 Find the Diagonal

2968.   Find the Diagonal Time Limit: 1.0 Seconds    Memory Limit: 65536K Total Runs: 695    Accepted Runs: 223 A square matrix contains equal number of rows and colu
·2015-11-11 13:02

toj 2483 Nasty Hacks

2483.   Nasty Hacks Time Limit: 0.5 Seconds    Memory Limit: 65536K Total Runs: 969    Accepted Runs: 759 You are the CEO of Nasty Hacks Inc., a company that creates
·2015-11-11 13:51

toj 2485 Card Tric

    2485.   Card Tric Time Limit: 0.5 Seconds    Memory Limit: 65536K Total Runs: 348    Accepted Runs: 200 The magician shuffles a small pack of cards, h
·2015-11-11 13:50

toj 2696 Collecting Beepers

2696.   Collecting Beepers Time Limit: 1.0 Seconds    Memory Limit: 65536K Karel is a robot who lives in a rectangular coordinate system where each place is designated by a set
·2015-11-11 13:50

toj 3098 Event Planning

3098.   Event Planning Time Limit: 5.0 Seconds    Memory Limit: 65536K Total Runs: 134    Accepted Runs: 67    Multiple test files As you didn't show up to
·2015-11-11 13:49

toj 2975 Encription

2975.   Encription Time Limit: 1.0 Seconds    Memory Limit: 65536K Total Runs: 233    Accepted Runs: 88 Now CUET has its own local Area Network and almost all PCs are
·2015-11-11 13:48

toj 2972 MOVING DHAKA

2972.   MOVING DHAKA Time Limit: 2.0 Seconds    Memory Limit: 65536K Total Runs: 344    Accepted Runs: 97 I am moving to Dhaka. I have many friends there. Since I sha
·2015-11-11 13:48

toj 2971 Rotating Numbers

2971.   Rotating Numbers Time Limit: 1.0 Seconds    Memory Limit: 65536K Total Runs: 262    Accepted Runs: 86 As CSE students you are already familiar with the
·2015-11-11 13:47

toj 2970 Hackle Number

2970.   Hackle Number Time Limit: 1.0 Seconds    Memory Limit: 65536K Total Runs: 183    Accepted Runs: 81 When I was in college one of my chemistry professor invente
·2015-11-11 13:46

toj 1731 Strange Towers of Hanoi

1731.   Strange Towers of Hanoi Time Limit: 1.0 Seconds    Memory Limit: 65536K Total Runs: 138    Accepted Runs: 81 Background Charlie Darkbrown sits in a
·2015-11-11 13:45

toj 1722 Manhattan 2025

1722.   Manhattan 2025 Time Limit: 1.0 Seconds    Memory Limit: 65536K       Total Runs: 56    Accepted Runs: 26 Manhattan in the yea
·2015-11-11 13:44

toj 1721 Friends

1721.   Friends Time Limit: 1.0 Seconds    Memory Limit: 65536K   Total Runs: 80    Accepted Runs: 14 You know this problem... several friends meet at
·2015-11-11 13:43

toj 1702 A Knight's Journey

1702.   A Knight's Journey Time Limit: 1.0 Seconds    Memory Limit: 65536K    Multiple test files Background The knight is getting bored of seeing the same blac
·2015-11-11 13:41

toj 1709 Incomplete chess boards

1709.   Incomplete chess boards Time Limit: 1.0 Seconds    Memory Limit: 65536K Total Runs: 320    Accepted Runs: 199    Multiple test files Background T
·2015-11-11 13:41

toj 1705 Scavenger Hunt

1705.   Scavenger Hunt Time Limit: 1.0 Seconds    Memory Limit: 65536K Total Runs: 399    Accepted Runs: 214    Multiple test files Background Bill has b
·2015-11-11 13:40

toj 1701 Stamps

  1701.   Stamps Time Limit: 2.0 Seconds    Memory Limit: 65536K Total Runs: 3159    Accepted Runs: 1053    Multiple test files Background Everybod
·2015-11-11 13:39

toj 2806 Replace Words

2806.   Replace Words Time Limit: 1.0 Seconds    Memory Limit: 65536K Total Runs: 476    Accepted Runs: 172    Multiple test files The text editors such as
·2015-11-11 13:38

toj 2802 Tom's Game

2802.   Tom's Game Time Limit: 1.0 Seconds    Memory Limit: 65536K Total Runs: 376    Accepted Runs: 117    Multiple test files Tom is playing the followin
·2015-11-11 13:37

toj 2798 Farey Sequence

   Farey Sequence Time Limit: 3.0 Seconds    Memory Limit: 65536K    Multiple test files The Farey Sequence Fn for any integer n with n ≥ 2 is the set of irre
·2015-11-11 13:36

toj 2794 Bus

2794.   Bus Time Limit: 3.0 Seconds    Memory Limit: 65536K Total Runs: 427    Accepted Runs: 189 UESTC is moving to the beautiful new campus which locates in the su
·2015-11-11 13:35

toj 2804 The Art Gallery Problem

    The Art Gallery Problem Time Limit: 1.0 Seconds    Memory Limit: 65536K In 1973, Klee posed a fascinating problem - the art gallery problem. Imagine an art gallery ro
·2015-11-11 13:34

toj 2815 Searching Problem

2815.   Searching Problem Time Limit: 1.0 Seconds    Memory Limit: 65536K Total Runs: 421    Accepted Runs: 177 It is said that the predecessors had hidden a lot of
·2015-11-11 13:33

toj 2807 Number Sort

  2807.   Number Sort Time Limit: 10.0 Seconds    Memory Limit: 65536K Total Runs: 469    Accepted Runs: 160 Given you N positive integers, your job is to o
·2015-11-11 13:32

toj 2819 Travel

2819.   Travel Time Limit: 1.0 Seconds    Memory Limit: 65536K Total Runs: 1042    Accepted Runs: 458 There are N cities in this country, and some of them are conne
·2015-11-11 13:32

toj 2843 Diamonds

2843.   Diamonds Time Limit: 1.0 Seconds    Memory Limit: 65536K Total Runs: 856    Accepted Runs: 510 As we know, Hawk is a great explorer. In the spring of 2007, he
·2015-11-11 13:11

toj 2841 Bitwise Reverse

    2841.   Bitwise Reverse Time Limit: 1.0 Seconds    Memory Limit: 65536K Total Runs: 1520    Accepted Runs: 1025 Professor Robby invents a powerful encr
·2015-11-11 13:10

TOJ 3029. Assemble

题目大意你需要攒一台电脑，需要从每种配件中选取1个，每种配件有若干个，每个配件有一个价格p和性能q。要求在不超出预算sum的情况下求最好的性能。一台电脑的性能是各个配件的性能最小值。0 ≤p≤ 1 000 000，0 ≤ quality ≤ 1 000 000 000； 分析最开始想的是DP，但是想了很久仍然没有思路，老大提示可能是二分性能。于是，可以考虑二分性能，从1 000 000 000
·2015-11-11 13:28
上一页 1 2 3 4 5 6 7 8 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他