oj.uz

Submission #943119

# Submission time Handle Problem Language Result Execution time Memory
943119 2024-03-11T08:27:13 Z simuyu Portals (BOI14_portals) C++14
100 / 100
 912 ms 73888 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f first
#define s second
#define ii pair<int,int>
#define qit pair<ii, ll>

vector<vector<int> > wallsr, wallsc; //wallsr means c of walls, given r, and vice versa.

ii get_walls_with_c(int r, int c) {
    // stuff with wallsc
    int small=0, large=wallsc[c].size()-1, mid;
    while (large-small > 1) {
        mid = (small+large)/2;
        if (wallsc[c][mid] > r) {
            large = mid; // so, r < wallsc[large] , always. (since last is always outside)
        } else {
            small = mid; // so, wallsc[small] <= r, always. (since first is always outside)
        }
    }
    if (wallsc[c][small] == r) small--;
    return ii(wallsc[c][small], wallsc[c][large]);
}

ii get_walls_with_r(int r, int c) {
    // stuff with wallsr
    int small=0, large=wallsr[r].size()-1, mid;
    while (large-small > 1) {
        mid = (small+large)/2;
        if (wallsr[r][mid] > c) {
            large = mid; // so, r < wallsc[large] , always. (since last is always outside)
        } else {
            small = mid; // so, wallsc[small] <= r, always. (since first is always outside)
        }
    }
    if (wallsr[r][small] == c) small--;
    return ii(wallsr[r][small], wallsr[r][large]);
}

/*
class qit {
public:
    ii f;
    ll s;
    qit(ii vals, ll dist) {
        f = vals;
        s = dist;
    }

    bool operator<(qit b) {
        return s < b.s;
    }

    bool operator>(qit b) {
        return s > b.s;
    }

    const bool operator<(qit b) {
        return s < b.s;
    }

    const bool operator>(qit b) {
        return s > b.s;
    }

};
*/

class cmp {
    public:
    int operator()(qit a, qit b) {
        return greater<ll>()(a.s, b.s);
    }
};


int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int r, c;
    cin >> r >> c;

    int maze[r+3][c+3];

    for (int i=0; i<=r+1; i++) {
        wallsr.push_back(vector<int>());
        wallsr[i].push_back(0);
    }
    for (int i=0; i<=c+1; i++) {
        wallsc.push_back(vector<int>());
        wallsc[i].push_back(0);
    }
    char temp;
    ii start;
    for (int i=1; i<=r; i++) {
        for (int j=1; j<=c; j++) {
            cin >> temp;
            if (temp == '#') {
                maze[i][j] = -1;
                wallsr[i].push_back(j); // this will be in ascending order
                wallsc[j].push_back(i); // but not definitely this (?)
            }
            else if (temp == 'C') maze[i][j] = 1;
            else {
                maze[i][j] = 0;
                if (temp == 'S') {
                    start = ii(i, j);
                }
            }
        }
    }
    for (int i=0; i<=r+1; i++) {
        wallsr[i].push_back(c+1);
    }
    for (int i=0; i<=c+1; i++) {
        wallsc[i].push_back(r+1);
    }


    // just in case
    for (int col=1; col<=c; col++) {
        sort(wallsc[col].begin(), wallsc[col].end());
    }


    bool visited[r+2][c+2];
    for (int i=1; i<=r; i++) {
        for (int j=1; j<=c; j++) {
            visited[i][j] = false;
        }
    }

    // outline borders
    for (int i=0; i<=r+1; i++) {
        visited[i][0] = true;
        visited[i][c+1] = true;
    }
    for (int j=0; j<c+1; j++) {
        visited[0][j] = true;
        visited[r+1][j] = true;
    }


    priority_queue<qit, vector<qit>, cmp> bfs;
    bfs.push(qit(start,0));
    qit curr = qit(start,0); // temp value
    ii cpos;
    ii rwalls, cwalls;
    int closest;
    while (!bfs.empty()) {
        curr = bfs.top(); bfs.pop();
        cpos = curr.f;
        //cout << "CHECKING (" << cpos.f << ',' << cpos.s << "): " << curr.s << endl;
        //if (cpos.f<0 || cpos.f>r || cpos.s<0 || cpos.s>c) continue; // this means it go out of map bounds, so ignore.
        if (visited[cpos.f][cpos.s]) continue;
        visited[cpos.f][cpos.s] = true;

        if (maze[cpos.f][cpos.s] == 1) {
            cout << curr.s << '\n';
            return 0;
        } else if (maze[cpos.f][cpos.s] == -1) continue; // means that just ignore yea.

        // try moving in all four directions normally
        bfs.push(qit(ii(cpos.f-1, cpos.s), curr.s+1));
        bfs.push(qit(ii(cpos.f+1, cpos.s), curr.s+1));
        bfs.push(qit(ii(cpos.f, cpos.s-1), curr.s+1));
        bfs.push(qit(ii(cpos.f, cpos.s+1), curr.s+1));

        // try going to each wall using portal
        rwalls = get_walls_with_c(cpos.f, cpos.s);
        cwalls = get_walls_with_r(cpos.f, cpos.s);

        //cout << "R: " << cpos.f << ", C: " << cpos.s << endl;
        //cout << "RWALLS: " << rwalls.f << ' ' << rwalls.s << endl;
        //cout << "CWALLS: " << cwalls.f << ' ' << cwalls.s << endl;

        // these shldn't need abs, but jic.
        closest = min( min( abs(cpos.f-rwalls.f) , abs(rwalls.s-cpos.f) ) ,
                       min( abs(cpos.s-cwalls.f) , abs(cwalls.s-cpos.s) ) );

        //cout << "CLOSEST: " << closest << endl << endl;

        // try portal gun in all 4 directions
        bfs.push(qit(ii(rwalls.f+1, cpos.s), curr.s+closest));
        bfs.push(qit(ii(rwalls.s-1, cpos.s), curr.s+closest));
        bfs.push(qit(ii(cpos.f, cwalls.f+1), curr.s+closest));
        bfs.push(qit(ii(cpos.f, cwalls.s-1), curr.s+closest));
    }

    // should never happen...
    cout << -1 << '\n';
    return 0;



    return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 460 KB Output is correct
4 Correct 0 ms 460 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 452 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 500 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 1 ms 688 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 452 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 9 ms 948 KB Output is correct
6 Correct 14 ms 984 KB Output is correct
7 Correct 9 ms 860 KB Output is correct
8 Correct 6 ms 860 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 456 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 9 ms 952 KB Output is correct
15 Correct 14 ms 1008 KB Output is correct
16 Correct 9 ms 856 KB Output is correct
17 Correct 12 ms 860 KB Output is correct
18 Correct 15 ms 1036 KB Output is correct
19 Correct 2 ms 872 KB Output is correct
20 Correct 11 ms 2724 KB Output is correct
21 Correct 9 ms 860 KB Output is correct
22 Correct 11 ms 956 KB Output is correct
23 Correct 14 ms 860 KB Output is correct
24 Correct 27 ms 1752 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 6 ms 860 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 700 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 9 ms 856 KB Output is correct
15 Correct 14 ms 860 KB Output is correct
16 Correct 9 ms 860 KB Output is correct
17 Correct 13 ms 1016 KB Output is correct
18 Correct 14 ms 1188 KB Output is correct
19 Correct 2 ms 860 KB Output is correct
20 Correct 11 ms 2768 KB Output is correct
21 Correct 11 ms 952 KB Output is correct
22 Correct 11 ms 860 KB Output is correct
23 Correct 12 ms 996 KB Output is correct
24 Correct 417 ms 11340 KB Output is correct
25 Correct 757 ms 73888 KB Output is correct
26 Correct 50 ms 15304 KB Output is correct
27 Correct 257 ms 39960 KB Output is correct
28 Correct 245 ms 10772 KB Output is correct
29 Correct 308 ms 10988 KB Output is correct
30 Correct 286 ms 10960 KB Output is correct
31 Correct 27 ms 1756 KB Output is correct
32 Correct 912 ms 24824 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 372 ms 19008 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 6 ms 928 KB Output is correct
38 Correct 172 ms 10500 KB Output is correct
39 Correct 240 ms 10616 KB Output is correct