Submission #93941

#	Time	Username	Problem	Language	Result	Execution time	Memory
93941		ahmedie404	Pohlepko (COCI16_pohlepko)	C++14	35 / 80	1084 ms	26224 KiB

pohlepko

#include <iostream>

using namespace std;
int n, m;
string a[2000+9];
bool vis[2000+9][2000+9];

bool check(int i, int j){
    return i >= 0 && j >= 0 && i < n && j < m;
}

string finds(int i, int j, string s){

    string sol="zzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz";
    s += a[i][j];

    if( i == n-1 && j == m-1 )
        return s;


    if(check(i, j+1) && string(s+a[i][j+1]) < string(s+a[i+1][j]) && !vis[i][j+1]){
        sol = min(string(finds(i, j+1, s)), sol);
        vis[i][j+1]=true;
    } else if(check(i+1, j) && string(s+a[i][j+1]) < string(s+a[i+1][j])){
        sol = min(string(finds(i+1, j, s)), sol);
        vis[i][j+1]=true;
    } else{
        if(check(i+1, j) && !vis[i+1][j]){
            sol = min(string(finds(i+1, j, s)), sol);
            vis[i+1][j]=true;
        }
        if(check(i, j+1) && !vis[i][j+1]){
            sol = min(string(finds(i, j+1, s)), sol);
            vis[i][j+1]=true;
        }
    }

    return sol;

}

int main(){
    cin >> n >> m;
    for(int i=0;i<n;i++) cin >> a[i];

    cout << finds(0, 0, "") << endl;

    return 0;
}

• Subtask 1: 35 / 80