#include "bits/stdc++.h"
#include "rainbow.h"
using namespace std;
vector<vector<bool>> ex;
int r, c;
void init(int R, int C, int sr, int sc, int M, char *S) {
r = R; c = C;
ex.assign(r + 1, vector<bool>(c + 1));
ex[sr][sc] = true;
for (int i = 0; i < M; i++) {
if (S[i] == 'N') sr--;
else if (S[i] == 'S') sr++;
else if (S[i] == 'W') sc--;
else sc++;
ex[sr][sc] = true;
}
}
int colour(int ar, int ac, int br, int bc) {
auto vis = ex;
int ans = 0;
// cout << '\t' << ar << ' ' << ac << ' ' << br << ' ' << bc << endl;
for (int x = ar; x <= br; x++) {
for (int y = ac; y <= bc; y++) {
if (vis[x][y]) continue;
queue<pair<int, int>> q;
q.push({x, y});
vis[x][y] = true;
ans++;
vector<pair<int, int>> a = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
while (!q.empty()) {
auto [qx, qy] = q.front();
// cout << '\t' << qx << ' ' << qy << endl;
q.pop();
for (auto [dx, dy]: a) {
qx += dx; qy += dy;
if (qx > 0 and qx <= r and qy > 0 and qy <= c and !vis[qx][qy]) {
vis[qx][qy] = true;
q.push({qx, qy});
}
}
}
}
}
return ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
5 ms |
340 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
308 KB |
Output is correct |
3 |
Execution timed out |
3061 ms |
756 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
296 KB |
Output is correct |
2 |
Runtime error |
416 ms |
1048576 KB |
Execution killed with signal 9 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
5 ms |
340 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
5 ms |
340 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |