EGOI 2026 Day 2 Commentary: 2/3

Hinzugefügt: 2026-05-17

[00:00:00]ended. So, you'll need to send a new [ __ ] stream link.

[00:00:03]>> Yep. Send >> this. If you need to restart your computer, I guess, bro.

[00:00:12]>> Okay, let's uh I sent you a link on Wait, no, that was the wrong stream. Got to send you got to find it on YouTube.

[00:00:21]But we are live again. We are live again. How do you guys hear me properly now?

[00:00:28]This This is not a cook, bro. If you need to restart again, bro. I am not liking this live.

[00:00:37]>> Oh, yes. The stream ended, that's for sure.

[00:00:41]>> Yeah, the new one started.

[00:00:43]>> Yeah.

[00:00:50]>> Okay. Anyway, I think we are live now.

[00:00:53]So, let's just continue. Bro, turn off the thing. Turn off the echo.

[00:01:03]Uh, Sonic.

[00:01:04]>> Yeah, my mic is still not loud enough, >> bro. It's five, bro. Right now, it's not the time. So, got AC on B.

[00:01:12]>> Oh, what?

[00:01:13]>> And Clara also got AC on B. Yeah. 79 to AC.

[00:01:16]>> Oh, what? That's >> crazy.

[00:01:19]>> Yeah. And Mariza 41 on P3 right now.

[00:01:22]Also, bro, can you hear the echo or is it just me? Uh, I can't I don't hear an echo.

[00:01:33]>> Okay, wait. Let's try again. Yeah, I can hear an echo.

[00:01:37]>> Wait, is my stream audio being shared?

[00:01:40]No, it's not. No, no, there is no echo.

[00:01:45]>> I think it's from your mic or something, bro. But don't don't turn because I increased the volume now.

[00:01:53]>> Maybe. Maybe.

[00:01:56]Yeah.

[00:02:00]>> Yeah. This this is not a cook, bro.

[00:02:03]>> Bro, I my APS got over yesterday, so I am pretty jobless now. That is true.

[00:02:12]>> Okay, so we have 41. Is that the highest on P3 right now?

[00:02:16]>> Metal predictions. What are medal predictions?

[00:02:20]>> I mean, it's pretty obvious. Gold, silver, bronze, bronze from me. What about you?

[00:02:24]>> Uh, Swasti's probably gold >> and Mani is probably silver, that's for sure. But Lyra and Dia, I don't know. I feel like one of them may drop to HM.

[00:02:35]>> Oh, I was thinking Dia may get to silver if if today is really good.

[00:02:40]>> What was Dia's yesterday?

[00:02:43]>> It was like mid to upper bronze. Mid to upper bronze. Wait, where is Lyra right now? Uh, bottom of bronze. That's not a good thing to see, but >> I think it's good. As long as she pulls through near the end, it's fine.

[00:02:57]>> Yeah. Yeah. So, right now, she's going really slow. What about Dia? How much does Dia have?

[00:03:03]>> Oh, Dia is bigger and worse. All right.

[00:03:06]So, well, it's not HM yet. We don't know that. It's just that she has 000. She hasn't even made any submissions. Yeah.

[00:03:13]>> Yeah. Well, at least we're not dropping non HM or >> cuz that's that's not possible for us at this point. Everyone is at least getting HM.

[00:03:23]>> I mean, bro, that's you sort of cook, bro.

[00:03:28]>> Is that really something? Is that really something to be proud of? Like, really?

[00:03:33]>> I mean, sure. If you have one gold and one HM, I think that's a fair trade.

[00:03:39]>> I mean, I don't know, bro. I think you may be a little biased towards HMs, but I personally don't really like them. I think that the no medal would honestly be better than an HM because >> I mean at least when you have no >> you're going to have HM at the very least.

[00:03:55]>> Yeah. Yeah, that's true. But you know what? Why are we even going to have HM?

[00:03:59]We're going to have two bronzes. You know, I have a feeling I have a feeling.

[00:04:01]Okay, so Dia right now, we haven't even given her a fair shot, so we can't even comment on that. Lyra, too, I mean, she's just warming up. We don't we don't even know what she's doing right now.

[00:04:10]She's still trying P1 probably, but maybe she's trying P2. Maybe she's just going to AC P1 on her next submission. I mean, we don't know. We'll have to we'll have to wait and see for that.

[00:04:20]>> Maybe Si is going to ACP4 on her next submission, but we know that's not coming.

[00:04:26]>> Bro, you know, those two things are not equivalent, bro.

[00:04:33]>> Like, like, okay, we don't have any submissions on P4 yet, right? So we don't even know how the subtask >> I think P3 is what's coming next.

[00:04:41]>> Yeah. Yeah. True. We have Mariza with 41 which is everything but the last two subtasks, right?

[00:04:50]>> Swasti is saying P2 is actually pretty insane though. And look at the time as well. 26 minutes for everything but the last and 33 for the last. I mean she's really doing something here. I don't know what I don't know what's gotten into her, you know, in a good way. Oh, first submission from there. And on P1, what do we think? Is it going to be 40 or 100 or zero >> for hopefully AC? I think it's AC.

[00:05:13]>> Yeah. I'm going to go with 100 as well.

[00:05:15]Let's have some faith.

[00:05:16]>> I mean, she was taking so long. She had to be cooking an AC.

[00:05:19]>> Yeah. Yeah. Yeah. Yeah. Let's see. Let's see. It could be 02. Okay. Yeah. There we go. There we go. It is an AC.

[00:05:26]>> No, it was an AC. It was an AC.

[00:05:28]>> Oh, okay.

[00:05:30]>> All right. So, now where is Dia? So >> that's bronze.

[00:05:33]>> This is the border of bronze. Dia somewhere here. And Okay. So Dia is like upper to mid bronze right now. Okay. You know, I don't think it's entirely unrealistic that she could go into silver as well. I mean, what do you think?

[00:05:47]>> I would say it's probably a little unrealistic because you we are looking at the leader about 40 minutes in and there are going to be so many people who just grind out in the last 1 hour and get so many points. I mean, how how do we know that's the case, though?

[00:06:03]>> It's it's an international competition there. Like 500. No, not 500. What? 200 400 people giving. There's going to be a lot of like people who just leave stuff up until the end and then they just start.

[00:06:16]>> This reminds me, this reminds me of that what do you say the tourist strategy, you know, that he was talking about at Yukov. Have you seen that video?

[00:06:24]>> No. What is that?

[00:06:26]>> Uh, basically a tourist strategy. Uh it's a it's a longgoing tradition. It's basically when you just have all of the solutions to the problems, but you just don't submit. You have to throw off your opponents. By the way, keep in mind this is our ICPC. Okay. So over there, the participants can see the scoreboard. So they look at tourists and they see him not submitting problems and they're like, "Yeah, this is not worth attempting." Right? And then at the very end, he just makes five submissions, five sees like five of the hardest problems and just jumps from like here to here.

[00:06:55]Oh my god, that's that sounds crazy.

[00:07:01]>> And it's only someone who's like as good a tourist that can really afford to do that, you know, because you don't need to be confident in your solutions. And especially at like an international Olympia, I mean I personally I wouldn't have the guts to like hold off know potentially using a medal just to like aura farm. Like that's pretty much >> it's not about aura farming. It's about It's about say they have a solution for P1, but they're like, "Okay, I I my mind is fresh right now. Let me use that fresh mind to think on some P3, P4 hard stuff."

[00:07:30]>> Oh, no, no, no. You misunderstood the You misunderstood the strategy. You code it as well.

[00:07:35]>> That's strategy for II. I'm saying people who just think and don't code because in IO if you code might as well somewhere.

[00:07:44]>> Right. Right. Right. Right. Right. Yeah.

[00:07:46]cuz there's no live rank list in iOS.

[00:07:48]So, doesn't really make sense. I mean, the only reason it would make sense is if for some reason you want to go from HM directly to gold in like 5 seconds.

[00:07:56]Oh, we had someone getting it to gold right now as I said that. But, but well, yeah. I mean, I guess the only really effect it would have is like on people looking at the rank list and then they're like, how did this person just AC these problems in like 2 seconds? Not really an effect on the competitors.

[00:08:14]>> Oh, yeah. And for the II stream, actually does that every single year.

[00:08:19]>> So, >> oh, you can just watch stream.

[00:08:25]>> Yeah. Right, right, right. Cuz we won't be able to do the same thing most likely, >> but I doubt this stream is going to be as professional and good as ours. I mean, okay, we ignore the fact that it died 25 minutes. I mean, that's just a minor hiccup. you know, we don't really talk about that, but there will be something else.

[00:08:48]Okay, so I feel like P3 is probably going to be somewhat hard right now.

[00:08:53]Now, this is really where stuff starts slowing down a bit. How's the Brazil team doing? Wait, let's look at the filtered rank list for a second. Let's see.

[00:09:02]Okay, so we have Marisa in goal, in gold. Oh, look at this. Isn't this Oh, wait. I did not mean to do that. Uh, yeah. Oh, no. We Claraara is right at the top. I didn't even notice her cuz I'm so used to her being like number one, number two. Yeah. Okay. So, Brazil is currently leading. Then we have Cypress. Then we have India. Oh, this is not good. So, Dia Mani is silver, Dia is bronze, and Lyra is HM.

[00:09:34]>> So, Lyra might be stuck up on P1 AC. not going to lie because we >> I think so too. But I think she is going to get it given how other people did get it as well and it is EGI P1.

[00:09:47]>> The chat has a really interesting suggestion actually. What if you get the EGI girls to do the II commentary? So we switch spots.

[00:09:55]>> Oh, right. We swap.

[00:09:58]>> Yo, you know, wait, who made that suggestion?

[00:10:00]>> Uh Hetros Sapion here.

[00:10:04]Hm. We could get Lyra and like Swasti or you know like I think Lyra and Swasti would probably be like chill enough for that, right?

[00:10:12]>> Let's see. Let's see. Let's see. IC and this time we can >> Yeah, we can make the proposal. Yeah.

[00:10:21]>> Yeah. Right, right, right. That actually sounds pretty good. Although I mean it'll definitely then it will be on the on this channel as well, right? So >> yeah, >> it's like even better. Yeah.

[00:10:33]>> Okay. But still, this is not looking good right now. Oh, and also this is something I just noticed. So, from Cyprus, we have Mariza who's like third overall rank, right? And then like if we just have a tiny look at her teammates, I don't think I don't think they're doing too well. I mean, if you look at day one, day two. So, I don't know what's going on in that country. I whatever situation there's this one guy who's just different >> different >> one I this is not even this [ __ ] situation I mean at least over there we had people getting silver silver it was a gold silver bronze so >> I mean did we have silvers last year I was the only silver we had two bronzes and an HM last year so >> oh yeah we we have an HM as well yeah but but we're talking about the time when Shiz was there right? Like at the time it was not that imbalanced, but this is like really a like next level of like I don't know what's going on, but I think it's fine. I mean, on the other hand, Brazil looks pretty balanced. Like we have gold, silver, silver, silver.

[00:11:40]That's like very respectable.

[00:11:42]>> Oh, and we have someone asking if EJ girls take our spot for II. I honestly don't think that's happening. Like >> I I think that's not very likely.

[00:11:53]>> You've seen the cut offs. You've seen You see I know I cut off. We have another submission from Swasti on what is this? Is this P4?

[00:12:04]>> Oh no it's not P4. It's P P P P P P P P P P P P P P P P P P P P P P P P P P P P P P P P P P P P P P P P P3. Oh, P3.

[00:12:07]Okay, she had >> 41. Okay, 25.

[00:12:10]>> It's 25. It was 25 for Mariza as well, I think. Yeah, first submission was 25. So >> 25 and then 60.

[00:12:17]>> And Mara just aced T2 as we speak and she's overtaken Clara. Now she's third and Mariza is first. So, we we literally have a person from Cypress who's first and all of the others just at HM over here. Uh, with zero on day three, actually, it's like pretty crazy to think about.

[00:12:37]>> Oh, no. They're not HMs. 29 on day one is not an HM. That That's no medal.

[00:12:42]>> Oh, right. This is no medal. It's not even an HM. Okay, but no medal is better than HM, right?

[00:12:48]>> What do you mean? Our scoreboard is laggy.

[00:12:54]Oh, that's Oh, the scoreboard is laggy.

[00:12:56]Wait, wait. So, are you talking about latency or are you talking about like like animations? Because latency is something, you know, like we can't really avoid because of YouTube. It's going to be like 10 or 15 seconds late.

[00:13:08]Uh, but in exchange for that, like the stream is higher quality. The lag, I think that's just the website itself. I mean, I don't know. This website is worse than the leaderboard. I mean, I don't know why because they're using CMS, too. So they could have used the exact same template but for some reason they haven't which I I >> it takes longer. Yeah. Yeah. That's just because of the stream.

[00:13:30]>> Yes. Can't really do anything about that. I mean we can but then the quality of the stream >> the stream quality would be a lot worse.

[00:13:38]>> Yeah.

[00:13:38]>> We're not going to do that.

[00:13:39]>> So So I think it's a a reasonable you know like reasonable compromise here.

[00:13:47]Yeah. Let's see. We have Okay. So Daria Pur Pere Pereopska, if I pronounced that right, was number one on day one. Right now she's number two.

[00:13:59]>> Yeah. So the reason why that happens is cuz we also see it at the same time, but the stream latency is too long.

[00:14:09]>> Oh, just as I was saying that, Dario is now number one again. I mean, yeah. Why is China not participating? For political reasons, I think >> they didn't participate. Why is China not participating? You actually know why?

[00:14:26]>> I'm not sure actually. You want to search it up? Want to see what what that's about?

[00:14:32]>> Let's see.

[00:14:33]>> You You want to search it up? Okay.

[00:14:34]Okay. Switch. Do it on your screen. Do it on your screen.

[00:14:37]>> Right. Let's see.

[00:14:39]>> I I'll have the leaderboard open here.

[00:14:43]>> Okay. Let's switch over to my screen.

[00:14:47]Okay. Hope you guys can see the Chrome window clearly.

[00:14:53]And yeah, so if you look at the API 2020 six actually yes that that might be a reason because in APR 2024 all 60 of them aed.

[00:15:09]>> Okay. You realize I think that was a joke, right? I did not [ __ ] think that was real.

[00:15:14]>> So >> like you're out here saying this like oh yeah you know they they aka the entire contest all 60 of them. That's not the case. I I am 99% sure there was a joke.

[00:15:26]>> Yep. And that's >> they had a different they had a different API. That's not even like not participating. That's them signaling that like you know we're too good for you.

[00:15:36]>> Exactly. It's and it doesn't even make sense like if if you have a separate Olympia then how is it even API like what's what's the Chinese this is Chinese Olympia in informatics like >> yeah like >> this isn't really political reasons yeah I okay I think it has something to do with the fact that Taiwan was the host this year and I'm not much into like you know geography and stuff but I think there there was some controversy with like Taiwan and China like geographically speaking. So I think that's the reason they weren't a part of it. Yeah.

[00:16:15]>> Yeah. Yeah. Yeah. Because I mean China doesn't recognize Taiwan. So if Taiwan is organizing Oh, so that's why China >> too.

[00:16:26]>> Oh okay. I mean look I'm not complaining. If China gave then I wouldn't be in gold in the unofficial but the preliminary. be in bronze either.

[00:16:37]>> I think I was like fourth in bronze as well. Like fourth last in bronze. So we both not complaining.

[00:16:42]>> Yeah, I I think that's I think that's fine. I think >> Oh, yeah. Because there would be six Chinese and gold, right? Yeah, this is completely fine. I mean, whatever political reasons. I mean, look, China, they were too good for us anyway. They needed their own example, >> right?

[00:16:59]>> That's in my opinion because >> uh you know what? You know what? I love Taiwan for this.

[00:17:07]>> Yeah. I mean, Taiwan's Taiwan's just a goat now. I mean, there's a reason we both have There's the reason you have a gold. They're the reason I have a bronze. So, >> I we don't have them right now. We need to >> They're the reason we could potentially probably are going to 99% chance have them.

[00:17:26]>> Probably >> if Yeah, probably. Yeah.

[00:17:32]>> Okay. Okay, I think we can switch back to the scoreboard now.

[00:17:35]>> Yep. Let's go back to you >> actually. Do you want to do you want to start looking at the P at the day one problems?

[00:17:43]>> Uh because we >> we can't actually look at the day two problems, right? And I think the scoreboard is going to start moving a bit slow now. But you know what we can do? We can look at the day one problems because uh I actually had solved them right after the contest. So I know some of the solutions. Uh Samic, I think you tried P3. I think that's about it, right?

[00:18:03]>> So, Sonic will actually be seeing the problems for the first time. So, you know, we can get his live reaction as well. So, let's do this. Okay. So, let's let Sonic explain P1. Uh or let's actually like let him try the problem and then see how fast he solves it. Uh we'll be all judging him on stream and let's and then he'll explain the solution. Uh if he fails to, I'm always there. So, uh that's fine, right? So, I'll leave it up to you. You can go ahead and open the problem.

[00:18:35]>> Let's see why.

[00:18:38]Now, we have this. Oh, yeah. We can delete the CMS thing that we cooked up yesterday as well.

[00:18:46]>> Oh, yeah. Yeah. So sad. It stayed up for 12 hours or something and it's overtaken.

[00:18:55]But that's fine because our CMS did not support like our CMS did not support P4.

[00:19:01]So >> we spent a lot of time on it. Come on.

[00:19:04]That's >> We spent like 1 hour on it. We spent like 1 hour.

[00:19:09]>> Should I Should I time this cuz I've never seen the problem before.

[00:19:14]>> All right. You know what? Go ahead.

[00:19:15]>> Let's Let's time it, guys. Let's see.

[00:19:17]Let's get >> Yeah. And switch to your screen, too.

[00:19:22]Uh, stopwatch. Okay.

[00:19:27]Yep. All right.

[00:19:30]Now, keep in mind that the goal is CC this in less than 5 minutes. So, if you don't, that means they're going to overtake you in IOTC. They're not going to go to IO this year. I mean, keep in mind there are four goals.

[00:19:41]>> Is this >> Well, start.

[00:19:48]>> Okay.

[00:19:50]>> All right. city's signature. Oh yeah, by the way, everyone else can read it as well. I'm not going to speak it out loud.

[00:20:01]>> Uh once someone is done reading, I'll just summarize the problem because I know that people don't like to read.

[00:20:09]I mean, at least I don't. So, uh so tell me when you're done reading it.

[00:20:14]>> Yep.

[00:20:34]H.

[00:20:46]Okay.

[00:20:48]And I think I get it.

[00:20:52]Yeah, I think I get it. Yeah, sure. You can you can go ahead and explain. This is >> all right. So, as far as I remember Yeah, you can stop the timer so you can think in the background while I explain.

[00:21:02]Yeah. Yeah, that's that's totally fine.

[00:21:04]Yeah. All right. So, basically, you're given >> Yeah. Yeah. So, basically, you're given a number n and you're given a string of length n consisting of pluses and minuses. Now if there's a plus at position i that means that you need basically you need to construct a permutation and that permutation should be such that if there's a plus on number at position i then the number that comes after it and the permutation must be bigger than it. So for example if there's a plus on zero then like 1 2 3 could come could come after it. If there's like a plus on one then 2 three could come after it but like zero couldn't because that would be an invalid permutation. Now if there was a minus on it, it's like exactly the opposite that like if you have a three, you could only have 0, one and two after it. Like by after I mean immediately after, by the way, and you need to either say that a permutation following the string is not possible or you need to construct one. So that is the problem. All right, Sonic, you can resume your timer and >> you know start thinking with time that's actually counted.

[00:22:05]>> Okay. Okay. Okay, let's let's open up Zern. That's my favorite uh drawing editor, by the way.

[00:22:12]>> Yeah, this guy for some reason uses Windows and uses a Linux drawing tool, which I don't really understand, but I'll leave it up to him.

[00:22:21]>> Is this is this better than Linux in my opinion?

[00:22:25]>> That opinion is wrong, but you can be a title to your own, I guess.

[00:22:30]>> See, Nvidia Nvidia has just [ __ ] Linux in the ass. like you use Nvidia, you can't really >> Okay. Yeah.

[00:22:40]>> All right. All right.

[00:22:41]>> Yeah.

[00:22:43]All right. Okay. So, if we have a plus - plus - - plus. So, the first thing that I'm thinking of is if we have all of the pluses, we can probably like link them together.

[00:22:59]And we can do the same thing for the minuses. just link them all up in the chain.

[00:23:07]And then how do we like link these together? So if if this minus if this minus was actually over here, we could link it up and we can link it up here. So that means that the last thing needs to be a minus and the first thing needs to be a plus.

[00:23:31]And we could probably say that that's a that's a requirement because if the zeroth index is a minus then you can't have an answer because there's nothing less than zero and n minus one being plus is also wrong because you can't have anything greater than n minus one.

[00:23:51]So >> okay that was actually impressive cuz that is the correct solution. That's exactly the solution I coded. It gets AC. You basically just told the pluses ascendingly and the minuses descendingly and that's literally it. Yeah. How much time did that take you? Like three minutes. Okay. You know what? Let's make let's make that 5 minutes because I was explaining and you were thinking a bit during that.

[00:24:10]>> Okay. But I was straight up to explaining my solution after I thought for that 2 minutes.

[00:24:17]>> I don't know man. I don't know. I don't know if you I don't know if you're going to count that. What do you guys think?

[00:24:22]Do you do you think we should give him the benefit of the doubt? I don't think so. But but yeah, that that is a correct solution. All right. You know, this is actually kind of embarrassing, but I took like 15 or 20 minutes to solve this. I mean, personally, I'm just like very very bad at like uh what you can call these kind of problems.

[00:24:40]Constructive problems. Yeah, that's the word I'm looking for. So, why don't you go ahead and just like code this up in the Q editor, >> you know, like no ID.

[00:24:49]>> Just just to see if you just just to see if you still have it. I mean, it's a pretty easy problem, right?

[00:24:53]>> I think I'm going to make it harder for me. I'm I'm going to code it in Notepad.

[00:24:57]>> Okay, fine. Notepad works as well.

[00:25:00]>> Not this Notepad. This This Notepad Microsoft has made it [ __ ] trash.

[00:25:07]>> No, no, no. Don't use Don't use an actual ID. You need to use You need to use either Notepad, this one, or the Qog editor.

[00:25:14]>> Oh, no. I'll use Notepad++ without syntax highlighting. That's It doesn't have autocomplete. So, it's basically the exact same. It's just monospaced.

[00:25:23]So, >> is this Java code I see?

[00:25:25]>> Yes.

[00:25:27]>> Wait a minute. Weren't you dissing me for using Java just some days ago?

[00:25:30]>> This is for APCSA.

[00:25:33]>> Or do I remember wrong?

[00:25:35]>> This is for APCSA brand. This like doesn't count.

[00:25:39]>> Anyways, let's let's code it in Java only for fun.

[00:25:43]>> Wait, can you submit in Java? You should probably check that out before you Yeah, I don't think you Oh, wait. Can you just scroll down? Okay.

[00:25:51]>> All right. There's some Chinese things.

[00:25:56]The package of a Java program should not be specified.

[00:26:00]Oh, okay.

[00:26:05]Okay. Come on, bro. You're going to make it difficult for me.

[00:26:09]>> Okay. Go ahead. Java.

[00:26:11]>> Okay.

[00:26:12]>> Yeah. Yeah. Public static void main.

[00:26:14]Let's go, man.

[00:26:17]How many people here have taken Java in school? How many people here know the trauma associated with it?

[00:26:24]>> You need to import java scanner. I'm pretty sure you know >> and then we have >> unless you have >> uh so okay there's a scanner class.

[00:26:38]>> Yeah. But you need to import that >> and it was system.n I believe >> it was it was that's correct.

[00:26:50]import scanner. I don't know what the imports are, unfortunately.

[00:26:54]>> Java.scanner, dude. I mean, this is just >> See, now there's a Java programmer here.

[00:27:01]I think it's pretty clear.

[00:27:04]>> Yeah. I mean, I know the basics. All right. I know the basics.

[00:27:07]>> Oh, IC has Java. That's interesting.

[00:27:12]>> What is ICC?

[00:27:14]>> ICE the board you >> ICC. Yeah. Yeah. Right. Right. That's the reason I know it. Yeah. Like >> uh let's do s do.can int.

[00:27:26]>> Okay. It's s it's s. Next. Dude, this is like >> Okay, I see. Okay, guys. Guys, guys, I had a reference for APCSA. Okay, I'm I'm doing this as like an AP exam. You have >> Yeah, you're not doing that well at this AP exam, bro.

[00:27:42]>> We have this. We have this. Okay. So, I'm going to You know what? I'm going to use this. Let's Let's keep it fair.

[00:27:51]>> Oh, yeah. Let's Let's just pull up the cheat sheet, you know, >> the official cheat by myself.

[00:27:57]>> Yeah. Cuz I don't know how to do Java myself. Let's just pull up this cheat sheet that tells me everything. Yeah.

[00:28:03]Yeah. All right.

[00:28:04]>> Yeah. I has to be capital, for example.

[00:28:07]>> Yeah. Right. That That was a very unobvious fact, right?

[00:28:11]>> Yes. I I don't know. I I'm not used to it. Okay. String S of length N consisting of characters plus and minus.

[00:28:20]Okay. So let's just use a string S is equal to S dot.

[00:28:28]>> You can't call both the scanner and the string S. You need to call it str or something.

[00:28:33]>> All right. Let's call it str. That's fine. Whatever.

[00:28:37]So >> now let us make a loop starting from zero str.length and uh okay so we have string char which is equal to str sub.

[00:28:59]>> You can't call the variable char cuz that's a data type's name dude. I mean what what is going on here man? I didn't know I they don't have the char data type in APA.

[00:29:11]>> All right.

[00:29:12]>> They only have this int boolean and uh double primitives. So >> that's all I know.

[00:29:22]>> Okay, >> bro. Char at is a function that exists.

[00:29:25]I don't know what what you're cooking up here, but >> I don't see you can use equals to compare.

[00:29:36]Oh, no. I I was joking when I said that actually.

[00:29:45]>> All right, man.

[00:29:49]Uh >> boolean array.

[00:29:54]Okay. Why do we need a boolean array?

[00:29:56]>> Uh to interpret the string.

[00:30:00]>> Uh we don't need to interpret the string, right?

[00:30:04]I think it's going to be better if we do interpret it cuz >> like we can just do a forward pass and a backward pass. Like you don't need to store any sort of like information.

[00:30:13]>> Yeah. Yeah. That it's it's going to be easier for me to code if I store that info.

[00:30:19]>> All right, man. I mean, if you say so.

[00:30:22]Currently, you have taken 4 + 2, that's 6 minutes. So I think if you don't code it in like 20 seconds you'll be worse than my >> so sorry not man you'll be worse than swasti >> or if that is plus then what's the output if it's not possible >> it's just no n o capital >> system out dot print ln no it's really hard to code without. Okay. What's early exit? I don't know how to early exit. Oh, I can just return.

[00:31:00]>> No, you I think you can, but system dot actually. Yeah, I think return should also work. All right.

[00:31:06]>> And uh otherwise it is possible. So let's sprint line. Yes. And then we have n integers >> and we justation itself. So let's let's just create a integer array answer which is new.

[00:31:28]>> Oh this is this this is not a cook man.

[00:31:30]I mean >> uh >> I could have coded this on Python faster than you and you know how bad I am at Python.

[00:31:39]>> I mean I learned Java and I'm coding it without syntax highlighting without autocomplete in Notepad. So hey, we aren't really the same person. Okay.

[00:31:51]Okay. Okay. If you say so. If you say so.

[00:31:54]>> We're not the same person. Remember that.

[00:31:59]>> Yeah. I don't code in Java. So, I think I can agree.

[00:32:06]>> Oh, so is the last thing meant to be like a pointer?

[00:32:09]>> Yep.

[00:32:10]>> All right.

[00:32:11]>> So, if uh Okay, you know what? Let's let's code it in a pretty way.

[00:32:18]If >> Oh, by the way, by that he means unreadable >> for people who are new.

[00:32:24]>> If not at AI. Okay, I'm getting a call.

[00:32:26]Wait, let's listen to who's calling.

[00:32:31]>> Hello.

[00:32:33]>> Yeah.

[00:32:55]It has been 6 minutes >> process two of thinking.

[00:33:03]>> Okay. Yes, I'm I'm back. I'm back.

[00:33:09]>> Why is coding in this disgusting language? I swear to God. I don't know.

[00:33:13]I think something's got in the t like some days ago he was telling me that NodeJS is ours as well.

[00:33:19]>> NodeJS is ours. So >> So it's like he said he's starting to like Java, JavaScript, all these like like second class, third class languages.

[00:33:30]>> Don't call them third class. They're the best languages. They were literally given to us by God himself.

[00:33:37]>> Oh, really? Really? All right, man. By the way, you need two brackets to close.

[00:33:42]Like you do not like have two brackets where >> uh you opened an if bracket, right? So you have the four bracket and the if bracket, bro, the four >> four doesn't have an open bracket, s it's an inline for bro.

[00:33:59]>> That's what I said. Let me code it in a pretty whim.

[00:34:03]>> Okay. Does that even work in Java?

[00:34:06]Yes, I am coding it in this disgusting language because this language is so ours, isn't it?

[00:34:16]>> It's not. But are you entitled to your own opinion? I guess >> it is. You You're just trying to cope.

[00:34:26]>> All right, bro.

[00:34:30]>> System.out.rint.

[00:34:32]He >> should be done any second now.

[00:34:35]Um okay what do we output? We just output the integer. So answer of five plus we output the empty string >> space >> and we do system.out.print ln.

[00:34:54]>> All right. So do you want to check your code? You want to submit it right away?

[00:34:58]What do you think?

[00:34:59]>> I think we're going to do a test run.

[00:35:02]>> Oh, really?

[00:35:05]Oh [ __ ] >> Highlighting.

[00:35:08]>> I mean, it's all right. You already coded it off. So, I'll I'll let this slide.

[00:35:12]>> No, no, no. We got to disable.

[00:35:19]>> Apologize to God for this. I don't think you understand. Wait, is this for Node or is this for Java?

[00:35:25]>> It's for Java. It's for Java.

[00:35:27]>> Okay, for Java, I mean, bro, all I'm saying is the rules are super strict.

[00:35:32]Like it's a super simple language. It's like C++ you can do whatever [ __ ] you want and the the >> Yeah. And this guy was like coming to me and being like why does while one not work >> while and he was like losing points. He was like no why am I getting so mad. I'm like dude like you deserve this. If you guys have looked at any of his score in C++ like ever you know what I'm talking about. Okay, let's just let's use nano as well.

[00:36:06]>> Making it worse, but all right. Rules are strict and that's that's why it's a simple language because the rules are strict.

[00:36:14]>> Basically, it means that like you know if a language has many rules, that's like very complicated, right? Like you can do the same thing in like 10 different ways, but that's not the case with Java.

[00:36:28]Uh Java doesn't exist.

[00:36:31]>> It's util, not utils.

[00:36:35]>> Okay. I mean that's your fault.

[00:36:38]>> My fault.

[00:36:41]And you're the one that wrote imports scatter. So I mean my >> imports are not expected to be written in the AP exam. You're supposed to just use the classes and expect that they are imported.

[00:36:54]>> Oh, okay. Okay. My bad, man.

[00:36:56]Wait, is that a zero? Okay, zero. All right.

[00:37:00]>> Yeah. Okay. So, >> wait, wait, hold on. Just go back to your thing real quick. Two zero. Does that say two 0?

[00:37:12]>> Can see 0 is connected to >> Should it be 02?

[00:37:16]>> What?

[00:37:18]>> Shouldn't it be 02? Not 2.

[00:37:20]>> No.

[00:37:22]How can it be? How can be zero connected to zero?

[00:37:26]No, zero connected to two.

[00:37:29]>> Yeah, zero is connected to two. Yes.

[00:37:32]>> Uh that's why zero should be first.

[00:37:34]>> What?

[00:37:36]>> Yeah. Okay. I mean, you can go ahead and submit and uh let's see if it works.

[00:37:42]>> Did I not read the output format correctly?

[00:37:47]>> I think you didn't. Yeah.

[00:37:49]>> Oh, wait. No, no, no, not not this, right? Otherwise, I'll see syntax highlighting.

[00:37:57]Let's get ready for the wrong answer.

[00:38:00]>> Error. What? Main method not found in class answer do main. Oh >> yeah. See this is what I was talking about by the way yesterday. So I think they fixed it in the new version but in the old version you need string ors.

[00:38:18]Okay.

[00:38:18]>> This is an old This is a newer version.

[00:38:21]Tower 21.

[00:38:31]>> All right, let's see.

[00:38:33]>> We have Okay, we we see.

[00:38:35]>> Yeah, that's what I was talking about.

[00:38:37]Like basically, you need to enter output zero too.

[00:38:41]Uh, >> so I think I read the output incorrectly.

[00:38:45]>> Yeah. Yeah, I think so.

[00:38:52]Oh, on a valid. Oh my god. Then it's trivial, bro.

[00:38:58]>> Then the answer is so trivial. I thought they they wanted me to print out something else.

[00:39:04]>> Yeah, that's why I was like, you can just use two loops. Why you doing this boolean thing?

[00:39:07]>> Yes.

[00:39:07]>> And you're like, no trust in the Java or something. And I was like, >> okay, God. God.

[00:39:14]>> Yeah. But guys, this is the truth of Savic, man. problem. AC in 6 minutes runtime error plus it's wrong.

[00:39:22]I'm sorry.

[00:39:27]Yo, you guys have seen that all today. I don't even know what to know what more we could have.

[00:39:35]>> It's I I plus an empty string and >> Oh, wait. What were you printing?

[00:39:44]answer. What >> the cabin I is connected to?

[00:39:50]>> Oh, I get what you mean. Okay. Okay, I see. No, no, no. You just have to print I. Okay. Okay, I see. So, now you should get AC.

[00:40:01]>> Yeah.

[00:40:02]>> Wait, what? Why is it? What is it? 1 3 4. No, this is still wrong.

[00:40:06]>> No, one is connected. Oh, did I do the reverse order?

[00:40:12]reverse order. I think I did reverse order.

[00:40:16]>> It's if AFI and if not AFI. Yeah. Yeah.

[00:40:19]Yeah. Exactly.

[00:40:22]>> Yeah.

[00:40:22]>> Now you have AC. Yeah. Now submit this.

[00:40:28]>> Okay guys, that was just a small hiccup.

[00:40:30]I think bad.

[00:40:32]>> Just a tiny. Just a tiny.

[00:40:36]>> I mean to be fair, I misunderstood the problem. like I didn't read the output format correctly.

[00:40:42]>> Right. Right. It's not his fault, guys.

[00:40:45]>> Come on, bro. It's their fault. Yes.

[00:40:48]>> You see?

[00:40:49]>> All right. Okay. So, yeah, >> that's how we solve P1.

[00:40:54]>> Explain my stomach.

[00:40:56]>> That That is called a cook, guys.

[00:40:59]>> Explain your gold medalist.

[00:41:01]>> Don't look at the 17 minutes, man. Who said don't? No, no, no. Look at this.

[00:41:06]Look at this. Look at the fact that I coded it up in Notepad++ without syntax highlighting. I coded this in Notepad with a box of scraps. Like >> you're coding this up in your fancy ass IDE. We are not the same person. Like >> All right, man.

[00:41:28]>> We are not the same person, guys. Like, like, no.

[00:41:33]>> All right. I I think it's time to just have a quick look at what's going on in the leaderboard.

[00:41:38]>> I think we may have missed some things.

[00:41:40]Let's have a look. Let's have a look.

[00:41:41]>> Switch over to a Vegna again.

[00:41:44]>> Okay, so how are we doing right now?

[00:41:47]Okay, so I think we stopped off somewhere over here, right? We have some submissions. Okay, we had a submission from my on P3 getting subtask number four.

[00:41:58]Okay.

[00:41:59]>> So, and but no subtask number one, two or three. Just directly to four. And look at her submission history, too. 23 22 23 0. So, I don't know what she's trying for. And it's pretty rare that you see subtask number four being easier than the first three. You think she may be going for AC? Actually, you know, it could be possible. 1 2 3 are special cases, then four and five are just like the full solutions.

[00:42:24]>> It is possible. I think the subtask four is a special case. Subtask three is a special case. And then >> we just have another submission from right as we speak on on P3 as well. All right.

[00:42:36]>> That's an AC. She she's going to cook.

[00:42:40]>> No, I don't know. I I >> I think it's going to be three subtasks.

[00:42:43]So, like the first two.

[00:42:46]>> First one. Not that bad. No, pretty close. Pretty close. Okay. So, that's subtasking really nicely. What's Lara doing?

[00:42:55]Let's let's check up on Many. She also got 79 on P2 which as we decided was pretty like normal but pretty doable to get given by the leaderboard. So that's pretty good as well. Uh then what do we have? We have Swasti with P1, P2, P3, sorry, a subtask 1, 2, and three on P3.

[00:43:16]>> Hasn't done anything in a while then, right?

[00:43:19]>> Yeah. No, no, she >> Oh, she got Oh, she got subtask three.

[00:43:23]Okay, it's pretty respectable.

[00:43:25]>> That's fine. Yeah, that's fine. Okay. Uh then we have a submission by Lyra.

[00:43:31]>> Oh. Oh, this is not looking good. Okay, so it seems that she has moved on from P1 and gone to P2, which is actually okay. So, there's two ways to see this, right? On one hand, P1 was an AC problem. So, ideally speaking, she should have gone AC on or not. But also, it's good to not get stuck on the same problem for a while. So maybe she'll come back to P1 in in some more time.

[00:43:54]But yeah, right now it's not looking that good.

[00:43:57]>> Okay, wait. I think your stream uh your webcam is lagging a bit. I mean, someone said in the chat as well. And by the way, this the reason why I look way more smoother than him is cuz I'm the one streaming. So it's going directly from me. Well, for Agna that data is coming from his computer to my computer and then mine to YouTube. So, it's like double compression as well.

[00:44:22]>> I hope it's not that bad, right? I mean, because it's also like we using Streamlabs, what is it called? Collab Cam. Yeah. So, this is going to be like way better than if I was on call with him and he was streaming that call or something. So, I think at least the audio quality is fixed because of that.

[00:44:38]So, it's like better than nothing.

[00:44:41]>> Yeah. Plus, I think he's on like a worse webcam than usual today anyways cuz >> Yeah. Yeah. Yeah. That that's also contributing to it a bit. Yeah. Okay.

[00:44:50]What are our medals so far? So, we have we have gold, silver, bronze, HM. So, I think on day one Nan predict predicted that these would be our results. I mean, I hope it's not the case. Oh, just as we speaking, we have two submissions from Lyra on is that P2? I think that's P2.

[00:45:08]and Swasti on P3.

[00:45:12]Oh, another submission from her on P3.

[00:45:14]Could she be going for subtask four or even?

[00:45:16]>> I hope that's a subtask four. Let's subtask four is going to be good.

[00:45:21]Subtask four is going to be mighty.

[00:45:24]>> Lyra did not get more points unfortunately. Many also made a submission right now. Okay, so she's going to get two and three as we were talking about.

[00:45:33]>> Yep.

[00:45:34]>> Yeah. Yeah. This is all. Oh, so Swasti could get subtask number four. Okay, she she got a zero now. But since my has subtask four, it seems very in the realm of possibilities that she could easily get subtask 4, too. Okay. And my has subtask one and two. Okay, so now there's just three remaining. All right.

[00:45:54]>> Yep. I think they all are cooking pretty hard. Like man is easily doing silver.

[00:46:01]>> Yeah, man is getting silver. That's true. may even get gold if she gets lucky. But she would need to ACP2 for that. I'm pretty sure. Like I have a feeling gold this time is going to be P1, P2, 100. P3 is probably going to be it's probably going to be Yeah, it's probably going to be 64 and P4. Well, actually, we have no way of saying what P4 would be cuz there's been no submissions so far. So, >> I mean, we are 1 hour 20 minutes into the contest, right? These people are Oh, Swasti 54 was the 64. That's subtask four. I see four.

[00:46:35]>> Oh, all right. There you go.

[00:46:36]>> That's GG's.

[00:46:37]>> Okay.

[00:46:39]And this is pretty insane. I think Si was like rank 11 or seven. Now she's like sticking on. Oh, why did my page just refresh? I mean, all right. Let me just select the teams again. Uh, by the way, if there's any >> day only. Let's let's look at day two only. I mean, now it's getting pretty interesting.

[00:46:58]>> Okay, let's see. Oh, Swasti is rank three when you only consider day two.

[00:47:02]That's interesting.

[00:47:03]>> Yep. Swasti is cooking really hard. Just one subtask left on P3 and then P4 is like a zero. And Mani is cooking pretty hard on P3 as well. So Mani should get 64 on P3 as well. Just 21 missing on P2.

[00:47:22]>> Right. Right. Right. And the now the thing about this 21 on P2 is at least according to EGI standards either this is tedious to code or she's missing like a very small idea.

[00:47:33]>> And the the bad thing about that is it's not that likely that you get it if you leave it behind. But maybe >> I'm asking for IIY teams.

[00:47:46]>> H let's see.

[00:47:48]>> It's actually pretty hard. I don't know who the third and fourth person are going to be. I mean if it was like really confusing >> I feel like it's going to be Avanch Abhinav or Man at least one of them because they were really really strong last year and >> you know he >> True and and strong as well.

[00:48:08]>> Yep. And they're going to be done with J now at least Avian will be. So they're going to be grinding two weeks happening J was happening during the time of right.

[00:48:22]Oh no J.

[00:48:24]>> Oh, Jay is tomorrow. All right. Well, good luck to everyone giving it here.

[00:48:30]>> I don't think you should be watching the stream right now if you have Jay tomorrow. By the way, just saying.

[00:48:35]>> Right. Right. Right.

[00:48:37]>> Yeah.

[00:48:38]>> Although maybe, you know, I mean, personally, I think EGI is more important. That's what Lyra thought as well. That's why she was planning to give J, but she ended up not doing it to go to EG, which is actually like really cool. I mean, imagine having to go to an international Olympia and not giving a J exam. Like, >> how would she get means?

[00:49:00]>> I'm not sure actually. I haven't asked her.

[00:49:02]>> Oh.

[00:49:03]>> H. Okay. Wait, do we have any submissions on P4 at all? Oh, we don't.

[00:49:09]>> P4?

[00:49:10]>> Oh my god. Okay.

[00:49:11]>> I mean, people are probably just waiting for P4. Like, >> yeah. Is it too early? Is it too early?

[00:49:18]>> Yeah, it's Maybe it is too early. Okay, but oh my god, look at this. We have 100 100 by two people on A, B, and C. This did not happen until like a lot later on day one. A day when P3 was actually pretty interesting, but I mean looking at the problem, I did not think that there would only be two ACs. Oh, and just as I said that on day two, we have three ACs, which is already more than how much we had on day one. So, by the looks of it, okay, by the looks of it, P1 and P2 are definitely ACable. We have so many ACS on P2. P1 is like most definitely AC.

[00:49:56]P3, I have a feeling is probably going to be doable as well. P4, we still have zeros. Like, we literally don't have a single submission. Do we wait, do we not have a single submission or do we not have do we not have like a single non-zero score? Because there is a difference.

[00:50:14]Hm.

[00:50:15]I think there's no submission at all, right? Oh, no. We do have a submission.

[00:50:19]>> It's way too early. Everyone's probably just focusing on maximizing first three problems.

[00:50:24]>> Okay, we have a submission from Lyra.

[00:50:27]Oh, which unfortunately is still just a nine on P2.

[00:50:32]Again, this is like the kind of thing that makes you wonder what the problems are, you know? Is it like some kind of problem like you know like a greedy kind of problem which which even I would struggle on or is it like a >> it's something more simple?

[00:50:47]H wait actually do you know if Pakistan participates in the EGI?

[00:50:52]>> I don't think so.

[00:50:57]>> Oh they don't they don't. Okay.

[00:50:59]>> How is Japan doing?

[00:51:01]>> Probably need a lot of money for that.

[00:51:03]Not going to lie. and >> oh okay I see I see I mean I guess it is Europe after all so let's look at Singapore as well okay so we're looking at Singapore and why we not looking at Ukraine we need Ukraine too cuz they were the winners on day one okay let's see so we have Ukraine in the lead then Mariza which is like who's like fourth and then her team members oh look at that one of Mara's team members has 40 on P1 so they're not four zeros. So, >> I don't think they're meddling. So, >> unfortunately, you may be right. But, but hey, this is still pretty good, right? If you look at it, like this is she's like the absolute best in her country. Then we have her. It's probably like, you know, we can have some conversations together about some problems. And then these two people who uh still need some time to get better.

[00:51:58]All right. But anyway, we have Japan, two goals, and where's the fourth Japan?

[00:52:04]Oh, we have two golds, one silver, and one bronze for Japan. I actually expected Japan to be a little bit stronger. What about you?

[00:52:11]>> I mean, that's pretty good. One gold, two silvers, one bronze.

[00:52:16]That's super strong, >> but it's But it's Japan. We need to keep in mind that Japan is insanely strong.

[00:52:24]Like three Japanese guys in API, I think.

[00:52:28]I mean, you're pretty strong, too, man.

[00:52:31]So, that's not a valid benchmark, right?

[00:52:34]So, >> I'm not that strong. Like, it's like >> Okay. Okay. To be fair, we did just see you trying to code EGI P1. So, I guess >> that was pretty strong. That was pretty strong for the conditions. Like, I mean, you want to do P2A in Python without autocomplete.

[00:52:56]Bro, I haven't ACP2 normally either and I've read the problems actually. So, it wouldn't be that fair for me.

[00:53:03]>> Okay, you can we can do like a CF800 d.

[00:53:06]I think that'll be pretty good.

[00:53:09]>> Bro, I have not solved a CF problem for like 10 years and I am not on my laptop right now. I'm going to actually have to code a notepad. Like, >> yeah, I'm also going to code it in not that's the point. I we both are going to code it in notepad.

[00:53:24]>> H, you know what? Maybe we can do that.

[00:53:26]But probably we should discuss the problems first, right? And then after after that gets done, you know, we can start doing stuff like CF duels maybe.

[00:53:38]>> Let's see.

[00:53:39]>> I have to log into CF over here as well.

[00:53:41]I don't know if I even have You know what? That should be probably possible.

[00:53:45]Okay, let's Oh, we just had another Ukraine person jump to gold. Okay. Okay.

[00:53:50]So, what about Brazil? Brazil is currently at one gold. Oh, Clara's doing a lot worse today than she was on day one, which is interesting.

[00:53:58]>> She's doing pretty good. 25. That's just two subtasks left. She's She's >> Yeah, but but last time she was at rank two, rank three for like pretty much the entire time. Like did not drop below that. Uh okay. But we have one gold, two silvers, and one bronze. All right, I see. What about Ukraine? Ukraine is two golds, one silver, one bronze. Singapore is wait Singapore has no goals. Okay, we have three silvers and one zero score from Singapore. Wow. Okay, >> that is interesting.

[00:54:38]>> Cypress only have three contestants.

[00:54:40]probably again because of budget constraints cuz >> they did >> one African country in II and they only sent one guy like literally just one person.

[00:54:53]>> But do you remember that one guy from II? I forgot his name but he got like 0.43 points or something like that.

[00:55:00]>> 0.43 Jason something. Yeah. Yeah. Some Jason something, bro. I I don't remember his exact name. Maybe someone over here knows. There's one guy.

[00:55:12]>> I don't remember. And I'm so sleepy today cuz I woke up too early. I You know, this guy woke up and I called him the live stream. He's like, "Wait, it's now the entire reason this thing is late. I mean, that's like his fault, guys." So, >> no.

[00:55:37]The freaking silence of shame is crazy, bro.

[00:55:40]>> No, wait. Can you not see my cam?

[00:55:44]>> No, I can. Oh, I can only see like a small portion of it. What are you doing like this?

[00:55:48]>> Yes.

[00:55:50]>> Oh, okay. Okay. I mean, I would I would say agree, but like whatever you say, man. Okay. Wait, hold on. Do we think that P P3 AC is doable? Do you think that some of these people do you think Mara is getting AC on P3? What about Swasti? I don't think Swasti is getting AC on P3.

[00:56:09]>> Uh what about Clara and Mariso?

[00:56:12]>> Clara again I don't know. I don't think P3 P3 AC is probably something non-trivial because if all three ACs are trivial then gold boundary is going to be very high and we can't have that.

[00:56:27]>> That's true. That's true. And and yeah, I mean if all three ACs are trivial and then just D is just like a like a problem where everyone gets zero, then the deciding factor is just going to be day one.

[00:56:39]>> Yeah. What did we have as the goal cut off on day one?

[00:56:43]>> Goal cut off on day one I think was 100 + 100 + 71 + 11. How much is that? 271 + 11 is 282. Yeah, I think that was the goal cut off.

[00:56:53]>> Yeah. Yeah.

[00:56:54]>> Yeah. So we should expect something along that line for today as well.

[00:56:59]>> Yes. Right now we are at 220 being the gold cutff. 100 + 79 + 41 + 0. Oh. Oh my god. You see this? We have our >> first tasks. What are those distributions? Okay. 65 last subtask.

[00:57:19]>> This was the same thing as yesterday actually. Do you think this is a communication problem as well? I don't know. Communication, but that's definitely a partial graded problem.

[00:57:28]>> Yeah, like communication/ interactive is what I mean.

[00:57:32]>> Interactive maybe.

[00:57:35]Maybe. I don't think we're going to have two communications. That would be historic, I think.

[00:57:40]>> Oh, really?

[00:57:42]>> I mean, two communications in Eg. That's That's absolutely crazy.

[00:57:49]I mean, at least in the mock given, there's always been like one communication per day. I don't know. I think it's pretty normal.

[00:57:56]>> I don't think so.

[00:57:59]>> H how 11 is the highest on D? Yeah, there's only literally one person from Australia with 11 points on D and that's pretty much it.

[00:58:10]>> Okay, but that means D is also still doable. So, people have not done a round doing D yet.

[00:58:20]H I'm kind of concerned about Lyra right now. I mean 40 + 9 and I don't know what she's trying right now. Wait. So >> she's still going to get Okay, let's let's try to run predictions maybe.

[00:58:37]>> Run predictions >> on cut offs.

[00:58:41]>> Cut offs. Uh total cut offs or let's just do just day three, right?

[00:58:46]>> Yeah. You know what? what we can do. So you you know the trick I used for predicting API cut offs to a really good accuracy.

[00:58:54]>> I mean you were like off by like 25 points.

[00:58:57]>> Yeah. But that was exactly my error.

[00:58:59]Like I calculated my RMSSE and that was exactly it. So >> plus or minus 20.

[00:59:04]>> Yes. Okay.

[00:59:06]>> So that means it's plus here we'll have like 300 400 data points. So it's going to be way more accurate and we can probably train like a small neural network.

[00:59:17]neural network.

[00:59:20]I mean, I don't know much about AI myself, but if you think that is possible, I mean, >> yeah, I'll leave it up to you.

[00:59:28]>> By the way, do we know if the cutffs on this website are accurate? I think it is right. This is just based on like top 50%, top 25%, top 12.5%, right? The the bronze colors we see on screen over here.

[00:59:41]>> Yeah, I think so. Oh, yeah. Wait, just find the ranking for EGI day 3. Uh, EGI 2025 day 2.

[00:59:51]>> EGI 2025 day 2. I think we can find it.

[00:59:55]Uh, >> uh, not the complete ranking like the timed ranking.

[01:00:00]>> Oh, the timed ranking. Is that even there?

[01:00:05]I don't think that exists because last year they had it on cat, not on CMS.

[01:00:09]>> Oh, but okay. We can you can we can use day one as the donator then.

[01:00:14]>> You know, try doing that. I mean, we have the contest moving a little slow now anyway. So, let's let's do something interesting.

[01:00:21]>> I mean, how long do you think it's going to take?

[01:00:24]>> Well, it shouldn't take more than like 15 20 minutes.

[01:00:29]>> All right. I mean, do you know how to import the data from the website?

[01:00:33]>> Yes, sir. Let's let's let's switch to me then.

[01:00:37]>> All right. Go ahead.

[01:00:41]Okay, let's stop now.

[01:00:46]>> Uh, till then I'll just make a rough prediction uh just based on wives, you know, and we can compare it to how well his thing does as well.

[01:00:54]>> So, >> just based on wives, I feel like the gold cutff is going to be 100 + 100 plus 48 plus Oh, you know what? Let's not make it 48.

[01:01:06]I think it's going to be 100 + 100 + 64 + 9. Yeah, I think that's what gold is going to be.

[01:01:13]>> Okay, so 136 137. Let's just use the cut offs at 137.

[01:01:22]>> Ooh, wait. Is this not copyable?

[01:01:26]>> Oh no. Is this not copyable?

[01:01:29]>> I think you can copy. Just come on. See?

[01:01:32]>> Well, that did not work.

[01:01:34]Oh, >> I mean we probably we can probably like do this, right?

[01:01:45]>> All right. This is not a cook, man.

[01:01:50]>> Okay. Okay. It's a binary file, so I'm not reading binary files right now. Um, okay. We have I have All right. Let's just let's just try and see if we can inspect element our way into it.

[01:02:10]I don't think I don't think this is a coke man personally speaking.

[01:02:17]>> Oh yes, these are the rows. Yeah, these are the rows and this is the div.

[01:02:24]So >> also I'll just be right back. I just need to get something to eat. Uh, and I'll be back in two.

[01:02:31]>> All right.

[01:02:47]Let's see.

[01:02:54]Seriously iron cuz why not?

[01:03:20]Wait, how do you switch to just day two?

[01:03:28]How do you just day two leaderboard?

[01:03:31]>> Oh, >> uh, just click on the day two. Yeah.

[01:03:34]>> Okay.

[01:03:36]>> How's it going? Are we making any progress? I >> think so.

[01:03:40]Yeah, we're we're still still the same place. But let's let's run the predictions now.

[01:03:49]Let's uh do it at 140.

[01:03:55]Okay, this technique is kind of cringe, but why not, right?

[01:04:02]It's okay, Sonic. You don't need to pretend like we don't do this all the time.

[01:04:16]H >> let's use >> let's use fast one.

[01:04:22]>> You know what I think? You know what I think we can do? I think while you figure this out, I can probably just go over yesterday's no day before yesterday's P2 with with the stream.

[01:04:34]You think that sounds like a good idea?

[01:04:38]>> Oh, wait, wait, wait. This didn't work.

[01:04:43]No, I mean, okay, sure. Let's switch over to you then.

[01:04:50]>> Yeah, just go ahead.

[01:04:54]>> So, >> okay. Wait, let me also just go ahead and take a small break in the meantime.

[01:05:01]>> All right. Sure. I'll continue. I'll continue explaining P2 till then.

[01:05:11]All right. So, let's pull it up. So, EGI 2026 QJ.

[01:05:27]Oh, can you not access the problems unless you log in?

[01:05:36]Wait, hold on. Cuz this is not my computer. So, okay. Okay, wait. What if I go here?

[01:05:47]Okay, that works. I think biscuits was P2.

[01:05:52]All right. Yeah, so we No, Biscuits was P3. Oven Masters was P2. All right, there you go. So, we were did manage to bypass that. All right. So, for the people who haven't read the problem, uh the problem is basically that we have we have n people. Okay, so basically we are uh we essentially need to imagine a permutation uh which represents n people and their relative rankings. So with these n people there are also m tables. Uh the ranks go from zero being the best rank to n minus one being the worst rank. Now what happens is uh for example if the permutation is something like 103 542 people sit down on the table. So in this case n is equal to 5 m is equal to 2. The first two people sit down on the tables in the order of their arrival. Uh then for the remaining people they follow a specific procedure.

[01:06:50]So what they do is uh let me just read this verbatim. Uh each time a baker that is a person arrives they choose a plate with a worse rank than theirs but still something better than them. So that is essentially like kind of like a lower bound. So for example, if I had numbers 1 2 3 4 5 or if I had 1 2 3 4 and six and a baker with number five arrived, then they would choose the number four cuz four is the biggest rank that is still worse than that is still better than them.

[01:07:24]So they do this procedure and after they do that they replace the number that they chose with their own number and this procedure keeps on happening.

[01:07:33]Now the one question may be that like what if you have 1 2 3 4 5 but then zero arrives and everyone over there is worse than him. In that case nothing happens.

[01:07:42]The zero is just skipped and we still have 1 2 3 4 5 in the table.

[01:07:47]So that is the procedure that happens and at the end we're going to have something like this right where we have the tables and we have the numbers that are stacked on top of them. This is what is given to us in the input. And what we need to do is we need to reconstruct the permutation that was possible that that could have caused this to happen. Uh so in this case one permutation that could have caused this to happen is 1 03 542 because if we simulate it 1 0 goes in the bottom. Then three will pick out one cuz it's the best one. Then five is going to pick out three from 0 and 3.

[01:08:21]Then four is going to pick out uh sorry not four. We're going to have 1 35 right. Yeah. So four is going to pick out zero from 0 and five and two is going to see four and five two is smaller than all of them. So it's just going to get skipped entirely and we get exactly this order. So does the question make sense?

[01:08:44]Uh people over here or maybe I'll just read the question verbatim once as well just to ensure that it's that's all good. So you're a reporter at the excellent glutenous oven masters and they went for n pizza bakers of Italy compete to decide who makes the best pizza. Each baker baked one pizza.

[01:09:12]The pizzas were ranked by a jury. Each one received a distinct rank from zero to n minus one. And the baker received the same rank as the pizza. Then after the competition, it's time to eat pizzas. They will attend the event. Not everyone will bring and everyone will bring their own pizza. They arrive one by one in some order. There are m less than or equal to n tables. The first first time bakers who arrive place their pizza on the tables.

[01:09:37]After that, a baker each time a baker arrives, they choose the available pizza with the worst rank still better than theirs. They sit down at the table to eat their pizza. Finally, they leave their own pizza behind on the same table for another baker to eat afterwards. If no pizza exists because all tables have pizzas ranked worse than their own, then the baker leaves frustrated and takes the pizza with them.

[01:10:03]Now we need to construct the permutation that could have possibly caused this to happen. So that is what the problem says. Now if we need to so let's read this out. Uh solutions with a correct first line yes or no that's whether it is possible at all to construct such a permutation.

[01:10:20]If we get that correct we get 20% of the points. If we get that correct and we get any valid order not necessarily the lexographically smallest permutation then we get 40 points. And to score a full 100 points, we need to output yes or no correctly. And if it is yes, also lexographically smallest permutation.

[01:10:43]All right. So does that make sense?

[01:10:58]Is anything going on right now? Boom. We have a submission from D by Swasti.

[01:11:04]Okay. I don't think anything happened, right? Let me just really quick just confirm that. Yeah. Okay. Okay.

[01:11:11]Nothing's going on right now. We still have Swasti Mani. Still have Lyra at 40 + 9. All right. Okay.

[01:11:20]So, now the solution to this problem, we're going to start looking at the subtasks. Okay.

[01:11:31]So firstly we have m is equal to 1 that means there's only one table. If there is only one table then the order the participants come in is pretty much okay so let me just draw this line. The order the participants come in is pretty much going to be the order that the permutation has to have.

[01:11:51]Now there's one caveat with this and that is that if you notice what the problem statement says if we just go back to the problem statement it says something very particular and it is that a pizza a new pizza only sits at a place where the rank is already better than theirs. So that means that on each one of these stacks if you even look at this example the stack is always going to be sorted uh so the smallest element is at the bottom and the biggest element at the top. So the second we have something like 3 1 2 we know the answer is immediately that like no it's not possible right so that's that's one of the cases that's one case where you can rule out the answer not being possible.

[01:12:39]Now the other case which I'm going to again look at this example for. So we have 13 5 4 0 which I'm going to write over here 1 3 5 4 0. All right. So over here we can see that one number that is missing is two.

[01:13:00]Now if you think about what they said when we need a number to be missing. So hold on. How do I change my pen's color?

[01:13:07]Can I not do that?

[01:13:09]I think I opened something.

[01:13:12]Uh, but I don't know how to Oh, exit zen mode. All right. Yeah.

[01:13:23]Okay. Uh, let me just draw the line over here. Yeah. If we have 1 3 5 4 0. In that case, if we have an element like two that occurs over here, also wait, I wrote this wrong. This is this is meant to be 0 four. If you have an element something like two over here, it's going to look at everything and it's two is smaller than five and two is smaller than four.

[01:13:47]And that is the reason the two is actually discarded. So if you're looking at a condition for an element E to be discarded, the condition looks like E should be less than every single element over here and every single element over here. If if we have e is less than four and e is less than five, then it's basically like saying e is less than min of 4a 5. So it's going to be min of I'm going to call that a z and a1.

[01:14:19]All right? Does this kind of make sense?

[01:14:22]Now we are going to look at this case for in this case it was just two that was missing.

[01:14:29]But if there was another element like there was another element. So let's say this was E1, but we also needed it the same exact condition to be true for E2.

[01:14:37]In that case, we have E2, E1 is less than the min. So if there's two elements that both have to satisfy a condition of being less than something else, then in that case, this is going to become a max and those are our two conditions. So these are the two conditions that make it so if they are true the solution is feasible and if they are false the solution is not. We need max of all of the missing elements to be less than the min of all of the elements at the top.

[01:15:10]Now the lexographically smallest part when we are adding elements in this sequence we need to ensure that the element we are adding is always less than the things at the top. But as we add more of these elements, the top only ever increases what what that implies is that there's going to be some points over here. Two is missing, right? So if we had this stack over here, three and four, that is fine. Two is still missing over here. So we can put the two down. But if it was but if it was something like this stack now two is bigger than this one over here. So we wouldn't actually be able to do it.

[01:15:53]So that is what we need to keep in mind as well.

[01:16:01]Uh I think these are these are like the two main impossible conditions. So if we satisfy this then how so now we now we have reduced the problem essentially to this subtask over here where the sum of ti is all equal to n.

[01:16:18]In this case, the solution is actually pretty simple. All we have to do is we first look at these elements over here.

[01:16:25]Uh so these ones which are just inserted by default and then we scan upwards and we look at each element at the top over here. We choose the minimum of them and we put it over. We choose the minimum of them and we also have to ensure that when we pick that element. So if we pick a three over here then that three is going to go to this one and not to the zero. In this case that's true because one is the only element before it. So if we l all possible stacks like this and keep choosing the min and keep updating this condition is always going to continue remaining to be true. And if we greedy construct the permutation in this way it turns out that that works.

[01:17:06]So just scoring this verbatim as I said is going to get you till this subtask.

[01:17:11]It's going to get you 70 points. In order to optimize this to a full solve, all we need to do is just make sure that these stacks work out better. So all I mean by that is that we need to make sure that we are able to compute which is the minimum element on top of which stack very fast. And you can do this in multiple ways but I used the segmentry indexed by B where B is the top element.

[01:17:36]Uh and then you can just binary search on that.

[01:17:43]So hopefully that makes sense. If you guys have questions, please ask. Uh I did rush a bit in this explanation, but hopefully some of it made sense. The long story short is basically just that we need to long story short is basically we just need to greedy look at the element on top of each stack and choose the smallest one that follows this order of the things. And that that turns out to work.

[01:18:11]So that is P2.

[01:18:14]All right, let's go back to the leaderboard. Let's see if there's something that I missed.

[01:18:21]Yeah, so we have we still have Swasti at the top. 100 + 100 + 64.

[01:18:27]Uh my is still at 179 48. Somehow she hasn't gotten subass yet, which is pretty unexpected.

[01:18:36]Uh and she did try for it. 121 151. So there was definitely some effort made by her. Dia is still Did make a submission?

[01:18:47]Dia is still at 100 + 31. So there's no progress there as well. And Lyra is still at 40 + 9, which is pretty unfortunate.

[01:18:58]But there's still time left. We are approaching the halfway mark, but not there yet.

[01:19:06]And let's not filter the scoreboard. Let's see how the others are doing. Okay, so we have the first person at rank one being a US being from the US. Wow. Okay.

[01:19:18]US wasn't doing as well yesterday. So, >> hello.

[01:19:23]>> Oh, hello.

[01:19:25]>> Yes, back.

[01:19:28]>> Yes, sir. Hello. Welcome back. Yeah. So, US is somehow at the top now. How about the other US people? How are they doing?

[01:19:39]USA.

[01:19:42]Let's filter the rank list.

[01:19:47]Okay, so we have one US over here, two US in silver, and one US in honor honorable mention. What is going on?

[01:19:56]Have you ever seen a US in the honorable mention?

[01:20:00]>> Yeah. I don't think historically I don't think historically US has ever got an HM. Like what is going on?

[01:20:06]>> I think they they got a bronze in IO 25 if I remember correctly.

[01:20:12]>> Wait, I can't sell you silver for the life of me. And you're telling me that there's people in the US that get through bronze, silver, gold, and platinum and some manager 25 rank list. Let's see.

[01:20:28]>> There's no way that's true. I know scored two US people in the I this year and I'm low silver >> United States.

[01:20:41]I >> mean Rain Boy obviously like >> yeah we have one gold.

[01:20:45]>> Oh two bottom silvers. Oh my god.

[01:20:48]>> And yeah one of them silvers is below me >> and one bronze >> and that to like mid bronze. Not even like high bronze.

[01:20:58]Okay.

[01:20:58]>> No, it it is somewhat high. Somewhat high.

[01:21:01]>> United States.

[01:21:02]>> It's so high. That's not as high as it should be.

[01:21:07]>> That's true. How is this even happening?

[01:21:09]Brian Zooie is like, oh my god. He had gold ranked three in 2024 and now he's at low silver below.

[01:21:18]>> Yes, sir.

[01:21:20]>> That doesn't even make sense. Yeah, I think you are somewhere over here. Yeah, you're also at the boundary of silver and bronze, but you are still above Brian Zoe.

[01:21:31]>> Yes. Isn't that cool?

[01:21:35]>> That is pretty cool. Yeah, but it's also it's also like how does this even happen? How does this even happen?

[01:21:47]Stuff is pretty unexpected. I mean, let's log the scoreboard. We're tracking too many teams right now. I can't even see where India is.

[01:22:01]Yeah, I think a lot of people right now are just stuck at 100 plus 100 plus 64 or 100 on P3. I think the problems are probably going to get significantly harder by this point.

[01:22:13]Yeah, I mean probably it'll be some time until we have some updates. Maybe we should take a break.

[01:22:22]Yeah, maybe. Maybe we can just leave the rank anchor on as well.

[01:22:39]Yeah, let's let's take a break then.

[01:22:41]Let's come back in like an hour and a half.

[01:22:46]>> Yeah.

[01:22:46]>> Have something interesting happening by that point.

[01:22:50]>> Yeah. All right. Cool. Cool. Cool. I'll just turn off my camera. I'll keep my screen on and you keep sharing my screen. Okay.

[01:22:56]>> All right. Sean.

[01:22:58]>> Yep. Cool.