kuronekonano的博客

畅通工程续Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 53520 Accepted Submission(s): 19997Problem Description 某省自从实行了很多年的畅通工程计划后，终于修建了很多路。不过路

题目描述Eagle Jump公司正在开发一款新的游戏。泷本一二三作为其员工，获得了提前试玩的机会。现在她正在试图通过一个迷宫。这个迷宫有一些特点。为了方便描述，我们对这个迷宫建立平面直角坐标系。迷宫中有两条平行直线 L1:Ax+By+C1=0,L2:Ax+By+C2=0，还有 n 个圆 。角色在直线上、圆上、圆内行走不消耗体力。在其他位置上由S点走到T点消耗的体力为S和T的欧几里得距离。泷本...

题目描述Bessie and her friend Elsie decide to have a meeting. However, after Farmer John decorated his fences they were separated into different blocks. John’s farm are divided into n blocks. Bessie live...

题目描述 You are given a tree with N vertices. Here, a tree is a kind of graph, and more specifically, a connected undirected graph with N−1 edges, where N is the number of its vertices. The i-th edge ...

高玩小Q不仅喜欢玩寻宝游戏，还喜欢一款升级养成类游戏。在这个游戏的世界地图中一共有n个城镇，编号依次为1到n。 这些城镇之间有m条单向道路，第i 条单项道路包含四个参数ui,vi,ai,bi，表示一条从ui号城镇出发，在vi号城镇结束的单向道路，因为是单向道路，这不意味着小Q可以从vi沿着该道路走到ui。小Q的初始等级level为1，每当试图经过一条道路时，需要支付cost=log2level...

TonyY是一个喜欢到处浪的男人，他的梦想是带着兰兰姐姐浪遍天朝的各个角落，不过在此之前，他需要做好规划。现在他的手上有一份天朝地图，上面有n个城市，m条交通路径，每条交通路径都是单行道。他已经预先规划好了一些点作为旅游的起点和终点，他想选择其中一个起点和一个终点，并找出从起点到终点的一条路线亲身体验浪的过程。但是他时间有限，所以想选择耗时最小的，你能告诉他最小的耗时是多少吗？Input ...

题目描述 On the xy-plane, Snuke is going to travel from the point (xs,ys) to the point (xt,yt). He can move in arbitrary directions with speed 1. Here, we will consider him as a point without size. Ther...

#include<stdio.h>///楼层之间没有楼梯，只通过电梯行走，因此利用两两电梯之间都到的楼层可以联结所有的电梯，到达时间便是楼层之间的权值，跑一个最短路即可#include<string.h>#include<vector>#include<queue>#include<stdlib.h>using namesp...

Several currency exchange points are working in our city. Let us suppose that each point specializes in two particular currencies and performs exchange operations only with these currencies. There can...

Freddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who is sitting on another stone. He plans to visit her, but since the water is dirty and full of tourists’ sun...

Background Hugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. But he needs a clever man who tells him whether there really is a way from the place his cu...

畅通工程续Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 53520 Accepted Submission(s): 19997Problem Description 某省自从实行了很多年的畅通工程计划后，终于修建了很多路。不过路多了也不

**旅行** Time Limit: 1000 MS Memory Limit: 32768 K Total Submit: 50(25 users) Total Accepted: 20(20 users) Rating: Special Judge: No Description “04.24，和Sakura去东京天空树，世界上最暖和的地方天空树的顶上。”“04.26，和

畅通工程续Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 53520 Accepted Submission(s): 19997Problem Description 某省自从实行了很多年的畅通工程计划后，终于修建了很多路。不过路多了也不

Bessie has moved to a small farm and sometimes enjoys returning to visit one of her best friends. She does not want to get to her old home too quickly, because she likes the scenery along the way. She...