제출 #333443

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
333443		luanaamorim	Tracks in the Snow (BOI13_tracks)	C++14	0 / 100	2106 ms	143876 KiB

tracks

#include <iostream>
#include <queue>

using namespace std;

char tab[4002][4002];
int n, m, f, r, ans, passou[4002][4002], passou2[4002][4002];
queue<pair<int, int> > fila;

void bfs1(int a, int b)
{
    fila.push(make_pair(a, b));
    while (!fila.empty())
    {   
        int a = fila.front().first, b = fila.front().second; fila.pop();
        if (tab[a][b] != 'F' || passou[a][b]) continue;
        passou[a][b] = 1;
        fila.push(make_pair(a + 1, b));
        fila.push(make_pair(a - 1, b));
        fila.push(make_pair(a, b + 1));
        fila.push(make_pair(a, b - 1));
    }
}

void bfs2(int a, int b)
{
    fila.push(make_pair(a, b));
    passou[a][b] = 1;
    while (!fila.empty())
    {   
        int a = fila.front().first, b = fila.front().second; fila.pop();
        if (a < 0 || b < 0 || a > n - 1 || b > m - 1) continue;
        if (tab[a][b] == '.' || passou2[a][b]) continue;
        passou2[a][b] = 1;
        fila.push(make_pair(a + 1, b));
        fila.push(make_pair(a - 1, b));
        fila.push(make_pair(a, b + 1));
        fila.push(make_pair(a, b - 1));
    }
}

int main()
{
    cin >> n >> m;
    for (int i = 1; i <= n; i++) 
        for (int j = 1; j <= m; j++)
            cin >> tab[i][j];

    for (int i = 1; i <= n; i++) 
        for (int j = 1; j <= m; j++)
        {
            if (tab[i][j] == 'F' && !passou[i][j])
                bfs1(i, j), ans++;
            if (tab[i][j] == 'R' && !passou2[i][j])
                bfs2(i, j), ans++;
        }

    cout << ans << endl;
}

• Subtask 1: 0 / 30
• Subtask 2: 0 / 70