Ruudukko

#include <iostream>
#include <queue>


using namespace std;

struct dij{
    int d;
    int x;
    int y;
    char c;
    int fx;
    int fy;
    bool operator<(dij d2)const{
        if (d!=d2.d) return d>d2.d;
        return c>d2.c;
    }
};

int fromx[511][511];
int fromy[511][511];
int used[511][511];
string m[511];

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin>>n;
    for (int i=0;i<n;i++){
        cin>>m[i];
    }
    priority_queue<dij> bfs;
    dij fd;
    fd.x=0;
    fd.y=0;
    fd.d=0;
    fd.c=m[0][0];
    fd.fx=-1;
    fd.fy=-1;
    bfs.push(fd);
    int gt=0;
    while (!bfs.empty()){
        auto asd=bfs.top();
        bfs.pop();
        //cout<<asd.x<<" "<<asd.y<<" "<<asd.c<<" "<<asd.fx<<" "<<asd.fy<<endl;
        gt++;
        if (used[asd.x][asd.y]==0){
            used[asd.x][asd.y]=1;
            fromx[asd.x][asd.y]=asd.fx;
            fromy[asd.x][asd.y]=asd.fy;
            if (asd.x<n-1) bfs.push({gt, asd.x+1, asd.y, m[asd.x+1][asd.y], asd.x, asd.y});
            if (asd.y<n-1) bfs.push({gt, asd.x, asd.y+1, m[asd.x][asd.y+1], asd.x, asd.y});
        }
    }
    string vs;
    int x=n-1;
    int y=n-1;
    while (x>-1){
        vs+=m[x][y];
        int nx=fromx[x][y];
        int ny=fromy[x][y];
        x=nx;
        y=ny;
    }
    for (int i=vs.size()-1;i>=0;i--){
        cout<<vs[i];
    }
    cout<<endl;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: WRONG ANSWER

Test 8

Group: 2

Verdict: WRONG ANSWER

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 2

Verdict: WRONG ANSWER

Test 11

Group: 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: WRONG ANSWER

Test 13

Group: 3

Verdict: WRONG ANSWER

Test 14

Group: 3

Verdict: WRONG ANSWER

Test 15

Group: 3

Verdict: WRONG ANSWER