oj.uz

Submission #486771

# Submission time Handle Problem Language Result Execution time Memory
486771 2021-11-12T18:19:00 Z davi_bart Patkice II (COCI21_patkice2) C++17
15 / 110
 2000 ms 72936 KB 
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
// #define int ll
#define fi first
#define se second
#define ld long double
#define pb push_back
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
char v[2010][2010];
bool vis[2010][2010];
int dd[2010][2010];
int N, M;
void solve(pair<int, int> start) {
    priority_queue<pair<int, pair<int, int> >, vector<pair<int, pair<int, int> > >, greater<pair<int, pair<int, int> > > > q;
    q.push({0, start});
    while (!q.empty()) {
        auto [d, pos] = q.top();
        q.pop();
        if (vis[pos.fi][pos.se]) continue;
        vis[pos.fi][pos.se] = 1;
        dd[pos.fi][pos.se] = d;
        if (v[pos.fi][pos.se] == 'x') return;

        if (pos.fi) q.push({d + (v[pos.fi][pos.se] != '^'), {pos.fi - 1, pos.se}});
        if (pos.fi < N - 1) q.push({d + (v[pos.fi][pos.se] != 'v'), {pos.fi + 1, pos.se}});
        if (pos.se) q.push({d + (v[pos.fi][pos.se] != '<'), {pos.fi, pos.se - 1}});
        if (pos.se < M - 1) q.push({d + (v[pos.fi][pos.se] != '>'), {pos.fi, pos.se + 1}});
    }
}
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> N >> M;
    pair<int, int> start, fine;
    for (int i = 0; i < N; i++) {
        string a;
        cin >> a;
        for (int j = 0; j < M; j++) {
            v[i][j] = a[j];
            if (a[j] == 'o') start = {i, j};
            if (a[j] == 'x') fine = {i, j};
        }
    }
    solve(start);
    // for (int i = 0; i < N; i++) {
    //     for (int j = 0; j < M; j++) {
    //         dd[i][j]--;
    //         cout << dd[i][j] << " ";
    //     }
    //     cout << endl;
    // }
    cout << dd[fine.fi][fine.se] - 1 << '\n';
}

Subtask #1
15.0 / 30.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 332 KB Partially correct
2 Partially correct 0 ms 332 KB Partially correct
3 Partially correct 1 ms 460 KB Partially correct
4 Partially correct 1 ms 332 KB Partially correct
5 Partially correct 0 ms 332 KB Partially correct

Subtask #2
0.0 / 80.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 332 KB Partially correct
2 Partially correct 0 ms 332 KB Partially correct
3 Partially correct 1 ms 460 KB Partially correct
4 Partially correct 1 ms 332 KB Partially correct
5 Partially correct 0 ms 332 KB Partially correct
6 Partially correct 154 ms 5700 KB Partially correct
7 Partially correct 148 ms 15884 KB Partially correct
8 Partially correct 532 ms 12400 KB Partially correct
9 Partially correct 1045 ms 40744 KB Partially correct
10 Partially correct 1546 ms 21376 KB Partially correct
11 Execution timed out 2079 ms 72936 KB Time limit exceeded