oj.uz

Submission #768806

# Submission time Handle Problem Language Result Execution time Memory
768806 2023-06-28T16:24:51 Z 1075508020060209tc Patkice II (COCI21_patkice2) C++14
15 / 110
 2000 ms 37436 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define X first
#define Y second
int n;int m;
int ok(int i,int j){
if(i>=1&&i<=n&&j>=1&&j<=m){return 1;}
return 0;
}
int dir[5]={0,1,0,-1,0};
char dc[5]={'!','>','v','<','^'};
string gr[2010];
int dis[2010][2010];
signed main(){
cin.tie(0);
ios_base::sync_with_stdio(0);

cin>>n>>m;
for(int i=1;i<=n;i++){
    cin>>gr[i];
    gr[i]="*"+gr[i];
}
deque<pair<int,int>>q;
for(int i=1;i<=n;i++){
    for(int j=1;j<=m;j++){
        dis[i][j]=1e9;
        if(gr[i][j]=='o'){
            q.push_back({i,j});
            dis[i][j]=0;
        }
    }
}
while(q.size()){
    int nwx=q.front().first;
    int nwy=q.front().second;
    q.pop_front();
    if(gr[nwx][nwy]=='o'){
        for(int i=1;i<=4;i++){
            int x=nwx+dir[i-1];
            int y=nwy+dir[i];
            if(!ok(x,y)||dis[x][y]<=dis[nwx][nwy]){continue;}
            dis[x][y]=0;
            q.push_front({x,y});
        }
        continue;
    }
    for(int i=1;i<=4;i++){
        int x=nwx+dir[i-1];
        int y=nwy+dir[i];
        int w=dis[nwx][nwy];
        if(gr[nwx][nwy]!=dc[i]){
            w++;
        }
        if(!ok(x,y)||dis[x][y]<=w){continue;}
        if(gr[x][y]==dc[i]){
            dis[x][y]=w;
            q.push_front({x,y});
        }else{
            dis[x][y]=w;
            q.push_back({x,y});
        }
    }
}
/*
for(int i=1;i<=n;i++){
    for(int j=1;j<=m;j++){
        cout<<dis[i][j]<<" ";
    }cout<<endl;
}
*/
for(int i=1;i<=n;i++){
    for(int j=1;j<=m;j++){
        if(gr[i][j]=='x'){
            cout<<dis[i][j]<<endl;
        }
    }
}
for(int i=1;i<=n;i++){
    for(int j=1;j<=m;j++){
        cout<<gr[i][j];
    }cout<<endl;
}



}

Subtask #1
15.0 / 30.0

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

Subtask #2
0.0 / 80.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 340 KB Partially correct
2 Partially correct 0 ms 340 KB Partially correct
3 Partially correct 0 ms 340 KB Partially correct
4 Partially correct 1 ms 340 KB Partially correct
5 Partially correct 0 ms 340 KB Partially correct
6 Partially correct 407 ms 8488 KB Partially correct
7 Partially correct 75 ms 12736 KB Partially correct
8 Partially correct 1776 ms 19264 KB Partially correct
9 Partially correct 264 ms 37436 KB Partially correct
10 Execution timed out 2053 ms 34316 KB Time limit exceeded
11 Halted 0 ms 0 KB -