Time limit 2 s Memory limit 512 MB Problem : There are NN attractions in the biggest theme park in Jakarta, numbered from 00 to N - 1N−1. These attractions are connected by N - 1N−1 bidirectional roads such that there is a unique path between any pair of attractions through

Read More

Time limit 2 s Memory limit 512 MB Problem : There are NN cities in Indonesia, numbered from 00 to N - 1N−1. There are also MM two-way roads, numbered from 00 to M - 1M−1. Each road connects two different cities. The ii-th road connects the U[i]U[i]-th city and

Read More

Time limit 1500 ms Memory limit 512 MB Problem : It has been a while since the last time Pak Dengklek painted the wall on his house, so he wants to repaint it. The wall consists of NN segments, numbered from 00 to N - 1N−1. For this problem, we

Read More

The official APIO 2016 Problems and solutions in this post. Problem – A (Boat) : Solution – A (Boat) : Problem – A (Fireworks) : Solution – A (Fireworks) : Problem – C (Gap) : Solution – C (Gap) :  75 total views

Read More

The official APIO 2017 Problems and solutions in this post. Problem – A (Koala Game) : Solution – A (Koala Game) : Problem – B (Merchant) : Solution – B (Merchant) : Problem – C (Land of the Rainbow Gold) : Solution – C (Land of the

Read More

The official APIO 2018 Problems and solutions in this post. Problems : Solution – A (New Home) : Solution – B (Circle Selection) : Solution – C (Duathlon) :  56 total views,  1 views today

Read More

The official APIO 2019 problems and solutions in this post

Read More