To jump on a bandwagon, I'll run a boring stream, where I'll virtual participate JOI Spring Camp 2019 Day2 (or Day1 if that's harder). The time will be 3/21 Thursday 7:30 PM UTC+9 (KST)

If this works out well, I'll maybe continue streaming after WF. I'll try to solve problems that is both hard and annoying, something like this.

See you!

How to write these contests virtual, not at 1:00 (UTC)?

I assumed they will hold an analysis session. If they don't, I'll just solve other hard JOI problems instead.

Please [ subscribe & follow & like ] wookje tv (^-^)

https://twitch.tv/wookje

WoW woookje tv is very fun! I won't miss the live broadcast!

Still no 100pt solution for that one problem from IOI 2003...

lol is it even possible to score > 88

That's what I'd like to know. After all, it's strange that there would be a problem without a 100pt solution. Spoiler alert: the only official(ish?) solution I found describes something that seems to score 88.

I don't think it's possible in 5 hours, but overall it's possible... I was given the task about 1-2 years ago, and gave it 2 weeks, after which I got 100.

I also lost the source code (this is the only thing I have left), but if you want to challenge me to rewrite it (maybe given a judge?) then sure.

I barely remember the idea, but it doesn't give away the solution;

Edit: Well apparently I have some source code that is incomplete, and some of the output files for some inputs. This is one of them, solving n=255 using upto 4 consecutive S operations at any time. I think this expresses all that's necessary to solve for fullscore.

Specifically, the bounds I kind of remember are:

8, 44, (I think 97 or 101), (I think 137 or 173), 257.

The judge is Yandex IOI archive.

Done :) (you can view in the standings)

The first time I solved the problem I wrote a lot of case analysis to do the best thing I found on paper. This time I tried to write something more general, which was able to solve with 1 operation upto 44, 2 operations upto 101 and 4 operations upto 257. For some reason it bugs for 3 operations (bound should be around 180-190 I think), but I tried submitting without it (solving either with 1,2,4). Jury's answers are weak enough to let this pass with 99 points, and then I had to improve just n=112 so I did the stupid thing that solves in 8 + 36T for some limit T.

tl;dr: My code is not general, just solves whatever is good enough for the jury. I couldn't bother fixing it, as it was unnecessary (my general solution improves jury's answers for tests 12,13).

Wow, good job! I really thought it was impossible, now I know that I can improve my total score in that IOI archive and that it makes for a good challenge to others.

Pretty please, just use Science & Technology category!

Done, thanks!

Wow, it's super fun. Maybe you guys can compete for writing annoying problems.

Well, everyone can have their guilty pleasures...

But I have the criteria. I don't like long and annoying problems (or cheats by compressing with formulas). Good annoying problems should have a short or motivating statement, and knowing it's annoyingness should be nontrivial, or quite hard. I'm not sure my examples are "good" in that sense, though.

Hi, i'm having a question:

Assume we've done kruskal algorithm on a list of edges of a connected graph. Then can we check if an edge were in the minimum spanning tree in O(1) with disjoint set we've created? Assume that checking edges exist in edge list.

Use set/unordered_set.

Thank you. Using set/map may be the only way to do it.

if you yourself know it's boring and useless don't waste both our and your time. what's so hard

Starts in 30 minutes!

13/10/100 :( See you next time!