제출 #1290303

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1290303		muhammad-mutahir	Tracks in the Snow (BOI13_tracks)	C++20	100 / 100	1002 ms	201080 KiB

tracks

#include <bits/stdc++.h>
using namespace std;

#define print(l) for(auto i:l) cout<<i<<" ";cout<<endl;
#define input(t,l,n) vector<t>l(n);for(int i = 0;i<n;i++)cin>>l[i];
#define int long long
#define pb push_back
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> 
#define all(l) l.begin(),l.end()
#define pii pair<int,int>
#define fi first
#define se second

const int M = 1e9+7;
const int inf = 1e18;


int bp(int x, int y, int p){
    int res = 1;
    x = x % p;
    while (y > 0) {
 
        if (y & 1)
            res = (res * x) % p;
        y = y >> 1;
        x = (x * x) % p;
    }
    return res;
}
 
int MI(int n, int p){
    return bp(n, p - 2, p);
}
int mul(int x,int y, int p){
    return x * 1ull * y % p;
}
int di(int x,int y, int p){
    return mul(x, MI(y, p), p);
}


int n , m , k , q;

void solve(int testcase_number){
    cin>>n>>m;
    input(string ,l ,n);
    int dc[4] = {0,0,-1,1};
    int dr[4] = {-1,1,0,0};
    vector<pair<int,int>>scr;
    int ans = 0;
    int vis[n+1][m+1];
    for(int i = 0;i<=n;i++){
    	for(int j = 0;j<=m;j++){
    		vis[i][j] = 0;
    	}
    }
    scr.pb({0,0});
    char cur;
    queue<pair<int,int>>Q;
    
    while(scr.size()){
    	for(auto i:scr){
    		cur = l[i.fi][i.se];
    		vis[i.fi][i.se] = 1;
    		Q.push({i.fi,i.se});
    	}
    	ans++;
    	scr.clear();
    	
    	while(Q.size()){
    		auto [r,c] = Q.front();
    		Q.pop();
    		for(int i = 0;i<4;i++){
    			int nc = c+dc[i];
    			int nr = r+dr[i];
    			if(nc>=0 and nr>=0 and nr<n and nc<m and !vis[nr][nc]){
    				if(l[nr][nc] == cur){
    					Q.push({nr,nc});
    					vis[nr][nc] = 1;
    				}
    				else if(l[nr][nc] == '.')continue;
    				else{
    					scr.pb({nr,nc});
    				}
    			}
    		}
    	}
    }
    cout<<ans<<endl;




}


signed main(){
    ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
    cin.tie(0), cout.tie(0);
    cout << fixed<<setprecision(9);

    int t = 1;
    // cin>>t;
    for(int i = 1;i<=t;i++){
        solve(i);
    }

}

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