POJ
文章平均质量分 88
TooSIMple_
十倍努力做突出一个!
展开
-
POJ3537 Crosses and Crosses (Multi-SG)
Crosses and CrossesTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 4059 Accepted: 1591Case Time Limit: 2000MSDescriptionThe game of Crosses and Crosses is played on the field of 1 × n cells....原创 2018-03-13 17:20:53 · 280 阅读 · 0 评论 -
POJ3295 Tautology (模拟)
附题目链接http://poj.org/problem?id=3295题目大意:给定一个字符串,有特定的字符作为逻辑运算符,求给定字符串最后的计算结果。思路:给定一个逻辑运算,逻辑运算符肯定在运算数的前面,所以最好的方法是从后往前运算。首先,在计算的时候,应该把每个字符用0 or 1随机表示出来,最多有5种运算数字符,所以把32转化成二进制数进行运算即可。用二进制数来表示随机运算数。另外,原创 2017-07-17 18:18:32 · 262 阅读 · 0 评论 -
POJ1573 Robot Motion (模拟 | 递归)
附poj1573题目链接http://poj.org/problem?id=1573题目大意:有一个robot要走迷宫,迷宫的每个点是由NWES四个组成的,每一个字符代表一个方向,其中N向上S向下E向右W向左。现在已知robot在第一行的某列的入口处c,问robot走出迷宫要多少步,或者如果走不出迷宫,则在第几步开始进入陷阱并在陷阱内走了多少步。思路:只要robot能够越界则就可以原创 2017-07-17 17:38:07 · 267 阅读 · 0 评论 -
POJ1753 Flip Game & POJ2965 The Pilots Brothers' refrigerator (DFS)
附poj1753题目链接http://poj.org/problem?id=1753题目大意:在一个4*4的棋盘上共有棋子16个,每个棋子都是一面白一面黑,现在给你的任务就是使得棋子翻转最少的次数使得棋子朝上的一面要么全是白色要么全是黑色。每次翻转一个棋子该棋子的上下左右四个方向的棋子也同时会被翻转。思路:一共有16个棋子,每个棋子有两种选择,又因为每个棋子如果翻转两遍,就相当于没原创 2017-07-17 17:22:05 · 176 阅读 · 0 评论 -
POJ2996 & POJ2993 (模拟)
附problem 2996 题目链接http://poj.org/problem?id=2996思路:所给的每个棋子的数目是固定的,所以根据棋盘棋子的摆放和输出结果找规律模拟出来就好。要注意的是:所有的棋子都是按照KQRBNP的顺序输出的,但白棋和黑棋的遍历顺序不同,白棋按照行从大到小,列从小到大的顺序,黑棋按照行列都从小到大的顺序遍历。AC代码入下:#include #in原创 2017-07-17 16:59:34 · 293 阅读 · 0 评论 -
POJ1979 Red and Black (DFS)
Red and BlackTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 35948 Accepted: 19462DescriptionThere is a rectangular room, covered with square tiles. E原创 2017-07-07 10:57:57 · 177 阅读 · 0 评论 -
POJ2386 Lake Counting (DFS)
Lake CountingTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 35370 Accepted: 17562DescriptionDue to recent rains, water has pooled in various places i原创 2017-07-06 21:27:18 · 195 阅读 · 0 评论 -
POJ3669 Meteor Shower (BFS)
Meteor ShowerTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 20419 Accepted: 5294DescriptionBessie hears that an extraordinary meteor shower is coming;原创 2017-07-15 22:18:52 · 333 阅读 · 0 评论 -
POJ1679 The Unique MST(判断最小生成树是否唯一)
The Unique MSTTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 29791 Accepted: 10664DescriptionGiven a connected undirected graph, tell if its minimum原创 2017-04-09 21:53:28 · 355 阅读 · 0 评论 -
POJ1847 Tram(最短路径)
TramTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 15377 Accepted: 5653DescriptionTram network in Zagreb consists of a number of intersections and ra原创 2017-05-04 15:44:12 · 228 阅读 · 0 评论 -
POJ2366 Wireless Network(并查集)
Wireless NetworkTime Limit: 10000MS Memory Limit: 65536KTotal Submissions: 27279 Accepted: 11286DescriptionAn earthquake takes place in Southeast Asia. The ACM原创 2017-04-18 19:46:14 · 364 阅读 · 0 评论 -
POJ1703 Find them, Catch them(并查集+向量偏移)
Find them, Catch themTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 44767 Accepted: 13791DescriptionThe police office in Tadu City decides to say end原创 2017-04-18 21:55:14 · 290 阅读 · 0 评论 -
POJ3041 Asteroids (最小顶点覆盖)
AsteroidsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 22298 Accepted: 12084DescriptionBessie wants to navigate her spaceship through a dangerous as原创 2017-05-02 21:03:29 · 335 阅读 · 0 评论 -
POJ1308 Is It A Tree?
Is It A Tree?Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 32054 Accepted: 10876DescriptionA tree is a well-known data structure that is either empt原创 2017-04-14 20:57:23 · 319 阅读 · 0 评论 -
POJ1068 Parencodings (模拟)
附题目链接http://poj.org/problem?id=1068题目大意:P序列:a[i]表示第i个右括号')'前的左括号'('数目。W序列:表示第i个完整的"()"内包括多少完整的括号对,也包括第i个括号对本身。题目求得就是W序列。思路:已知P序列,通过P序列给所有左括号匹配右括号,存储在str[]中,即str[]中存储的是'('')'括号的组合。然后遍历str[],当str[i]原创 2017-07-17 18:31:43 · 248 阅读 · 0 评论 -
POJ3009 Curling 2.0 (DFS)
Curling 2.0Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 21478 Accepted: 8754DescriptionOn Planet MM-21, after their Olympic games this year, curlin原创 2017-07-08 11:39:51 · 242 阅读 · 0 评论 -
POJ3468 A Simple Problem with Integers (树状数组 | 线段树)
题目链接:http://poj.org/problem?id=3468方法一:树状数组 区间修改区间查询问题。讲一下关于树状数组区间修改和区间查询的问题的解决方法。设a[i]为原数组,d[i] = a[i] - a[i-1],其中a[0] = 0; 递推一下: d[2] = a[2] - a[1] d[3] = a原创 2017-08-03 20:56:33 · 217 阅读 · 0 评论 -
POJ2315 Football Game (Nim & Bash)
Football GameTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 362 Accepted: 125DescriptionAlice and Bob both love football very much, and both of them ar原创 2018-03-16 21:35:13 · 322 阅读 · 0 评论 -
POJ1740 A New Stone Game (博弈)
A New Stone GameTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 6214 Accepted: 3394DescriptionAlice and Bob decide to play a new stone game.At the beg原创 2018-03-01 09:07:26 · 210 阅读 · 0 评论 -
POJ2311 Cutting Game (博弈)
Cutting GameTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4794 Accepted: 1753DescriptionUrej loves to play various types of dull games. He usually a原创 2018-02-17 22:48:59 · 222 阅读 · 0 评论 -
POJ1704 Georgia and Bob(博弈)
Georgia and BobTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 11346 Accepted: 3746DescriptionGeorgia and Bob decide to play a self-invented game. The原创 2018-02-17 22:42:41 · 252 阅读 · 0 评论 -
POJ2425 A Chess Game (博弈)
Language:DefaultA Chess GameTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 4327 Accepted: 1747DescriptionLet's design a new chess game. There are N positions to hold M chesses in this game....原创 2018-02-28 09:30:40 · 382 阅读 · 0 评论 -
POJ2960 S-Nim (sg博弈模板)
S-NimTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 4655 Accepted: 2438DescriptionArthur and his sister Caroll have been playing a game called Nim fo原创 2018-02-28 09:19:32 · 276 阅读 · 0 评论 -
POj2348 Euclid's Game (博弈)
Euclid's GameTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9928 Accepted: 4063DescriptionTwo players, Stan and Ollie, play, starting with two natural numbers. Stan, the first player, subtr...原创 2018-02-14 22:48:18 · 171 阅读 · 0 评论 -
POJ2975 Nim (Nim博弈)
NimTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6393 Accepted: 3043DescriptionNim is a 2-player game featuring several piles of stones. Players a原创 2018-02-26 16:13:12 · 171 阅读 · 0 评论 -
POJ3616 Milking Time (dp)
Milking TimeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10738 Accepted: 4507DescriptionBessie is such a hard-working cow. In fact, she is so focus原创 2017-09-11 20:30:39 · 204 阅读 · 0 评论 -
POJ2385 Apple Catching (dp)
Apple CatchingTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 13261 Accepted: 6448DescriptionIt is a little known fact that cows love apples. Farmer J原创 2017-09-10 21:34:03 · 298 阅读 · 0 评论 -
POJ3046 Ant Counting (多重集合组合dp)
Ant CountingTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6170 Accepted: 2287DescriptionBessie was poking around the ant hill one day watching the a原创 2017-09-10 10:47:52 · 279 阅读 · 0 评论 -
POJ2229 Sumsets (dp)
SumsetsTime Limit: 2000MS Memory Limit: 200000KTotal Submissions: 20004 Accepted: 7814DescriptionFarmer John commanded his cows to search for different sets of nu原创 2017-09-10 10:15:49 · 206 阅读 · 0 评论 -
POJ3280 Cheapest Palindrome (区间dp)
Cheapest PalindromeTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 10629 Accepted: 5094DescriptionKeeping track of all the cows can be a tricky task s原创 2017-09-13 20:46:16 · 177 阅读 · 0 评论 -
POJ2524 Ubiquitous Religions (并查集)
Ubiquitous ReligionsTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 34137 Accepted: 16488DescriptionThere are so many different religions in the world原创 2017-04-15 21:45:27 · 319 阅读 · 0 评论 -
POJ1988 Cube Stacking
Cube StackingTime Limit: 2000MS Memory Limit: 30000KTotal Submissions: 24990 Accepted: 8750Case Time Limit: 1000MSDescriptionFarmer John and Betsy are pla原创 2017-04-15 19:30:51 · 233 阅读 · 0 评论 -
POJ3625 Building Roads
Building RoadsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11366 Accepted: 3224DescriptionFarmer John had just acquired several new farms! He wants t原创 2017-04-13 20:06:37 · 226 阅读 · 0 评论 -
POJ2395 Out of Hay
Out of HayTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 16481 Accepted: 6450DescriptionThe cows have run out of hay, a horrible event that must be r原创 2017-04-12 17:08:59 · 245 阅读 · 0 评论 -
POJ3660 Cow Contest
Cow ContestTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10756 Accepted: 5992DescriptionN (1 ≤ N ≤ 100) cows, conveniently numbered 1..N, are partic原创 2017-02-28 21:14:38 · 322 阅读 · 0 评论 -
POJ2250 Compromise (LCS)
CompromiseTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8369 Accepted: 3600 Special JudgeDescriptionIn a few months the European Currency Union原创 2017-02-15 21:56:08 · 291 阅读 · 0 评论 -
POJ2488 A Knight's Journey (DFS)
A Knight's JourneyTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 43581 Accepted: 14821DescriptionBackground The knight is getting bored of seeing t原创 2017-02-21 22:55:12 · 197 阅读 · 0 评论 -
POJ 2299 Ultra-QuickSort (归并排序)
In this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping two adjacent sequence elements until the sequence is sorted i原创 2017-01-20 11:19:13 · 235 阅读 · 0 评论 -
POJ1426 Find The Multiple (BFS | DFS)
Find The MultipleTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%lld & %lluDescriptionGiven a positive integer n, write a program to find out a nonzero multiple m of原创 2016-11-26 09:56:16 · 245 阅读 · 0 评论 -
POJ 3126 Prime Path (BFS)
DescriptionThe ministers of the cabinet were quite upset by the message from the Chief of Security stating that they would all have to change the four-digit room numbers on their offices. — It原创 2016-11-26 12:26:27 · 218 阅读 · 0 评论