oj.uz

Submission #310812

# Submission time Handle Problem Language Result Execution time Memory
310812 2020-10-08T04:32:13 Z VROOM_VARUN Tracks in the Snow (BOI13_tracks) C++14
100 / 100
 1442 ms 198652 KB 
/*
ID: varunra2
LANG: C++
TASK: tracks
*/

#include <bits/stdc++.h>
using namespace std;

#ifdef DEBUG
#include "lib/debug.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define debug_arr(...) \
  cerr << "[" << #__VA_ARGS__ << "]:", debug_arr(__VA_ARGS__)
#pragma GCC diagnostic ignored "-Wsign-compare"
//#pragma GCC diagnostic ignored "-Wunused-parameter"
//#pragma GCC diagnostic ignored "-Wunused-variable"
#else
#define debug(...) 42
#endif

#define EPS 1e-9
#define IN(A, B, C) assert(B <= A && A <= C)
#define INF (int)1e9
#define MEM(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define MP make_pair
#define PB push_back
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define x first
#define y second

const double PI = acos(-1.0);
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef map<int, int> MPII;
typedef multiset<int> MSETI;
typedef set<int> SETI;
typedef set<string> SETS;
typedef vector<int> VI;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef vector<string> VS;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto& a : x)
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef vector<int> vi;
#pragma GCC diagnostic ignored "-Wsign-compare"
// util functions

VVI vals;
int h, w;
vector<vector<bool>> vis;
int get(PII a, PII b) { return vals[a.x][a.y] != vals[b.x][b.y]; }

bool inbnds(PII a) {
  bool x = a.x >= 0 and a.x < h and a.y >= 0 and a.y < w;
  if (x == false) return false;

  return vals[a.x][a.y] != 0 and vis[a.x][a.y] == false;
}

VI dx = {0, -1, 0, 1};
VI dy = {1, 0, -1, 0};

int dij() {
  deque<pair<int, PII>> dq;

  dq.PB(MP(0, MP(0, 0)));
  int ret = 0;
  while (!dq.empty()) {
    auto x = dq.front();
    dq.pop_front();
    ret = max(ret, x.x);
    if (vis[x.y.x][x.y.y]) continue;
    vis[x.y.x][x.y.y] = true;

    for (int i = 0; i < 4; i++) {
      PII nw = MP(x.y.x + dx[i], x.y.y + dy[i]);
      if (inbnds(nw)) {
        int gt = get(x.y, nw);
        if (gt == 1) {
          dq.PB(MP(x.x + gt, nw));
        } else
          dq.push_front(MP(x.x + gt, nw));
      }
    }
  }

  return ret;
}

int main() {
  // #ifndef ONLINE_JUDGE
  // freopen("tracks.in", "r", stdin);
  // freopen("tracks.out", "w", stdout);
  // #endif
  cin.sync_with_stdio(0);
  cin.tie(0);

  cin >> h >> w;

  vals.resize(h);
  vis.resize(h);
  for (int i = 0; i < h; i++) {
    vals[i].assign(w, 0);
    vis[i].assign(w, false);
    for (int j = 0; j < w; j++) {
      char c;
      cin >> c;
      if (c == 'R')
        vals[i][j] = 1;
      else if(c == 'F')
        vals[i][j] = 2;
    }
  }

  cout << dij() + 1 << '\n';

  return 0;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 1536 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 13 ms 1536 KB Output is correct
5 Correct 4 ms 640 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 4 ms 640 KB Output is correct
11 Correct 4 ms 640 KB Output is correct
12 Correct 9 ms 768 KB Output is correct
13 Correct 4 ms 640 KB Output is correct
14 Correct 4 ms 768 KB Output is correct
15 Correct 21 ms 1408 KB Output is correct
16 Correct 26 ms 1536 KB Output is correct
17 Correct 17 ms 1408 KB Output is correct
18 Correct 13 ms 1536 KB Output is correct

Subtask #2
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 896 KB Output is correct
2 Correct 83 ms 6776 KB Output is correct
3 Correct 532 ms 65400 KB Output is correct
4 Correct 139 ms 15740 KB Output is correct
5 Correct 345 ms 36856 KB Output is correct
6 Correct 1440 ms 102332 KB Output is correct
7 Correct 3 ms 1024 KB Output is correct
8 Correct 3 ms 896 KB Output is correct
9 Correct 4 ms 640 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 3 ms 896 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 85 ms 6780 KB Output is correct
14 Correct 47 ms 4088 KB Output is correct
15 Correct 38 ms 4480 KB Output is correct
16 Correct 41 ms 3064 KB Output is correct
17 Correct 225 ms 16888 KB Output is correct
18 Correct 166 ms 16632 KB Output is correct
19 Correct 137 ms 15736 KB Output is correct
20 Correct 126 ms 14328 KB Output is correct
21 Correct 312 ms 38348 KB Output is correct
22 Correct 345 ms 36856 KB Output is correct
23 Correct 444 ms 31864 KB Output is correct
24 Correct 304 ms 37244 KB Output is correct
25 Correct 771 ms 65400 KB Output is correct
26 Correct 1442 ms 198652 KB Output is correct
27 Correct 1342 ms 148712 KB Output is correct
28 Correct 1436 ms 102268 KB Output is correct
29 Correct 1404 ms 96636 KB Output is correct
30 Correct 1403 ms 116368 KB Output is correct
31 Correct 1166 ms 43384 KB Output is correct
32 Correct 1386 ms 136404 KB Output is correct