Second week of on-campus test (East! XVI ~ East! XX) Summary (Revelation of abuse, xvi on campus

Second week of on-campus test (East! XVI ~ East! XX) Summary (Revelation of abuse, xvi on campus

Meow ....

It's a big deal of abuse...

Day1 East! XVI question: 18357

T1: Minimum Cut of Water Binary relationship

-- A picture shows you how to understand it]

Only 16bitwar showed that this result was an explosion in almost all fields.

T2: water combination mathematics

The last vertex is read beyond the int range.

So the egg is stuck at a point.

T3: Water priority queue

No, AC. Sorry, QAQ.

As a result, it is 200 rough.

Summary:

1. Read the question carefully if you do not guarantee that the person with a good mentality is not stupid.

2. The biggest point in the data range is not necessarily the last one.

3. If you don't need a combination of mathematical questions, you are advised to enable long, or pay more attention to whether long will pop up.

4. I fuck your mom.

Day2 East! Question XVII: wyfcyx

T1: BZOJ 3853 GCD Array

No, brute force 30 rollback

T2: Given a tree, there are some black spots. It is required that all black spots be inserted into a connected subgraph of the tree to obtain the minimum cost.

The 3.5h is about to start writing the results. The asshole handed in the results, but they couldn't write it anymore. They just handed in this question and didn't write it.

Positive solution is a very troublesome tree-like DP = seeing the data range 50 I thought about searching for half a day =

18357 million fraud points cannot be tolerated by the AC

T3: Given a tree, each vertex has a valid value. The maximum number and Σ k that can be obtained from k intervals are obtained on a chain multiple times. <= 4 W

Every time a range is taken away, this interval is reversed, and then k times can be taken, and then restored.

So I am the only one in the AC?

Summary:

1. Don't be confused with the ability to give in advance.

2. It is good to use multiple push statements.

Day3: East! XVIII: PoPoQQQ

T1: BZOJ 3738 ONTAK2013 kap2013

If no one writes the correct solution, it will give 50 points and the highest score of the violent result is 30 ....

T2: BZOJ 3897 Power

After all my data is done, Gromah tells me that this question has been uploaded to the BZ, and it cannot be tolerated =

I'm so drunk when I talk about all kinds of violence and writing...

T3: BZOJ 3165 HEOI2013 Segment

It's my fault to get stuck.-At first, I forgot to shut down O2. I was attacked for 9 points...

Wyfcyx gets stuck--Eolv writes double into int---the remaining pile of brute force is simply...

Writing half-plane traffic is also better than brute force traffic =

Summary:

1.18357 reflects my difficulties? Next Round in the row.

(Junior high school class teacher: as long as the level is there, any set of questions can be separated to the level

Even if I make it simple, do I have to write or do it?

I am not familiar with the code.

2. Do not do the question or leave it blank = (not this Round

3. The best way to avoid card accuracy... Write a few more partial explanations to see if it will be refined...

4. I, I, and I are dummies ....

Day4: East! XIX: 16 bitwar

T1: BZOJ 3695 slide

I did not write iteration + binary for the shortest principle, and there were nine points after constant and accuracy, and the last point was 0.01 =

Has Eolv expired? Haoqiang =

Original question n <= 100 instead of 10 W is really good QAQ

T2: given n strings, two pattern strings A and B are given each time. It is required that the number of strings meet the requirements that the suffix is A prefixed with B and is forced to be online.

Confident bitset, confident MLE, confident

Wyfcyx writes the Hash + Chairman tree of 5 k +, and then A is lost... Too strong

The Eolv dared to write the omnipotent AC code...

T3: Given n non-intersecting and non-tangent circles, each circle has a weight value. Some circles are selected to maximize the total weight value. Two Circles must not contain

The Splay maintains the scanning line + tree-like DP and writes 1.5 h. The result is that T has RE. Why is the Splay constant too large? But RE does not understand =. Is precision suspended?

Finally, I got 68 points and 60 points of brute force attacks. Why...

But is the total Brute Force rated 32 points? What is the situation?

Summary:

1. Pay attention to memory! Open the memory pool dynamically! Do not be confident about the static memory pool! Meow!

2. In addition, I am quite satisfied with the good performance of various fraud scores... I did my best to solve the last question...

OTZ 18357 believes that this first question is "too nooi" and refuses to answer questions and brush Mobius for retrieval. Then, it is shown by the [OI practices] of my first question?

Day5: East! XX subject: Eolv

Before you begin, there will be too many other problems.

T1: Water AC Automation

No. A is not enough for the civilian to get angry. However, the question below is basically not.

Kneeling 16bitwar's 6-dimensional DP... A is terrible.

T2: defines the value of a certain position of a square matrix = pyramid matrix value of this position * spiral matrix value of this position * inverse spiral matrix Value

Multiple queries to the sum of a child Matrix

Not written.

T3: maintain a Treap and calculate the distance between two points multiple times.

Brute-force 80, do you believe it?

I know how to do this, write it for h, and then write it with confidence.

After the call is made, the key constant is 4 points.

Directly simulate 80 !!

Replacing the line segment tree with blocks is really a wrong choice...

Summary:

I have nothing to say.

This week is really bad.

It is not the result of the test. It is easy to write all kinds of Positive Solutions of various violent marking processes...

It's the kind of [completely wrong estimation of Data strength] That makes people have nothing to say...

In the final analysis, the level of the subject is too low, including I am too weak.