2017年10月_Wang_128

原创 HDU3498-whosyourdaddy

whosyourdaddy Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)

2017-10-30 20:45:10 475

原创 HDU4979-A simple math problem.

A simple math problem. Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)

2017-10-30 20:29:56 333

原创 HDU3335-Divisibility

Divisibility Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

2017-10-30 20:21:11 325

原创 SPOJNQUEEN-Yet Another N-Queen Problem

NQUEEN - Yet Another N-Queen Problemno tags After solving Solution to the n Queens Puzzle by constructing, LoadingTime wants to solve a harder version of the N-Queen Problem. Some quee

2017-10-30 20:17:14 412

原创 HDU3663-Power Stations

Power Stations Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

2017-10-30 19:56:18 284

原创 HDU2295-Radar

Radar Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

2017-10-30 19:44:16 303

原创 HDU4069-Squiggly Sudoku

Squiggly Sudoku Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)

2017-10-30 19:36:50 365

原创 POJ1084-Square Destroyer

#include #include #include #include #include #include #include #include #include #include #include #include #include

2017-10-24 20:17:25 360

原创 HDU3656-Fire station

#include #include #include #include #include #include #include #include #include #include #include #include #include #include usi

2017-10-23 19:34:02 336

原创 ZOJ3209-Treasure Map

#include #include #include #include #include #include #include #include #include #include #include #include #include #include usi

2017-10-21 22:56:19 285

原创 FZU1686-神龙的难题

#include #include #include #include #include #include #include #include #include #include #include #include #include #include usi

2017-10-21 22:32:01 433

原创 HDU3529-Bomberman - Just Search!

#include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;#define L

2017-10-20 20:48:26 317

原创 HDU2828-Lamp

#include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;#define L

2017-10-20 19:28:37 291

原创 POJ3076-Sudoku

#include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #de

2017-10-20 17:58:52 543

原创 POJ3740-Easy Finding

#include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;#define LL long longconst int INF =

2017-10-20 16:52:11 233

原创 POJ3074-Sudoku

#include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;#define LL long longconst int INF =

2017-10-20 15:35:46 351

原创 POJ2676-Sudoku

#include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;#define LL long longconst int INF =

2017-10-20 15:22:58 248

原创 SPOJFTOUR2-Free tour II

FTOUR2 - Free tour IIno tags After the success of 2nd anniversary (take a look at problem FTOUR for more details), this 3rd year, Travel Agent SPOJ goes on with another discount tour.T

2017-10-18 12:49:39 350

原创 HDU4918-Query on the subtree

Query on the subtree Time Limit: 16000/8000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)

2017-10-18 12:13:23 301

原创 HDU4871-Shortest-path tree

Shortest-path tree Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 130712/130712 K (Java/Others)

2017-10-16 21:06:59 380

原创 HDU4670-Cube number on a tree

Cube number on a tree Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)

2017-10-16 20:56:56 368

原创 POJ2114-Boatherds

BoatherdsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 3049 Accepted: 1001DescriptionBoatherds Inc. is a sailing company operating in the country of

2017-10-16 20:51:16 310

原创 POJ1987-Distance Statistics

Distance StatisticsTime Limit: 2000MS Memory Limit: 64000KTotal Submissions: 2588 Accepted: 933Case Time Limit: 1000MSDescriptionFrustrated at the number

2017-10-16 20:49:01 331

原创 HDU4812-D Tree

D Tree Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 102400/102400 K (Java/Others)

2017-10-16 20:38:37 266

原创 HYSBZ4016-最短路径树问题

[FJOI2014]最短路径树问题Time Limit: 5 Sec Memory Limit: 512 MBSubmit: 1625 Solved: 565[Submit][Status][Discuss]Description给一个包含n个点，m条边的无向连通图。从顶点1出发，往其余所有点分别走一次并返回。往某一个点走时，选择总长度最短的路径走。若有多条长度最短

2017-10-16 20:29:30 406

原创 HYSBZ2152-聪聪可可

聪聪可可Time Limit: 3 Sec Memory Limit: 259 MBSubmit: 3775 Solved: 1939[Submit][Status][Discuss]Description聪聪和可可是兄弟俩，他们俩经常为了一些琐事打起来，例如家中只剩下最后一根冰棍而两人都想吃、两个人都想玩儿电脑（可是他们家只有一台电脑）……遇到这种问题，一般情况下石头

2017-10-16 20:28:03 265

原创 POJ1741-Tree

TreeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 24702 Accepted: 8256DescriptionGive a tree with n vertices,each edge has a length(positive integer

2017-10-16 20:23:40 226

原创 SPOJREPEATS-Repeats

REPEATS - Repeatsno tags A string s is called an (k,l)-repeat if s is obtained by concatenating k>=1 times some seed string t with length l>=1. For example, the strings = abaabaabaaba

2017-10-16 20:11:56 463

原创 SPOJDISUBSTR-Distinct Substrings

DISUBSTR - Distinct Substrings#suffix-array-8Given a string, we need to find the total number of its distinct substrings.InputT- number of test cases. TEach test case consists of

2017-10-15 23:25:36 271

原创 SPOJSUBST1-New Distinct Substrings

SUBST1 - New Distinct Substrings#suffix-array-8Given a string, we need to find the total number of its distinct substrings.InputT- number of test cases. TOutputFor each test

2017-10-15 23:06:27 232

原创 URAL1517-Freedom of Choice

Freedom of ChoiceTime limit: 2.0 secondMemory limit: 64 MBBackgroundBefore Albanian people could bear with the freedom of speech (this story is fully described in the problem "Freedom

2017-10-15 23:00:40 257

原创 SPOJPHRASES-Relevant Phrases of Annihilation

PHRASES - Relevant Phrases of Annihilationno tags You are the King of Byteland. Your agents have just intercepted a batch of encrypted enemy messages concerning the date of the planned a

2017-10-15 22:57:23 270

原创 POJ1226-Substrings

SubstringsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 14668 Accepted: 5172DescriptionYou are given a number of case-sensitive strings of alphabeti

2017-10-15 22:51:24 240

原创 POJ3623-Best Cow Line, Gold

Best Cow Line, GoldTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 5846 Accepted: 2034DescriptionFJ is about to take his N (1 ≤ N ≤ 30,000) cows to th

2017-10-15 22:45:16 270

原创 POJ3294-Life Forms

Life FormsTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 16301 Accepted: 4795DescriptionYou may have wondered why most extraterrestrial life forms re

2017-10-15 22:36:57 268

原创 URAL1297-Palindrome

PalindromeTime limit: 1.0 secondMemory limit: 64 MBThe “U.S. Robots” HQ has just received a rather alarming anonymous letter. It states that the agent from the competing «Robots Unlimite

2017-10-15 22:30:11 236

原创 POJ1743-Musical Theme

Musical ThemeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 31286 Accepted: 10437DescriptionA musical melody is represented as a sequence of N (1<=N<

2017-10-15 22:23:47 320

原创 Gym101194D-Ice Cream Tower

题意：给你n个冰激凌球的大小，一个冰激凌塔要k个冰激凌球，并且满足上下相邻的两个球，下面的球的质量大于等于其上面的那个球质量的两倍，问这n个冰激凌球最多构出几个冰激凌塔解题思路：二分能形成几个冰激凌塔#include #include #include #include #include #include #include #include #include #i

2017-10-12 19:53:29 441

原创 Gym101194L-World Cup

题意：有四个队伍，两两之间比赛，赢的得三分，输的不得分，平的各得一分，告诉你最后各个队伍的得分，问这个得分结果，每个队之间的比赛结果是不是唯一的，若是则输出Yes，若有解但不是唯一的则输出No，否则输出Impossible解题思路：dfs预处理出六次比赛的所有结果，然后进行统计#include #include #include #include #include #in

2017-10-12 19:49:40 473

原创 Gym101194F-Mr. Panda and Fantastic Beasts

题意：给你n个字符串，找出一个最短的字符串，使得这个字符串只是第一个字符串的子串解题思路：后缀数组+二分#include #include #include #include #include #include #include #include #include #include #include #include #include using nam

2017-10-12 19:47:39 495

空空如也

空空如也