• A: trivial


• B: invert array, trivial


• C: trivial


• D: pretty cool, restructure directed graph as an undirected graph w/ directed weight, DFS


• E: possibly some sort of ranging and binary search, couldn't work out implementation


• F: tried to run the knapsack dp as normal but store a best_cost[] alongside, and attempted to use some quasi-convexity and 2p to speed up choice but this did not work (AC x53, WA x5)


• G: impossible wtf jasonwei orz

terrible perf lol. should I take the upcoming AGC? idk.

tags: programming atcoder contest-logs