제출 #938051

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
938051	2024-03-04 18:42:47	TAhmed33	Tracks in the Snow (BOI13_tracks)	C++98	19.79 / 100	633 ms	122464 KiB

tracks

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
int dx[4] = {0, -1, 0, 1};
int dy[4] = {1, 0, -1, 0};
const int MAXN = 4000;
int n, m;
bool check (int x, int y) {
  return x >= 0 && x < n && y >= 0 && y < m;
}
char a[MAXN][MAXN];
int dist[MAXN][MAXN];
deque <pair <int, int>> cur;
signed main () {
  ios::sync_with_stdio(0); cin.tie(0);
  cin >> n >> m; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) cin >> a[i][j];
  cur.push_back({0, 0}); 
  for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) dist[i][j] = 1e9;
  dist[0][0] = 1;
  int ans = 1;
  while (!cur.empty()) {
    auto k = cur.front(); cur.pop_front();
    ans = max(ans, dist[k.first][k.second]);
    for (int i = 0; i < 4; i++) {
      int x = k.first + dx[i], y = k.second + dy[i];
      if (!check(x, y)) continue;
      if (a[x][y] == a[k.first][k.second]) {
        if (dist[k.first][k.second] < dist[x][y]) {
          dist[x][y] = dist[k.first][k.second];
          cur.push_front({x, y});
        }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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