Share
Embed
Transcript
38 slides
-
ڝϓϩՊձ Regular ୈ 2 ճ Rho17 ͡Ίʹ Max Flow-Min Cut
Project Selection Problem ڝϓϩՊձ Regular ୈ 2 ճ Rho17 October 9, 2025 Rho17 ڝϓϩՊձ Regular ୈ 2 ճ October 9, 2025 1 / 38 -
ڝϓϩՊձ Regular ୈ 2 ճ Rho17 ͡Ίʹ Max Flow-Min Cut
Project Selection Problem ࣍ 1 ͡Ίʹ 2 Max Flow-Min Cut 3 Project Selection Problem Rho17 ڝϓϩՊձ Regular ୈ 2 ճ October 9, 2025 2 / 38 -
ڝϓϩՊձ Regular ୈ 2 ճ Rho17 ͡Ίʹ Max Flow-Min Cut
Project Selection Problem ࣍ 1 ͡Ίʹ 2 Max Flow-Min Cut 3 Project Selection Problem Rho17 ڝϓϩՊձ Regular ୈ 2 ճ October 9, 2025 3 / 38 -
ڝϓϩՊձ Regular ୈ 2 ճ Rho17 ͡Ίʹ Max Flow-Min Cut
Project Selection Problem ࣗݾհ Rho17 • ཧֶ෦ใՊֶՊ B4(2025 ݱࡏ) • AtCoder ԫ (2056) • ՊձॳࢀՃͰ։࠵ଆʹճΔ͜ͱ ʹ...... Rho17 ڝϓϩՊձ Regular ୈ 2 ճ October 9, 2025 4 / 38 -
ڝϓϩՊձ Regular ୈ 2 ճ Rho17 ͡Ίʹ Max Flow-Min Cut
Project Selection Problem ࣍ 1 ͡Ίʹ 2 Max Flow-Min Cut 3 Project Selection Problem Rho17 ڝϓϩՊձ Regular ୈ 2 ճ October 9, 2025 5 / 38 -
ڝϓϩՊձ Regular ୈ 2 ճ Rho17 ͡Ίʹ Max Flow-Min Cut
Project Selection Problem Max Flow ࠷େϑϩʔ N ݸͷڌ͕͋Γɺڌ S ͔Βڌ T ·ͰࢿΛӡͼ͍ͨɻࢿڌ ui ͔ Βڌ vi ʹҰํ௨ߦͰӡͿ͜ͱ͕Ͱ͖ɺ1 ͋ͨΓ࠷େͷ༌ૹྔ ci ͕ܾ·ͬͯ ͍Δɻ1 ʹ S ͔Β T ·Ͱ࠷େͰͲΕ͚ͩ༌ૹͰ͖Δ͔ʁ ࢿͷ༌ૹΛςʔϚʹͨ͠ཧ༝ޙड़...... Rho17 ڝϓϩՊձ Regular ୈ 2 ճ October 9, 2025 6 / 38 -
ڝϓϩՊձ Regular ୈ 2 ճ Rho17 ͡Ίʹ Max Flow-Min Cut
Project Selection Problem Max Flow Λάϥϑཧͷ༻ޠͰݴ͍͑Δ ࠷େϑϩʔ N ͷ༗άϥϑ G = (V, E) ͕͋Γɺ֤ลʹ༗ݶͷ༰ྔ c(e) ͕ఆ·ͬͯ ͍Δɻ S Λ࢝ (Source), T Λऴ (Sink) ͱࢦఆ͢Δɻ ֤ล͔Β࣮ͷؔ f : E → R ΛҎԼͷ݅Λຬͨ͢Α͏ʹఆΊΔɻ • 0 ≤ f(e) ≤ c(e) • ༰ྔ੍ • u ∈ V \ {S, T} ʹ͍ͭͯɺ ∑ v∈V f(v, u) = ∑ v∈V f(u, v) • ࢝ͱऴҎ֎ͰೖΔྔͱग़Δྔಉ͡ ྲྀྔ |F| = ∑ v∈V f(S, v) Λ maximize ͤΑɻ Rho17 ڝϓϩՊձ Regular ୈ 2 ճ October 9, 2025 7 / 38 -
ڝϓϩՊձ Regular ୈ 2 ճ Rho17 ͡Ίʹ Max Flow-Min Cut
Project Selection Problem Max Flow ACL ͕ఏڙͯ͘͠Ε͍ͯΔͷͰɺͦΕΛ͏ʢऴʣ ࢀߟɿAtCoder Library ͷυΩϡϝϯτ Listing 1: convolution 1 auto graph=mf_graph<int>(N); 2 for(int i=0;i<E;i++){ 3 graph.add_edge(u[i],v[i],c[i]); 4 } 5 int ans=graph.flow(S,T); Rho17 ڝϓϩՊձ Regular ୈ 2 ճ October 9, 2025 8 / 38 -
ڝϓϩՊձ Regular ୈ 2 ճ Rho17 ͡Ίʹ Max Flow-Min Cut
Project Selection Problem Max Flow ACL ͕ఏڙͯ͘͠Ε͍ͯΔͷͰɺͦΕΛ͏ʢऴʣ ࢀߟɿAtCoder Library ͷυΩϡϝϯτ Listing 2: convolution 1 auto graph=mf_graph<int>(N); 2 for(int i=0;i<E;i++){ 3 graph.add_edge(u[i],v[i],c[i]); 4 } 5 int ans=graph.flow(S,T); ෦ͷΞϧΰϦζϜʁˠ Ford-Fulkerson ͷΞϧΰϦζϜ 1 1ACL ͷ෦ Ford-Fulkerson ΑΓߴͳΞϧΰϦζϜͬΆͦ͞͏ Rho17 ڝϓϩՊձ Regular ୈ 2 ճ October 9, 2025 9 / 38 -
ڝϓϩՊձ Regular ୈ 2 ճ Rho17 ͡Ίʹ Max Flow-Min Cut
Project Selection Problem Ford-Fulkerson ʮ͠ S ͔Β T ͷύε͕͍ͬͯΔͳΒྲྀ͢ʯʁ Rho17 ڝϓϩՊձ Regular ୈ 2 ճ October 9, 2025 10 / 38 -
ڝϓϩՊձ Regular ୈ 2 ճ Rho17 ͡Ίʹ Max Flow-Min Cut
Project Selection Problem Ford-Fulkerson ʮ͠ S ͔Β T ͷύε͕͍ͬͯΔͳΒྲྀ͢ʯʁ Rho17 ڝϓϩՊձ Regular ୈ 2 ճ October 9, 2025 11 / 38 -
ڝϓϩՊձ Regular ୈ 2 ճ Rho17 ͡Ίʹ Max Flow-Min Cut
Project Selection Problem Ford-Fulkerson ʮ͠ S ͔Β T ͷύε͕͍ͬͯΔͳΒྲྀ͢ʯʁ Rho17 ڝϓϩՊձ Regular ୈ 2 ճ October 9, 2025 12 / 38 -
ڝϓϩՊձ Regular ୈ 2 ճ Rho17 ͡Ίʹ Max Flow-Min Cut
Project Selection Problem Ford-Fulkerson ʮ͠ S ͔Β T ͷύε͕͍ͬͯΔͳΒྲྀ͢ʯʁ ͍ͬͯͳ͍ͷͰ͓͠·͍ʁ Rho17 ڝϓϩՊձ Regular ୈ 2 ճ October 9, 2025 13 / 38 -
ڝϓϩՊձ Regular ୈ 2 ճ Rho17 ͡Ίʹ Max Flow-Min Cut
Project Selection Problem Ford-Fulkerson ʮ͠ S ͔Β T ͷύε͕͍ͬͯΔͳΒྲྀ͢ʯʁ ࣮ 11 ྲྀͤΔʂˠͲ͏͢Ε 11 ྲྀ͔ͤͨʁ Rho17 ڝϓϩՊձ Regular ୈ 2 ճ October 9, 2025 14 / 38 -
ڝϓϩՊձ Regular ୈ 2 ճ Rho17 ͡Ίʹ Max Flow-Min Cut
Project Selection Problem Ford-Fulkerson ݱࡏͷϑϩʔΛҰ෦औΓΊΔૢ࡞͕Ͱ͖Δͱ͍͍͔͠Εͳ͍ ༨ωοτϫʔΫ ݱࡏͷϑϩʔ f ʹରͯ͠ɺ cf (e) = c(e) − f(e) e ∈ E f(e) rev(e) ∈ E 0 otherwise ͱఆٛ͞ΕΔؔ cf Λ༨༰ྔͱ͍͏ɻू߹͕ V Ͱ͋ͬͯล e ͷཁྖ͕ cf (e) Ͱ͋ΔΑ͏ͳάϥϑ Gf Λ༨ωοτϫʔΫͱ͍͏ɻ Rho17 ڝϓϩՊձ Regular ୈ 2 ճ October 9, 2025 15 / 38 -
ڝϓϩՊձ Regular ୈ 2 ճ Rho17 ͡Ίʹ Max Flow-Min Cut
Project Selection Problem Ford-Fulkerson Gf ্Ͱͷ S ͔Β T ͷύεͰɺ༰ྔͷ࠷খ͕ਖ਼ͷͷͷ͜ͱΛ augmenting path ͱݺͿɻ Augmenting path ͕ݟ͔ͭΕશମͷྲྀྔΛ૿ͤΔ (طʹྲྀͨ͠෦ΛҰ෦ԡͯ͠͠ผͷϧʔτʹมߋ͢Δૢ࡞) Rho17 ڝϓϩՊձ Regular ୈ 2 ճ October 9, 2025 16 / 38 -
ڝϓϩՊձ Regular ୈ 2 ճ Rho17 ͡Ίʹ Max Flow-Min Cut
Project Selection Problem Ford-Fulkerson Augmenting path Λ୳͢ Rho17 ڝϓϩՊձ Regular ୈ 2 ճ October 9, 2025 17 / 38 -
ڝϓϩՊձ Regular ୈ 2 ճ Rho17 ͡Ίʹ Max Flow-Min Cut
Project Selection Problem Ford-Fulkerson Augmenting path Λ୳͢ Rho17 ڝϓϩՊձ Regular ୈ 2 ճ October 9, 2025 18 / 38 -
ڝϓϩՊձ Regular ୈ 2 ճ Rho17 ͡Ίʹ Max Flow-Min Cut
Project Selection Problem Ford-Fulkerson Augmenting path Λ୳͢ ͜ΕͰਖ਼͍͕͑͠ಘΒΕͨ Rho17 ڝϓϩՊձ Regular ୈ 2 ճ October 9, 2025 19 / 38 -
ڝϓϩՊձ Regular ୈ 2 ճ Rho17 ͡Ίʹ Max Flow-Min Cut
Project Selection Problem Ford-Fulkerson ͜ΕΛΞϧΰϦζϜʹ͢Ε OK • શͯͷྲྀྔΛ 0 ʹͨ͠ঢ়ଶͰελʔτ • BFS/DFS Ͱ༨άϥϑ্ͷ S − T ύεΛݟ͚ͭΔ • ύε͕ݟ͔ͭΕύε্ͷ࠷খͱಉ͚ͩ͡ྲྀ͠ɺ༨άϥϑΛߋ৽ • ύε͕ݟ͔ͭΒͳ͚Ε͓͠·͍ ܭࢉྔʁ F ͕ 1 ͣͭ૿͑ΔΑ͏ͳύλʔϯ͕࠷ѱͳͷͰ O(FE) (ݱ࣮తʹ 1 ͣͭ૿͑Δ͜ͱ͋·Γͳ͘ɺߴʹಈ͘͜ͱ͕ଟ͍) Rho17 ڝϓϩՊձ Regular ୈ 2 ճ October 9, 2025 20 / 38 -
ڝϓϩՊձ Regular ୈ 2 ճ Rho17 ͡Ίʹ Max Flow-Min Cut
Project Selection Problem Edmonds-Karp/Dinic S ͔ΒͷڑΛ BFS ͰௐΔΑ͏ʹ͠ɺ • S ͔ΒͷڑΛ BFS ͰௐΔ • DFS Ͱ BFS Tree ্ͷ࠷ύεΛऔಘͰ͖Δ͔͗Γऔಘ͢Δ • ༨άϥϑΛߋ৽͠ɺBFS ʹΔ ͜ͷΑ͏ʹ͢Δͱܭࢉྔ͕ O(V 2E)ɺແବͳ୳ࡧΛ͠ͳ͍Α͏ʹ T ͔Β BFS ͯ͠౸ୡՄೳੑΛௐΔͳͲ͢Δͱ O(V E2) ʹͳΔʢEdmonds-Karp/Dinic ๏ʣ Rho17 ڝϓϩՊձ Regular ୈ 2 ճ October 9, 2025 21 / 38 -
ڝϓϩՊձ Regular ୈ 2 ճ Rho17 ͡Ίʹ Max Flow-Min Cut
Project Selection Problem Edmonds-Karp/Dinic ূ໌ͷུ֓ • 1 ճ BFS Λߦ͏ͨͼʹ S → T ͷ࠷ augmenting path ͷ͕͞ 1 ͣͭ૿ ͑ΔͷͰɺBFS ͷճ͕ O(V ) • ֤ DFS O(E) Ͱɺ͜ΕΛ࠷େ O(E) ճߦ͏ ༨άϥϑΛߋ৽͢ΔλΠϛϯάͰ࠷ڑ͕ඞͣ૿Ճ͢Δ͜ͱΛؤுͬͯ ݴ͑Α͍ Rho17 ڝϓϩՊձ Regular ୈ 2 ճ October 9, 2025 22 / 38 -
ڝϓϩՊձ Regular ୈ 2 ճ Rho17 ͡Ίʹ Max Flow-Min Cut
Project Selection Problem Min Cut ࠷খΧοτ N ݸͷڌ͕͋Γɺڌ S ͔Βڌ T ·Ͱࢿ͕ӡΕ͍ͯΔɻڌ ui ͔Β ڌ vi ͷ͖ʹࢿ͕ӡΕ͓ͯΓɺίετ ci ΛͬͯͦͷಓΛഁյ͢Δ͜ ͱ͕Ͱ͖ΔɻS ͔Β T ·Ͱͷύε͕ଘࡏ͠ͳ͘ͳΔͨΊʹඞཁͳίετͷ߹ܭ ͷ࠷খʁ Rho17 ڝϓϩՊձ Regular ୈ 2 ճ October 9, 2025 23 / 38 -
ڝϓϩՊձ Regular ୈ 2 ճ Rho17 ͡Ίʹ Max Flow-Min Cut
Project Selection Problem Min Cut ޙʑͷͨΊʹݴ͍͓͑ͯ͘ ࠷খΧοτ ༗άϥϑ G = (V, E) ͱू߹ U(S ∈ U, T / ∈ U) Λߟ͑ΔɻU ͔Β V \ U ʹ͔͏ลͷू߹ΛάϥϑͷΧοτͱ͍͏ɻΧοτʹؚ·ΕΔลͷ༰ྔͷ૯ Λ࠷খԽͤΑɻ ͓·͚ɿ Max Cut NP-Complete ʹͳΔ Rho17 ڝϓϩՊձ Regular ୈ 2 ճ October 9, 2025 24 / 38 -
ڝϓϩՊձ Regular ୈ 2 ճ Rho17 ͡Ίʹ Max Flow-Min Cut
Project Selection Problem Min Cut Max Flow-Min Cut Equivalence άϥϑ G = (V, E) ͷ࠷େϑϩʔͱ࠷খΧοτͷҰக͢Δɻ ུ֓ɿదͳϑϩʔΛྲྀͨ͠άϥϑͷదͳΧοτΛߟ͑ΔͱɺΧοτͷ༰ྔ ͷํ͕େ͖͍ͷͰʢϑϩʔͷྲྀྔʣ ≤ (Χοτͷ༰ྔ) ͱͳΔɻ ࠷େϑϩʔͷͱ͖ɺ༨ωοτϫʔΫ্Ͱ S → T ͷύεଘࡏ͠ͳ͍ɻͦͷ ͨΊɺ༨ωοτϫʔΫ্Ͱ S ͔Β౸ୡՄೳͳΛ U ͱ͢Ε (U, V \ U) ͕ΧοτͱͳΔ͜ͱ͔Β Max Flow ͱ Min Cut ͕͘͠ͳΔ Rho17 ڝϓϩՊձ Regular ୈ 2 ճ October 9, 2025 25 / 38 -
ڝϓϩՊձ Regular ୈ 2 ճ Rho17 ͡Ίʹ Max Flow-Min Cut
Project Selection Problem Min Cut ҙ Ford-Fulkerson ͷΞϧΰϦζϜΑΓ༰ྔ͕ͷϑϩʔຖճͷ iteratiron Ͱྲྀ ྔ͕ 1 Ҏ্૿͑Δ͜ͱ͔Βඞͣఀࢭ͢Δɻ ༰ྔ͕ඇͷ߹ఀࢭ͠ͳ͍߹͕͋Δʂ Rho17 ڝϓϩՊձ Regular ୈ 2 ճ October 9, 2025 26 / 38 -
ڝϓϩՊձ Regular ୈ 2 ճ Rho17 ͡Ίʹ Max Flow-Min Cut
Project Selection Problem ࿅श Typical Path Problem (Dif: 2260) ແάϥϑ G = (V, E) ͱ૬ҟͳΔ A, B, C ͕༩͑ΒΕΔɻB Λܦ༝ͯ͠ A ͱ C Λ݁Ϳ୯७ύε͕ଘࡏ͢Δ͔ఆͤΑɻ • 3 ≤ N ≤ 2 × 105 • N − 1 ≤ M ≤ 2 × 105 ग़య: ABC318-G Rho17 ڝϓϩՊձ Regular ୈ 2 ճ October 9, 2025 27 / 38 -
ڝϓϩՊձ Regular ୈ 2 ճ Rho17 ͡Ίʹ Max Flow-Min Cut
Project Selection Problem ࿅श B → A, B → C ͱ͍͏ 2 ຊͷύεͰૉͳͷΛͱΕΔ͔ʁ • ʮลૉͳύε 2 ຊʯͳΒɺS → B, A → T, C → T ͱ͓ΑͼลΛ Ճ͠ S → T ʹྲྀྔ 2 ͷϑϩʔΛྲྀͤ OK • Menger ͷఆཧɿลૉύεͷ࠷େ࠷খΧοτͱ͍͠ • ૉύεͷ࠷େ࠷খΧοτͱ͍͠ • ʹؔ͢Δ੍ˠ֤ΛลͷΑ͏ʹѻ͍͍ͨ • u Λ uin, uout ʹׂɺuin → uout ʹ cap=1 • ล (u, v) ʹର͠ɺuout → vin ʹ cap=1 • S → T ʹྲྀྔ 2 ྲྀΕΕ OK Rho17 ڝϓϩՊձ Regular ୈ 2 ճ October 9, 2025 28 / 38 -
ڝϓϩՊձ Regular ୈ 2 ճ Rho17 ͡Ίʹ Max Flow-Min Cut
Project Selection Problem ࿅श • AtCoder Beginner Contest 205 F - Grid and Tokens (2088) • AtCoder Regular Contest 074 F - Lotus Leaves (2208) • AtCoder Beginner Contest 241 G - Round Robin (2422) • AtCoder Beginner Contest 320 G - Slot Strategy 2 (Hard) (2575) • AtCoder Regular Contest 125 E - Snack (2874) Rho17 ڝϓϩՊձ Regular ୈ 2 ճ October 9, 2025 29 / 38 -
ڝϓϩՊձ Regular ୈ 2 ճ Rho17 ͡Ίʹ Max Flow-Min Cut
Project Selection Problem ࣍ 1 ͡Ίʹ 2 Max Flow-Min Cut 3 Project Selection Problem Rho17 ڝϓϩՊձ Regular ୈ 2 ճ October 9, 2025 30 / 38 -
ڝϓϩՊձ Regular ୈ 2 ճ Rho17 ͡Ίʹ Max Flow-Min Cut
Project Selection Problem Project Selection Problem ೩͢ຒΊΔ i ൪ͷΰϛΛ೩ͯ͠ॲཧ͢Δͷʹ Ai ԁ͔͔ΓɺຒΊͯॲཧ͢Δͷʹ Bi ԁ͔͔Δɻ·ͨɺΰϛ i Λ೩͠ j ΛຒΊ͍ͯͨ࣌ɺՃͰ Cij ͷίετ͕͔ ͔ΔɻશͯͷΰϛΛॲཧ͢Δ࠷খίετʁ ʮ೩͢ຒΊΔʯ Project Selection Problem ͷҰ෦ Rho17 ڝϓϩՊձ Regular ୈ 2 ճ October 9, 2025 31 / 38 -
ڝϓϩՊձ Regular ୈ 2 ճ Rho17 ͡Ίʹ Max Flow-Min Cut
Project Selection Problem Project Selection Problem ֤ΰϛΛʮ೩͢ʯଆͱʮຒΊΔʯଆʹॴଐͤ͞Δͩͱࢥ͏ ˠ࠷খΧοτͷܗ=࠷େϑϩʔͰղ͚Δ Rho17 ڝϓϩՊձ Regular ୈ 2 ճ October 9, 2025 32 / 38 -
ڝϓϩՊձ Regular ୈ 2 ճ Rho17 ͡Ίʹ Max Flow-Min Cut
Project Selection Problem Project Selection Problem Get More Moneyʢ˒ 7ʣ Ո i ʹݱۚ Ai ԁͱՈ Ci1, · · · , Cij ͷ伴͕ஔ͍ͯ͋ΔɻՈ i ʹೖΔͨΊʹՈ i ͷ伴શ͕ͯඞཁͰɺೖྉ W ͕͔͔Δɻ ʢೖखֹͨۚ͠ʣ-ʢͬͨೖྉʣΛ࠷େԽͤΑɻ ग़య: యܕ 90 - 040 Rho17 ڝϓϩՊձ Regular ୈ 2 ճ October 9, 2025 33 / 38 -
ڝϓϩՊձ Regular ୈ 2 ճ Rho17 ͡Ίʹ Max Flow-Min Cut
Project Selection Problem Project Selection Problem • ʮX ԁ֫ಘʯͱ͍͏݅Λͦͷ··ʮ−X ԁേۚʯͱ͍͚ͯ͠ͳ͍ • ෛลೖΓͷ MaxFlow NP-Hard • ࠷ॳʹશͯͷۚ Ai ԁΛճऩ͠ɺ ʮՈ i ʹೖΒͳ͔ͬͨΒ Ai ԁേۚʯͱ ͢Δ • ʮೖΒͳ͍ʯ͔ΒՈʹ༰ྔ WɺՈ͔ΒʮೖΔʯʹ༰ྔ Ai ͷลΛுΔ • Ո i ͷ伴͕Ո j ʹ͋Δͱ͖ɺj ʹೖΒͣͯ͠ i ʹೖΔ͜ͱແཧ • j ͔Β i ʹ༰ྔ ∞ ͷลΛுΔ Rho17 ڝϓϩՊձ Regular ୈ 2 ճ October 9, 2025 34 / 38 -
ڝϓϩՊձ Regular ୈ 2 ճ Rho17 ͡Ίʹ Max Flow-Min Cut
Project Selection Problem Project Selection Problem Zebraness (2475) N × N ͷϚε͕͋ΓɺനͰృΒΕ͍ͯΔ͔ࠇͰృΒΕ͍ͯΔ͔ܾ·͍ͬͯͳ ͍͔ͷ͍ͣΕ͔Ͱ͋ΔɻҟͳΔ৭ͷϚε͕ลͰ͢ΔՕॴΛ࠷େԽͤΑɻ ग़య: ABC193-F Rho17 ڝϓϩՊձ Regular ୈ 2 ճ October 9, 2025 35 / 38 -
ڝϓϩՊձ Regular ୈ 2 ճ Rho17 ͡Ίʹ Max Flow-Min Cut
Project Selection Problem Project Selection Problem • ଛࣦʹͯ͠ߟ͑Δ • ʮಉ͡৭͕ྡ͢Δʯͱ 1 ԁേۚˠ͜Εແཧ • Χοτ 2 ͭͷੑ࣭ʹ͚Δ • άϦου͕༩͑ΒΕΔͷͰɺάϦουͷ 2 ෦άϥϑੑ͔Βࢢদ༷ͷยํ ͷ৭Λసͤͯ͞ΈΔ • ʮಉ͡৭͕ྡ͢Δʯˠʮҧ͏৭͕ྡ͢Δʯ ͱ 1 ԁേۚʹͳΓɺղ͚Δ Α͏ʹͳΔ • ֤ϚεΛʹରԠͤ͞ɺi ͕നͰ j ͕ࠇˠ i → j ʹ༰ྔ 1 ͷล ٯ͔͠Γ • ࠷ॳ͔Β֬ఆ͍ͯ͠Δ෦ͷѻ͍ʹҙ Rho17 ڝϓϩՊձ Regular ୈ 2 ճ October 9, 2025 36 / 38 -
ڝϓϩՊձ Regular ୈ 2 ճ Rho17 ͡Ίʹ Max Flow-Min Cut
Project Selection Problem ࿅श • AtCoder Regular Contest 085 E - MUL (2571) • AtCoder Beginner Contest 259 G - Grid Card Game (2428) • AtCoder Beginner Contest 326 G - Unlock Achievement (2470) • AtCoder Beginner Contest 397 G - Maximize Distance (2947) • AtCoder Regular Contest 176 E - Max Vector (3077) • AtCoder Regular Contest 129 E - Yet Another Minimization (3337) Rho17 ڝϓϩՊձ Regular ୈ 2 ճ October 9, 2025 37 / 38 -
ڝϓϩՊձ Regular ୈ 2 ճ Rho17 ͡Ίʹ Max Flow-Min Cut
Project Selection Problem ࣍ճ༧ࠂ 10 Ͱ͜ͷྔͷεϥΠυ࡞Δͷ͕͠ΜͲ͍ͷͰ 1 ճ͋ͨΓ͏গܰ͘͢͠Δ ͔...... ࣍࠷খඅ༻ྲྀͱมͳ੍ͷѻ͍ํͷ༧ఆͰ͢ Rho17 ڝϓϩՊձ Regular ୈ 2 ճ October 9, 2025 38 / 38