BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//American Young Coder - ECPv6.10.1.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:American Young Coder
X-ORIGINAL-URL:https://www.ayclogic.com
X-WR-CALDESC:Events for American Young Coder
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20260308T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20261101T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260108T190000
DTEND;TZID=America/Los_Angeles:20260108T200000
DTSTAMP:20260429T143853
CREATED:20260109T001005Z
LAST-MODIFIED:20260109T055028Z
UID:32097-1767898800-1767902400@www.ayclogic.com
SUMMARY:7 PM – USACO Bronze – Darin
DESCRIPTION:What We Did Today:\n\nWent over the Balancing Bacteria optimal solution over greedy search\n\nHomework:\n\nCode up the second optimal solution using difference arrays for Balancing Bacteria\, and submit your answer to the webpage and google drive when you are finished\nproblem: https://usaco.org/index.php?page=viewproblem2&cpid=1372 \nNote on the optimal solution(s) presented in class\nOptimal Solution 1 (Optimized naive solution): \nIn class we talked about how to derive the accumulation by analyzing the solution\, and estimating the remainder needed. \nThis resulted in the formula net_accumulation[i] = net_accumulation[i-1] + cur_sprays + net_sprays. \nThe purpose of the net_accumulation is to iteratively adjust the target patch without adjusting every patch that comes after it. This value can be thought of as individual accumulations from every patch before it\, but every patch before it also has a position multiplier. \nI recommend re-deriving the formula above\, seeing how to go from an understanding of the problem to the solution mentioned above. \nThe easiest way to derive the formula above is through analyzing the operations done and how those operations increment/decrement the values of the next target patches. \nOptimized Solution 2 (Difference Arrays):\nWe derived this solution by realizing we can transform the problem space S and the operation O on the space into another form that is meaningful. \nDiff(A) means you transform the array A by subtracting each position in the array with the previous position value. \nSo Diff(A): [    A[0]\,    A[1] – A[0]\,   A[2] – A[1]\, …\, A[last_index] – A[last_index – 1]]\nWe start with the original space S\, with an example as shown:\n–1  0 –1 0 \nwhere the operation to balance patch 1 causes an accumulation shown as:\n+1\, +2\, +3\, +4 \nTransforming the original operation O with Diff(O) changes the operations to:\n+1\, +1\, +1\, +1 \nTransforming it one more time to Diff(Diff((O)) leads the operation to become:\n+1\, 0\, 0\, 0 \nWhich means that the operation Diff(Diff(O)) on a patch does not affect the other patches. \nHowever this Diff(Diff(O)) operation has to be done on the Diff(Diff(S)) space instead of the original. \nSo in implementing the second optimal solution\, define a Diff() function which transforms an array\, and then equalize the Diff(Diff(S)) space instead to figure out the number of operations needed to set everything to 0.\n\nNotes:\nYou can reach out to me at ddjapri@ayclogic.com if you have any questions! \nYou can find class notes here (Tues7PM_IntroToCompProgramming is our excel sheet for visuals).
URL:https://www.ayclogic.com/event/7-pm-usaco-bronze-darin-10/
CATEGORIES:Intro To Competitive,Java
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260116T190000
DTEND;TZID=America/Los_Angeles:20260116T200000
DTSTAMP:20260429T143853
CREATED:20260117T044441Z
LAST-MODIFIED:20260117T044441Z
UID:32192-1768590000-1768593600@www.ayclogic.com
SUMMARY:7 PM – USACO Bronze – Darin
DESCRIPTION:What We Did Today:\n\nWent over the Balancing Bacteria optimal solution 2 implementation using difference arrays\n\nHomework:\n\nCode up the optimal solution using sorting + binary search on the difference values Maximizing Productivity\, and submit your answer to the webpage and google drive when you are finished\nproblem: https://usaco.org/index.php?page=viewproblem2&cpid=1397\nNote on the optimal solution(s) presented in classOptimal Solution 1 (Optimized naive solution):\nWe can rearrange the formula for the brute force:\nS + t_i < c_i\,\ninto\nc_i – t_i > S \nThen we can sort the differences and perform a binary search on it to reduce the number of checks to perform on the N farms.\n\nNotes:\nYou can reach out to me at ddjapri@ayclogic.com if you have any questions! \nYou can find class notes here (Tues7PM_IntroToCompProgramming is our excel sheet for visuals).
URL:https://www.ayclogic.com/event/7-pm-usaco-bronze-darin-11/
CATEGORIES:Intro To Competitive,Java
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260123T190000
DTEND;TZID=America/Los_Angeles:20260123T200000
DTSTAMP:20260429T143853
CREATED:20260124T041419Z
LAST-MODIFIED:20260124T041419Z
UID:32262-1769194800-1769198400@www.ayclogic.com
SUMMARY:7 PM – USACO Bronze – Darin
DESCRIPTION:What We Did Today:\n\nWent over implementation of the Maximizing Productivity problem involving binary search.\n\nHomework:\n\nWork on this problem: https://usaco.org/index.php?page=viewproblem2&cpid=1443 and submit your answer to the webpage and google drive when you are finished\n\nNotes:\nYou can reach out to me at ddjapri@ayclogic.com if you have any questions! \nYou can find class notes here (Tues7PM_IntroToCompProgramming is our excel sheet for visuals).
URL:https://www.ayclogic.com/event/7-pm-usaco-bronze-darin-12/
CATEGORIES:Intro To Competitive,Java
END:VEVENT
END:VCALENDAR