oj.uz

Submission #968905

# Submission time Handle Problem Language Result Execution time Memory
968905 2024-04-24T09:18:04 Z Mher777 Tracks in the Snow (BOI13_tracks) C++17
100 / 100
 537 ms 133888 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <iomanip>
#include <array>
#include <string>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <list>
#include <iterator>
#include <numeric>
#include <complex>
#include <utility>
#include <random>
#include <cassert>
#include <fstream>
using namespace std;
mt19937 rnd(7069);

/* -------------------- Typedefs -------------------- */

typedef int itn;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef float fl;
typedef long double ld;

/* -------------------- Usings -------------------- */

using vi = vector<int>;
using vll = vector<ll>;
using mii = map<int, int>;
using mll = map<ll, ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

/* -------------------- Defines -------------------- */

#define ff first
#define ss second
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define mpr make_pair
#define yes cout<<"Yes\n"
#define no cout<<"No\n"
#define all(x) (x).begin(), (x).end()
#define USACO freopen("feast.in", "r", stdin); freopen("feast.out", "w", stdout);

/* -------------------- Constants -------------------- */

const int dx[8] = { -1, 0, 1, 0, -1, -1, 1, 1 };
const int dy[8] = { 0, -1, 0, 1, -1, 1, -1, 1 };
const int MAX = int(1e9 + 5);
const ll MAXL = ll(1e18) + 5ll;
const ll MOD = ll(1000000007);
const ll MOD2 = ll(998244353);

/* -------------------- Functions -------------------- */

void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

void precision(int x) {
    cout.setf(ios::fixed | ios::showpoint);
    cout.precision(x);
}

ll gcd(ll a, ll b) {
    if (a == 0 || b == 0) return(max(a, b));
    while (b) {
        a %= b;
        swap(a, b);
    }
    return a;
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}

ll range_sum(ll a, ll b) {
    if (a > b) return 0ll;
    ll dif = a - 1, cnt = b - a + 1;
    ll ans = ((b - a + 1) * (b - a + 2)) / 2;
    ans += ((b - a + 1) * dif);
    return ans;
}

string dec_to_bin(ll a) {
    string s = "";
    for (ll i = a; i > 0; ) {
        ll k = i % 2;
        i /= 2;
        char c = k + 48;
        s += c;
    }
    if (a == 0) {
        s = "0";
    }
    reverse(all(s));
    return s;
}

ll bin_to_dec(string s) {
    ll num = 0;
    for (int i = 0; i < s.size(); i++) {
        num *= 2ll;
        num += (s[i] - '0');
    }
    return num;
}

ll factorial_by_mod(ll n, ll mod) {
    ll ans = 1;
    ll num;
    for (ll i = 1; i <= n; ++i) {
        num = i % mod;
        ans *= num;
        ans %= mod;
    }
    return ans;
}

int isPrime(ll a) {
    if (a == 1) return 0;
    for (ll i = 2; i * i <= a; i++) {
        if (a % i == 0) return 0;
    }
    return 1;
}

ll binpow(ll a, ll b) {
    if (!a) return 0;
    ll ans = 1;
    while (b) {
        if (b & 1) {
            ans *= a;
        }
        b >>= 1;
        a *= a;
    }
    return ans;
}

ll binpow_by_mod(ll a, ll b, ll mod) {
    if (!a) return 0;
    ll ans = 1;
    while (b) {
        if (b & 1) {
            ans *= a;
            ans %= mod;
        }
        b >>= 1;
        a *= a;
        a %= mod;
    }
    return ans;
}

/* -------------------- Solution -------------------- */

const int N = 4005;
char a[N][N];
int val[N][N];
int n, m, ans;

bool check(int x, int y) {
    if (x <= n && x >= 1 && y >= 1 && y <= m && a[x][y] != '.') return true;
    return false;
}

void bfs() {
    deque<pii> dq;
    dq.pub({ 1,1 });
    val[1][1] = 1;
    while (!dq.empty()) {
        int x = dq.front().ff, y = dq.front().ss;
        dq.pof();
        ans = max(ans, val[x][y]);
        for (int i = 0; i < 4; ++i) {
            int x1 = x + dx[i], y1 = y + dy[i];
            if (check(x1, y1) && !val[x1][y1]) {
                val[x1][y1] = val[x][y];
                if (a[x1][y1] == a[x][y]) {
                    dq.puf({ x1,y1 });
                }
                else {
                    ++val[x1][y1];
                    dq.pub({ x1,y1 });
                }
            }
        }
    }
}

void slv() {
    cin >> n >> m;
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= m; ++j) {
            cin >> a[i][j];
        }
    }
    bfs();
    cout << ans;
}

void cs() {
    int tstc = 1;
    //cin >> tstc;
    while (tstc--) {
        slv();
    }
}

void precalc() {
    return;
}

int main() {
    fastio();
    precalc();
    //precision(0);
    cs();
    return 0;
}

Compilation message

tracks.cpp: In function 'll range_sum(ll, ll)':
tracks.cpp:97:21: warning: unused variable 'cnt' [-Wunused-variable]
   97 |     ll dif = a - 1, cnt = b - a + 1;
      |                     ^~~
tracks.cpp: In function 'll bin_to_dec(std::string)':
tracks.cpp:120:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  120 |     for (int i = 0; i < s.size(); i++) {
      |                     ~~^~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 7768 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 7 ms 7768 KB Output is correct
5 Correct 3 ms 5980 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2908 KB Output is correct
10 Correct 2 ms 3676 KB Output is correct
11 Correct 2 ms 3420 KB Output is correct
12 Correct 4 ms 6156 KB Output is correct
13 Correct 3 ms 5980 KB Output is correct
14 Correct 3 ms 6036 KB Output is correct
15 Correct 9 ms 7496 KB Output is correct
16 Correct 11 ms 7768 KB Output is correct
17 Correct 8 ms 7516 KB Output is correct
18 Correct 7 ms 7516 KB Output is correct

Subtask #2
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 32308 KB Output is correct
2 Correct 39 ms 16220 KB Output is correct
3 Correct 243 ms 73672 KB Output is correct
4 Correct 79 ms 35612 KB Output is correct
5 Correct 173 ms 55896 KB Output is correct
6 Correct 537 ms 107964 KB Output is correct
7 Correct 9 ms 33112 KB Output is correct
8 Correct 10 ms 32344 KB Output is correct
9 Correct 2 ms 2796 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 9 ms 32604 KB Output is correct
12 Correct 2 ms 3164 KB Output is correct
13 Correct 38 ms 16192 KB Output is correct
14 Correct 22 ms 13148 KB Output is correct
15 Correct 21 ms 15324 KB Output is correct
16 Correct 18 ms 8284 KB Output is correct
17 Correct 97 ms 31216 KB Output is correct
18 Correct 85 ms 38224 KB Output is correct
19 Correct 69 ms 35660 KB Output is correct
20 Correct 58 ms 26956 KB Output is correct
21 Correct 146 ms 54816 KB Output is correct
22 Correct 187 ms 55880 KB Output is correct
23 Correct 188 ms 46276 KB Output is correct
24 Correct 163 ms 52028 KB Output is correct
25 Correct 414 ms 94508 KB Output is correct
26 Correct 327 ms 133888 KB Output is correct
27 Correct 408 ms 122996 KB Output is correct
28 Correct 513 ms 108084 KB Output is correct
29 Correct 525 ms 109196 KB Output is correct
30 Correct 474 ms 114168 KB Output is correct
31 Correct 384 ms 75228 KB Output is correct
32 Correct 387 ms 112092 KB Output is correct