oj.uz

Submission #270287

# Submission time Handle Problem Language Result Execution time Memory
270287 2020-08-17T13:52:02 Z Killer2501 Portals (BOI14_portals) C++14
70 / 100
 1000 ms 195960 KB 
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define fi first
#define se second
#define pll pair<ll, ll>
using namespace std;
const ll N = 1e6 + 5;
const ll mod = 1e9 + 7;
ll n, dp[N], sum= 0, m, tong, k, ans, T, t;
int vit[N];
ll a[N], b[N], d[N];
string s;
vector<pll> adj[N];
ll f(ll i, ll j)
{
    return (i-1) * m + j;
}
char c[N];
queue<pll> ds;
void bfs()
{
    while(!ds.empty())
    {
        pll u = ds.front();
        ds.pop();
        int j = (u.se % m == 0) ? m : (u.se % m), i = (u.se - j) / m + 1;
        //cout << i <<" "<<j<<'\n';
        if(i > 1)
        {
            k = f(i-1, j);
            if(b[k] > u.fi + 1)
            {
                b[k] = u.fi + 1;
                ds.push({b[k], k});
            }
        }
        if(j > 1)
        {
            k = f(i, j-1);
            if(b[k] > u.fi + 1)
            {
                b[k] = u.fi + 1;
                ds.push({b[k], k});
            }
        }
        if(i < n)
        {
            k = f(i+1, j);
            if(b[k] > u.fi + 1)
            {
                b[k] = u.fi + 1;
                ds.push({b[k], k});
            }
        }
        if(j < m)
        {
            k = f(i, j+1);
            if(b[k] > u.fi + 1)
            {
                b[k] = u.fi + 1;
                ds.push({b[k], k});
            }
        }
    }
}
inline void sol()
{
    cin >> n >> m;
    ll sa, fn;
    for(int i = 1; i <= n; i ++)
        for(int j = 1; j <= m; j ++)
        {
            k = f(i, j);
            cin >> c[k];
            if(c[k] == 'S')
            {
                sa = k;
            }
            if(c[k] == 'C')
            {
                fn = k;
            }
            b[k] = mod;
            d[k] = mod;
            if(c[k] == '#')
            {
                ds.push({0, k});
                b[k] = 0;
            }

        }
        for(int i = 1; i <= n; i ++)
        {
            for(int j = 1; j <= m; j ++)
            {
            k = f(i, j);
            if(i > 1 && c[f(i-1, j)] != '#')adj[k].pb({1, f(i-1, j)});
            if(j > 1 && c[f(i, j-1)] != '#')adj[k].pb({1, f(i, j-1)});
            if(i < n && c[f(i+1, j)] != '#')adj[k].pb({1, f(i+1, j)});
            if(j < m && c[f(i, j+1)] != '#')adj[k].pb({1, f(i, j+1)});
            }
        }
        for(int i = 1; i <= n; i ++)
        {
            k = f(i, 1);
            if(c[k] != '#')
            {
                b[k] = 1;
                ds.push({b[k], k});
            }
            k = f(i, m);
            if(c[k] != '#')
            {
                b[k] = 1;
                ds.push({b[k], k});
            }
        }
        for(int i = 1; i <= m; i ++)
        {
            k = f(1, i);
            if(c[k] != '#')
            {
                b[k] = 1;
                ds.push({b[k], k});
            }
            k = f(n, i);
            if(c[k] != '#')
            {
                b[k] = 1;
                ds.push({b[k], k});
            }
        }
    bfs();
    for(int i = 1; i <= n; i ++)
    {
        stack<ll> l, r;
        l.push(0);
        r.push(m+1);
        for(int j = 1; j <= m; j ++)
        {
            k = f(i, j);
            //cout << b[k] <<" ";

            t = l.top() + 1;
            adj[k].pb({b[k], f(i, t)});
            if(c[k] == '#')l.push(j);
        }
        //cout << '\n';
        for(int j = m; j > 0; j --)
        {
            k = f(i, j);
            t = r.top() - 1;
            adj[k].pb({b[k], f(i, t)});
            if(c[k] == '#')r.push(j);
        }
    }
    for(int i = 1; i <= m; i ++)
    {
        stack<ll> l, r;
        l.push(0);
        r.push(n+1);
        for(int j = 1; j <= n; j ++)
        {
            k = f(j, i);
            t = l.top() + 1;
            //cout << j <<" "<< i <<" "<<t<<'\n';
            adj[k].pb({b[k], f(t, i)});
            if(c[k] == '#')l.push(j);
        }
        for(int j = n; j > 0; j --)
        {
            k = f(j, i);
            t = r.top() - 1;
            adj[k].pb({b[k], f(t, i)});
            if(c[k] == '#')r.push(j);
        }
    }
    priority_queue< pll, vector<pll>, greater<pll> >pr;
    pr.push({0, sa});
    d[sa] = 0;
    while(!pr.empty())
    {
        pll u = pr.top();
        pr.pop();
        if(d[u.se] != u.fi)continue;
        int j = (u.se % m == 0) ? m : u.se  % m, i = (u.se - j) / m + 1;
        //cout << i <<" "<<j<<" "<<u.fi<<'\n';
        for(pll v : adj[u.se])
        {
            if(d[v.se] > d[u.se] + v.fi)
            {

                d[v.se] = d[u.se] + v.fi;
                pr.push({d[v.se], v.se});
            }
        }
    }

    cout << d[fn];
}
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    sol();
}

Compilation message

portals.cpp: In function 'void sol()':
portals.cpp:71:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   71 |     for(int i = 1; i <= n; i ++)
      |     ^~~
portals.cpp:93:9: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   93 |         for(int i = 1; i <= n; i ++)
      |         ^~~
portals.cpp:187:50: warning: unused variable 'i' [-Wunused-variable]
  187 |         int j = (u.se % m == 0) ? m : u.se  % m, i = (u.se - j) / m + 1;
      |                                                  ^
portals.cpp:181:11: warning: 'sa' may be used uninitialized in this function [-Wmaybe-uninitialized]
  181 |     d[sa] = 0;
      |     ~~~~~~^~~
portals.cpp:200:17: warning: 'fn' may be used uninitialized in this function [-Wmaybe-uninitialized]
  200 |     cout << d[fn];
      |                 ^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 23808 KB Output is correct
2 Correct 17 ms 23808 KB Output is correct
3 Correct 16 ms 23968 KB Output is correct
4 Correct 14 ms 23808 KB Output is correct
5 Correct 14 ms 23808 KB Output is correct
6 Correct 14 ms 23808 KB Output is correct
7 Correct 18 ms 23808 KB Output is correct
8 Correct 18 ms 23944 KB Output is correct
9 Correct 15 ms 23808 KB Output is correct
10 Correct 15 ms 23808 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23808 KB Output is correct
2 Correct 15 ms 23808 KB Output is correct
3 Correct 14 ms 23808 KB Output is correct
4 Correct 15 ms 23808 KB Output is correct
5 Correct 19 ms 23808 KB Output is correct
6 Correct 20 ms 23808 KB Output is correct
7 Correct 15 ms 23808 KB Output is correct
8 Correct 17 ms 23808 KB Output is correct
9 Correct 17 ms 24192 KB Output is correct
10 Correct 20 ms 24312 KB Output is correct
11 Correct 19 ms 24320 KB Output is correct
12 Correct 22 ms 24320 KB Output is correct
13 Correct 18 ms 24320 KB Output is correct
14 Correct 18 ms 23808 KB Output is correct
15 Correct 19 ms 24320 KB Output is correct
16 Correct 15 ms 23808 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 23808 KB Output is correct
2 Correct 16 ms 23840 KB Output is correct
3 Correct 18 ms 23928 KB Output is correct
4 Correct 15 ms 23808 KB Output is correct
5 Correct 41 ms 30712 KB Output is correct
6 Correct 50 ms 30712 KB Output is correct
7 Correct 52 ms 30584 KB Output is correct
8 Correct 36 ms 30584 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23808 KB Output is correct
2 Correct 15 ms 23884 KB Output is correct
3 Correct 17 ms 23808 KB Output is correct
4 Correct 16 ms 23808 KB Output is correct
5 Correct 19 ms 23808 KB Output is correct
6 Correct 15 ms 23808 KB Output is correct
7 Correct 15 ms 23808 KB Output is correct
8 Correct 15 ms 23808 KB Output is correct
9 Correct 16 ms 24320 KB Output is correct
10 Correct 16 ms 24192 KB Output is correct
11 Correct 17 ms 24320 KB Output is correct
12 Correct 17 ms 24320 KB Output is correct
13 Correct 16 ms 24448 KB Output is correct
14 Correct 51 ms 30712 KB Output is correct
15 Correct 47 ms 30712 KB Output is correct
16 Correct 42 ms 30456 KB Output is correct
17 Correct 39 ms 30464 KB Output is correct
18 Correct 42 ms 30592 KB Output is correct
19 Correct 37 ms 30200 KB Output is correct
20 Correct 36 ms 30328 KB Output is correct
21 Correct 41 ms 30712 KB Output is correct
22 Correct 43 ms 30720 KB Output is correct
23 Correct 49 ms 30692 KB Output is correct
24 Correct 37 ms 30332 KB Output is correct
25 Correct 15 ms 23808 KB Output is correct
26 Correct 17 ms 24320 KB Output is correct
27 Correct 15 ms 23840 KB Output is correct
28 Correct 37 ms 30592 KB Output is correct

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23808 KB Output is correct
2 Correct 16 ms 23808 KB Output is correct
3 Correct 16 ms 23808 KB Output is correct
4 Correct 18 ms 23808 KB Output is correct
5 Correct 15 ms 23808 KB Output is correct
6 Correct 15 ms 23808 KB Output is correct
7 Correct 15 ms 23808 KB Output is correct
8 Correct 16 ms 23936 KB Output is correct
9 Correct 18 ms 24320 KB Output is correct
10 Correct 20 ms 24320 KB Output is correct
11 Correct 17 ms 24320 KB Output is correct
12 Correct 20 ms 24320 KB Output is correct
13 Correct 20 ms 24320 KB Output is correct
14 Correct 41 ms 30712 KB Output is correct
15 Correct 48 ms 30712 KB Output is correct
16 Correct 48 ms 30456 KB Output is correct
17 Correct 40 ms 30584 KB Output is correct
18 Correct 43 ms 30584 KB Output is correct
19 Correct 49 ms 30208 KB Output is correct
20 Correct 42 ms 30328 KB Output is correct
21 Correct 44 ms 30848 KB Output is correct
22 Correct 46 ms 30712 KB Output is correct
23 Correct 49 ms 30720 KB Output is correct
24 Correct 919 ms 190724 KB Output is correct
25 Correct 865 ms 183032 KB Output is correct
26 Correct 779 ms 182688 KB Output is correct
27 Correct 724 ms 183120 KB Output is correct
28 Correct 990 ms 195576 KB Output is correct
29 Correct 983 ms 195960 KB Output is correct
30 Execution timed out 1039 ms 195404 KB Time limit exceeded
31 Halted 0 ms 0 KB -