Menu Home

AtCoder Regular 099E: Independence

Problem Description: This problem is one that requires thoughts on complement graph. The official editorial has done a pretty good job in explanation.  Step: Convert into complement graph -> Find characteristic of this graph -> Bipartite graph -> Convert back -> Find minimum roads -> DP #include <iostream> #include <cstring> […]

BZOJ4027: Rabbits and Sakura [HEOI2015]

Problem Description: You are given a sakura tree(try to be descriptive). At each node of the tree(actually a tree structure!), there is a weight and children nodes. The rabbits want to remove as many nodes as possible on the sakura tree(don’t know why) while following the several rules. For each […]

BZOJ1556: The Secret of the Grave

Problem Description: You start at a point (sx,sy). There are T gravestones at on the map. You can destroy(diss joy?) a gravestone by touch the four sides that are adjacent to it. After destroying a gravestone, the gravestone turns into a wall, which you cannot pass through. As a Übermensch, […]

BZOJ3223: Artful SBT

Problem Description: Given a sequence comprised of numbers from 1 – N in order. There are M operations. Each operation will flip a sequence [l,r]. Please output the finally formed sequence. Input Format: One line with the number N and M. The next M lines contain two numbers l and […]

P2519: problem a [HAOI2011]

Problem Description: N students are in classroom, the ith student says there are students that have scores higher than me and students that have scores lower than me(There might exist same scores). Please give out the minimum possible number of students that are lying. Input Format: First line with one […]

HDU2896: Virus Infection

Problem Description: There are N computer viruses and M potential infected websites. Each virus and website can be described as a string. The task is to find which websites are infected by what kinds of viruses and the total number of infected websites with viruses.  Input Format: The first line […]

P2153: Exercise [SDOI2009]

Problem Description: There are N nodes and M edges, you can go through each node at most once, there are weights on the edges. Try to minimize the total weight going through 1 to N while maximizing the times you can go from 1 to N without passing through any […]

P2515: Software Installation [HAOI2010]

Problem Description: You have computer with M amount of storage. There are N softwares you are going to install on the computer. The ith computer takes amount of storage and has a value of . There are also dependencies between softwares. Specifically, the ith software can be installed only if   is installed. Every software […]