oj.uz

답안 #252918

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
252918 2020-07-26T12:54:21 Z Erkhemkhuu 무지개나라 (APIO17_rainbow) C++17
0 / 100
 6 ms 384 KB 
#include "rainbow.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
const int sN = 105;
char grid[sN][sN];
void init(int R, int C, int sr, int sc, int M, char *S) {
    int n, m, curx, cury, sz, i, j;
    n = R; m = C; curx = sr; cury = sc;
    sz = M;
    for(i = 0; i <= n; i++)
        for(j = 0; j <= m; j++)
            grid[i][j] = '0';
    for(i = 0; i < sz; i++) {
        if(S[i] == 'N') grid[--curx][cury] = 'X';
        if(S[i] == 'E') grid[curx][++cury] = 'X';
        if(S[i] == 'S') grid[++curx][cury] = 'X';
        if(S[i] == 'W') grid[curx][--cury] = 'X';
    }
    return;
}

int colour(int ar, int ac, int br, int bc) {
    int x0, y0, x1, y1;
    x0 = ar; y0 = ac;
    x1 = br; y1 = bc;
    int N = x1 - x0 + 1;
    int M = y1 - y0 + 1;
    int i, j;
    char temp[sN][sN];
    for(i = x0; i <= x1; i++)
        for(j = y0; j <= y1; j++)
            temp[i - x0 + 1][j - y0 + 1] = grid[i][j];
    int cnt = 0;
    for(i = 1; i <= N; i++) {
        for(j = 1; j <= M; j++) {
            if(temp[i][j] == '0') {
                cnt++;
                queue <int> q;
                q.push(i * 1000 + j);
                while(!q.empty()) {
                    int v = q.front();
                    int curx = v / 1000;
                    int cury = v % 1000;
                    q.pop();
                    temp[curx][cury] = 'M';
                    if(curx - 1 >= 1 && temp[curx - 1][cury] == '0') q.push((curx - 1) * 1000 + cury);
                    if(cury + 1 <= M && temp[curx][cury + 1] == '0') q.push(curx * 1000 + cury + 1);
                    if(curx + 1 <= N && temp[curx + 1][cury] == '0') q.push((curx + 1) * 1000 + cury);
                    if(cury - 1 >= 1 && temp[curx][cury - 1] == '0') q.push(curx * 1000 + cury - 1);
                }
            }
        }
    }
    return cnt;
}

Subtask #1
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 256 KB Output isn't correct

Subtask #4
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -