Submission #715171

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
715171	2023-03-26T07:07:11 Z	radal	Tracks in the Snow (BOI13_tracks)	C++17	100 / 100	475 ms	119360 KB

tracks

#include <bits/stdc++.h>
//#pragma GCC target("sse,sse2,avx2")
#pragma GCC optimize("unroll-loops,O3")
#define rep(i,l,r) for (int i = l; i < r; i++)
#define repr(i,r,l) for (int i = r; i >= l; i--)
#define X first
#define Y second
#define all(x) (x).begin() , (x).end()
#define pb push_back
#define endl '\n'
#define debug(x) cerr << #x << " : " << x << endl;

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pll;
constexpr int N = 4e3+20,mod = 998244353;
constexpr ll inf = 1e9+10;
inline int mkay(int a,int b){
    if (a+b >= mod) return a+b-mod;
    if (a+b < 0) return a+b+mod;
    return a+b;
}
 
inline int poww(int a,int k){
    if (k < 0) return 0;
    int z = 1;
    while (k){
        if (k&1) z = 1ll*z*a%mod;
        a = 1ll*a*a%mod;
        k >>= 1;
    } 
    return z; 
}

int d[N][N];
string s[N];
int n,m;
pll ja[4] = {{1,0},{-1,0},{0,1},{0,-1}};

inline bool isval(int i,int j){
	if (min(i,j) < 0 || i >= n || j >= m || s[i][j] == '.') return 0;
	return 1;
}

int bfs(){
	deque<pll> q;
	q.pb({0,0});
	d[0][0] = 1;
	int mx = 0;
	while (!q.empty()){
		pll p = q.front();
		q.pop_front();
		int x = p.X,y = p.Y;
		mx = max(mx,d[x][y]);
		rep(i,0,4){
			int x2 = x + ja[i].X,y2 = y + ja[i].Y;
			if (isval(x2,y2) && !d[x2][y2]){
				if (s[x2][y2] == s[x][y]){
					d[x2][y2] = d[x][y];
					q.push_front({x2,y2});
				}
				else{
					d[x2][y2] = d[x][y] + 1;
					q.pb({x2,y2});
				}
			}
		}
	}
	return mx;
}

int main(){
	ios :: sync_with_stdio(0); cin.tie(0);  cout.tie(0);
	cin >> n >> m;
	rep(i,0,n) cin >> s[i];
	cout << bfs() << endl;
}

Subtask #1

30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	11 ms	3896 KB	Output is correct
2	Correct	1 ms	452 KB	Output is correct
3	Correct	1 ms	580 KB	Output is correct
4	Correct	6 ms	3516 KB	Output is correct
5	Correct	3 ms	2004 KB	Output is correct
6	Correct	1 ms	468 KB	Output is correct
7	Correct	1 ms	596 KB	Output is correct
8	Correct	1 ms	816 KB	Output is correct
9	Correct	1 ms	852 KB	Output is correct
10	Correct	2 ms	1620 KB	Output is correct
11	Correct	2 ms	1492 KB	Output is correct
12	Correct	5 ms	2124 KB	Output is correct
13	Correct	3 ms	2004 KB	Output is correct
14	Correct	3 ms	1956 KB	Output is correct
15	Correct	9 ms	3660 KB	Output is correct
16	Correct	11 ms	3808 KB	Output is correct
17	Correct	8 ms	3632 KB	Output is correct
18	Correct	6 ms	3508 KB	Output is correct

Subtask #2

70.0 / 70.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	10 ms	15864 KB	Output is correct
2	Correct	33 ms	10732 KB	Output is correct
3	Correct	160 ms	60248 KB	Output is correct
4	Correct	53 ms	26032 KB	Output is correct
5	Correct	118 ms	43148 KB	Output is correct
6	Correct	469 ms	94944 KB	Output is correct
7	Correct	11 ms	16596 KB	Output is correct
8	Correct	10 ms	15956 KB	Output is correct
9	Correct	2 ms	724 KB	Output is correct
10	Correct	1 ms	468 KB	Output is correct
11	Correct	10 ms	16340 KB	Output is correct
12	Correct	1 ms	1112 KB	Output is correct
13	Correct	32 ms	10664 KB	Output is correct
14	Correct	19 ms	7440 KB	Output is correct
15	Correct	16 ms	9740 KB	Output is correct
16	Correct	16 ms	4640 KB	Output is correct
17	Correct	82 ms	21576 KB	Output is correct
18	Correct	59 ms	28608 KB	Output is correct
19	Correct	57 ms	26064 KB	Output is correct
20	Correct	43 ms	19372 KB	Output is correct
21	Correct	102 ms	42000 KB	Output is correct
22	Correct	122 ms	43212 KB	Output is correct
23	Correct	161 ms	35240 KB	Output is correct
24	Correct	105 ms	38860 KB	Output is correct
25	Correct	299 ms	81356 KB	Output is correct
26	Correct	281 ms	119360 KB	Output is correct
27	Correct	378 ms	108008 KB	Output is correct
28	Correct	472 ms	94948 KB	Output is correct
29	Correct	475 ms	93368 KB	Output is correct
30	Correct	431 ms	97676 KB	Output is correct
31	Correct	401 ms	62688 KB	Output is correct
32	Correct	326 ms	93300 KB	Output is correct