#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pull;
typedef pair<int, int> pii;
typedef pair<ld, ld> pld;
int n, m;
char a[2009][2009];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
//freopen("in.txt", "r", stdin);
//freopen("out.txt", "w", stdout);
cin >> n >> m;
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= m; ++j)
cin >> a[i][j];
vector<pii> cur = {{1, 1}};
string s;
s.pb(a[1][1]);
while(1){
vector<pii> nxt[30];
for(auto u : cur){
if(u == mp(n, m))
goto END;
if(u.ff+1 <= n)
nxt[a[u.ff+1][u.ss]-'a'].pb({u.ff+1, u.ss});
if(u.ss+1 <= m)
nxt[a[u.ff][u.ss+1]-'a'].pb({u.ff, u.ss+1});
}
for(int i = 0; i < 'z'-'a'; ++i){
if(nxt[i].size() > 0){
cur = nxt[i];
s.pb((char)(i+'a'));
break;
}
}
}
END:;
cout << s << "\n";
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
3 ms |
1272 KB |
Output is correct |
3 |
Correct |
2 ms |
376 KB |
Output is correct |
4 |
Correct |
2 ms |
376 KB |
Output is correct |
5 |
Correct |
3 ms |
376 KB |
Output is correct |
6 |
Correct |
7 ms |
1244 KB |
Output is correct |
7 |
Correct |
28 ms |
4344 KB |
Output is correct |
8 |
Correct |
66 ms |
8184 KB |
Output is correct |
9 |
Correct |
3 ms |
508 KB |
Output is correct |
10 |
Correct |
8 ms |
888 KB |
Output is correct |
11 |
Correct |
12 ms |
760 KB |
Output is correct |
12 |
Correct |
11 ms |
2680 KB |
Output is correct |
13 |
Correct |
11 ms |
4476 KB |
Output is correct |
14 |
Execution timed out |
1064 ms |
24872 KB |
Time limit exceeded |
15 |
Runtime error |
205 ms |
65540 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
16 |
Runtime error |
223 ms |
65536 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |