Competition is over. Is there any editorial available?

How to solve A, B, F?

Hi Codeforces,

I wanted to share with you all acmX, an extension for vscode I started coding half a year ago for myself. Since then it has evolved a lot and it has some features that might be useful for some of you:

• Contest/Problem parsing. (Via Competitive-Companion extension).
• Running solution against testcases.
• Automatic verdict results (OK, WA, RTE, TLE, CE).
• Manage test cases easily.
• Stress solution.
• Support for multiple languages.
• Smart copy (Use custom algorithm library and merge code with caide-cpp-inliner).

Check the wiki to read about all features.

Installation

In the vscode install the extension from the marketplace

Usage

Check the README for more details.

Discussion

All the discussion happens in the github issue tracker or in the Telegram group. Feel free to ping me through any of those if you have any suggestion or hit some error.

Thanks Devil and Agile_Eagle for encouraging me write this blog.

The contest finished few hours ago and there is no blog so far. I'm really interested in learn how to solve problem A and B.

Is there any editorial?

I had a very funny conversation with Merkurev few minutes ago. Apparently he needs help for testing some problems but unfortunately he is not using polygon for that. Moreover it seems he forgot at all how to use polygon (I must say myself Polygon UX is far from perfect, but you hardly forget once you use it).

Some of you may say this was scam Merkurev and not the real one, can you spot the definite clue the turn down his cover?

Anyway, beware of random guys in Discord reaching you.

Dear All,

The COJ system is preparing to celebrate its 9th Anniversary on June 5th, with the start that same day of the COJ Progressive Contest #13, which will last for 15 days until June 20th. More details are available at http://coj.uci.cu/contest/contestview.xhtml?cid=1700 You need to read carefully the AWARDS section!

I ask you to contribute to the promotion of this special contest among your contacts that you think may be interested in participating. We count with your participation in the COJ Progressive Contest #13!

DURATION AND LANGUAGES

The contest duration is 15 days. In principle, the tasks are in English, but some easy problems may be also in Spanish. The allowed programming languages are C, C++, C++11, C#, Java and Python; however correct solutions will be ensured only for C, C++ and C++11. Judges will not ensure a possible solution for other programming languages. The contest will be held on the rules for Progressive competitions in the COJ. If you have any question, please feel free to ask on coj@uci.cu

REGISTERING

To participate you need to have an account in the COJ (for a new account, please use this form). You don't need to register in the contest: the registration in the contest is effective with the first submission.

SCORING

The challenge is as follows:

• The problems are divided by difficulty levels, and in the beginning you only have access to the first level of problems.
• In order to gain access to the next level of problems, you must solve a specific number of problems from the current level (defined by the Contest-Setter).
• Not all levels require the same amount of problems and, of course, we design each level to be more challenging than the previous one.

About the ranking of the contest:

• There will be not penalty time for rejected submissions.
• There will be not (less or more) points by solve any problem after or before another user. Points are assigned when you solve a problem.
• Each problem has a fixed number of points, so no matter the number of users who solved it will always worth the same.
• The scored points are in this form: TPOINTS / (TLEVELS — PLEVEL + 1) where TPOINTS is the Total Points defined for all the problems in the contest, TLEVELS is the Total Levels defined for the contest and PLEVEL is the level of the given problem. Note that problems in the first level gives you TPOINTS / TLEVELS points, and problems on the last level gives you TPOINTS points (full points). The higher the level, the more points are scored. If two users have the same points in the ranking, the user who has solved its problems before, must be in a higher rank.

LEVELS

We are celebrating the 9th Anniversary of the COJ. Then, for this 13th Edition of the COJ Progressive Contest we will have 9 levels of problems, and you need to solve 4 problems from each one to pass to the next level. On the other hand, you can solve 40 problems in the entire contest to see (unblock by special rule) all the problems in all the levels. The value for TPOINTS is 2520 points (in this edition).

Problems by levels:

• Level 1: 7 problems.
• Level 2: 7 problems.
• Level 3: 6 problems.
• Level 4: 6 problems.
• Level 5: 5 problems.
• Level 6: 5 problems.
• Level 7: 4 problems.
• Level 8: 4 problems.
• Level 9: 3 problems.

AWARDS

The contest will award two gold, two silver, and two bronze medals. These contestants will be awarded with COJ's t-shirts, which will have their logo engraved, as well as messages in allusion to the sponsor and to the contest as well. In addition, other three t-shirts will be randomly sorted between the other contestants solving at least one problem. The t-shirts will be sent by sponsor to the winners. Other awards could be announced later!

Can you get to the last level? Can you solve all the problems? This is the real challenge for you!

We hope that you enjoy it very much. Thank you and have fun!

Kind regards, COJ Development Team (CDEVT)

We create a mirror on the vjudge with the problems from Kattis.

• https://cn.vjudge.net/contest/223694
• https://vjudge.net/contest/223694

All problems are not available yet, I'll update the contest as soon as the problems become available.

Enjoy the contest, see you on the standings.

How to solve problem 1, 4, 8 and 12 of this contest??

I found that Petr commented problem 1 on his blog, but he didn't post the idea later.

I am trying to solve a problem on Spoj, but all i get is SIGSEGV on test 10. I just want a second on review on my code to try to figure out what is happening here.

I see each island of the problem (cartesian point with integers coordinates) as an edge between x and y. Then if a build several path alternating colors it guarantees that each island will have a couple on the same row (column) with another color. Of course, each path start on a node with odd degree unless there aren't, so then, i am looking for cycles. If this approach is wrong i need some suggestion, but if it isn't, i just want to know why this answer is getting SIGSEGV.