44 lines
No EOL
1.4 KiB
Text
44 lines
No EOL
1.4 KiB
Text
---
|
|
id: ff
|
|
title: Flood Fill
|
|
author: Siyong Huang
|
|
prerequisites:
|
|
- Silver - Depth First Search
|
|
description: "Flood Fill refers to finding connected components in a graph that is respresented by a grid."
|
|
frequency: 3
|
|
---
|
|
|
|
import { Problem } from "../models";
|
|
|
|
export const metadata = {
|
|
problems: {
|
|
sample: [
|
|
new Problem("CSES", "Counting Rooms", "1192", "Easy", false, []),
|
|
],
|
|
general: [
|
|
new Problem("CSES", "Labyrinth", "1193", "Easy", false, []),
|
|
new Problem("Silver", "Count Cross", "716", "Easy", false, ["FF"]),
|
|
new Problem("Silver", "Ice Perimeter", "895", "Easy", false, []),
|
|
new Problem("Silver", "Switching on the Lights", "570", "Normal", false, []),
|
|
new Problem("Silver", "Build Gates", "596", "Normal", false, []),
|
|
new Problem("Silver", "Milk Pails", "620", "Normal", false, []),
|
|
new Problem("Silver", "Where's Bessie?", "740", "Normal", false, []),
|
|
new Problem("Silver", "Why Did the Cow Cross the Road III", "716", "Normal", false, []),
|
|
new Problem("Silver", "Multiplayer Moo", "836", "Hard", false, []),
|
|
new Problem("Silver", "Snow Boots", "811", "Hard", false, []),
|
|
new Problem("Silver", "Mooyo Mooyo", "860", "Hard", false, []),
|
|
],
|
|
}
|
|
};
|
|
|
|
<problems-list problems={metadata.problems.sample} />
|
|
|
|
## Lesson
|
|
|
|
<resources>
|
|
<resource source="IUSACO" title="10.5 - Flood Fill"></resource>
|
|
</resources>
|
|
|
|
## Problems
|
|
|
|
<problems-list problems={metadata.problems.general} /> |