제출 #462437

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
462437		Khizri	Tracks in the Snow (BOI13_tracks)	C++17	75.94 / 100	2128 ms	1048580 KiB

tracks

#include <bits/stdc++.h>
using namespace std;
//------------------------------DEFINE------------------------------
//******************************************************************
#define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0)
#define ll long long
#define pb push_back		 
#define F first																 
#define S second 															 
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
//******************************************************************
//----------------------------FUNCTION------------------------------
//******************************************************************
ll gcd(ll a,ll b){
	if(a>b) swap(a,b);
	if(a==0) return a+b;
	return gcd(b%a,a);
}
ll lcm(ll a,ll b){
	return a/gcd(a,b)*b;
}
bool is_prime(ll n){
	ll k=sqrt(n);
	if(n==2) return true;
	if(n<2||n%2==0||k*k==n) return false;
	for(int i=3;i<=k;i+=2){
		if(n%i==0){
			return false;
		}
	}
	return true;
}
//*****************************************************************
//--------------------------MAIN-CODE------------------------------
const int mxn=4000+5;
const int N=1e7;
int t=1,n,m,k,a,b,x[mxn][mxn],dis[N],color[mxn][mxn],color2[mxn][mxn],colorr[N];
char arr[mxn][mxn];
char c[3];
map<pii,bool>edge;
vector<int>vt[N];
void dfs(int i,int j){
	char cc=arr[i][j];
	color[i][j]=1;
	x[i][j]=k;
	if(arr[i+1][j]==cc&&!color[i+1][j]){
		dfs(i+1,j);
	}
	if(arr[i-1][j]==cc&&!color[i-1][j]){
		dfs(i-1,j);
	}
	if(arr[i][j+1]==cc&&!color[i][j+1]){
		dfs(i,j+1);
	}
	if(arr[i][j-1]==cc&&!color[i][j-1]){
		dfs(i,j-1);
	}
}
void dfss(int i,int j){
	color2[i][j]=1;
	char cc=arr[i][j];
	if(arr[i+1][j]==cc&&!color2[i+1][j]){
		dfss(i+1,j);
	}
	else if(arr[i+1][j]!='.'&&!color2[i+1][j]){
		int a=min(x[i][j],x[i+1][j]);
		int b=max(x[i][j],x[i+1][j]);
		if(!edge[{a,b}]){
			edge[{a,b}]=1;
			vt[a].pb(b);
			vt[b].pb(a);
		}
	}
	if(arr[i-1][j]==cc&&!color2[i-1][j]){
		dfss(i-1,j);
	}
	else if(arr[i-1][j]!='.'&&!color2[i-1][j]){
		int a=min(x[i][j],x[i-1][j]);
		int b=max(x[i][j],x[i-1][j]);
		if(!edge[{a,b}]){
			edge[{a,b}]=1;
			vt[a].pb(b);
			vt[b].pb(a);
		}
	}
	if(arr[i][j+1]==cc&&!color2[i][j+1]){
		dfss(i,j+1);
	}
	else if(arr[i][j+1]!='.'&&!color2[i][j+1]){
		int a=min(x[i][j],x[i][j+1]);
		int b=max(x[i][j],x[i][j+1]);
		if(!edge[{a,b}]){
			edge[{a,b}]=1;
			vt[a].pb(b);
			vt[b].pb(a);
		}
	}
	if(arr[i][j-1]==cc&&!color2[i][j-1]){
		dfss(i,j-1);
	}
	else if(arr[i][j-1]!='.'&&!color2[i][j-1]){
		int a=min(x[i][j],x[i][j-1]);
		int b=max(x[i][j],x[i][j-1]);
		if(!edge[{a,b}]){
			edge[{a,b}]=1;
			vt[a].pb(b);
			vt[b].pb(a);
		}
	}
}
void solve(){
	memset(arr,'.',sizeof(arr));
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>arr[i][j];
		}
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			if(arr[i][j]!='.'&&!color[i][j]){
				k++;
				dfs(i,j);
			}
		}
	}
	//memset(color,0,sizeof(color));
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			if(arr[i][j]!='.'&&!color2[i][j]){
				dfss(i,j);
			}
		}
	}
	queue<int>q;
	q.push(1);
	colorr[1]=1;
	dis[1]=1;
	int ans=1;
	while(q.size()){
		int u=q.front();
		q.pop();
		for(int v:vt[u]){
			if(!colorr[v]){
				dis[v]=dis[u]+1;
				colorr[v]=1;
				q.push(v);
				ans=max(ans,dis[v]);
			}
		}
	}
	cout<<ans<<endl;
}
int main(){
	IOS;
	//cin>>t;
	while(t--){
		solve();
	}
	return 0;
}

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