Attribution Non-Commercial (BY-NC)

35 vues

Attribution Non-Commercial (BY-NC)

- Broad HS Principal Dashboard
- Alain Barrat, Marc Barthelemy, Alessandro Vespignani - Dynamical Processes on Complex Networks (2008).pdf
- CS502 Full Material
- Brief introduction to algorithms
- 00b4952f45a9c93bac000000
- Crossing the bridge at night.pdf
- RTS Chapter 2-3
- Cohen-Macaulay of Ideal I2(G)
- CS1114_prelim_review
- Exam - 2009
- Elementary Graph Algorithms
- d83ea5f1ab10354e342a33201c35127e 01 Introduction Problems
- Survey
- Ban Dung Ryan 3
- BFDF4ABC-452A-4467-8539-B9B15A3CC6EC
- charts and graphs handout 2
- 10.1.1.21
- hw5-rajKorpally_rithvikgambhir.odt
- GRAPH THEORYU-1.pptx
- 1482

Vous êtes sur la page 1sur 119

Example #1

Example #2

Epilogue

Taejin Chin, Wonha Ryu

KAIST

KAIST

Example #1

Example #2

Epilogue

ACM-ICPC

KAIST

Example #1

Example #2

Epilogue

ACM-ICPC

KAIST

Example #1

Example #2

Epilogue

ACM-ICPC

KAIST

Example #1

Example #2

Epilogue

ACM-ICPC

KAIST

Example #1

Example #2

Epilogue

ACM-ICPC

KAIST

Example #1

Example #2

Epilogue

ACM-ICPC

KAIST

Example #1

Example #2

Epilogue

ACM-ICPC

Worlds largest programming contest - over 7000 teams! 3 students compete in a team, using only 1 machine. About 10 problems and 5 hours are given. Judgement is in real-time. A balloon is awarded for accepted solutions.

KAIST

Example #1

Example #2

Epilogue

ACM-ICPC

Worlds largest programming contest - over 7000 teams! 3 students compete in a team, using only 1 machine. About 10 problems and 5 hours are given. Judgement is in real-time. A balloon is awarded for accepted solutions.

KAIST

Example #1

Example #2

Epilogue

ACM-ICPC

Worlds largest programming contest - over 7000 teams! 3 students compete in a team, using only 1 machine. About 10 problems and 5 hours are given. Judgement is in real-time. A balloon is awarded for accepted solutions.

KAIST

Example #1

Example #2

Epilogue

Worlds largest programming contest - over 7000 teams! 3 students compete in a team, using only 1 machine. About 10 problems and 5 hours are given. Judgement is in real-time. A balloon is awarded for accepted solutions.

KAIST

Example #1

Example #2

Epilogue

Worlds largest programming contest - over 7000 teams! 3 students compete in a team, using only 1 machine. About 10 problems and 5 hours are given. Judgement is in real-time. A balloon is awarded for accepted solutions.

KAIST

Example #1

Example #2

Epilogue

Worlds largest programming contest - over 7000 teams! 3 students compete in a team, using only 1 machine. About 10 problems and 5 hours are given. Judgement is in real-time. A balloon is awarded for accepted solutions.

KAIST

Example #1

Example #2

Epilogue

KAIST

Example #1

Example #2

Epilogue

WSAC 2011 is going to be held, from last years success. Lastly, Wonha has been asked to assign rooms to participants. But in this time, were able to assign exactly one room for each participant. Organizer has reserved rooms as many as the number of the participants.

KAIST

Example #1

Example #2

Epilogue

WSAC 2011 is going to be held, from last years success. Lastly, Wonha has been asked to assign rooms to participants. But in this time, were able to assign exactly one room for each participant. Organizer has reserved rooms as many as the number of the participants.

KAIST

Example #1

Example #2

Epilogue

So he designed sophiscated but fair way to assign rooms. At the registration time, every participant chooses two preferred rooms, and writes down their numbers on both side of the coin. And then, everyone throws their own coin. If there is no conict, assignment is done. . . but otherwise, everyone should re-throw their coin until assignment is done. This approach ensures uniformness of the assignment!

KAIST

Example #1

Example #2

Epilogue

So he designed sophiscated but fair way to assign rooms. At the registration time, every participant chooses two preferred rooms, and writes down their numbers on both side of the coin. And then, everyone throws their own coin. If there is no conict, assignment is done. . . but otherwise, everyone should re-throw their coin until assignment is done. This approach ensures uniformness of the assignment!

KAIST

Example #1

Example #2

Epilogue

So he designed sophiscated but fair way to assign rooms. At the registration time, every participant chooses two preferred rooms, and writes down their numbers on both side of the coin. And then, everyone throws their own coin. If there is no conict, assignment is done. . . but otherwise, everyone should re-throw their coin until assignment is done. This approach ensures uniformness of the assignment!

KAIST

Example #1

Example #2

Epilogue

Wonha, a little undergraduate, is also participant too. He already rated the preference of each room in a numerical way. Formally speaking, he rated the preference of room k by integer vk . As a moderator, he knows all others preference; so hes going to have some advantage! Help him to maximize expected rating of assigned room.

KAIST

Example #1

Example #2

Epilogue

Wonha, a little undergraduate, is also participant too. He already rated the preference of each room in a numerical way. Formally speaking, he rated the preference of room k by integer vk . As a moderator, he knows all others preference; so hes going to have some advantage! Help him to maximize expected rating of assigned room.

KAIST

Example #1

Example #2

Epilogue

Input C N a_1 b_1 a_2 b_2 .. a_N-1 b_N-1 v_1 v_2 .. v_N # Rating (1 <= v_k <= 1000000)

Taejin Chin, Wonha Ryu Algorithm design for ACM-ICPC KAIST

# Number of test cases (1 <= C <= 200) # Number of rooms (2 <= N <= 50000) # Preferred two rooms # 1 <= a_k < b_k <= N

Example #1

Example #2

Epilogue

Output For each test case, Print a single line containing the two dierent room numbers a and b, which should be selected by Wonha. If there is more than one optimal selection, break ties by choosing lexicographically smallest solution. If there is no way to select two rooms such that an assignment is possible, print impossible instead.

Taejin Chin, Wonha Ryu Algorithm design for ACM-ICPC KAIST

Example #1

Example #2

Epilogue

Modeling

Were going to model the objects using graph. Vertex - each room. (undirected) Edge - each person.

Endpoint of edge - selected rooms. Direction of edge - result of coin toss.

KAIST

Example #1

Example #2

Epilogue

Modeling

Were going to model the objects using graph. Vertex - each room. (undirected) Edge - each person.

Endpoint of edge - selected rooms. Direction of edge - result of coin toss.

KAIST

Example #1

Example #2

Epilogue

Modeling

Were going to model the objects using graph. Vertex - each room. (undirected) Edge - each person.

Endpoint of edge - selected rooms. Direction of edge - result of coin toss.

KAIST

Example #1

Example #2

Epilogue

Were going to model the objects using graph. Vertex - each room. (undirected) Edge - each person.

Endpoint of edge - selected rooms. Direction of edge - result of coin toss.

KAIST

Example #1

Example #2

Epilogue

Were going to model the objects using graph. Vertex - each room. (undirected) Edge - each person.

Endpoint of edge - selected rooms. Direction of edge - result of coin toss.

KAIST

Example #1

Example #2

Epilogue

Were going to model the objects using graph. Vertex - each room. (undirected) Edge - each person.

Endpoint of edge - selected rooms. Direction of edge - result of coin toss.

KAIST

Example #1

Example #2

Epilogue

Observation: independence

Two disconnected components are independent.

KAIST

Example #1

Example #2

Epilogue

V = E + 1 . . . tree! V = E ...? V < E . . . by pigeonhole principle, assignment is impossible.

KAIST

Example #1

Example #2

Epilogue

V = E + 1 . . . tree! V = E ...? V < E . . . by pigeonhole principle, assignment is impossible.

KAIST

Example #1

Example #2

Epilogue

V = E + 1 . . . tree! V = E ...? V < E . . . by pigeonhole principle, assignment is impossible.

KAIST

Example #1

Example #2

Epilogue

Observation: case of V = E

Taejin Chin, Wonha Ryu Algorithm design for ACM-ICPC KAIST

Example #1

Example #2

Epilogue

Observation: case of V = E

Taejin Chin, Wonha Ryu Algorithm design for ACM-ICPC KAIST

Example #1

Example #2

Epilogue

Observation: case of V = E

Taejin Chin, Wonha Ryu Algorithm design for ACM-ICPC KAIST

Example #1

Example #2

Epilogue

Observation: case of V = E

Taejin Chin, Wonha Ryu Algorithm design for ACM-ICPC KAIST

Example #1

Example #2

Epilogue

Observation: case of V = E

Taejin Chin, Wonha Ryu Algorithm design for ACM-ICPC KAIST

Example #1

Example #2

Epilogue

Without my selection, V = N, E = N 1. For example:

Were going to add a single edge. (Note: there exists one and only tree component for every valid graph.)

KAIST

Example #1

Example #2

Epilogue

Without my selection, V = N, E = N 1. For example:

Were going to add a single edge. (Note: there exists one and only tree component for every valid graph.)

Taejin Chin, Wonha Ryu Algorithm design for ACM-ICPC KAIST

Example #1

Example #2

Epilogue

Without my selection, V = N, E = N 1. For example:

Were going to add a single edge. (Note: there exists one and only tree component for every valid graph.)

Taejin Chin, Wonha Ryu Algorithm design for ACM-ICPC KAIST

Example #1

Example #2

Epilogue

Without my selection, V = N, E = N 1. For example:

Were going to add a single edge. (Note: there exists one and only tree component for every valid graph.)

Taejin Chin, Wonha Ryu Algorithm design for ACM-ICPC KAIST

Example #1

Example #2

Epilogue

Tree-to-Tree: A cycle is generated. Each of our endpoint rooms will have equal probability. Tree-to-Other: One endpoint will never be selected. Expectation is equal to other endpoints rating. Other-to-Other: impossible!

KAIST

Example #1

Example #2

Epilogue

Tree-to-Tree: A cycle is generated. Each of our endpoint rooms will have equal probability. Tree-to-Other: One endpoint will never be selected. Expectation is equal to other endpoints rating. Other-to-Other: impossible!

KAIST

Example #1

Example #2

Epilogue

Tree-to-Tree: A cycle is generated. Each of our endpoint rooms will have equal probability. Tree-to-Other: One endpoint will never be selected. Expectation is equal to other endpoints rating. Other-to-Other: impossible!

KAIST

Example #1

Example #2

Epilogue

Tree-to-Tree: A cycle is generated. Each of our endpoint rooms will have equal probability. Tree-to-Other: One endpoint will never be selected. Expectation is equal to other endpoints rating. Other-to-Other: impossible!

KAIST

Example #1

Example #2

Epilogue

Tree-to-Tree: A cycle is generated. Each of our endpoint rooms will have equal probability. Tree-to-Other: One endpoint will never be selected. Expectation is equal to other endpoints rating. Other-to-Other: impossible!

KAIST

Example #1

Example #2

Epilogue

Tree-to-Tree: A cycle is generated. Each of our endpoint rooms will have equal probability. Tree-to-Other: One endpoint will never be selected. Expectation is equal to other endpoints rating. Other-to-Other: impossible!

KAIST

Example #1

Example #2

Epilogue

Problem description From given sequence S with length N , Find densest continuous subsequence and its mean . . . with length at least L. Variations Submatrix version (Taiwan 2001) Binary sequence version (Seoul 2009)

Taejin Chin, Wonha Ryu Algorithm design for ACM-ICPC KAIST

Example #1

Example #2

Epilogue

Problem description From given sequence S with length N , Find densest continuous subsequence and its mean . . . with length at least L. Variations Submatrix version (Taiwan 2001) Binary sequence version (Seoul 2009)

Taejin Chin, Wonha Ryu Algorithm design for ACM-ICPC KAIST

Example #1

Example #2

Epilogue

Problem description From given sequence S with length N , Find densest continuous subsequence and its mean . . . with length at least L. Variations Submatrix version (Taiwan 2001) Binary sequence version (Seoul 2009)

Taejin Chin, Wonha Ryu Algorithm design for ACM-ICPC KAIST

Example #1

Example #2

Epilogue

Problem description From given sequence S with length N , Find densest continuous subsequence and its mean . . . with length at least L. Variations Submatrix version (Taiwan 2001) Binary sequence version (Seoul 2009)

Taejin Chin, Wonha Ryu Algorithm design for ACM-ICPC KAIST

Example #1

Example #2

Epilogue

Problem description From given sequence S with length N , Find densest continuous subsequence and its mean . . . with length at least L. Variations Submatrix version (Taiwan 2001) Binary sequence version (Seoul 2009)

Taejin Chin, Wonha Ryu Algorithm design for ACM-ICPC KAIST

Example #1

Example #2

Epilogue

Problem description From given sequence S with length N , Find densest continuous subsequence and its mean . . . with length at least L. Variations Submatrix version (Taiwan 2001) Binary sequence version (Seoul 2009)

Taejin Chin, Wonha Ryu Algorithm design for ACM-ICPC KAIST

Introduction Na approaches ve

Example #1

Example #2

Epilogue

Na approaches ve

Most simple approach Try every possible subsequence . . . leads to O(n3 ). Infeasible. Yet inecient approach Lets dene i,j as mean of subsequence S[i . . . j] (inclusive). Evaluating i,j+1 or i+1,j+1 from i,j isnt dicult. It leads overall time complexity to O(n2 ).

KAIST

Introduction Na approaches ve

Example #1

Example #2

Epilogue

Na approaches ve

Most simple approach Try every possible subsequence . . . leads to O(n3 ). Infeasible. Yet inecient approach Lets dene i,j as mean of subsequence S[i . . . j] (inclusive). Evaluating i,j+1 or i+1,j+1 from i,j isnt dicult. It leads overall time complexity to O(n2 ).

KAIST

Introduction Na approaches ve

Example #1

Example #2

Epilogue

Na approaches ve

Most simple approach Try every possible subsequence . . . leads to O(n3 ). Infeasible. Yet inecient approach Lets dene i,j as mean of subsequence S[i . . . j] (inclusive). Evaluating i,j+1 or i+1,j+1 from i,j isnt dicult. It leads overall time complexity to O(n2 ).

KAIST

Introduction Na approaches ve

Example #1

Example #2

Epilogue

Most simple approach Try every possible subsequence . . . leads to O(n3 ). Infeasible. Yet inecient approach Lets dene i,j as mean of subsequence S[i . . . j] (inclusive). Evaluating i,j+1 or i+1,j+1 from i,j isnt dicult. It leads overall time complexity to O(n2 ).

KAIST

Introduction Na approaches ve

Example #1

Example #2

Epilogue

Most simple approach Try every possible subsequence . . . leads to O(n3 ). Infeasible. Yet inecient approach Lets dene i,j as mean of subsequence S[i . . . j] (inclusive). Evaluating i,j+1 or i+1,j+1 from i,j isnt dicult. It leads overall time complexity to O(n2 ).

KAIST

Introduction Na approaches ve

Example #1

Example #2

Epilogue

Most simple approach Try every possible subsequence . . . leads to O(n3 ). Infeasible. Yet inecient approach Lets dene i,j as mean of subsequence S[i . . . j] (inclusive). Evaluating i,j+1 or i+1,j+1 from i,j isnt dicult. It leads overall time complexity to O(n2 ).

KAIST

Example #1

Example #2

Epilogue

Key observation:

For a subsequence S[i . . . j], with length 2L. Split that one into two subsequences, like i,i+L1 and i+L,j One of them has bigger mean.

. . . leads to O(N L), infeasible for L = O(N ). But for Seoul regional problem, L all?) solved it in this way. N : many team(almost

KAIST

Example #1

Example #2

Epilogue

Key observation:

For a subsequence S[i . . . j], with length 2L. Split that one into two subsequences, like i,i+L1 and i+L,j One of them has bigger mean.

. . . leads to O(N L), infeasible for L = O(N ). But for Seoul regional problem, L all?) solved it in this way. N : many team(almost

KAIST

Example #1

Example #2

Epilogue

Key observation:

For a subsequence S[i . . . j], with length 2L. Split that one into two subsequences, like i,i+L1 and i+L,j One of them has bigger mean.

. . . leads to O(N L), infeasible for L = O(N ). But for Seoul regional problem, L all?) solved it in this way. N : many team(almost

KAIST

Example #1

Example #2

Epilogue

Key observation:

For a subsequence S[i . . . j], with length 2L. Split that one into two subsequences, like i,i+L1 and i+L,j One of them has bigger mean.

KAIST

Example #1

Example #2

Epilogue

Key observation:

For a subsequence S[i . . . j], with length 2L. Split that one into two subsequences, like i,i+L1 and i+L,j One of them has bigger mean.

KAIST

Example #1

Example #2

Epilogue

Key observation:

For a subsequence S[i . . . j], with length 2L. Split that one into two subsequences, like i,i+L1 and i+L,j One of them has bigger mean.

KAIST

Example #1

Example #2

Epilogue

P

Maximize

iS

S[i] , |S |

Is m upper bound for means of all subsequences? P m

iS P iS

S[i] 1

iS

(m S[i]) 0. We have to

If we dene T [i] := m S[i], the problem is essentially same as minimum sum subsequence problem. Easy.

We can binary search over all possible means, until sucient precision is acquired.

Taejin Chin, Wonha Ryu Algorithm design for ACM-ICPC KAIST

Example #1

Example #2

Epilogue

P

Maximize

iS

S[i] , |S |

Is m upper bound for means of all subsequences? P m

iS P iS

S[i] 1

iS

(m S[i]) 0. We have to

If we dene T [i] := m S[i], the problem is essentially same as minimum sum subsequence problem. Easy.

We can binary search over all possible means, until sucient precision is acquired.

Taejin Chin, Wonha Ryu Algorithm design for ACM-ICPC KAIST

Example #1

Example #2

Epilogue

P

Maximize

iS

S[i] , |S |

Is m upper bound for means of all subsequences? P m

iS P iS

S[i] 1

iS

(m S[i]) 0. We have to

If we dene T [i] := m S[i], the problem is essentially same as minimum sum subsequence problem. Easy.

We can binary search over all possible means, until sucient precision is acquired.

Taejin Chin, Wonha Ryu Algorithm design for ACM-ICPC KAIST

Example #1

Example #2

Epilogue

P

Maximize

iS

S[i] , |S |

m Is m upper bound for means of all subsequences? P

iS P iS

S[i] 1

iS

(m S[i]) 0. We have to

Taejin Chin, Wonha Ryu Algorithm design for ACM-ICPC KAIST

Example #1

Example #2

Epilogue

P

Maximize

iS

S[i] , |S |

m Is m upper bound for means of all subsequences? P

iS P iS

S[i] 1

iS

(m S[i]) 0. We have to

Taejin Chin, Wonha Ryu Algorithm design for ACM-ICPC KAIST

Example #1

Example #2

Epilogue

P

Maximize

iS

S[i] , |S |

m Is m upper bound for means of all subsequences? P

iS P iS

S[i] 1

iS

(m S[i]) 0. We have to

Taejin Chin, Wonha Ryu Algorithm design for ACM-ICPC KAIST

Example #1

Example #2

Epilogue

P

Maximize

iS

S[i] , |S |

m Is m upper bound for means of all subsequences? P

iS P iS

S[i] 1

iS

(m S[i]) 0. We have to

Taejin Chin, Wonha Ryu Algorithm design for ACM-ICPC KAIST

Example #1

Example #2

Epilogue

Basic idea

Iterate for an endpoint of subsequence. L elements from the endpoint must be included: base window Maintain blocks ordered by its mean like this:

Include some blocks into subsequence, if included subsequence results bigger mean.

KAIST

Example #1

Example #2

Epilogue

Basic idea

Iterate for an endpoint of subsequence. L elements from the endpoint must be included: base window Maintain blocks ordered by its mean like this:

Include some blocks into subsequence, if included subsequence results bigger mean.

KAIST

Example #1

Example #2

Epilogue

Basic idea

Iterate for an endpoint of subsequence. L elements from the endpoint must be included: base window Maintain blocks ordered by its mean like this:

Include some blocks into subsequence, if included subsequence results bigger mean.

KAIST

Example #1

Example #2

Epilogue

Iterate for an endpoint of subsequence. L elements from the endpoint must be included: base window Maintain blocks ordered by its mean like this:

Include some blocks into subsequence, if included subsequence results bigger mean.

KAIST

Example #1

Example #2

Epilogue

Iterate for an endpoint of subsequence. L elements from the endpoint must be included: base window Maintain blocks ordered by its mean like this:

Include some blocks into subsequence, if included subsequence results bigger mean.

KAIST

Example #1

Example #2

Epilogue

Iterate for an endpoint of subsequence. L elements from the endpoint must be included: base window Maintain blocks ordered by its mean like this:

Include some blocks into subsequence, if included subsequence results bigger mean.

KAIST

Example #1

Example #2

Epilogue

Iterate for an endpoint of subsequence. L elements from the endpoint must be included: base window Maintain blocks ordered by its mean like this:

Include some blocks into subsequence, if included subsequence results bigger mean.

KAIST

Example #1

Example #2

Epilogue

Removing blocks from the list Remove rst block when its better not to use.

Why? These blocks are never useful, because were looking for maximum! Each block is removed at most once.

KAIST

Example #1

Example #2

Epilogue

Removing blocks from the list Remove rst block when its better not to use.

Why? These blocks are never useful, because were looking for maximum! Each block is removed at most once.

KAIST

Example #1

Example #2

Epilogue

Removing blocks from the list Remove rst block when its better not to use.

Why? These blocks are never useful, because were looking for maximum! Each block is removed at most once.

KAIST

Example #1

Example #2

Epilogue

Removing blocks from the list Remove rst block when its better not to use.

KAIST

Example #1

Example #2

Epilogue

Removing blocks from the list Remove rst block when its better not to use.

KAIST

Example #1

Example #2

Epilogue

Removing blocks from the list Remove rst block when its better not to use.

KAIST

Example #1

Example #2

Epilogue

Removing blocks from the list Remove rst block when its better not to use.

KAIST

Example #1

Example #2

Epilogue

Inserting new element into the list When base window advances, one element will be added into list.

Merge some rear blocks to be in order of its means like this: Shifting base window increments the number of blocks. Merging two blocks decrements the number of blocks. Using data structures like deque, we achieve O(N )!

Taejin Chin, Wonha Ryu Algorithm design for ACM-ICPC KAIST

Example #1

Example #2

Epilogue

Inserting new element into the list When base window advances, one element will be added into list.

Merge some rear blocks to be in order of its means like this: Shifting base window increments the number of blocks. Merging two blocks decrements the number of blocks. Using data structures like deque, we achieve O(N )!

Taejin Chin, Wonha Ryu Algorithm design for ACM-ICPC KAIST

Example #1

Example #2

Epilogue

Inserting new element into the list When base window advances, one element will be added into list.

Merge some rear blocks to be in order of its means like this: Shifting base window increments the number of blocks. Merging two blocks decrements the number of blocks. Using data structures like deque, we achieve O(N )!

Taejin Chin, Wonha Ryu Algorithm design for ACM-ICPC KAIST

Example #1

Example #2

Epilogue

Inserting new element into the list When base window advances, one element will be added into list.

Taejin Chin, Wonha Ryu Algorithm design for ACM-ICPC KAIST

Example #1

Example #2

Epilogue

Inserting new element into the list When base window advances, one element will be added into list.

Taejin Chin, Wonha Ryu Algorithm design for ACM-ICPC KAIST

Example #1

Example #2

Epilogue

Inserting new element into the list When base window advances, one element will be added into list.

Taejin Chin, Wonha Ryu Algorithm design for ACM-ICPC KAIST

Example #1

Example #2

Epilogue

Inserting new element into the list When base window advances, one element will be added into list.

Taejin Chin, Wonha Ryu Algorithm design for ACM-ICPC KAIST

Example #1

Example #2

Epilogue

Inserting new element into the list When base window advances, one element will be added into list.

Taejin Chin, Wonha Ryu Algorithm design for ACM-ICPC KAIST

Example #1

Example #2

Epilogue

Inserting new element into the list When base window advances, one element will be added into list.

Taejin Chin, Wonha Ryu Algorithm design for ACM-ICPC KAIST

Example #1

Example #2

Epilogue

Renewed from 2008. Anyone with age 13+ is eligible to compete. Annual event track consists of several rounds: some online rounds, local oce onsites, onsite nals at Mountain View. 3 to 6 problems are given in 2 hours to 4 hours. Any language can be used. Competitor downloads input, runs it in ones own machine, and uploads the result with code.

KAIST

Example #1

Example #2

Epilogue

Renewed from 2008. Anyone with age 13+ is eligible to compete. Annual event track consists of several rounds: some online rounds, local oce onsites, onsite nals at Mountain View. 3 to 6 problems are given in 2 hours to 4 hours. Any language can be used. Competitor downloads input, runs it in ones own machine, and uploads the result with code.

KAIST

Example #1

Example #2

Epilogue

Renewed from 2008. Anyone with age 13+ is eligible to compete. Annual event track consists of several rounds: some online rounds, local oce onsites, onsite nals at Mountain View. 3 to 6 problems are given in 2 hours to 4 hours. Any language can be used. Competitor downloads input, runs it in ones own machine, and uploads the result with code.

KAIST

Example #1

Example #2

Epilogue

Renewed from 2008. Anyone with age 13+ is eligible to compete. Annual event track consists of several rounds: some online rounds, local oce onsites, onsite nals at Mountain View. 3 to 6 problems are given in 2 hours to 4 hours. Any language can be used. Competitor downloads input, runs it in ones own machine, and uploads the result with code.

KAIST

Example #1

Example #2

Epilogue

Renewed from 2008. Anyone with age 13+ is eligible to compete. Annual event track consists of several rounds: some online rounds, local oce onsites, onsite nals at Mountain View. 3 to 6 problems are given in 2 hours to 4 hours. Any language can be used. Competitor downloads input, runs it in ones own machine, and uploads the result with code.

KAIST

Example #1

Example #2

Epilogue

KAIST

Introduction TopCoder

Example #1

Example #2

Epilogue

Introducing TopCoder

TopCoder provides various competition platform, including Algorithm Match and Marathon Match. Each members performance is rated in a numerical way, like ladder system of Battle.net. Hosts annual competition track named TopCoder Open.

KAIST

Introduction TopCoder

Example #1

Example #2

Epilogue

Introducing TopCoder

TopCoder provides various competition platform, including Algorithm Match and Marathon Match. Each members performance is rated in a numerical way, like ladder system of Battle.net. Hosts annual competition track named TopCoder Open.

KAIST

Introduction TopCoder

Example #1

Example #2

Epilogue

Introducing TopCoder

TopCoder provides various competition platform, including Algorithm Match and Marathon Match. Each members performance is rated in a numerical way, like ladder system of Battle.net. Hosts annual competition track named TopCoder Open.

KAIST

Introduction TopCoder

Example #1

Example #2

Epilogue

KAIST

Introduction TopCoder

Example #1

Example #2

Epilogue

Algorithm Match

The match consists of several phases:

75 minutes for coding phase, 5 minutes for intermission, 15 minutes for challenge phase.

Three problems with score weighted on their diculty are given. Faster submission, higher score. Submissions are judged against preconstructed test cases, like ACM-ICPC.

Taejin Chin, Wonha Ryu Algorithm design for ACM-ICPC KAIST

Introduction TopCoder

Example #1

Example #2

Epilogue

Algorithm Match

The match consists of several phases:

75 minutes for coding phase, 5 minutes for intermission, 15 minutes for challenge phase.

Three problems with score weighted on their diculty are given. Faster submission, higher score. Submissions are judged against preconstructed test cases, like ACM-ICPC.

Taejin Chin, Wonha Ryu Algorithm design for ACM-ICPC KAIST

Introduction TopCoder

Example #1

Example #2

Epilogue

Algorithm Match

The match consists of several phases:

75 minutes for coding phase, 5 minutes for intermission, 15 minutes for challenge phase.

Three problems with score weighted on their diculty are given. Faster submission, higher score. Submissions are judged against preconstructed test cases, like ACM-ICPC.

Taejin Chin, Wonha Ryu Algorithm design for ACM-ICPC KAIST

Introduction TopCoder

Example #1

Example #2

Epilogue

The match consists of several phases:

75 minutes for coding phase, 5 minutes for intermission, 15 minutes for challenge phase.

Taejin Chin, Wonha Ryu Algorithm design for ACM-ICPC KAIST

Introduction TopCoder

Example #1

Example #2

Epilogue

The match consists of several phases:

75 minutes for coding phase, 5 minutes for intermission, 15 minutes for challenge phase.

Taejin Chin, Wonha Ryu Algorithm design for ACM-ICPC KAIST

Introduction TopCoder

Example #1

Example #2

Epilogue

The match consists of several phases:

75 minutes for coding phase, 5 minutes for intermission, 15 minutes for challenge phase.

Taejin Chin, Wonha Ryu Algorithm design for ACM-ICPC KAIST

Introduction TopCoder

Example #1

Example #2

Epilogue

The match consists of several phases:

75 minutes for coding phase, 5 minutes for intermission, 15 minutes for challenge phase.

Taejin Chin, Wonha Ryu Algorithm design for ACM-ICPC KAIST

Introduction TopCoder

Example #1

Example #2

Epilogue

Marathon Match

Problems with no optimal solutions are given. Scoring mechanism may be dierent for each problem. Some problems have real-world purpose: winners may be awarded by prize. Recent example:

Cracking Enigma, hosted by NSA. Packaging a medkit, hosted by NASA.

KAIST

Introduction TopCoder

Example #1

Example #2

Epilogue

Marathon Match

Problems with no optimal solutions are given. Scoring mechanism may be dierent for each problem. Some problems have real-world purpose: winners may be awarded by prize. Recent example:

Cracking Enigma, hosted by NSA. Packaging a medkit, hosted by NASA.

KAIST

Introduction TopCoder

Example #1

Example #2

Epilogue

Marathon Match

Problems with no optimal solutions are given. Scoring mechanism may be dierent for each problem. Some problems have real-world purpose: winners may be awarded by prize. Recent example:

Cracking Enigma, hosted by NSA. Packaging a medkit, hosted by NASA.

KAIST

Introduction TopCoder

Example #1

Example #2

Epilogue

Problems with no optimal solutions are given. Scoring mechanism may be dierent for each problem. Some problems have real-world purpose: winners may be awarded by prize. Recent example:

Cracking Enigma, hosted by NSA. Packaging a medkit, hosted by NASA.

KAIST

Introduction TopCoder

Example #1

Example #2

Epilogue

Problems with no optimal solutions are given. Scoring mechanism may be dierent for each problem. Some problems have real-world purpose: winners may be awarded by prize. Recent example:

Cracking Enigma, hosted by NSA. Packaging a medkit, hosted by NASA.

KAIST

Introduction TopCoder

Example #1

Example #2

Epilogue

Problems with no optimal solutions are given. Scoring mechanism may be dierent for each problem. Some problems have real-world purpose: winners may be awarded by prize. Recent example:

Cracking Enigma, hosted by NSA. Packaging a medkit, hosted by NASA.

KAIST

- Broad HS Principal DashboardTransféré parJulian A.
- Alain Barrat, Marc Barthelemy, Alessandro Vespignani - Dynamical Processes on Complex Networks (2008).pdfTransféré parClaudio Uribe Rosner
- CS502 Full MaterialTransféré parSami Signs
- Brief introduction to algorithmsTransféré parJaney24
- 00b4952f45a9c93bac000000Transféré parsyahroel778583
- Crossing the bridge at night.pdfTransféré parDeepa Kiran
- RTS Chapter 2-3Transféré parAnonymous 4iFUXUT
- Cohen-Macaulay of Ideal I2(G)Transféré parIoan Degau
- CS1114_prelim_reviewTransféré parlightsaber5
- Exam - 2009Transféré parscribd6289
- Elementary Graph AlgorithmsTransféré parmedoreme
- d83ea5f1ab10354e342a33201c35127e 01 Introduction ProblemsTransféré paramarjeet
- SurveyTransféré parKavyashree Lokesh
- Ban Dung Ryan 3Transféré parRAJAT SHARMA
- BFDF4ABC-452A-4467-8539-B9B15A3CC6ECTransféré parAhmadAliAKbarPhambra
- charts and graphs handout 2Transféré parapi-240303558
- 10.1.1.21Transféré parlkngee
- hw5-rajKorpally_rithvikgambhir.odtTransféré parKoushik Reddy
- GRAPH THEORYU-1.pptxTransféré parakm
- 1482Transféré parSilviu
- ESTRUCTURAS DEL CONOCIMIENTOTransféré parUgo Rivera
- Unit Graph of Some Finite Group Zn, Cn and DnTransféré parAnonymous 0U9j6BLllB
- Generalized Bipolar Neutrosophic Graphs of Type 1Transféré parAnonymous 0U9j6BLllB
- algo- Part 3Transféré parAnisorac Vasile
- MTH310_20190415_MON_FINALTransféré parDhruv Kundu
- IntroTransféré parHemesh Singh
- PR2016 Mat 131_1468_6.13.17.docxTransféré parLeonardo Torres Pagan
- dynprogTransféré parHykinel Bon Guarte
- 11CS30010.pdfTransféré parzakeermas
- CS4413-01 - Chap 1.1Transféré parZeeshan Aslam

- aimaTransféré paragmedia95
- PYL800_Assignment1Transféré parAnonymous sgjks8zd
- 6-5Transféré parSalih Hassen Anwar
- Tugas Network AnalysisTransféré parNando Imanuel
- C1 Sequences and Series Exam QuestionsTransféré parprofitmaker_2
- MathTransféré parEuzreen Eusuff
- MathematicsTransféré parWael Fawzy Mohamed
- Network Topology Cutset LoopTransféré parKuracha Polarao
- Tutorial 9BTransféré para
- Laplace_Table.pdfTransféré parRichard Obinna
- Proof of Dfpf and Gcd PfTransféré parSamantha Yu
- codeforcoder_CSE-408_MCQ-1Transféré parMaheswari Chimata
- MATH1070_2_Error_and_Computer_Arithmetic.pdfTransféré parShah Saud Alam
- automata theoryTransféré partabinda_salam
- TAILARD-BENCHMARK PROBLEM.pdfTransféré parAnonymous P6Bg3PzV6X
- mergesortTransféré parxcygon
- Competitive Programming 2Transféré parThuy Pham
- quadratic equations square rootsTransféré parapi-262277495
- BacktrackingTransféré parJordan Cook-Irwin
- 2010WOOT CatalanTransféré paraem
- Fuzzy Journal 1Transféré parprabhushankar05
- Mathematical ProblemsTransféré parMorakinyo Douglas Elijah
- On the Planarity of Graphs 2Transféré parFernie Villanueva Bucang
- IGCSE Math Test 1Transféré parSudhan Nair
- test2-solnTransféré par2376271
- chap12Transféré parGhansham Khobragade
- 02buhlerTransféré parPANKOPANK
- Asymptotic NotationTransféré parnikhilesh walde
- MathematicsTransféré parrasromeo
- Dag Code GenerationnTransféré parkarthi_gopal