10267 - Graphical Editor

此题其实是一个简单的模拟题，但经过多次WA后，我终于写对了其中的floodfill算法，要写一个正确的floodFill算法要非常小心。

 

Floodfill 一般过程就是：

1. 将起始点染色，并压入队尾
2. 从队列中取出一点 p:(x,y)
3. 检测 p 周围4点（或是8点，取决于题目要求是八向还是四向），并将那些可以到达的点染色，并压入队尾
4. 循环2~3直到队空

我在实现时，出现了几个问题：

• 每个点要染色后再入队。如果把点入队了但没染色，会导致一个点被从多个方向检测到，从而多次入队。这会直接导致TLE。
• 最重要的一点是：一开始要检测起始点原始颜色与新染的颜色是否一样，如果一样就不做floodfill，否则死循环，TLE。
• 边界检查，超出边界不要再继续，不然会越界。在四周加一圈哨兵会大大简化算法实现。

 

 

返回 Volume CII 索引

返回总索引

 

 

// // 10267 - Graphical Editor // Copyright (c) 2010 by Bo-wen Feng // balonfan@gmail.com // #include <set> #include <map> #include <list> #include <queue> #include <stack> #include <vector> #include <string> #include <sstream> #include <cstdio> #include <cmath> #include <limits> #include <utility> #ifndef ONLINE_JUDGE #include <fstream> std::ifstream cin("in.txt"); std::ofstream cout("out.txt"); // std::ofstream cout(stdout); #else #include <iostream> #endif typedef long long llong; typedef unsigned long long ullong; typedef long double ldouble; using namespace std; #define MAX 255 #define MAX_NAME 20 char graph[MAX][MAX]; int row, col; void ProcessI(int m, int n); void ProcessC(); void ProcessL(int x, int y, char c); void ProcessV(int x, int y1, int y2, char c); void ProcessH(int x1, int x2, int y, char c); void ProcessK(int x1, int y1, int x2, int y2, char c); void ProcessF(int x, int y, char c); void ProcessS(char* name); void ProcessI(int m, int n) { row = n; col = m; ProcessC(); } void ProcessC() { for(int x = 1; x <= col; ++x) for(int y = 1; y <= row; ++y) graph[x][y] = 'O'; } void ProcessL(int x, int y, char c) { graph[x][y] = c; } void ProcessV(int x, int y1, int y2, char c) { for(int y = y1; y <= y2; ++y) graph[x][y] = c; } void ProcessH(int x1, int x2, int y, char c) { for(int x = x1; x <= x2; ++x) graph[x][y] = c; } void ProcessK(int x1, int y1, int x2, int y2, char c) { for(int x = x1; x <= x2; ++x) ProcessV(x, y1, y2, c); } void PushPixels(queue<pair<int,int> > &flood, int x0, int y0, char orgColor, char c) { if(graph[x0][y0] == orgColor) { graph[x0][y0] = c; flood.push(make_pair(x0, y0)); } } void ProcessF(int x, int y, char c) { char orgColor = graph[x][y]; if(c == orgColor) { return; } queue<pair<int,int> > flood; flood.push(make_pair(x, y)); graph[x][y] = c; while(!flood.empty()) { pair<int,int> p = flood.front(); int x0 = p.first; int y0 = p.second; flood.pop(); if(x0 <= 0 || x0 > col || y0 <= 0 || y0 > row) continue; PushPixels(flood, x0 - 1, y0 , orgColor, c); PushPixels(flood, x0 + 1, y0 , orgColor, c); PushPixels(flood, x0 , y0 - 1, orgColor, c); PushPixels(flood, x0 , y0 + 1, orgColor, c); } } void ProcessS(char* name) { cout<< name<< '/n'; for(int y = 1; y <= row; ++y) { for(int x = 1; x <= col; ++x) cout<< graph[x][y]; cout<< '/n'; } } int main(int argc, char* argv[]) { char cmd; int x1, y1, x2, y2; char c; char name[MAX_NAME]; char skip[1025]; memset(graph, -1, sizeof(graph)); while(!cin.eof()) { cin>> cmd; switch(cmd) { case 'I': cin>> x1>> y1; ProcessI(x1, y1); break; case 'C': ProcessC(); break; case 'L': cin>> x1>> y1>> c; ProcessL(x1, y1, c); break; case 'V': cin>> x1>> y1>> y2>> c; if(y1 > y2) swap(y1, y2); ProcessV(x1, y1, y2, c); break; case 'H': cin>> x1>> x2>> y1>> c; if(x1 > x2) swap(x1, x2); ProcessH(x1, x2, y1, c); break; case 'K': cin>> x1>> y1>> x2>> y2>> c; if(y1 > y2) swap(y1, y2); if(x1 > x2) swap(x1, x2); ProcessK(x1, y1, x2, y2, c); break; case 'F': cin>> x1>> y1>> c; ProcessF(x1, y1, c); break; case 'S': cin>> name; ProcessS(name); break; case 'X': break; default: cin.getline(skip, 1024); break; } if(cmd == 'X') break; } return 0; }