蒟蒻JHY

2018年4月24日

摘要： Discription You are given two multisets A and B. Each multiset has exactly n integers each between 1 and n inclusive. Multisets may contain multiple c 阅读全文

posted @ 2018-04-24 11:44 蒟蒻JHY 阅读(321) 评论(0) 推荐(0) 编辑

CodeForces - 618D Hamiltonian Spanning Tree

摘要： Discription A group of n cities is connected by a network of roads. There is an undirected road between every pair of cities, so there are roads in to 阅读全文

posted @ 2018-04-24 11:19 蒟蒻JHY 阅读(471) 评论(0) 推荐(0) 编辑

2018年4月23日

AtCoder - 2581 Meaningful Mean

摘要： Problem Statement You are given an integer sequence of length N, a= {a1,a2,…,aN}, and an integer K. a has N(N+1)⁄2 non-empty contiguous subsequences, 阅读全文

posted @ 2018-04-23 21:22 蒟蒻JHY 阅读(231) 评论(0) 推荐(0) 编辑

Codeforces Gym - 101147G The Galactic Olympics

摘要： Discription Altanie is a very large and strange country in Mars. People of Mars ages a lot. Some of them live for thousands of centuries! Your old fri 阅读全文

posted @ 2018-04-23 18:41 蒟蒻JHY 阅读(302) 评论(0) 推荐(0) 编辑

[SCOI2008] 奖励关

摘要：题目背景 08四川NOI省选题目描述你正在玩你最喜欢的电子游戏，并且刚刚进入一个奖励关。在这个奖励关里，系统将依次随机抛出k次宝物，每次你都可以选择吃或者不吃（必须在抛出下一个宝物之前做出选择，且现在决定不吃的宝物以后也不能再吃）。宝物一共有n种，系统每次抛出这n种宝物的概率都相同且相互独立。阅读全文

posted @ 2018-04-23 17:06 蒟蒻JHY 阅读(159) 评论(0) 推荐(0) 编辑

Codeforces Gym - 101147J Whistle's New Car

摘要： Discription Statements Whistle has bought a new car, which has an infinite fuel tank capacity. He discovered an irregular country since it has n citie 阅读全文

posted @ 2018-04-23 16:51 蒟蒻JHY 阅读(334) 评论(0) 推荐(0) 编辑

CodeForces - 732F Tourist Reform

摘要： Discription Berland is a tourist country! At least, it can become such — the government of Berland is confident about this. There are n cities in Berl 阅读全文

posted @ 2018-04-23 10:48 蒟蒻JHY 阅读(375) 评论(0) 推荐(0) 编辑

UVA - 10615 Rooks

摘要：建一下模，把行和列看成二分图的点，把车看成是二分图中的边，这样就变成了上一个博客的问题。我们每次新加一条边，就把它加入一条这条边两端点最小没有出现的颜色交替出现的路径中去。阅读全文

posted @ 2018-04-23 09:14 蒟蒻JHY 阅读(212) 评论(0) 推荐(0) 编辑

CodeForces - 600F Edge coloring of bipartite graph

摘要： Discription You are given an undirected bipartite graph without multiple edges. You should paint the edges of graph to minimal number of colours, so t 阅读全文

posted @ 2018-04-23 08:52 蒟蒻JHY 阅读(415) 评论(0) 推荐(0) 编辑

2018年4月22日

UVA - 10972 RevolC FaeLoN

摘要：一道特别好的题qwq。题目大意就是给你一个无向图，让你把边定向之后再加一些边使得这个图强连通，求最少需要加多少边。一开始毫无头绪23333,数据范围让人摸不着头脑。。。。。然后开始画图，，，发现环上的边都顺时针或者逆时针是很优的，之后扩展到了边双联通分量上(因为边双联通分量中的每个边都在至少阅读全文

posted @ 2018-04-22 20:55 蒟蒻JHY 阅读(244) 评论(0) 推荐(0) 编辑

AFO but may be back one day.....

公告