Submission #33904

---

Source Code Expand

#include <cstdio>
#include <set>
#include <stack>

using namespace std;

int h, w, c = 1;
char s[1000][1001];
int a[1000][1000];
int f[1000][1000];
int dx[4] = {0, 0, 1, -1};
int dy[4] = {1, -1, 0, 0};
int dx2[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
int dy2[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
set <int> se;

bool in(int x, int y)
{
    if (x >= 0 && x < h && y >= 0 && y < w) {
        return true;
    } else {
        return false;
    }
}

void dfs(int x, int y)
{
    int i;
    stack <pair<int, int> > st;
    
    st.push(make_pair(x, y));
    
    while (!st.empty()) {
        x = st.top().first;
        y = st.top().second;
        
        st.pop();
        
        a[x][y] = c;
        
        for (i = 0; i < 4; i++) {
            int nx = x + dx[i];
            int ny = y + dy[i];
            
            if (in(nx, ny) && s[nx][ny] == '.' && a[nx][ny] == 0) st.push(make_pair(nx, ny));
        }
    }
}

void dfs2(int x, int y)
{
    int i;
    stack <pair<int, int> > st;
    
    st.push(make_pair(x, y));
    
    while (!st.empty()) {
        int x = st.top().first;
        int y = st.top().second;
        
        st.pop();
        
        f[x][y] = 1;
        
        for (i = 0; i < 8; i++) {
            int nx = x + dx2[i];
            int ny = y + dy2[i];
            
            if (in(nx, ny)) {
                if (s[nx][ny] == '.') {
                    se.insert(a[nx][ny]);
                } else if (f[nx][ny] == 0) {
                    st.push(make_pair(nx, ny));
                }
            }
        }
    }
}

int main()
{
    int i, j;
    int b[3] = {0};
    
    scanf("%d %d", &h, &w);
    
    for (i = 0; i < h; i++) scanf("%s", s[i]);
    
    for (i = 0; i < h; i++) {
        for (j = 0; j < w; j++) {
            if (s[i][j] == '.' && a[i][j] == 0) {
                dfs(i, j);
                
                c++;
            }
        }
    }
    
    c = 1;
    
    for (i = 0; i < h; i++) {
        for (j = 0; j < w; j++) {
            if (s[i][j] == 'o' && f[i][j] == 0) {
                se.clear();
                
                dfs2(i, j);
                
                if (se.size() == 2) {
                    b[0]++;
                } else if (se.size() == 3) {
                    b[1]++;
                } else {
                    b[2]++;
                }
            }
        }
    }
    
    printf("%d %d %d\n", b[0], b[1], b[2]);
    
    return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:85:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:87:46: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]

Judge Result