"Let It Rot" will win everything!

here we go again:
https://zibada.guru/finals/

separate pages:
https://zibada.guru/finals/2022/
https://zibada.guru/finals/2023/

2x Jagiellonian

Will be there any live contest mirror? Can you please share the link?

I won two TON coins in CodeTON Round 8, but now I don't know how I can receive them. I have a TON account

and also I updated my wallet before April 16 UTC.

What can I do beside just waiting?

47th mipt

you won't

Looks like the intersection of the problemsets is 5 problems. Shame. Now for training purposes you have to choose one or the other.

Scoreboard

Either MIT or Peking U will win the 46th

Either Peking U or Harbour Space will win the 47th

why not spbsu

I wanna go home :((

On their main website icpc.global, they have a link to an online mirror: https://onlinejudge.icpc.global/. The icpc.global website top-left menu has pretty useful links :).

why skipped, cheater? 256497006

Are you a narcissist? Always commenting for your friend (or maybe your main?) absolute-mess. Two comments in screenshot below. Upping his blog in the comment above too

Please feed cowboys to the sharks and let someone else announce the results.

Thank you! Also, I guess, at https://www.youtube.com/watch?v=wJRh62s5frE there should be an opportunity to look at our screen, and at https://www.youtube.com/watch?v=an5sBhtktaE there should be a stream.

I won't

When can we expect the prize money ?

no

Yeah, I certainly consider this algorithm as from The Book. In purely aesthetical measure, there are very few algorithms with higher beauty. While I do see the intuition of this "level" structure, I also fully agree that the invariants are very delicate.

I just regard the top tree as a good abstraction of a dynamic tree scheme, but here, it's important to note that vanilla LCT would not work. If you try to implement the find_first and update operations in LCT, you will probably just reinvent the top tree. Most literature gets around this limitation by storing cyclic Euler Tours in a BBST (known as Euler Tour Trees), but I do not prefer this, as ETT has limited usage outside of this algorithm and is honestly just painful to implement.

But a mirror's supposed to be a live contest?

I think we should all orz evenvalue for good luck and high score! I'll start: evenvalue orz.

jiangly won 1st place.

it's now jiangly's stage,let's just get hyped to see it!

You're welcome! I think you may get a medal in few hours. I'm a big fan of your casts and rounds' explanations

wow

I want to congratulate the [HSE] FFTilted team on their well-deserved victory at the 47th ICPC World Final!

Me too

BigBadBully is now higher rated than you :o

Enjoyed every problem, thanks to CodeChef.

Hangzhou Dianzi U

I said I would eat shit if Peking University does not take the champion title.

I feel so lucky I won't do this.

Bro, you need to train

Skill issue, the blog is also long, uninteresting, and you should provide a tldr;

Stream by tourist

0, most don't have cf accounts

As a problem setter, I highly recommend participating in this contest...

Available now, 47th PS 46th PS

There are different problems but some intersections as well with some shuffle, but overall they aren't identical.

Even though the standings are frozen, from what I've gathered, the first places wouldn't change, so congratulations to MIT on the 46th final and HSE on the 47th!

I had expected 10-13 common problems. 5 is great.

around $$$10^4$$$ dollars for the first place

you are the kind of guy to shit talk blogs that are useless yet posting the most useless shit ever

It's so bad nowadays...people devoting their time to a contest all to get ignored when querying about the rightful things Fremder

As hariaakash646, I can confirm kshitij_sodani will be participating.

feeling so dumb after reading editorial for append array :(

all the best, you are gonna have a blast tomorrow :)

why is everyone talking about jiangly suddenly

Using custom hash functions allows you to modify unordered_set hashing so that it's less likely to be hacked.

Here's my template:

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
struct custom_hash {
  	static uint64_t splitmix64(uint64_t x) {
   	 	x += 0x9e3779b97f4a7c15;
    	x = (x^(x>>30))*0xbf58476d1ce4e5b9;
    	x = (x^(x>>27))*0x94d049bb133111eb;
    	return x^(x>>31);
  	}	

  	size_t operator()(uint64_t x) const {
    	static const uint64_t FIXED_RANDOM = rng();
    	return splitmix64(x+FIXED_RANDOM);
  	}
};

template<typename T> using safe_set = unordered_set<T, custom_hash>;

Please note that not everything is able to be given a hash, so only stick to basic data types such as int, string etc.

Why is the Mirror linking to tourist's twitch?

why you always say sir sir sir

What about you, will you take the place?

Star button does not appear if you are logged out
Moreover if you are logged in other tabs like settings and favourites also appear along with blogs, teams etc.

p_b_p_b and his teammates will win WF 47.

As a problem tester, I really liked the problems and highly recommend everyone to participate in the contest !

Specialists are cyan, masters are yellow, contest hi toh hai, practice ke liye dedow

who else wants him back to competitive programming?

Best of luck! May your teamwork, skills, and determination lead you to success.

wow the script still works!

looking forward to the excellent problems and exciting contest :D

Does being a grad student count as being in college?

Best of luck ! "May the algorithms be with you! Your problem-solving skills are legendary, use them to conquer the World Finals!"

I cheer for SPbSU, but I believe the probability of HSE winning is Higher (and, to be honest, I cheer for them not less).

Hoping for an amazing contest

evenvalue orz

Starting in Year 10 means you have plenty of time! I attended this year and the last, and I started learning CP properly later than that (you can see my blog post if you want to know more). The best way to prepare (in my opinion) is first, to have a good foundation in general programming and CP, then once you're confident you should definitely do all of the past paper questions; the format of the BIO is very different from other national informatics olympiads.

Also, you can join our Informatics Olympiad server, where there's a lot more finalists you can talk to! Add me on discord -- myst06 -- and I can send you an invite :)

Me too :-(

650 problems solved, of these 650, 350 are for beginners 800

Thik Hai, Samajh Gya! xD

Thanks for recommendation, Hoping for an amazing contest.

pupils are green, experts are blue, is contest mein part, aakhir kyun main lu?

Thank you and same to you!

Pupils are green, experts are blue, we all have different reasons to practice. Find your reason too! xD

There is always something new to learn, even after many years, and in addition it serves me very well in the pledge to deliver the best experience to my students.

Thank you so much! I have added you on discord.

When you hit a point of mental fatigue, it's crucial to pause and take breaks.

Well said, When I was pupil I spent months trying nonstop to reach specialist and get into new topics, For the topics I tried to learn I didn't get most of it and for the rate it dropped to newbie, I took a little rest and I went from newbie to pupil in a matter of days.

In Dhaka WFs, my team had 0 ACs until the 2:20 hrs mark. We ended up becoming Asia West Champions by the 4:40-hour mark.

This CALICOmment is peak CALICOmedy. CALICOmpartmentalization.

Sorry for necroposting. I was solving problem E and got ml14 then I did some optimizations and got AC. After that, I looked for the editorial and author's code. The code was the same with my solution that got ml14. So I copied it and submitted it in C++ 20 (GCC 13-64) and surprisingly this got ml14 too. Then I resubmitted it in C++ 17 and got AC. Why it could get ml?

If you're using unordered_map or unordered_set you MUST have them anyway. I've already gave a link to the blog that gives comprehensive information about which exactly function you should use, so I won't duplicate it.

About what orz said: I completely agree with him in terms of competitive programming. When you have the prewritten protection code then it's much better to use unordered_map or unordered_set if you only don't need the sorted elements in these structures. Also, most of the time, you really don't need anti-anti-hack protection, because it's very rare now that someone will try to fetch the random and write the test based on it, because it's enormously time consuming and it doesn't cost it.

If you look in my solutions, then you will see that it's very rare when I'm using such structures, and I have an explanation for this as well. Actually, I've a couple of reasons:

1. You can't use random hashing in real programming, and I'm trying to write my code as clear as possible and as similar to what you would write in reality (without including the principles of OOP, this is unnecessary in conditions of contests), so these structures are bad for me and I use them only when I really can't think of something else.
2. If I can't solve the problem without them then either I can't solve problem efficiently at all or problem was designed to be solved in only one way, which is enough to consider (for me) most of the time the problem annoying and boring, and I really don't like such problems.

On the homepage, icpc.global there is a menu in the topleft, it contains two items which are both "Online Judge" :). One leads to a dead link, one leads to https://onlinejudge.icpc.global/register, which looks like an online mirror of both world finals. It seems to start one hour after the start of onsite the contest.

Edit: It seems that after I looked at the site earlier today, they have changed it to only one working "Online Judge" link.

ahhh icpc... never change :)

And i give up after 1 or 2 submissions ;(

Either MIT or Peking U will win the 46th

Either Peking U or Harbour Space will win the 47th

1. We don't know anything about problems before the beginning of the contest(
2. Not, only one team per contest. 2022-2023 season of regional contest qualified with extra selection rules

fix the live stream plz!

evenvalue orz pls bless me with good luck

he isn't, its a lie, a propoganda spread by hariaakash646 fan club.

Yea, sorry about that( It's apparently very difficult to gather reliable info

As part of the CALICO team, I recommend the contest!!

What do you mean by “You can't use random hashing in real programming”?

meme

https://codeforces.com/blog/entry/128590?#comment-1141460

jaldi jaldi flex krdeta hun ki maine problem banayi hai :')

i will give this contest .

Haha, I also upsolved problems from a contest I participated 9 years ago

Now you should regret for jiangly

Most of the problems in this round had pretty much similar difficulty levels, as our more difficult problems were used up in CodeRed Finals :-)