Submission #1136465

#	Time	Username	Problem	Language	Result	Execution time	Memory
1136465		thelegendary08	Tracks in the Snow (BOI13_tracks)	C++17	93.44 / 100	616 ms	208748 KiB

tracks

#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define pout(a) cout<<a.first<<' '<<a.second<<'\n'
#define vout(v) for(auto u : v){cout<<u<<' ';} cout<<'\n'
#define dout(a) cout<<a<<' '<<#a<<'\n'
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<'\n'
#define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;
 
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	//ifstream cin(".in");
	//ofstream cout(".out");
	in2(n,m);
	char grid[n][m];
	f0r(i,n)f0r(j,m)cin>>grid[i][j];
	deque<pii>q;
	vvi dist(n,vi(m,4e18));
	dist[0][0] = 0;
	q.push_back(mp(0,0));
	
	while(!q.empty()){
		pii node = q.front();
		q.pop_front();
		int x = node.first;
		int y = node.second;
		if(x != 0 && grid[x-1][y] != '.' && dist[x-1][y] == 4e18){
			if(grid[x-1][y] != grid[x][y]){
				dist[x-1][y] = dist[x][y] + 1;
				q.push_back(mp(x-1,y));
			}
			else{
				dist[x-1][y] = dist[x][y];
				q.push_front(mp(x-1,y));
			}
			
		}
		if(x != n-1 && grid[x+1][y] != '.' && dist[x+1][y] == 4e18){
			if(grid[x+1][y] != grid[x][y]){
				dist[x+1][y] = dist[x][y] + 1;
				q.push_back(mp(x+1,y));
			}
			else{
				dist[x+1][y] = dist[x][y];
				q.push_front(mp(x+1,y));
			}
		}
		if(y != 0 && grid[x][y-1] != '.' && dist[x][y-1] == 4e18){
			if(grid[x][y-1] != grid[x][y]){
				dist[x][y-1] = dist[x][y] + 1;
				q.push_back(mp(x,y-1));
			}
			else{
				dist[x][y-1] = dist[x][y];
				q.push_front(mp(x,y-1));
			}
			
		}
		if(x != m-1 && grid[x][y+1] != '.' && dist[x][y+1] == 4e18){
			if(grid[x][y+1] != grid[x][y]){
				dist[x][y+1] = dist[x][y] + 1;
				q.push_back(mp(x,y+1));
			}
			else{
				dist[x][y+1] = dist[x][y];
				q.push_front(mp(x,y+1));
			}
		}
	}
	int ans = 0;
	f0r(i,n){
		f0r(j,m){
			if(dist[i][j] != 4e18)ans = max(ans, dist[i][j]);
		}
	}
	ans++;
	out(ans);
}

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