제출 #1120722

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1120722		vjudge1	Tracks in the Snow (BOI13_tracks)	C++17	2.19 / 100	1125 ms	795016 KiB

tracks

// Author: RufatM
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF 1e9+7
#define ll long long
#define ull unsigned long long
#define vi vector<int>
#define vii vector<vector<int>>
#define mii map<int,int>
#define pb push_back
#define pii pair<ll,int>
#define all(a) a.begin(), a.end()
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
const int MAXN = 4005;
char grid[MAXN][MAXN];
bool visited[MAXN][MAXN];
int h,w;
int dx[4] = {0,0,1,-1};
int dy[4] = {1,-1,0,0};
void dfs(int x,int y,char c){
    visited[x][y] = true;
    for(int k=0;k<4;k++){
        int nx = x + dx[k];
        int ny = y + dy[k];
        if(nx >= 0 and nx < h and ny >= 0 and ny < w and !visited[nx][ny] and grid[nx][ny] == c) {
            dfs(nx, ny, c);
        }
    }
}
signed main(){
    fastio;
    int t=1;
    //cin >> t;
    while(t--){
        cin >> h >> w;
        for(int i=0;i<h;i++){
            cin >> grid[i];
        }
        int comp = 0;
        for(int i=0;i<h;i++){
            for(int j=0;j<w;j++){
                if(grid[i][j] != '.' and !visited[i][j]){
                    dfs(i,j,grid[i][j]);
                    comp++;
                }
            }
        }
        cout<< min(2,comp) << '\n';
    }
}

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