#UVa:10267-Graphical Editor

照著題目要求去對二維字元陣列做處理即可,此題有兩點需要注意:

  1. V與H當中的X1,X2以及Y1,Y2,並不一定是第一個小於第二個,有可能會是第二個小於第一個,要注意。
  2. 做DFS(或BFS)去填滿顏色時,若要填滿的顏色與該點已經填上的顏色一樣時,即可不用去做DFS(或BFS)了,做了可能會炸掉。

C++(0.036)

/*******************************************************/
/* UVa 10267 Graphical Editor                          */
/* Author: LanyiKnight [at] knightzone.studio             */
/* Version: 2012/11/10                                 */
/*******************************************************/
#include <iostream>
#include <cstdio>
#include <cstdlib>
using namespace std;

struct Graph{

  Graph(){ fill( *content, (*content)+255*255, 'O' ); }

  char content[255][255];
  int M;
  int N;
};

void fill_color( Graph& graph, char C, int x, int y, int w, int h ){
  for( int i = y ; i < y+h ; i++ )
    for( int j = x ; j < x+w ; j++ )
      graph.content[i][j] = C;
}

void fill_DFS_color( Graph& graph, char C, int x, int y, char R ){
  if( C == R ) return; 
  graph.content[y][x] = C;

  if( x+1 <= graph.M && graph.content[y][x+1] == R ) fill_DFS_color( graph, C, x+1 , y, R );
  if( x-1 >= 1 && graph.content[y][x-1] == R ) fill_DFS_color( graph, C, x-1 , y, R );
  if( y+1 <= graph.N && graph.content[y+1][x] == R ) fill_DFS_color( graph, C, x , y+1, R );
  if( y-1 >= 1 && graph.content[y-1][x] == R ) fill_DFS_color( graph, C, x , y-1, R ); 
}

int main(){
  char trash[100];
  char command;
  int X1, X2, Y1, Y2;
  char C;
  string name;
  Graph now_graph;

  while( scanf( "%c", &command ) && command != 'X'){
    switch( command ){
      case 'I':
        scanf( "%d%d", &(now_graph.M), &(now_graph.N) );
        // pass through
      case 'C':
        fill_color( now_graph, 'O', 1, 1, now_graph.M, now_graph.N );
        break;
      case 'L':
        scanf( "%d %d %c", &X1, &Y1, &C );
        fill_color( now_graph, C, X1, Y1, 1, 1 );
        break;
      case 'V':
        scanf( "%d %d %d %c", &X1, &Y1, &Y2, &C );
        fill_color( now_graph, C, X1, min(Y1, Y2), 1, abs(Y2-Y1)+1 );
        break;
      case 'H':
        scanf( "%d %d %d %c", &X1, &X2, &Y1, &C );
        fill_color( now_graph, C, min(X1, X2), Y1, abs(X2-X1)+1, 1 );
        break;
      case 'K':
        scanf( "%d %d %d %d %c", &X1, &Y1, &X2, &Y2, &C );
        fill_color( now_graph, C, X1, Y1, X2-X1+1, Y2-Y1+1 );
        break;
      case 'F':
        scanf( "%d %d %c", &X1, &Y1, &C );
        fill_DFS_color( now_graph, C, X1, Y1, now_graph.content[Y1][X1] );
        break;
      case 'S':
        cin >> name;
        printf( "%s\n", name.c_str() );
        for( int i = 1 ; i <= now_graph.N ; i++ ){
          for( int j = 1 ; j <= now_graph.M ; j++ )
            printf( "%c", now_graph.content[i][j] );
          printf( "\n" );
        }
        break;
      default:
        break;
    }
    gets(trash);
  }
  return 0;
}
廣告

Comment

There is no comment on this post. Be the first one.

發表迴響

這個網站採用 Akismet 服務減少垃圾留言。進一步瞭解 Akismet 如何處理網站訪客的留言資料

%d 位部落客按了讚: