龙崎的专栏

The Tourist GuideInput: standard inputOutput: standard output Mr. G. works as a tourist guide.His current assignment is to take some tourists from one city to another. Sometwo-way roads connec

Online JudgeOnline ExerciseOnline TeachingOnline ContestsExercise AuthorF.A.QHand In HandOnline AcmersForum | DiscussStatistical ChartsProblem ArchiveRealtime Judge Statu

这题重点是在蛋疼的大数相加。。。

Language:DefaultPhone ListTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 22737 Accepted: 7030DescriptionGiven a list of phone numbers, determ

Online JudgeOnline ExerciseOnline TeachingOnline ContestsExercise AuthorF.A.QHand In HandOnline AcmersForum | DiscussStatistical ChartsProblem ArchiveRealtime Judge Statu

Online JudgeOnline ExerciseOnline TeachingOnline ContestsExercise AuthorF.A.QHand In HandOnline AcmersForum | DiscussStatistical ChartsProblem ArchiveRealtime Judge Statu

C. Watto and Mechanismtime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputWatto, the owner of a spare parts store, has r

DescriptionFOTILE得到了一个长为N的序列A，为了拯救地球，他希望知道某些区间内的最大的连续XOR和。即对于一个询问，你需要求出max(Ai xor Ai+1 xor Ai+2 ... xor Aj)，其中l为了体现在线操作，对于一个询问(x,y)：l = min ( ((x+lastans) mod N)+1 , ((y+lastans) mod N)+1 

Good FirewallTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 663 Accepted Submission(s): 177Problem Description Professor X is an expert in

转自：这里写链接内容 题意：有两个字符串集合，从第一个集合中取某个串的非空前缀，从第二个集合中取某个串的非空后缀，拼接成一个串，问有多少个不同的新串。 思路：首先把第一个集合中的串加入到Trie中，然后就可以枚举前缀了，然后就是统计后缀，麻烦的是可能出现重复的。当我们按长度枚举前缀的时候，可以考虑如果后缀的前缀出现在前缀的后继中，那便不用考虑，后面总会统计到。这样的话，其实只要比较第一个字母。如

C. Arthur and TableArthur has bought a beautiful big table into his new flat. When he came home, Arthur noticed that the new table is unstable.In total the table Arthur bought has n legs, the length of

ZYB loves Xor I问题描述ZYB喜欢研究Xor，现在他得到了一个长度为n的数组A。于是他想知道：对于所有数对(i,j)(i∈[1,n],j∈[1,n])，lowbit(AixorAj)之和为多少.由于答案可能过大，你需要输出答案对998244353取模后的值定义lowbit(x)=2k，其中k是最小的满足(x and 2k)>0的数特别地：lowbit(0)=0输入

CRB and CandiesProblem DescriptionCRB has N different candies. He is going to eat K candies. He wonders how many combinations he can select. Can you answer his question for all K(0≤K≤N)?K(0 ≤ K ≤ N)?

Online JudgeOnline ExerciseOnline TeachingOnline ContestsExercise AuthorF.A.QHand In HandOnline AcmersForum | DiscussStatistical ChartsProblem ArchiveRealtime Judge Statu

Online JudgeOnline ExerciseOnline TeachingOnline ContestsExercise AuthorF.A.QHand In HandOnline AcmersForum | DiscussStatistical ChartsProblem ArchiveRealtime Judge Statu

Online JudgeOnline ExerciseOnline TeachingOnline ContestsExercise AuthorF.A.QHand In HandOnline AcmersForum | DiscussStatistical ChartsProblem ArchiveRealtime Judge Statu

题意：给出一个字符串和S个单词组成的字典，问把这个字符串分解成若干单词的连接，总共有多少种？（单词可重复）思路：令d[i]表示从字符i开始的字符串的分解方案数，则dans[i]=sum{dans[i+d[x]] | 单词x是S[i...len]的前缀};#include#include#include#include#includeusing namespace std;typ

Trie树|字典树的简介Trie,又称字典树、单词查找树,是一种树形结构，用于保存大量的字符串，其核心思想是空间换时间。它的优点是：利用字符串的公共前缀来节约存储空间。相对来说,Trie树是一种比较简单的数据结构.理解起来比较简单,正所谓简单的东西也得付出代价.故Trie树也有它的缺点,Trie树的内存消耗非常大.当然,或许用左儿子右兄弟的方法建树的话,可能会好点.其基本性质可以归纳为：1

指针实现：class trie { public: trie* next[26]; int num; //记录前缀的个数 bool value;//标记这里是不是一个单词 trie() { for(int i=0;i<26;i++) next[i]=0;

题意：给出n个字符串，进行两两比较，计算比较的次数。刚开始用指针写，发现这样写保存信息的时候不好计算，于是学习刘汝佳的儿子兄弟表示，这样建树统计分差点的比较次数是非常方便。#include#include#include#includeusing namespace std;const int maxn=4000*1000*10;int n;struct trie{

这题的输入有点坑#include#include#include#includeusing namespace std;const int maxn=1510;int n,m;char a[maxn][100],b[maxn][100],x[100];int main(){ //freopen("in.txt","r",stdin); int t; s

题意：给定一个字符串集合S，定义P（S）为所有字符串的公共前缀长度与S中字符串个数的乘积，比如P（{000,001,0011}） = 6.给N个01串，从中选出一个集合S，使得P(S)最大。思路：建立Trie树，插入的过程中记录经过该节点的字符串个数，更新最大值#include#include#include#includeusing namespace std;const in

太弱了。。。

3267. D-queryProblem code: DQUERY  EnglishVietnameseGiven a sequence of n numbers a1, a2, ..., an and a number of d-queries. A d-query is a pair (i, j) (1 ≤ i ≤

Online JudgeOnline ExerciseOnline TeachingOnline ContestsExercise AuthorF.A.QHand In HandOnline AcmersForum | DiscussStatistical ChartsProblem ArchiveRealtime Judge Statu

Language:DefaultWord PuzzlesTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 9513 Accepted: 3543 Special JudgeDescriptionWord puzzles are usu

Language:DefaultWild WordsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 4681 Accepted: 1221DescriptionA word is a string of lowercases. A word

Language:DefaultColored SticksTime Limit: 5000MS Memory Limit: 128000KTotal Submissions: 30307 Accepted: 8007DescriptionYou are given a bunch of wooden st

A - Sudoku ExtensionSudoku is a logic-based, combinatorial number-placement puzzle. The objective is to fill a 9 x 9 grid so that each column, each row, and each of the nine 3 x 3 boxes (also called bl