随缘&不屈 - 博客园

UVA - 11478 - Halum（二分+差分约束系统）

摘要： Problem UVA - 11478 - Halum Time Limit: 3000 mSec Problem Description You are given a directed graph G(V,E) with a set of vertices and edges. Each edg 阅读全文

posted @ 2019-04-24 15:39 随缘&不屈阅读(183) 评论(0) 推荐(0) 编辑

UVA - 10917 - Walk Through the Forest（最短路+记忆化搜索）

摘要： Problem UVA - 10917 - Walk Through the Forest Time Limit: 3000 mSec Problem Description Jimmy experiences a lot of stress at work these days, especial 阅读全文

posted @ 2019-04-23 18:50 随缘&不屈阅读(329) 评论(0) 推荐(0) 编辑

UVA - 11374 - Airport Express（堆优化Dijkstra）

摘要： Problem UVA - 11374 - Airport Express Time Limit: 1000 mSec Problem Description In a small city called Iokh, a train service, Airport-Express, takes r 阅读全文

posted @ 2019-04-23 17:56 随缘&不屈阅读(287) 评论(0) 推荐(0) 编辑

UVALive - 3713 - Astronauts（图论——2-SAT）

摘要： Problem UVALive - 3713 - Astronauts Time Limit: 3000 mSec Problem Description Input The input contains several blocks of test cases. Each case begins 阅读全文

posted @ 2019-04-22 21:33 随缘&不屈阅读(247) 评论(0) 推荐(0) 编辑

UVALive - 3211 - Now or later（图论——2-SAT）

摘要： Problem UVALive - 3211 - Now or later Time Limit: 9000 mSec Problem Description Input Output Sample Input 10 44 156 153 182 48 109 160 201 55 186 54 2 阅读全文

posted @ 2019-04-22 20:05 随缘&不屈阅读(151) 评论(0) 推荐(0) 编辑

UVALive - 4287 - Proving Equivalences（强连通分量）

摘要： Problem UVALive - 4287 - Proving Equivalences Time Limit: 3000 mSec Problem Description Input Output Sample Input 2 4 0 3 2 1 2 1 3 Sample Output 4 2 阅读全文

posted @ 2019-04-22 16:57 随缘&不屈阅读(205) 评论(0) 推荐(0) 编辑

UVALive - 5135 - Mining Your Own Business（双连通分量+思维）

摘要： Problem UVALive - 5135 - Mining Your Own Business Time Limit: 5000 mSec Problem Description John Digger is the owner of a large illudium phosdex mine. 阅读全文

posted @ 2019-04-22 02:07 随缘&不屈阅读(245) 评论(0) 推荐(0) 编辑

UVALive - 3523 - Knights of the Round Table

摘要： Problem UVALive - 3523 - Knights of the Round Table Time Limit: 4500 mSec Problem Description Input The input contains several blocks of test cases. E 阅读全文

posted @ 2019-04-21 21:12 随缘&不屈阅读(204) 评论(0) 推荐(0) 编辑

UVALive - 4255-Guess（拓扑排序）

摘要： Problem UVALive - 4255-Guess Time Limit: 3000 mSec Problem Description Input The input consists of T test cases. The number of test cases T is given i 阅读全文

posted @ 2019-04-21 19:34 随缘&不屈阅读(260) 评论(0) 推荐(0) 编辑

UVA10054-The Necklace（无向图欧拉回路——套圈算法）

摘要： Problem UVA10054-The Necklace Time Limit: 3000 mSec Problem Description Input The input contains T test cases. The ﬁrst line of the input contains the 阅读全文

posted @ 2019-04-21 18:49 随缘&不屈阅读(435) 评论(0) 推荐(0) 编辑