catTom的博客

D. Shovel Saletime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are n shovels in Polycarp's shop. The i

描述小Hi现在有n个物品，每个物品都有一个价值。并且这n个物品总共有m个不同的属性，每个物品都具有其中若干属性。小Ho要从中选出若干物品，满足每个属性都正好有奇数个物品拥有，且被选出的物品价值总和最大。你能帮助小Ho完成任务么？输入第一行一个数T(第一行两个数n，m（1接下来每两行描述一件物品。对于每一件物品：第一行两个数v和s，表示

题目3 : 区间价值时间限制:10000ms单点时限:1000ms内存限制:256MB描述给定n个数A1...An，小Ho想了解AL..AR中有多少对元素值相同。小Ho把这个数目定义为区间[L,R]的价值，用v[L,R]表示。例如1 1 1 2 2这五个数所组成的区间的价值为4。现在小Ho想知道在所有的的v[L,R](1

题目2 : 出勤记录II时间限制:10000ms单点时限:1000ms内存限制:256MB描述小Hi的算法课老师每次上课都会统计小Hi的出勤记录。迟到会被记录一个L，缺席会被记录一个A，按时上课会被记录一个O。一学期结束，小Hi的出勤记录可以看成是一个只包含LAO的字符串，例如"OOOOLOOOLALLO……"。如果小Hi整学期缺

C. Andryusha and Colored Balloonstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAndryusha goes through a

B. The Meeting Place Cannot Be Changedtime limit per test5 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe main road in Byt

C - Go HomeTime limit : 2sec / Memory limit : 256MBScore : 200 pointsProblem StatementThere is a kangaroo at coordinate 0 on an infinite number line that runs from left to right,

D. Timofey and rectanglestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOne of Timofey's birthday present

Each New Year Timofey and his friends cut down a tree of n vertices and bring it home. After that they paint all the n its vertices, so that the i-th vertex gets color ci.Now it's time for Timof

ProblemWe consider a number to be beautiful if it consists only of the digit 1 repeated one or more times. Not all numbers are beautiful, but we can make any base 10 positive integer beautiful by

竞赛中经常使用memset函数进行数组初始化，但只能初始为0， -1。哪怕写成：int num[N];memset(num, 1, sizeof(num));num[0]也是个很大的数。今天看了一下C标准库里面memset函数的源码，一切就清楚了void *(memset)(void *s, int c, size_t n){ const unsigned char uc

描述现在有一个有n个元素的数组a1, a2, ..., an。记f(i, j) = ai * ai+1 * ... * aj。初始时，a1 = a2 = ... = an = 0，每次我会修改一个ai的值，你需要实时反馈给我 ∑1 f(i, j)的值 mod 10007。输入第一行包含两个数n(1接下来q行，每行包含两个数i, x，代表我把ai的值改为了

In the ever-popular role-playing game Dungeons & Dragons, or D&D, some wizards enhance their skills by training as geometers, specialist spell-casters who rely on th

Facebook Hacker Cup 2016 Qualification RoundYou have a list of N distinct words, consisting of only lowercase letters. You'd like to print any K words from this list, one per page, in any or

Problem A. Password AttackerThis contest is open for practice. You can try every problem as many times as you like, though we won't keep track of which problems you solve. Read the Quick-Start

Facebook Hacker Cup 2016 Round 1注意Laundro, Matt20 pointsDownload InputChoose OutputNo output file selectedSubmitMatt Laundro i

描述H国正在进行一项持续N周的填海造岛工程。整片工程海域可以被看作是1000x1000的网格。每周都有一块1x1的单位方格海域被填成陆地。如果我们将连成一片的陆地（一块单位方格与它上下左右4个单位方格是相连的）视为岛屿，H国想监测每周末整片海域中一共存在有多少个岛屿，以及这些岛屿的总面积和总周长各是多少。假设工程持续三周，第一周被填的海域坐标是(0, 0)，那么第一周结

描述小Hi有一棵N个节点的树，编号1-N，其中1号节点是整棵树的根。他把这棵树的N-1条边记录成N-1行，每行2个整数a和b，表示a是b的父节点。  喜欢恶作剧的小Ho在小Hi的记录里加了一行两个整数，于是小Hi不得设法找出这行可疑的记录。具体来说，如果去掉某一行之后，余下N-1行按小Hi的规则（a是b的父节点）恰好能构成一棵N个节点的树，并且满足编号恰好是1-N且1号节点是根，那么被去掉

题目1 : 偶像的条件时间限制:10000ms单点时限:1000ms内存限制:256MB描述小Hi的学校正面临着废校的大危机。面对学校的危机，小Hi同学们决定从ABC三个班中各挑出一名同学成为偶像。  成为偶像团体的条件之一，就是3名团员之间的身高差越小越好。  已知ABC三个班同学的身高分别是A1..AN, B1..BM 和

#1643 : 最少换乘时间限制:10000ms单点时限:1000ms内存限制:256MB描述小Ho居住的城市有N条公交车线路，其中第i条线路上有Ki个车站。  某些线路之间会有公共的车站，小Ho可以在这些车站从一条线路换乘到另一条线路。  现在给定N条公交车线路以及两个车站S和E，你能帮助小Ho计算从S到E最少换乘几次公交车吗？

D. Credit Cardtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputRecenlty Luba got a credit card and started

#1619 : “共同富裕”时间限制:10000ms单点时限:1000ms内存限制:256MB描述给定一个数组A1, A2, ... AN，每次操作可以从中选定一个元素Ai，把除了Ai之外的所有元素都加1。  问最少几次操作可以实现“共同富裕”，即数组中所有元素都相等。例如对于[1, 1, 1, 2, 3]经过3步:[1,

B. Ralph And His Magic Fieldtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputRalph has a magic field which i

C. Marco and GCD Sequencetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn a dream Marco met an elderly ma

#1620 : 股票价格3时间限制:10000ms单点时限:1000ms内存限制:256MB描述小Hi最近在关注股票，为了计算股票可能的盈利，他获取了一只股票最近N天的价格A1~AN。  小Hi想知道，对于第i天的股票价格Ai，几天之后股价会第一次超过Ai。  假设A=[69, 73, 68, 81, 82]，则对于A1=

D. Disdain ChainTime Limit: 2000msCase Time Limit: 2000msMemory Limit: 262144KB64-bit integer IO format: %lld      Java class name: MainSubmit Status PID: 52503Font Size: +

Problem C. Matrix CuttingThis contest is open for practice. You can try every problem as many times as you like, though we won't keep track of which problems you solve. Read the Quick-Start

Problem B. Cards GameThis contest is open for practice. You can try every problem as many times as you like, though we won't keep track of which problems you solve. Read the Quick-Start Guid

roblem A. Huge NumbersThis contest is open for practice. You can try every problem as many times as you like, though we won't keep track of which problems you solve. Read the Quick-Start Gui

C. Bertown Subwaytime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe construction of subway in Bertown is a

度度熊的01世界  Accepts: 967  Submissions: 3064 Time Limit: 2000/1000 MS (Java/Others)  Memory Limit: 32768/32768 K (Java/Others)Problem Description度度熊是一个喜欢计算机的孩子，在计算机的世界中，所有

#1305 : 区间求差时间限制:10000ms单点时限:1000ms内存限制:256MB描述给定两个区间集合 A 和 B，其中集合 A 包含 N 个区间[ A1, A2 ], [ A3, A4 ], ..., [ A2N-1, A2N ]，集合 B 包含 M 个区间[ B1, B2 ], [ B3, B4 ], ...,

Problem StatementAlice and Brown loves games. Today, they will play the following game.In this game, there are two piles initially consisting of X and Y stones, respectively. Alice and Bob alter

#1515 : 分数调查时间限制:10000ms单点时限:1000ms内存限制:256MB描述小Hi的学校总共有N名学生，编号1-N。学校刚刚进行了一场全校的古诗文水平测验。  学校没有公布测验的成绩，所以小Hi只能得到一些小道消息，例如X号同学的分数比Y号同学的分数高S分。  小Hi想知道利用这些消息，能不能判断出某两位同学之间

The Price is Correct25 pointsDownload InputChoose OutputNo output file selectedSubmitYou've managed to become a contestant on the hottest new game show, T

High Security25 pointsDownload InputChoose OutputNo output file selectedSubmitA top-secret algorithmic research facility has decided to up its security by

因为这个客户端经常更新，之前的老是登陆不了，所以，记录一下。http://community.topcoder.com/tc?module=Static&d1=applet&d2=partial-support

D. Balltime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputN ladies attend the ball in the King's palace. Ever

JapanTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 16970 Accepted: 4552DescriptionJapan plans to welcome the ACM ICPC World Finals and a lot of roads

GDCPC2013，第一次参加省赛。恩还是自费的。得益于队友强大，拿了个铜。从试机开始说起，三个人被志愿者领着饶了个大圈去院楼。其实当时挺紧张的，不知怎么得聊到了楼天成的比赛风格，一人读题，一人扇风，楼教主一人虐全场。我们笑了笑算是不太紧张了。院楼正门是那样的，也是才知道，以前以为那个是后门的。不让走电梯，必须爬楼梯。我们分析一个是人太多，另一个吗，院楼楼梯不安全，我们曾经被困过。说下试机