티스토리 뷰
2021/02/01
10128번: Supercomputer
In the first line of standard input, there are two integers, n and q(1 ≤ n,q ≤ 1,000,000), separated by a single space, that specify the number of instructions in Byteasar's program and the number of running time queries (for different numbers of proce
www.acmicpc.net
20172번: Electric Vehicle
Your program is to read from standard input. The input starts with an integer n (2 ≤ n ≤ 1,000), representing the number of villages. Each of the following n lines contains three integers, a, b, and c (0 ≤ a, b ≤ 106 and 1 ≤ c ≤ 104), where (a,
www.acmicpc.net
2021/02/02
NOI(China) 2014
17309번: Enchanted Forest
To obtain the master calligrapher's true teachings, little E has decided to pay a visit to the hermit of an enchanted forest. The forest can be represented as an undirected graph with n nodes and m edges. The nodes are numbered 1, 2, 3, …, n and th
www.acmicpc.net
'PS(공부) 일지' 카테고리의 다른 글
| 2020/12/29 (0) | 2020.12.30 |
|---|---|
| 앞으로의 계획 (0) | 2020.12.25 |
| 2020/08/04 (0) | 2020.08.04 |
- Total
- Today
- Yesterday
- Interactive
- CHT
- DP
- convex hull
- Union Find
- Line sweeping
- Divide & Conquer
- ioi
- Lazy Propagation
- APIO
- Segment Tree
- DFS
- Codeforces
- Greedy
- tree
- HLD
- Centroid Decomposition
- Merge Sort
- Floyd-Warshall
- graph
- offline
- Fenwick Tree
- stack
- BOJ
- ⭐
- Persistent Segment Tree
- Parametric Search
- Sparse Table
- Shortest path
- Sqrt Decomposition
| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 1 | 2 | 3 | 4 | 5 | ||
| 6 | 7 | 8 | 9 | 10 | 11 | 12 |
| 13 | 14 | 15 | 16 | 17 | 18 | 19 |
| 20 | 21 | 22 | 23 | 24 | 25 | 26 |
| 27 | 28 | 29 | 30 |