We are still on our way to dream-Summary of the sixth ACM competition in Shandong Province, acm in Shandong Province

We are still on our way to dream-Summary of the sixth ACM competition in Shandong Province, acm in Shandong Province

The results of the competition reached expectations (Gold Medal), which is far from my expectation in terms of the process (the competition was too messy and I played poorly). Fortunately, my teammates resisted the pressure at the crucial moment, the consequences are really unimaginable.

Warm-up match

The warm-up competition is purely for machine testing. First, the, B, and C caocaoshui (the lower case of question A x is also drunk). I started various testing machines with the old high school, long enough is expected to be lld. I tried the re problem except for 0 and array out-of-bounds, and found that there is no re, only wa (or even array out-of-bounds AC ), as for the depth of the stack, we didn't investigate the issue too much. What hurts a lot is that we don't know the question's time limit. When the test times out, we use question B to test it, at that time, we ran 1 billion of the cycle and had not timed out. I really don't know how long the background gave me this question. orz = ~, After testing the machine, he wrote D, but it seems that there was a small BUG. The old master gave the Group data a decisive BUG. Unfortunately, there was no time to change it, and there was no AK, it's also a point of RP for the race ~

Preliminaries

Old rule: I am ABCD, Old High EFGH, and Haoran IJKL. after about five minutes, I click the list and find that A team has come out of A and C, and old high is decisive to go to C, I found C was a very watery game. I thought about it, wrote it on the computer, and submitted it to 1Y. At this time, Haoran had already written J, but he brushed the list, I found that the submitted team was very strange and wrong, so I felt that this question was definitely a pitfall (he proved that his judgment was correct afterwards, and the data Scope of this question was wrong ), after that, I did not have A thorough understanding of the meaning of question A. I decided to give the question to the old master and read D. I found D seemed to be A two-dimensional tree array, and there was no template for the tragedy, put it for the moment (only after talking with everyone can we find that the complexity of using n ^ 3 logn is violent binary. The positive solution seems to be a line segment tree with in-depth optimization !!! I didn't even see this question as A line segment tree, so I was depressed.) At this time, I wrote A and submitted 1Y. I continued to read the following questions and read B from the old master, at this time, haoge and their team went out of F, and I went to read F (it turned out that it was too pitfall after the event. The subject said it was an AK defense question, and it was minutes ago, ORZ). I read it twice and found it a ry. I pulled it and pushed it. At this time, J's data was changed and it was a bare big number, I started Java to write and submitted 1Y. When I was a senior, I came here and told me what B meant. After I heard it, I thought it was a priority queue. I wrote it on the computer. After writing it, I found that the sample could not pass, I had another chat with Lao Gao and found that I had read the question wrong, but it had little impact. I changed the team to set to submit 1Y. At this time, we were already stable in the gold medal zone.

At this time, I chose to continue reading questions. Question F seems to know the theorem. He and Lao Gao continue to study question F. I went to read the remaining questions and found that G and H had some meaning in number theory, let's put it first. I read the short L and found that it seems to be a collection. After reading it carefully, I found it was a graph theory. Then I pulled Haoran and gave him a general idea, it was probably a very watery contraction point + strong Unicom component, and Haoran wrote code on the computer. I went to think about H, and then it was a long wait. It took about one hour, haoran wrote L, submitted 1Y, and quickly squeezed into the silver zone, we finally returned to the middle of the gold zone. At this time, the old master and Haoran went to discuss F, and the monotonicity of F was hard to do, haoran decisively ran a program and ran out of monotonicity. Then he wrote the code for about 10 minutes and submitted 1Y. At this time, we had 6 questions and 1Y, And the next one was almost stable, I and I decided to die H, and I found that E seems to be a probability DP that let Haoran write (not actually, it is a search + combination number ),

Then there was a variety of suffering. I started to use STL to burst H and found that the time-out was reached. In about 30 minutes before the competition, I made an optimization for the old master so that I could only access the AC and wrong the AC five times, when we saw the return of YES, our team really breathed a sigh of relief, followed by collective E, but unfortunately, all the ideas of question E are in place. (After the discussion, the AC team found that the idea was okay.) After that, there was a small BUG when I wrote the code, if you don't have time to change it, you can only regret that the 7 questions have ended.

Awards

The awards were really cool. Xue Shen's rankings were awesome, and he was really happy to win the Shandong provincial championship for their team. Cheng Shenhui ge also gave them the same strength. The second runner-up, hey! ^ O ^, we won the gold medal with 7 risks based on the first six 1Y items. At the same time, I would like to thank all the teachers and referees who participated in this competition. If you don't talk about it, I would like to pay tribute to the ACM Association and Training Team representing shanke !!

Summary

At the conclusion time, I still got into trouble in this competition. If it weren't for my teammates, I really didn't know what the consequences would be. In fact, from the very beginning, the pace of the team was a little messy and even failed to finish reading the questions, there is a water trie that I did not read, and I may not understand it. I think too much about it, including question D. I still need to train more ideas in the future.

As for the future, we will continue to develop in an all-round way. After training a few more topics in the data structure, we will switch to DP. We will also look at mathematics and other things, so we won't be able to help us in the field, knowledge points in geometric graph theory are still required. We try our best to maximize the knowledge coverage of our team. Sometimes, the field's 1 + 1 is far greater than 2.

This should be the best time in the history of shanke, with three gold medals, the extra champion, and the Third runner-up. Looking back on this journey, I have grown a lot and I have never been able to even use printf since the very beginning, now you can write code in the arena. On the road to ACM, I was just interested in code from the very beginning, and then attracted by various exquisite algorithms. What really made me go far is the ACMer atmosphere in the team: we are all making every effort to move forward towards our goal by 12 points. In addition, I am very grateful to Mr. Wu for his great efforts. All the members of the training team know that I don't want to say anything too lyrical. Long live the instructor!

As for the future, our goal is to prepare for the semi-finals. The provincial competition is only the beginning. In this year's second year, I feel like I am about to retire my dog (Time flies, ah, ah, QAQ ), in short, we will do our best to fight for the next day! If you are not satisfied with life and death, do it! We are still on our way to dream!

 

We are still on our way to dream