Submission #944210

#	Time	Username	Problem	Language	Result	Execution time	Memory
944210		Mher777	Portals (BOI14_portals)	C++17	0 / 100	11 ms	26892 KiB

portals

#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 MAX = int(2e9 + 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) {
    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 = 1005;
vector<pii> g[N][N];
char a[N][N];
int d[N][N];
int x1, yx, x2, y2;
int n, m;

void dijkstra() {
    d[x1][yx] = 0;
    priority_queue<pair<int, pii>> pq;
    pq.push({ 0,{x1,yx} });
    while (!pq.empty()) {
        int dist = -pq.top().ff, x = pq.top().ss.ff, y = pq.top().ss.ss;
        pq.pop();
        if (dist > d[x][y]) continue;
        for (auto to : g[x][y]) {
            x1 = to.ff, yx = to.ss;
            if (d[x1][yx] > d[x][y] + 1) {
                d[x1][yx] = d[x][y] + 1;
                pq.push({ -d[x1][yx],{x1,yx} });
            }
        }
    }
    cout << d[x2][y2];
}

void slv() {
    cin >> n >> m;
    for (int i = 1; i <= n; ++i) {
        a[i][0] = '#';
        a[i][m + 1] = '#';
        for (int j = 1; j <= m; ++j) {
            a[0][j] = '#';
            a[n + 1][j] = '#';
            cin >> a[i][j];
            if (a[i][j] == 'S') {
                x1 = i, yx = j;
            }
            else if (a[i][j] == 'C') {
                x2 = i, y2 = j;
            }
            d[i][j] = MAX;
        }
    }
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= m; ++j) {
            if (a[i][j] == '#') continue;
            if (a[i - 1][j] == '#') {
                //right
                for (int ji = j; ji <= m; ++ji) {
                    if (a[i][ji + 1] == '#') {
                        g[i][j].pub({ i,ji });
                        g[i][ji].pub({ i,j });
                        break;
                    }
                }
            }
            if (a[i][j - 1] == '#') {
                //down
                for (int ii = i; ii <= n; ++ii) {
                    if (a[ii + 1][j] == '#') {
                        g[ii][j].pub({ i,j });
                        g[i][j].pub({ ii,j });
                        break;
                    }
                }
            }
            g[i + 1][j].pub({ i,j });
            g[i - 1][j].pub({ i,j });
            g[i][j + 1].pub({ i,j });
            g[i][j - 1].pub({ i,j });
        }
    }
    dijkstra();
}

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

void precalc() {
    return;
}

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

Compilation message (stderr)

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

• Subtask 1: 0 / 11
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 19
• Subtask 5: 0 / 30