版权声明： 本博客所有文章除特别声明外，均采用 BY-NC-SA 许可协议。转载请注明出处！
title: VP记录 - 2021 ICPC 亚洲区域赛(澳门)
author: "Tifa & Foi"
coauthor:
- Foi
categories:
- 算法竞赛
- 题解
- ICPC
tags:
- 算法竞赛
- 题解
- ICPC
date: 2023-09-09 19:07:55
比赛链接
进度: 7 / 11
<!-- more -->
题目概览
| 题号 |
标题 |
做法 |
| A |
So I'll Max Out My Constructive Algorithm Skills |
|
| *B |
the Matching System |
|
| C |
Laser Trap |
|
| *D |
Shortest Path Fast Algorithm |
|
| E |
Pass the Ball! |
|
| F |
Sandpile on Clique |
|
| G |
Cyclic Buffer |
|
| *H |
Permutation on Tree |
|
| I |
LCS Spanning Tree |
|
| *J |
Colorful Tree |
|
| K |
Link-Cut Tree |
{% pdf /archives/icpc-amcr2021/problems.pdf 600px %}
D 题的附带代码
<details open>
<summary><font color='orange'>Show code</font></summary>
{% icodeweb blog lang:cpp icpc-amcr2021/spfa.cpp %}
</details>官方题解
{% pdf /archives/icpc-amcr2021/tutorial.pdf 600px %}
A - So I'll Max Out My Constructive Algorithm Skills
解题思路
复杂度
代码参考
<details open>
<summary><font color='orange'>Show code</font></summary>
{% icodeweb blog lang:cpp icpc-amcr2021/A.cpp %}
</details>B - the Matching System
解题思路
复杂度
代码参考
<details open>
<summary><font color='orange'>Show code</font></summary>
{% icodeweb blog lang:cpp icpc-amcr2021/B.cpp %}
</details>C - Laser Trap
解题思路
复杂度
代码参考
<details open>
<summary><font color='orange'>Show code</font></summary>
{% icodeweb blog lang:cpp icpc-amcr2021/C.cpp %}
</details>D - Shortest Path Fast Algorithm
解题思路
复杂度
代码参考
<details open>
<summary><font color='orange'>Show code</font></summary>
{% icodeweb blog lang:cpp icpc-amcr2021/D.cpp %}
</details>E - Pass the Ball!
解题思路
复杂度
代码参考
<details open>
<summary><font color='orange'>Show code</font></summary>
{% icodeweb blog lang:cpp icpc-amcr2021/E.cpp %}
</details>F - Sandpile on Clique
解题思路
复杂度
代码参考
<details open>
<summary><font color='orange'>Show code</font></summary>
{% icodeweb blog lang:cpp icpc-amcr2021/F.cpp %}
</details>G - Cyclic Buffer
解题思路
复杂度
代码参考
<details open>
<summary><font color='orange'>Show code</font></summary>
{% icodeweb blog lang:cpp icpc-amcr2021/G.cpp %}
</details>H - Permutation on Tree
解题思路
复杂度
代码参考
<details open>
<summary><font color='orange'>Show code</font></summary>
{% icodeweb blog lang:cpp icpc-amcr2021/H.cpp %}
</details>I - LCS Spanning Tree
解题思路
复杂度
代码参考
<details open>
<summary><font color='orange'>Show code</font></summary>
{% icodeweb blog lang:cpp icpc-amcr2021/I.cpp %}
</details>J - Colorful Tree
解题思路
复杂度
代码参考
<details open>
<summary><font color='orange'>Show code</font></summary>
{% icodeweb blog lang:cpp icpc-amcr2021/J.cpp %}
</details>K - Link-Cut Tree
解题思路
复杂度
代码参考
<details open>
<summary><font color='orange'>Show code</font></summary>
{% icodeweb blog lang:cpp icpc-amcr2021/K.cpp %}
</details>