Puya的博客

胜利大逃亡Time Limit : 4000/2000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 36   Accepted Submission(s) : 17Font: Times New Roman | Verdana | GeorgiaFont

DogsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2578    Accepted Submission(s): 997Problem DescriptionPrairie dog comes agai

Oil DepositsTime Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 55   Accepted Submission(s) : 33Font: Times New Roman | Verdana | Georgia

A very hard Aoshu problemTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1409    Accepted Submission(s): 958Problem DescriptionA

Bone CollectorTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 52273    Accepted Submission(s): 22025Problem DescriptionMany year

Sparse GraphTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 1604    Accepted Submission(s): 565Problem DescriptionIn graph the

SticksTime Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%lld & %lluSubmit Status Practice POJ 1011DescriptionGeorge took sticks of the same length and cut them ran

最大黑区域Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit Status Practice FZU 1082Description二值图像是由黑白两种像素组成的矩形点阵，图像识别的一个操作是求出图像中最大黑区域的面积。请设计一个程序完成

Strange Country IITime Limit: 1 Second      Memory Limit: 32768 KB      Special JudgeYou want to visit a strange country. There are n cities in the country. Cities are numbered from 1 to n.

GirlCatTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 699    Accepted Submission(s): 468Problem DescriptionAs a cute girl, Koto

SudokuTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 20364 Accepted: 9745 Special JudgeDescriptionSudoku is a very simple task. A square table wi

TudokuTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2447 Accepted: 1356DescriptionTom is a master in several mathematical-theoretical disciplines.

The Rotation Game UVA - 1343 #include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define ll long l

Ideal Path UVA - 1599 思路：从终点开始倒着bfs一次，得到每个点到终点的距离，然后从起点开始，按照每次距离减1的方法寻找接下来的点的编号。按照颜色最小的走，如果有多个颜色最小，则都拉入队列中，将最小的颜色记录在res数组中。细节：已经进入队列的节点不能重复入队，否则复杂度太高，会tle（重复入队的

迷宫城堡Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 19   Accepted Submission(s) : 8Font: Times New Roman | Verdana | GeorgiaFont S

Red and BlackTime Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 19   Accepted Submission(s) : 15Font: Times New Roman | Verdana | Georgia

Tempter of the BoneTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 97076    Accepted Submission(s): 26342Problem DescriptionThe

搜索训练——取数字Time Limit: 1 Sec  Memory Limit: 128 MBSubmit: 20  Solved: 16[Submit][Status][Web Board]Description给你n个数字，问能否从中取一些数字出来，使得取出来的数字的和为KInput第一行输入n(n第二行输入n个数字Output

逃离迷宫Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit StatusDescription　　给定一个m × n (m行, n列)的迷宫，迷宫中有两个位置，gloria想从迷宫的一个位置走到另外一个位置，当然迷宫中有些地方是空地，gloria

RescueTime Limit:2000MS     Memory Limit:65536KB     64bit IO Format:%lld & %lluSubmit StatusDescriptionAngel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison i

题目链接#include #include #include #include #include using namespace std;typedef long long LL;const int MAXN = 33;struct Node { int a[MAXN], len; void clear() { len = 0; }

NightmareTime Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 51   Accepted Submission(s) : 34Font: Times New Roman | Verdana | Georgia

FatMouse and CheeseTime Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 37   Accepted Submission(s) : 26Font: Times New Roman | Verdana | G

诡异的楼梯Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 131072/65536K (Java/Other)Total Submission(s) : 47   Accepted Submission(s) : 19Font: Times New Roman | Verdana | GeorgiaFon

Sum It UpTime Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 21   Accepted Submission(s) : 16Font: Times New Roman | Verdana | Georgia

变形课Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 131072/65536K (Java/Other)Total Submission(s) : 69   Accepted Submission(s) : 30Font: Times New Roman | Verdana | GeorgiaFont

连连看Time Limit : 20000/10000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 173   Accepted Submission(s) : 41Font: Times New Roman | Verdana | GeorgiaFon

Fire NetTime Limit:2000MS     Memory Limit:65536KB     64bit IO Format:%lld & %lluSubmit StatusDescriptionSuppose that we have a square city with straight streets. A map of a city is

N皇后问题Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 27   Accepted Submission(s) : 15Font: Times New Roman | Verdana | GeorgiaFont

DFSTime Limit : 5000/2000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 37   Accepted Submission(s) : 18Font: Times New Roman | Verdana | GeorgiaFont S

RXD and dividingTime Limit: 6000/3000 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 1344    Accepted Submission(s): 569Problem DescriptionRXD has