oj.uz

Submission #949715

# Submission time Handle Problem Language Result Execution time Memory
949715 2024-03-19T15:24:26 Z tnknguyen_ Patkice II (COCI21_patkice2) C++14
110 / 110
 307 ms 149892 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n' 
#define pii pair<int, int>

struct st{
    int i, j, k;
};
const int sz = 2005;
const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};
const char dc[] = {'>', 'v', '<', '^'};

char a[sz][sz];
int d[sz][sz];
st pre[sz][sz];
int n, m, S, T, U, V;

bool valid(int x, int y){
    return (x >= 1 && x <= n && y >= 1 && y <= m);
}

void bfs(int x, int y){
    deque<pair<int, pii>> q;
    memset(d, 63, sizeof d);
    q.push_front({0, {x, y}});
    d[x][y] = 0;
    pre[x][y] = {-1, -1, -1};

    while(q.size()){
        int x, y, w;
        w = q.front().first;
        tie(x, y) = q.front().second;
        q.pop_front();

        for(int i=0; i<4; ++i){
            int u = x + dx[i];
            int v = y + dy[i];
            int c = (a[x][y] == 'o' ? 0 : (dc[i] != a[x][y]));
            if(!valid(u, v) || a[u][v] == 'o'){
                continue;
            }
            if(w + c < d[u][v]){
                d[u][v] = w + c;
                pre[u][v] = {x, y, i};
                if(c == 0){
                    q.push_front({w+c, {u, v}});
                }
                else{
                    q.push_back({w+c, {u, v}});
                }
            }
        }   
        // cout<<"-------------"<<endl;
    }
}

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

    //freopen("main.inp","r",stdin);
    //freopen("main.out","w",stdout);

    cin>>n>>m;
    for(int i=1; i<=n; ++i){
        for(int j=1; j<=m; ++j){
            cin>>a[i][j];
            if(a[i][j] == 'o'){
                S = i;
                T = j;
            }
            if(a[i][j] == 'x'){
                U = i;
                V = j;
            }
            pre[i][j] = {-1, -1, -1};
        }
    }

    bfs(S, T);
    cout<<d[U][V]<<endl;

    int x, y, p;
    x = U;
    y = V;
    p = pre[U][V].k;

    while(min({x, y, p}) != -1){
        if(a[x][y] != 'x' && a[x][y] != 'o'){
            a[x][y] = dc[p];
        }
        st nxt = pre[x][y];
        x = nxt.i;
        y = nxt.j;
        p = nxt.k;
    }

    for(int i=1; i<=n; ++i){
        for(int j=1; j<=m; ++j){
            cout<<a[i][j];
        }
        cout<<endl;
    }

    //1 0 1 1 
    //1 0 1 1 
    //0 1 1 1 
    //2 2 2 2 

    return 0;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 37212 KB Output is correct
2 Correct 5 ms 37212 KB Output is correct
3 Correct 5 ms 37212 KB Output is correct
4 Correct 5 ms 37212 KB Output is correct
5 Correct 5 ms 35324 KB Output is correct

Subtask #2
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 37212 KB Output is correct
2 Correct 5 ms 37212 KB Output is correct
3 Correct 5 ms 37212 KB Output is correct
4 Correct 5 ms 37212 KB Output is correct
5 Correct 5 ms 35324 KB Output is correct
6 Correct 39 ms 65104 KB Output is correct
7 Correct 54 ms 85596 KB Output is correct
8 Correct 93 ms 93424 KB Output is correct
9 Correct 188 ms 117900 KB Output is correct
10 Correct 227 ms 127828 KB Output is correct
11 Correct 307 ms 149892 KB Output is correct