{"status":"OK","result":[{"timeSeconds":1790172604,"blogEntry":{"originalLocale":"en","allowViewHistory":false,"creationTimeSeconds":1790128229,"rating":-9,"authorHandle":"IceKnight1093","modificationTimeSeconds":1790128229,"id":157030,"title":"\u003cp\u003eInvitation to CodeChef Starters 257 (Rated till 6-Stars) — 23rd September\u003c/p\u003e","locale":"en","tags":[]},"comment":{"id":1394133,"creationTimeSeconds":1790172604,"commentatorHandle":"White-Ghost","locale":"en","text":"\u003cdiv class\u003d\"ttypography\"\u003e\u003cp\u003eCodechef : Arena of Cheaters\u003c/p\u003e\u003c/div\u003e","rating":0}},{"timeSeconds":1790172087,"blogEntry":{"originalLocale":"en","allowViewHistory":false,"creationTimeSeconds":1790128229,"rating":-9,"authorHandle":"IceKnight1093","modificationTimeSeconds":1790128229,"id":157030,"title":"\u003cp\u003eInvitation to CodeChef Starters 257 (Rated till 6-Stars) — 23rd September\u003c/p\u003e","locale":"en","tags":[]},"comment":{"id":1394132,"creationTimeSeconds":1790172087,"commentatorHandle":"VoidRunnerJ","locale":"en","text":"\u003cdiv class\u003d\"ttypography\"\u003e\u003cp\u003eContest starts in 30 minutes.\u003c/p\u003e\u003c/div\u003e","rating":0}},{"timeSeconds":1790171014,"blogEntry":{"originalLocale":"en","allowViewHistory":true,"creationTimeSeconds":1790015743,"rating":79,"authorHandle":"WorldWarV","modificationTimeSeconds":1790062872,"id":156984,"title":"\u003cp\u003eCodeforces Round 1122 (Div. 3) Editorial\u003c/p\u003e","locale":"en","tags":[]},"comment":{"id":1394130,"creationTimeSeconds":1790171014,"commentatorHandle":"PiggyPump","locale":"en","text":"\u003cdiv class\u003d\"ttypography\"\u003e\u003cp\u003eAlso what do you mean C is hell, you literally solved D and E, basically you\u0027re the expert and I\u0027m the newbie.\u003c/p\u003e\u003c/div\u003e","parentCommentId":1394092,"rating":0}},{"timeSeconds":1790170745,"blogEntry":{"originalLocale":"en","allowViewHistory":true,"creationTimeSeconds":1790170745,"rating":-5,"authorHandle":"jinxyd","modificationTimeSeconds":1790170745,"id":157046,"title":"\u003cp\u003eHi Coders!\u003c/p\u003e","locale":"en","tags":[]}},{"timeSeconds":1790167708,"blogEntry":{"originalLocale":"en","allowViewHistory":false,"creationTimeSeconds":1789064529,"rating":2495,"authorHandle":"MikeMirzayanov","modificationTimeSeconds":1789119935,"id":156620,"title":"\u003cp\u003eTelegram Returns as Title Sponsor of Codeforces!\u003c/p\u003e","locale":"en","tags":["codeforces","telegram","sponsor","sponsorship"]},"comment":{"id":1394129,"creationTimeSeconds":1790167708,"commentatorHandle":"Annimesh.kumar","locale":"en","text":"\u003cdiv class\u003d\"ttypography\"\u003e\u003cp\u003eGreat to see this\u003c/p\u003e\u003c/div\u003e","rating":0}},{"timeSeconds":1790167214,"blogEntry":{"originalLocale":"en","allowViewHistory":false,"creationTimeSeconds":1746973882,"rating":185,"authorHandle":"eren__","modificationTimeSeconds":1747026095,"id":142788,"title":"\u003cp\u003eCodeforces Round 1024 (Div. 1, Div. 2) Editorial\u003c/p\u003e","locale":"en","tags":[]},"comment":{"id":1394128,"creationTimeSeconds":1790167214,"commentatorHandle":"thismagic","locale":"en","text":"\u003cdiv class\u003d\"ttypography\"\u003e\u003cp\u003eMany people would be glad if someone made a better editorial for Div1C without using phrases like \u0026quot;it can be proven\u0026quot; without proof and something like \u0026quot;it\u0027s obvious that\u0026quot;.\u003c/p\u003e\u003c/div\u003e","rating":4}},{"timeSeconds":1790165638,"blogEntry":{"originalLocale":"en","allowViewHistory":true,"creationTimeSeconds":1750716875,"rating":156,"authorHandle":"Pajaraja","modificationTimeSeconds":1751392422,"id":144134,"title":"\u003cp\u003eOlympicode Open Olympiad\u003c/p\u003e","locale":"en","tags":["olympiads","ioi"]},"comment":{"id":1394127,"creationTimeSeconds":1790165638,"commentatorHandle":"GomerDoGo","locale":"en","text":"\u003cdiv class\u003d\"ttypography\"\u003e\u003cp\u003eNo more olympicode.rs ?(\u003c/p\u003e\u003c/div\u003e","rating":0}},{"timeSeconds":1790162121,"blogEntry":{"originalLocale":"en","allowViewHistory":true,"creationTimeSeconds":1789575258,"rating":23,"authorHandle":"UNDERTAKER","modificationTimeSeconds":1789575258,"id":156823,"title":"\u003cp\u003eLooking for contests to host — we\u0027ll adapt our judge to your problems\u003c/p\u003e","locale":"en","tags":[]},"comment":{"id":1394123,"creationTimeSeconds":1790162121,"commentatorHandle":"Bubbler","locale":"en","text":"\u003cdiv class\u003d\"ttypography\"\u003e\u003cp\u003eSubmissions must be Lean proof that your algorithm is correct and fast enough\u003c/p\u003e\u003c/div\u003e","rating":1}},{"timeSeconds":1790154610,"blogEntry":{"originalLocale":"en","allowViewHistory":true,"creationTimeSeconds":1790015743,"rating":79,"authorHandle":"WorldWarV","modificationTimeSeconds":1790062872,"id":156984,"title":"\u003cp\u003eCodeforces Round 1122 (Div. 3) Editorial\u003c/p\u003e","locale":"en","tags":[]},"comment":{"id":1394118,"creationTimeSeconds":1790154610,"commentatorHandle":"Tey","locale":"en","text":"\u003cdiv class\u003d\"ttypography\"\u003e\u003cp\u003eExplanation for G \u003ca href\u003d\"https://codeforces.com/contest/2266/submission/391752057\"\u003eAC code\u003c/a\u003e\u003c/p\u003e\u003cp\u003eWhat you need?:$$$\\text{Bezout indentity,dfs,gcd}$$$\u003c/p\u003e \u003col\u003e   \u003cli\u003e\u003cp\u003eFirst we reduce the problem,i don\u0027t know how to construct the answer then i let $$$y_i$$$ is the maximum number $$$x_i$$$ can reach,then $$$ans\u003d\\sum y_i$$$ .\u003c/p\u003e\u003c/li\u003e   \u003cli\u003e\u003cp\u003eNow,i observe something interesting,$$$y_i$$$ is independent,why?Let $$$u$$$ be the parent of $$$v$$$,then i can make $$$x_u$$$ to $$$y_u$$$ first,then after that no matter how i change $$$x_v$$$,it won\u0027t affect $$$x_u\u003dy_u$$$\u003c/p\u003e\u003c/li\u003e   \u003cli\u003e\u003cp\u003efrom step $$$2$$$,the problem reduce to how to maximum $$$x_i$$$ to $$$y_i$$$,now i suddenly observe something,let set $$$A\u003d\\{s_v\\}$$$ which $$$s_v\u003d\\sum x_v$$$ for some moment,obviously $$$|A|$$$ (size of the set) is finite,then the $$$(x_i\u003da_i + c_0\\cdot b_i + c_1\\cdot s_1 + ... )\\mod b_i$$$,if you see this form you must be sensitive,because this is related to the general bezout identity,define $$$g\u003d\\gcd(b_i,s_v)$$$ then you can see that no matter i reduce how many times of $$$b_i$$$ or increase how many times of $$$s_v$$$ ,in the kernel ,always increase/decrease some $$$g$$$ and bezout identity state that i always exist such a set of coefficient such that $$$(c_0\\cdot b_i + c_1\\cdot s_1 + ... )\u003dg\\mod b_i$$$,for example if $$$s_1\u003d10\\cdot g$$$ and $$$b\u003d20\\cdot g$$$ then if i increase $$$1$$$ time $$$s_1$$$ and decrease $$$1$$$ time $$$b$$$ then result is $$$+10\\cdot g - 20\\cdot g\u003d-10\\cdot g$$$,in modular i can use add arithmetic to simulate minus arithmetic,for example if $$$b\u003d20\\cdot g$$$ and current $$$x_i$$$ be $$$constant+10\\cdot g$$$,if i want minus $$$3\\cdot g$$$,i can directly add $$$17\\cdot g$$$\u003c/p\u003e\u003c/li\u003e   \u003cli\u003e\u003cp\u003eNow everything is almost clear,$$$x_i\u003da_i + k\\cdot g$$$ and $$$k$$$ is some constant,i observe that if $$$a_i\\ge k$$$ then $$$a_i$$$ also produce some of the $$$k$$$,thus let $$$r_i \u003d (a_i \\mod g)$$$ then $$$x_i \u003d (r_i+c\\cdot g)\\mod b_i$$$ and $$$c$$$ is some constant,how to maximize this equation?Remember that $$$b_i$$$ is a multiple of $$$g$$$ thus let $$$b\u0027\u003d\\frac{b}{g}$$$ then apparently $$$c\\ge b\u0027$$$ is useless it will cycle back,so we can ensure that $$$0\\le c\\lt b$$$ then i greedily pick the largest one and i found that $$$r_i+(b\u0027-1)\\cdot g\u003dr_i+b-g\\lt b_i$$$,so we can conclude that for every vertex $$$i$$$ the maximum $$$x_i$$$ it can reach is $$$r_i+b-g_i$$$ and $$$r_i\u003da_i \\mod b_i$$$ and $$$g_i\u003d\\gcd(b_i,s_v)$$$\u003c/p\u003e\u003c/li\u003e   \u003cli\u003e\u003cp\u003eHow to construct answer?Actually we don\u0027t need $$$s_v$$$,we need $$$g_v$$$,Define $$$u$$$ as the parent of $$$v$$$ then $$$s\u003d\\sum a_v$$$,let me remind you what $$$g_i$$$ meaning for,$$$g_i$$$ is the change of every operation in $$$x_i$$$,in other word $$$x_i$$$ always increase/decrease $$$g_i$$$,so we can say that for $$$s_v$$$ of $$$u$$$ , we have $$$s_v\u003ds+\\sum c_v\\cdot g_v$$$ and $$$c_v$$$ is some constant,tell me what\u0027s this form?Bezout identity right?So let $$$g_i\u003d\\gcd(b,s,g_v)$$$ then no matter i increase how many times of $$$b,s,g_v$$$ the kernel is i always increase/decrease $$$x_i$$$ some $$$g_i$$$\u003c/p\u003e\u003c/li\u003e \u003c/ol\u003e\u003c/div\u003e","rating":0}},{"timeSeconds":1790153574,"blogEntry":{"originalLocale":"ru","allowViewHistory":true,"creationTimeSeconds":1783430512,"rating":109,"authorHandle":"BledDest","modificationTimeSeconds":1783430637,"id":155047,"title":"\u003cp\u003eEducational Codeforces Round 192 Editorial\u003c/p\u003e","locale":"en","tags":[]},"comment":{"id":1394117,"creationTimeSeconds":1790153574,"commentatorHandle":"liangzexian","locale":"en","text":"\u003cdiv class\u003d\"ttypography\"\u003e\u003cp\u003ecout\u0026lt;\u0026lt;r[a[i]] is O(a[i]).\u003c/p\u003e\u003cp\u003eyou can\u003c/p\u003e \u003cpre\u003e\u003ccode\u003efor(int i \u003d n-1; i \u0026gt;\u003d 0; i--) {\n        r \u003d r.substr(a[i], a[i]) + r.substr(0, 2*n - a[i]);\n        cout\u0026lt;\u0026lt;r[0]\u0026lt;\u0026lt;\u0026quot; \u0026quot;;\n} \n\u003c/code\u003e\u003c/pre\u003e\u003c/div\u003e","parentCommentId":1376107,"rating":0}},{"timeSeconds":1790153464,"blogEntry":{"originalLocale":"en","allowViewHistory":false,"creationTimeSeconds":1789064529,"rating":2495,"authorHandle":"MikeMirzayanov","modificationTimeSeconds":1789119935,"id":156620,"title":"\u003cp\u003eTelegram Returns as Title Sponsor of Codeforces!\u003c/p\u003e","locale":"en","tags":["codeforces","telegram","sponsor","sponsorship"]},"comment":{"id":1394116,"creationTimeSeconds":1790153464,"commentatorHandle":"218105633","locale":"en","text":"\u003cdiv class\u003d\"ttypography\"\u003e\u003cp\u003ehello!!!!!!\u003c/p\u003e\u003c/div\u003e","rating":0}},{"timeSeconds":1790149281,"blogEntry":{"originalLocale":"en","allowViewHistory":false,"creationTimeSeconds":1788972975,"rating":59,"authorHandle":"MrBrionix","modificationTimeSeconds":1790149281,"id":156572,"title":"\u003cp\u003eItalian Olympiad in Informatics (OII) 2026 — Online Contest\u003c/p\u003e","locale":"en","tags":["oii","national olympiad","team selection"]}},{"timeSeconds":1790147583,"blogEntry":{"originalLocale":"en","allowViewHistory":false,"creationTimeSeconds":1782225295,"rating":98,"authorHandle":"wakanda-forever","modificationTimeSeconds":1782887146,"id":154698,"title":"\u003cp\u003eCodeforces Round 1107 (Div. 3) Editorial\u003c/p\u003e","locale":"en","tags":["editorial","codeforces round 1107"]},"comment":{"id":1394109,"creationTimeSeconds":1790147583,"commentatorHandle":"GoryK","locale":"en","text":"\u003cdiv class\u003d\"ttypography\"\u003e\u003cp\u003eF so confused\u003c/p\u003e\u003c/div\u003e","rating":0}},{"timeSeconds":1790147313,"blogEntry":{"originalLocale":"en","allowViewHistory":false,"creationTimeSeconds":1742894452,"rating":692,"authorHandle":"AlperenT","modificationTimeSeconds":1743640531,"id":141024,"title":"\u003cp\u003eApril Fools Day Contest 2025\u003c/p\u003e","locale":"en","tags":["april fools day contest","april 1st","contest"]},"comment":{"id":1394108,"creationTimeSeconds":1790147313,"commentatorHandle":"Alaninator3000","locale":"en","text":"\u003cdiv class\u003d\"ttypography\"\u003e\u003cp\u003echto?\u003c/p\u003e\u003c/div\u003e","parentCommentId":1261507,"rating":0}},{"timeSeconds":1790143852,"blogEntry":{"originalLocale":"en","allowViewHistory":false,"creationTimeSeconds":1790100931,"rating":89,"authorHandle":"AksLolCoding","modificationTimeSeconds":1790100991,"id":157024,"title":"\u003cp\u003eHow Not to Code a Trie\u003c/p\u003e","locale":"en","tags":[]},"comment":{"id":1394106,"creationTimeSeconds":1790143852,"commentatorHandle":"hutianmintimmy","locale":"en","text":"\u003cdiv class\u003d\"ttypography\"\u003e\u003cp\u003eCodeforces better users be like:\u003c/p\u003e\u003c/div\u003e","rating":0}},{"timeSeconds":1790143412,"blogEntry":{"originalLocale":"en","allowViewHistory":true,"creationTimeSeconds":1790142911,"rating":5,"authorHandle":"IvanBorquez","modificationTimeSeconds":1790143411,"id":157033,"title":"\u003cp\u003e[GYM] 2026 ICPC Gran Premio de Mexico Repechaje\u003c/p\u003e","locale":"en","tags":[]},"comment":{"id":1394105,"creationTimeSeconds":1790143412,"commentatorHandle":"IvanBorquez","locale":"en","text":"\u003cdiv class\u003d\"ttypography\"\u003e\u003cp\u003e\u003ci\u003eAuto comment: topic has been updated by \u003ca class\u003d\"rated-user user-blue\" href\u003d\"/profile/IvanBorquez\" title\u003d\"Expert IvanBorquez\"\u003eIvanBorquez\u003c/a\u003e (\u003ca href\u003d\"/topic/157677/en1\"\u003eprevious revision\u003c/a\u003e, \u003ca href\u003d\"/topic/157677/en2\"\u003enew revision\u003c/a\u003e, \u003ca href\u003d\"/topic/157677/diff/en1/en2\"\u003ecompare\u003c/a\u003e).\u003c/i\u003e\u003c/p\u003e\u003c/div\u003e","rating":0}},{"timeSeconds":1790143411,"blogEntry":{"originalLocale":"en","allowViewHistory":true,"creationTimeSeconds":1790142911,"rating":5,"authorHandle":"IvanBorquez","modificationTimeSeconds":1790143411,"id":157033,"title":"\u003cp\u003e[GYM] 2026 ICPC Gran Premio de Mexico Repechaje\u003c/p\u003e","locale":"en","tags":[]}},{"timeSeconds":1790143232,"blogEntry":{"originalLocale":"en","allowViewHistory":true,"creationTimeSeconds":1790142911,"rating":5,"authorHandle":"IvanBorquez","modificationTimeSeconds":1790143411,"id":157033,"title":"\u003cp\u003e[GYM] 2026 ICPC Gran Premio de Mexico Repechaje\u003c/p\u003e","locale":"en","tags":[]},"comment":{"id":1394104,"creationTimeSeconds":1790143232,"commentatorHandle":"IvanBorquez","locale":"en","text":"\u003cdiv class\u003d\"ttypography\"\u003e\u003cp\u003eAuthors of each problem\u003c/p\u003e \u003cdiv class\u003d\"spoiler\"\u003e\u003cb class\u003d\"spoiler-title\"\u003eThe authors of each problem are:\u003c/b\u003e\u003cdiv class\u003d\"spoiler-content\" style\u003d\"display: none;\"\u003e\u003cp\u003e\u003ca href\u003d\"/gym/106710/problem/A\" title\u003d\"2026 ICPC Gran Premio de Mexico Repechaje\"\u003e106710A - Avatar queries\u003c/a\u003e — \u003ca class\u003d\"rated-user user-orange\" href\u003d\"/profile/wiritos\" title\u003d\"Master wiritos\"\u003ewiritos\u003c/a\u003e\u003c/p\u003e\u003cp\u003e\u003ca href\u003d\"/gym/106710/problem/B\" title\u003d\"2026 ICPC Gran Premio de Mexico Repechaje\"\u003e106710B - Bridges of Koninsberg ii\u003c/a\u003e — Eddy Ramírez Jiménez\u003c/p\u003e\u003cp\u003e\u003ca href\u003d\"/gym/106710/problem/C\" title\u003d\"2026 ICPC Gran Premio de Mexico Repechaje\"\u003e106710C - Costly Roads\u003c/a\u003e — Juan Pablo Marin Rosas\u003c/p\u003e\u003cp\u003e\u003ca href\u003d\"/gym/106710/problem/D\" title\u003d\"2026 ICPC Gran Premio de Mexico Repechaje\"\u003e106710D - Disco Elysium\u003c/a\u003e — \u003ca class\u003d\"rated-user user-blue\" href\u003d\"/profile/IvanBorquez\" title\u003d\"Expert IvanBorquez\"\u003eIvanBorquez\u003c/a\u003e\u003c/p\u003e\u003cp\u003e\u003ca href\u003d\"/gym/106710/problem/E\" title\u003d\"2026 ICPC Gran Premio de Mexico Repechaje\"\u003e106710E - Expected Snaps\u003c/a\u003e — Juan Pablo Marin Rosas\u003c/p\u003e\u003cp\u003e\u003ca href\u003d\"/gym/106710/problem/F\" title\u003d\"2026 ICPC Gran Premio de Mexico Repechaje\"\u003e106710F - Following the Mentor\u003c/a\u003e — \u003ca class\u003d\"rated-user user-cyan\" href\u003d\"/profile/Baus\" title\u003d\"Specialist Baus\"\u003eBaus\u003c/a\u003e\u003c/p\u003e\u003cp\u003e\u003ca href\u003d\"/gym/106710/problem/G\" title\u003d\"2026 ICPC Gran Premio de Mexico Repechaje\"\u003e106710G - Grand Rainbow Railway\u003c/a\u003e — \u003ca class\u003d\"rated-user user-violet\" href\u003d\"/profile/yongwhan\" title\u003d\"Candidate Master yongwhan\"\u003eyongwhan\u003c/a\u003e\u003c/p\u003e\u003cp\u003e\u003ca href\u003d\"/gym/106710/problem/H\" title\u003d\"2026 ICPC Gran Premio de Mexico Repechaje\"\u003e106710H - Hlaalu\u0027s Ebony\u003c/a\u003e — \u003ca class\u003d\"rated-user user-blue\" href\u003d\"/profile/IvanBorquez\" title\u003d\"Expert IvanBorquez\"\u003eIvanBorquez\u003c/a\u003e\u003c/p\u003e\u003cp\u003e\u003ca href\u003d\"/gym/106710/problem/I\" title\u003d\"2026 ICPC Gran Premio de Mexico Repechaje\"\u003e106710I - Inner Product II\u003c/a\u003e — \u003ca class\u003d\"rated-user user-orange\" href\u003d\"/profile/Bashca\" title\u003d\"Master Bashca\"\u003eBashca\u003c/a\u003e\u003c/p\u003e\u003cp\u003e\u003ca href\u003d\"/gym/106710/problem/J\" title\u003d\"2026 ICPC Gran Premio de Mexico Repechaje\"\u003e106710J - Jalisco\u0027s Hydration Stations\u003c/a\u003e — \u003ca class\u003d\"rated-user user-violet\" href\u003d\"/profile/yongwhan\" title\u003d\"Candidate Master yongwhan\"\u003eyongwhan\u003c/a\u003e\u003c/p\u003e\u003cp\u003e\u003ca href\u003d\"/gym/106710/problem/K\" title\u003d\"2026 ICPC Gran Premio de Mexico Repechaje\"\u003e106710K - Kaleidoscopic Talavera\u003c/a\u003e — \u003ca class\u003d\"rated-user user-violet\" href\u003d\"/profile/yongwhan\" title\u003d\"Candidate Master yongwhan\"\u003eyongwhan\u003c/a\u003e\u003c/p\u003e\u003cp\u003e\u003ca href\u003d\"/gym/106710/problem/L\" title\u003d\"2026 ICPC Gran Premio de Mexico Repechaje\"\u003e106710L - Ledger of true names \u003c/a\u003e — \u003ca class\u003d\"rated-user user-blue\" href\u003d\"/profile/IvanBorquez\" title\u003d\"Expert IvanBorquez\"\u003eIvanBorquez\u003c/a\u003e\u003c/p\u003e\u003cp\u003e\u003ca href\u003d\"/gym/106710/problem/M\" title\u003d\"2026 ICPC Gran Premio de Mexico Repechaje\"\u003e106710M - Miguel and His Chess Tournament\u003c/a\u003e — \u003ca class\u003d\"rated-user user-orange\" href\u003d\"/profile/Bashca\" title\u003d\"Master Bashca\"\u003eBashca\u003c/a\u003e\u003c/p\u003e\u003cp\u003e\u003ca href\u003d\"/gym/106710/problem/N\" title\u003d\"2026 ICPC Gran Premio de Mexico Repechaje\"\u003e106710N - Nord\u0027s Cairn\u003c/a\u003e — \u003ca class\u003d\"rated-user user-blue\" href\u003d\"/profile/IvanBorquez\" title\u003d\"Expert IvanBorquez\"\u003eIvanBorquez\u003c/a\u003e\u003c/p\u003e\u003c/div\u003e\u003c/div\u003e\u003c/div\u003e","rating":0}},{"timeSeconds":1790140865,"blogEntry":{"originalLocale":"en","allowViewHistory":true,"creationTimeSeconds":1790015743,"rating":79,"authorHandle":"WorldWarV","modificationTimeSeconds":1790062872,"id":156984,"title":"\u003cp\u003eCodeforces Round 1122 (Div. 3) Editorial\u003c/p\u003e","locale":"en","tags":[]},"comment":{"id":1394102,"creationTimeSeconds":1790140865,"commentatorHandle":"eta","locale":"en","text":"\u003cdiv class\u003d\"ttypography\"\u003e\u003cp\u003eMy bad, $$$O(n \\log^2{(n)})$$$ is much more accurate bound for it.\u003c/p\u003e\u003c/div\u003e","parentCommentId":1394078,"rating":0}},{"timeSeconds":1790140396,"blogEntry":{"originalLocale":"en","allowViewHistory":false,"creationTimeSeconds":1790128229,"rating":-9,"authorHandle":"IceKnight1093","modificationTimeSeconds":1790128229,"id":157030,"title":"\u003cp\u003eInvitation to CodeChef Starters 257 (Rated till 6-Stars) — 23rd September\u003c/p\u003e","locale":"en","tags":[]},"comment":{"id":1394101,"creationTimeSeconds":1790140396,"commentatorHandle":"BitHunter_65_","locale":"en","text":"\u003cdiv class\u003d\"ttypography\"\u003e\u003cp\u003ecodechef contains many cheaters.. aren\u0027t any way to remove them\u003c/p\u003e\u003c/div\u003e","rating":0}},{"timeSeconds":1790139553,"blogEntry":{"originalLocale":"en","allowViewHistory":true,"creationTimeSeconds":1789607667,"rating":253,"authorHandle":"WorldWarV","modificationTimeSeconds":1790016035,"id":156834,"title":"\u003cp\u003eCodeforces Round 1122 (Div. 3)\u003c/p\u003e","locale":"en","tags":[]},"comment":{"id":1394097,"creationTimeSeconds":1790139553,"commentatorHandle":"Red_skull123","locale":"en","text":"\u003cdiv class\u003d\"ttypography\"\u003e\u003cp\u003ebut it as wrong that\u0027s why\u003c/p\u003e\u003c/div\u003e","parentCommentId":1393958,"rating":0}},{"timeSeconds":1790138677,"blogEntry":{"originalLocale":"en","allowViewHistory":false,"creationTimeSeconds":1789729885,"rating":149,"authorHandle":"Timosh","modificationTimeSeconds":1789730001,"id":156875,"title":"\u003cp\u003ePersonal thoughts on learning and improvement\u003c/p\u003e","locale":"en","tags":["learning","improvement","pog"]},"comment":{"id":1394094,"creationTimeSeconds":1790138677,"commentatorHandle":"1234_5678_9123","locale":"en","text":"\u003cdiv class\u003d\"ttypography\"\u003e\u003cp\u003eThanks for such genuine advice.\u003c/p\u003e\u003c/div\u003e","rating":0}},{"timeSeconds":1790137921,"blogEntry":{"originalLocale":"en","allowViewHistory":true,"creationTimeSeconds":1790015743,"rating":79,"authorHandle":"WorldWarV","modificationTimeSeconds":1790062872,"id":156984,"title":"\u003cp\u003eCodeforces Round 1122 (Div. 3) Editorial\u003c/p\u003e","locale":"en","tags":[]},"comment":{"id":1394092,"creationTimeSeconds":1790137921,"commentatorHandle":"Lnrrw","locale":"en","text":"\u003cdiv class\u003d\"ttypography\"\u003e\u003cp\u003eyea\u003c/p\u003e\u003c/div\u003e","parentCommentId":1394061,"rating":0}},{"timeSeconds":1790137705,"blogEntry":{"originalLocale":"en","allowViewHistory":true,"creationTimeSeconds":1790137705,"rating":-7,"authorHandle":"manaotian","modificationTimeSeconds":1790137705,"id":157031,"title":"\u003cp\u003eAppeal for key_anemoi\u003c/p\u003e","locale":"en","tags":[]}},{"timeSeconds":1790137258,"blogEntry":{"originalLocale":"en","allowViewHistory":true,"creationTimeSeconds":1790015743,"rating":79,"authorHandle":"WorldWarV","modificationTimeSeconds":1790062872,"id":156984,"title":"\u003cp\u003eCodeforces Round 1122 (Div. 3) Editorial\u003c/p\u003e","locale":"en","tags":[]},"comment":{"id":1394091,"creationTimeSeconds":1790137258,"commentatorHandle":"Adu_Vai_404","locale":"en","text":"\u003cdiv class\u003d\"ttypography\"\u003e\u003cp\u003ecould you please explain your approach I want to know \u003c/p\u003e\u003c/div\u003e","parentCommentId":1393838,"rating":0}},{"timeSeconds":1790136835,"blogEntry":{"originalLocale":"en","allowViewHistory":true,"creationTimeSeconds":1790015743,"rating":79,"authorHandle":"WorldWarV","modificationTimeSeconds":1790062872,"id":156984,"title":"\u003cp\u003eCodeforces Round 1122 (Div. 3) Editorial\u003c/p\u003e","locale":"en","tags":[]},"comment":{"id":1394090,"creationTimeSeconds":1790136835,"commentatorHandle":"eta","locale":"en","text":"\u003cdiv class\u003d\"ttypography\"\u003e\u003cp\u003eI went with a very crude approximation, by taking ~$$$O(n^{1/3})$$$ factors for a number comparable to $$$n$$$. And since the multiset has $$$n$$$ elements; We\u0027ll get total $$$O(n^{4/3})$$$ nodes, and each node costs $$$O(\\log{n})$$$ to activate or deactivate.\u003c/p\u003e\u003c/div\u003e","parentCommentId":1394078,"rating":0}},{"timeSeconds":1790135194,"blogEntry":{"originalLocale":"en","allowViewHistory":false,"creationTimeSeconds":1790100931,"rating":89,"authorHandle":"AksLolCoding","modificationTimeSeconds":1790100991,"id":157024,"title":"\u003cp\u003eHow Not to Code a Trie\u003c/p\u003e","locale":"en","tags":[]},"comment":{"id":1394089,"creationTimeSeconds":1790135194,"commentatorHandle":"shashwat1511","locale":"en","text":"\u003cdiv class\u003d\"ttypography\"\u003e\u003cp\u003ePointer chasing is going to be slower as compared to array lookups, since the memory addresses are sparse which will result in more cache misses. \u003c/p\u003e\u003cp\u003eMoreover, every time you want to add a new character, you have to do dynamic heap allocation, which means free space has to be found in the currently assigned memory block. \u003c/p\u003e\u003cp\u003eImplementation wise, we are just mimicking the pointer approach, except whenever we have to add a new node, instead of looking for free memory, we just have to increment the pointer(like done in the above implementation). This way a lot of child nodes are close to their parent in memory and, leading to more cache hits and thus being faster. \u003c/p\u003e\u003cp\u003eI don\u0027t use array based tries either since I started with pointers, and was too lazy to make a template for them. \u003c/p\u003e\u003c/div\u003e","parentCommentId":1394082,"rating":0}},{"timeSeconds":1790133770,"blogEntry":{"originalLocale":"en","allowViewHistory":true,"creationTimeSeconds":1790077625,"rating":18,"authorHandle":"AzizbekSabirov","modificationTimeSeconds":1790077625,"id":157007,"title":"\u003cp\u003eI got to pupil!!!\u003c/p\u003e","locale":"en","tags":[]},"comment":{"id":1394088,"creationTimeSeconds":1790133770,"commentatorHandle":"AzizbekSabirov","locale":"en","text":"\u003cdiv class\u003d\"ttypography\"\u003e\u003cp\u003eme?? yess\u003c/p\u003e\u003c/div\u003e","parentCommentId":1394080,"rating":0}},{"timeSeconds":1790130396,"blogEntry":{"originalLocale":"en","allowViewHistory":false,"creationTimeSeconds":1790087300,"rating":4,"authorHandle":"siriexo","modificationTimeSeconds":1790087756,"id":157014,"title":"\u003cp\u003eLooking for feedback on this problem I came up with\u003c/p\u003e","locale":"en","tags":["flows","data structures","math","greedy","constructive algorithms"]},"comment":{"id":1394085,"creationTimeSeconds":1790130396,"commentatorHandle":"greateric","locale":"en","text":"\u003cdiv class\u003d\"ttypography\"\u003e\u003cp\u003eCan I use this problem as my div0F\u003c/p\u003e\u003c/div\u003e","parentCommentId":1394036,"rating":0}},{"timeSeconds":1790129956,"blogEntry":{"originalLocale":"en","allowViewHistory":false,"creationTimeSeconds":1790087300,"rating":4,"authorHandle":"siriexo","modificationTimeSeconds":1790087756,"id":157014,"title":"\u003cp\u003eLooking for feedback on this problem I came up with\u003c/p\u003e","locale":"en","tags":["flows","data structures","math","greedy","constructive algorithms"]},"comment":{"id":1394084,"creationTimeSeconds":1790129956,"commentatorHandle":"greateric","locale":"en","text":"\u003cdiv class\u003d\"ttypography\"\u003e\u003cp\u003erank 5 on div2 :skull:\u003c/p\u003e\u003c/div\u003e","rating":0}}]}