Submission #999966

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
999966	2024-06-16 11:40:30	Dipa	Tracks in the Snow (BOI13_tracks)	C++14	80.31 / 100	2102 ms	97244 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>
#define INF_INT 2147483647
#define what_is(x) cerr << #x << " is " << x << endl;
#define all(v) v.begin(), v.end()
typedef long long ll;
using namespace std;
void solve() {
  int H, W; cin >> H >> W;
  string grid[H];
  for (auto &el: grid) cin >> el;
  vector<vector<int>> dist(H, vector<int>(W, 1e9));
  deque<pair<int, int>> dq;
  dq.push_back({0, 0});
  dist[0][0] = 0;
  while (!dq.empty()) {
    pair<int, int> current = dq.front();
    dq.pop_front();
    // go down
    if (current.first + 1 < H && (grid[current.first + 1][current.second] != '.')) {
      if (grid[current.first + 1][current.second] != grid[current.first][current.second]) {
        if (dist[current.first + 1][current.second] > dist[current.first][current.second] + 1) {
          dist[current.first + 1][current.second] = dist[current.first][current.second] + 1;
          dq.push_back({current.first + 1, current.second});
        }
      } else {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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