U E D R , A S I H C RSS

ACM_ICPC/2012년스터디

1.

  • , 권기, 곽 : ( 10 )

2.

  • , 고, . (Programming Challenges )

2.1.

  • 간 - , 금 1 30.
  • - 6 PC
  • - 고, .

2.2.

  • 간 - 9.
  • - 6 PC
  • - 고, .

3.1. 8 9

3.1.1.

3.1.2.

3.2. 8 14

3.3. 8 17


3.3.2.

3.4. 8 21


3.4.1.

3.4.3.

  • -- 근 -

3.5. 8 24


3.5.1.

  • : ,
    • Pairsumonious Numbers -
    • Bridge -
  • fail... .

3.5.3.


3.6. 8 31


3.6.1.

  • : , ,

    • 9

    • Pairsumonious Numbers
    • Bridge
    • . 간까 기.
  • 간까 .
    • Expressions
    • Bigger Square Please
    • koi_cha
    • Binary Indexed Tree

3.6.3.

  • . -
    • . -
  • 경(?) ...== -

3.7. 9 8


3.7.1.

  • : , ,

    • 9

    • Expressions -
    • Bigger Square Please -
    • Binary Indexed Tree
  • 간까 .
    • Expressions
    • Bigger Square Please
    • koi_cha
    • Smith Numbers

3.7.3.


3.8. 9 18


3.8.1.

3.8.2.

3.9. 9 22

3.9.1.

  • : , ,
  • Codeforce 3 set기.
    • 2 .
    • 1 , testcase .

3.10. 10 2

3.10.1.

3.11. 10 6

3.11.1.

  • : , ,

    • ACM-ICPC .
      • .
        • D,F,G
      • .
      • , .
  • 간까



  • 간까 .
    • 기.
    • Programming Challenges 기.

3.11.2.

  • 4 .
    . . ㅎㅎ -
  • A 각... .(게-) -

3.12. 10 13

3.12.1.

3.12.2. required data structure

< 그 &  >
 
 (, )
(=>      AVL Tree,  AVL .     ..)
 
, 
Deque (Double Ended Queue)    ( )
 (Linked List)

   - Binary Heap
   - Binomial Heap
   - Fibonacci Heap (  .)
   - (Binary) Indexed Tree  (  .  Binary Indexed Tree Binomial ..)
   - Interval Tree  (  Indexed Tree    .)
 (, , , , , , 기)
   - K   O(n)  

   - Prim
   - Kruskal
   - Matroid Theory  (  )

   - Dijkstra ()
   - Floyd ()
   - Bellman Ford ()
그 
   - BFS(), DFS(깊)
 (Topological Sort)
  (Maximum Flow Algorithm)
   - Ford-Fulkerson 
   - Minimum Cut (  )
   - -  (  )
   -   (Bipartite Maximum Matching)
            - Hungarian Method  ( )
            - Gale-Shapely Matching 
             (  , 그 ,     )
            - Hopcroft-Karp 
             (     , 꼭   )
   - Mincost-Maxflow Algorithm
   - Stoer-Wagner Algorithm   (간    , 꼭   )
 
   -    
      (   ,   ..)
   -  기
   - Bridge 기
   (...   )
  (Strongly Connected Components ,  SCC)
   - Kosaraju , Tarjan 
2-CNF (2-SAT )
  (Disjoint Set)
   -  기 ( )
   - 경  (  , Path Compression)
- from kin.naver.com by kanghd13



3.13. 11 3

3.13.1.


    • GoSoMi_Critical - (, , )
    • OOPARTS - (, , )

    • ACM-ICPC Asia-Daejeon Regional .
    • OOPARTS - 15, 38
    • GoSoMi_Critical - 15, 39
    • D, E, F, I .
      • G , H J ..
  • 1 ( dictation)

A - accelerator
 ,.       , 그 길   .
각각    ,,,
        ..
B    ..?
  edge  ... indexed tree
C shortest path,   . state ..?
dynamic programming    state    .
D 
E 
F 
G     , 
H    . ( )       .       .

 ..      ...  
I
J 각  x길  y    .  DP   ,     n   .......ㅁㅣㅇ
K DAG minimum cover ?????
L ㅁㅇㄹㅎ

3.14. 11 8

3.14.1.

  • .
  • 기. H, G.
    • H
  • 9 9 .
  • 3 기. 각 , 기.

3.15. 11 17

3.15.1.

3.15.2.


  • , , 1
  • 1~2

3.15.3.

  • - . ( .. ?) .
  • - 그게 ㅠㅠ .( ...)

3.16. 11 24

3.16.1.

3.16.2.


  • , - pattern matching
  • 1~2

3.16.3.


3.17. 12 1

3.17.1.

3.17.2.

  • Inflate

3.17.3.

  • - Histogram . 기 ㅎㅎ

Valid XHTML 1.0! Valid CSS! powered by MoniWiki
last modified 2021-02-07 05:22:20
Processing time 0.0535 sec