04 2018 档案

摘要:Dylans loves tree Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1915 Accepted Submission(s): 阅读全文
posted @ 2018-04-27 20:20 冥想选手 阅读(181) 评论(0) 推荐(0)
摘要:链接:https://www.nowcoder.com/acm/contest/105/H来源:牛客网 n个桶按顺序排列,我们用1~n给桶标号。有两种操作: 1 l r c 区间[l,r]中的每个桶中都放入一个颜色为c的球 (1≤l,r ≤n,l≤r,0≤c≤60) 2 l r 查询区间[l,r]的 阅读全文
posted @ 2018-04-26 22:19 冥想选手 阅读(245) 评论(0) 推荐(0)
摘要:2243: [SDOI2011]染色 Description 给定一棵有n个节点的无根树和m个操作,操作有2类: 1、将节点a到节点b路径上所有点都染成颜色c; 2、询问节点a到节点b路径上的颜色段数量(连续相同颜色被认为是同一段), 如“112221”由3段组成:“11”、“222”和“1”。 请 阅读全文
posted @ 2018-04-26 21:56 冥想选手 阅读(241) 评论(0) 推荐(0)
摘要:You are given a tree (an undirected acyclic connected graph) with N nodes, and edges numbered 1, 2, 3...N-1. Each edge has an integer value assigned t 阅读全文
posted @ 2018-04-24 22:25 冥想选手 阅读(290) 评论(0) 推荐(0)
摘要:How far away ? Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 20971 Accepted Submission(s): 8245 阅读全文
posted @ 2018-04-24 19:55 冥想选手 阅读(221) 评论(0) 推荐(0)
摘要:Problem 2082 过路费 Accept: 887 Submit: 2881Time Limit: 1000 mSec Memory Limit : 32768 KB Accept: 887 Submit: 2881Time Limit: 1000 mSec Memory Limit : 32 阅读全文
posted @ 2018-04-23 22:30 冥想选手 阅读(187) 评论(0) 推荐(0)
摘要:Tunnel Warfare Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11180 Accepted Submission(s): 4389 阅读全文
posted @ 2018-04-23 19:58 冥想选手 阅读(167) 评论(0) 推荐(0)
摘要:Stars in Your Window Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 13196 Accepted: 3609 Description Fleeting time does not blur my memory 阅读全文
posted @ 2018-04-22 21:50 冥想选手 阅读(277) 评论(0) 推荐(0)
摘要:1036: [ZJOI2008]树的统计Count Description 一棵树上有n个节点,编号分别为1到n,每个节点都有一个权值w。我们将以下面的形式来要求你对这棵树完成一些操作: I. CHANGE u t : 把结点u的权值改为t II. QMAX u v: 询问从点u到点v的路径上的节点 阅读全文
posted @ 2018-04-17 19:27 冥想选手 阅读(160) 评论(0) 推荐(0)
摘要:马上要去西安打邀请赛了,存下板子 首先是vector存图的: 不会链式前向星,存个链式前向星的数剖板子,免得碰到要用的时候装死 阅读全文
posted @ 2018-04-16 19:52 冥想选手 阅读(322) 评论(0) 推荐(0)
摘要:2124: 等差子序列 Description 给一个1到N的排列{Ai},询问是否存在1<=p1<p2<p3<p4<p5<…<pLen<=N (Len>=3), 使得Ap1,Ap2,Ap3,…ApLen是一个等差序列。 给一个1到N的排列{Ai},询问是否存在1<=p1<p2<p3<p4<p5<… 阅读全文
posted @ 2018-04-15 22:10 冥想选手 阅读(211) 评论(0) 推荐(0)
摘要:Toposort Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 499 Accepted Submission(s): 203 Probl 阅读全文
posted @ 2018-04-14 21:13 冥想选手 阅读(165) 评论(0) 推荐(0)
摘要:DZY Loves Topological Sorting Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1250 Accepted Sub 阅读全文
posted @ 2018-04-14 19:51 冥想选手 阅读(150) 评论(0) 推荐(0)
摘要:D. The Child and Sequence time limit per test 4 seconds memory limit per test 256 megabytes input standard input output standard output D. The Child a 阅读全文
posted @ 2018-04-13 22:08 冥想选手 阅读(232) 评论(0) 推荐(0)
摘要:An easy problem Time Limit: 8000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2770 Accepted Submission(s): 1034 阅读全文
posted @ 2018-04-13 20:50 冥想选手 阅读(175) 评论(0) 推荐(0)
摘要:LCIS Time Limit: 6000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8337 Accepted Submission(s): 3566 Problem De 阅读全文
posted @ 2018-04-03 18:47 冥想选手 阅读(221) 评论(0) 推荐(0)