Valera

Valera and Fruits

B.ValeraandFruitstimelimitpertest1secondmemorylimitpertest256megabytesinputstandardinputoutputstandardoutputValeraloveshisgarden,where n fruittreesgrow.Thisyearhewillenjoyagreatharvest!Onthe i-thtree 
a342500329a·2014-06-19 22:00

Codeforces 441C Valera and Tubes

题目链接：Codeforces441CValeraandTubes没看到r>=2一直错。让前几个管子占用2个格子，最后一个把剩下的都占用了，如果问题有解，这样做一定有解，其他策略就不一定了(比如让某个管子占用了3个格子，而总共有四个格子，两个管子)。#include#includeusingnamespacestd;intmain(){intn,m,k;scanf("%d%d%d",&n,&m,&
小爷永远不死·2014-06-09 23:40

codeforces 369C Valera and Elections

codeforces369CValeraandElections题目描述n个节点和n-1条双向边组成了一棵树。这些边分为两种，一种类型为1，一种类型为2，类型为2的边需要维修。当我们选中一个节点x时，节点x到节点1路径上的所有类型为2的边都会被维修。我们需要找到n个节点的一个子集，满足子集中个数最少，并且所有类型为2的边都得到维修分析选择该将哪个子树的叶节点加入子集比较麻烦，所以就不纠结于叶节点了
猫哆莉·2014-04-03 10:00

Valera and X

timelimitpertest1secondmemorylimitpertest256megabytesinputstandardinputoutputstandardoutputValeraisalittleboy.YesterdayhegotahugeMathhometaskatschool,soValeradidn'thaveenoughtimetoproperlylearntheEngl
jj12345jj198999·2014-03-25 10:00

Marathon（精度 + 分析模拟）

second memory limit per test 256 megabytes input standard input output standard output Valera
Simone_chou·2014-03-21 19:00

Codeforces Round #216 C Valera and Elections ( DFS )

题目链接:  C题目大意:  给出N(N #include #include #defineMAX101000 structsnode{ intto,w,next; }Tree[MAX=1)//若该条路需要被修复||子节点已经被修复 { if(sum[Star]==0)//未被记录则加入集合 { Answer[Ansn++]=Star; } return1; } else//不需要修复 retur
qq7366020·2013-12-07 22:00

Valera and Queries

E.ValeraandQueriestimelimitpertest2secondsmemorylimitpertest512megabytesinputstandardinputoutputstandardoutputValeralovessegments.Hehasrecentlycomeupwithoneinterestingproblem.The Ox axisofcoordinatesh
u012797220·2013-12-05 22:00

Valera and Contest

timelimitpertest1secondmemorylimitpertest256megabytesinputstandardinputoutputstandardoutputValeralovestoparticipateincompetitions.Especiallyinprogrammingcontests.Todayhehasparticipatedinthecontestwith
jj12345jj198999·2013-12-02 21:00

Valera and Fools

D.ValeraandFoolstimelimitpertest1secondmemorylimitpertest256megabytesinputstandardinputoutputstandardoutputOnefinemorning, n foolslinedupinarow.Afterthat,theynumberedeachotherwithnumbersfrom 1 to n,in
u012797220·2013-12-01 20:00

Codeforces 369D.Valera and Fools

D.ValeraandFoolstimelimitpertest1secondmemorylimitpertest256megabytesinputstandardinputoutputstandardoutputOnefinemorning, n foolslinedupinarow.Afterthat,theynumberedeachotherwithnumbersfrom 1 to n,in
u011788531·2013-11-30 23:00

Valera and Elections

C.ValeraandElectionstimelimitpertest1secondmemorylimitpertest256megabytesinputstandardinputoutputstandardoutputThecityValeralivesinisgoingtoholdelectionstothecityParliament.Thecityhas n districtsand n
u012797220·2013-11-30 15:00

Valera and Fools

这个题目很多人都是用记忆化搜索的办法来做的，确实这样比较不容易错并且好写。不过我用了另外一种办法，枚举加判断，判断dp[i][j]是否可行，首先计算前j-1个人死亡的最少回合数，然后再看看后i个人是否不存在神枪手，再判断j号人物是否具有杀伤力，然后再把之前的回合数加上杀死j到i的人的回合数，看看是否比k小，如果这些条件都满足，则这个状态可达。然后剩下的问题就是怎么计算前j-1个人死亡的最少回合数了
yrleep·2013-11-30 13:00

Valera and Elections (树形dp)

C.ValeraandElectionstimelimitpertest1secondmemorylimitpertest256megabytesinputstandardinputoutputstandardoutputThecityValeralivesinisgoingtoholdelectionstothecityParliament.Thecityhas n districtsand n
u010228612·2013-11-30 11:00

Valera and Contest

B.ValeraandContesttimelimitpertest1secondmemorylimitpertest256megabytesinputstandardinputoutputstandardoutputValeralovestoparticipateincompetitions.Especiallyinprogrammingcontests.Todayhehasparticipat
u010228612·2013-11-30 11:00

CodeForces 369B Valera and Contest

B.ValeraandContesttimelimitpertest1secondmemorylimitpertest256megabytesinputstandardinputoutputstandardoutputValeralovestoparticipateincompetitions.Especiallyinprogrammingcontests.Todayhehasparticipat
u012797220·2013-11-30 10:00

Valera and Contest（模拟）

Valera and Contest time limit per test 1 second memory limit per test 256 megabytes input
Simone_chou·2013-11-30 10:00

Codefoces 369C.Valera and Elections

C.ValeraandElectionstimelimitpertest1secondmemorylimitpertest256megabytesinputstandardinputoutputstandardoutputThecityValeralivesinisgoingtoholdelectionstothecityParliament.Thecityhas n districtsand n
u011788531·2013-11-30 02:00

Valera and Contest

B.ValeraandContesttimelimitpertest1secondmemorylimitpertest256megabytesinputstandardinputoutputstandardoutputValeralovestoparticipateincompetitions.Especiallyinprogrammingcontests.Todayhehasparticipat
u011788531·2013-11-30 01:00

Domino（模拟）

second memory limit per test 256 megabytes input standard input output standard output Valera
Simone_chou·2013-10-11 16:00

Codeforces Round #203 (Div. 2) B. Resort

Hepackedupandheadedforaskiresort.Valera'sfanciedaskitripbuthesoo
u010422038·2013-10-02 10:00

A. Two Problems

timelimitpertest2secondsmemorylimitpertest256megabytesinputstandardinputoutputstandardoutputAboyValeraregisteredonsite Codeforces as Valera
jj12345jj198999·2013-05-11 09:00

Codeforces Beta Round #72 (Div. 2 Only)——A,B,C

A.ToyArmytimelimitpertest2secondsmemorylimitpertest256megabytesinputstandardinputoutputstandardoutputTheheroofourstory,Valera
z690933166·2013-04-10 20:00

A. Toy Army

timelimitpertest2secondsmemorylimitpertest256megabytesinputstandardinputoutputstandardoutputTheheroofourstory,Valera
jj12345jj198999·2013-03-18 14:00

Two Problems

A.TwoProblemstimelimitpertest2secondsmemorylimitpertest256megabytesinputstandardinputoutputstandardoutputAboyValeraregisteredonsite Codeforces as Valera
cs_zlg·2012-07-14 20:00
上一页 1 2 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他