Mitsuha_的博客

原创 ACM-ICPC 2017 Asia Urumqi： H. Count Numbers（DP+矩阵快速幂优化）

Now Alice wants to sum up all integers whose digit sum is exactly a^b.However we all know the number of this kind of integers are unlimited. So she decides to sum up all these numberswhose each digit ...

原创 Codeforces-935C：Fifa and Fafa

C. Fifa and Fafatime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputFifa and Fafa are sharing a flat. Fifa loves video games and wants to download a ne...

原创 Codeforces-935D： Fafa and Ancient Alphabet（DP）

Codeforces-935D： Fafa and Ancient Alphabet（DP）Ancient Egyptians are known to have used a large set of symbols to write on the walls of the temples. Fafa and Fifa went to one of the temples and found two non-empty words S1 and S2 of equal lengths on the wa

原创 Codeforces-932D：Tree（倍增法）

Codeforces-932D：Tree（倍增法）You are given a node of the tree with index 1 and with weight 0. Let cnt be the number of nodes in the tree at any instant (initially, cnt is set to 1). Support Q queries of following two types:

原创 Codeforces-939D：Love Rescue（并查集）

D. Love Rescuetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputValya and Tolya are an ideal pair, but they quarrel sometimes. Recently, Valya took ...

原创 Codeforces Round #462 (Div. 2)：C. A Twisty Movement（预处理）

C. A Twisty Movementtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputA dragon symbolizes wisdom, power and wealth. On Lunar New Year's Day, people m...

原创 ACM-ICPC 2017 Asia Urumqi： D. Fence Building（递推//矩阵快速幂）

Farmer John owns a farm. He first builds a circle fence. Then, he will choose n points and build some straight fences connecting them. Next, he will feed a cow in each region so that cows cannot play ...

原创 ACM-ICPC 2017 Asia Urumqi： K. Sum of the Line（容斥）

Consider a triangle of integers, denoted by T. The value at (r,c) is denoted by Tr,c​, where 1≤r and 1≤c≤r. If the greatest common divisor of r and c is exactly 1, Tr​,c=c, or 0 otherwise.Now, we have...

原创 ACM-ICPC 2017 Asia Urumqi：A. Coins（DP）

Alice and Bob are playing a simple game. They line up a row of n identical coins, all with the heads facing down onto the table and the tails upward.For exactly m times they select any k of the coins ...

原创 HDU-4619：Warm up 2（二分图最大独立集）

Warm up 2                                                                   Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)                                         ...

原创 hihocoder#1685 : 最大子矩阵2（二分）

时间限制:10000ms单点时限:1000ms内存限制:256MB描述给定一个N × M的矩阵A和一个整数K，小Hi希望你能求出其中最大（元素数目最多）的子矩阵，并且该子矩阵中所有元素的和不超过K。输入第一行包含三个整数N、M和K。  以下N行每行包含M个整数，表示A。  对于40%的数据，1 ≤ N, M ≤ 100    对于100%的数据，1 ≤ N, M ≤ 300 -2147483647...

原创 HUD-4417：Super Mario（二分+划分树）

Super Mario                                                            Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)                                              ...

原创 ACM-ICPC 2017 Asia Nanning-I：Rake It In（DFS）

原创 ACM-ICPC 2017 Asia Nanning-J：Rearrangement（思维）

In a two dimensional array of integers of size 2 \times n2×n, is it possible to rearrange integers so that the sum of two adjacent elements (which are adjacent in a common row or a common column) is n...

原创 POJ-2761：Feed the dogs（划分树）

Feed the dogsTime Limit: 6000MS Memory Limit: 65536KTotal Submissions: 21924 Accepted: 6959DescriptionWind loves pretty dogs very much, and she has n pet dogs

原创 POJ-2104：K-th Number（划分树）

K-th NumberTime Limit: 20000MS Memory Limit: 65536KTotal Submissions: 63091 Accepted: 22209Case Time Limit: 2000MSDescriptionYou are working for Macroha

原创 Codeforces-920F：SUM and REPLACE（set+树状数组）

Codeforces-920F：SUM and REPLACE（set+树状数组）Let D(x) be the number of positive divisors of a positive integer x. For example, D(2) = 2 (2 is divisible by 1 and 2), D(6) = 4 (6 is divisible by 1, 2, 3 and 6).You are given an array a of n integers. You have to