Submission #775091

#TimeUsernameProblemLanguageResultExecution timeMemory
775091Sam_a17Land of the Rainbow Gold (APIO17_rainbow)C++17
11 / 100
3075 ms1856 KiB
#include "rainbow.h" #include <queue> using namespace std; const int N = 505; int color[N][N]; void init(int R, int C, int sr, int sc, int M, char *S) { color[sr][sc] = 1; for (int i = 0; i < M; i++) { if (S[i] == 'W') { sc--; } if (S[i] == 'S') { sr++; } if (S[i] == 'E') { sc++; } if (S[i] == 'N') { sr--; } color[sr][sc] = 1; } } int st[N][N]; int colour(int ar, int ac, int br, int bc) { queue<pair<int, int>> q; for (int i = ar; i <= br; i++) { for (int j = ac; j <= bc; j++) { st[i][j] = 0; } } int qan = 0; for (int i = ar; i <= br; i++) { for (int j = ac; j <= bc; j++) { if (st[i][j] == 0 && color[i][j] == 0) { qan++; int qq = 0; q.push({ i, j }); st[i][j] = true; while (!q.empty()) { qq++; int x = q.front().first, y = q.front().second; q.pop(); if (x + 1 <= br && color[x + 1][y] == 0 && st[x + 1][y] == 0) { st[x + 1][y] = true; q.push({ x + 1, y }); } if (x - 1 >= ar && color[x - 1][y] == 0 && st[x - 1][y] == 0) { st[x - 1][y] = true; q.push({ x - 1, y }); } if (y + 1 <= bc && color[x][y + 1] == 0 && st[x][y + 1] == 0) { st[x][y + 1] = true; q.push({ x, y + 1 }); } if (y - 1 >= ac && color[x][y - 1] == 0 && st[x][y - 1] == 0) { st[x][y - 1] = true; q.push({ x, y - 1 }); } } } } } return qan; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...