#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scan1(a) scanf("%lld",&a);
#define scan2(a,b) scanf("%lld %lld",&a, &b);
#define scan3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
const int N = 1e6+12,INF=1e9+7;
int dp[201][201],m,n,k,cnt=0;
vector <char> v;
multiset <vector <char >> ans;
char q[50][50];
void dfs(int x,int y){
if (x == n && m == y){
cnt++;
ans.insert(v);
auto it = ans.end();
it--;
if (ans.size() > k)ans.erase(it);
ret ;
}
if (y+1 <= m){
v.pb(q[x][y+1]);
dfs(x,y+1);
v.pop_back();
}
if (x + 1 <= n){
v.pb(q[x+1][y]);
dfs(x+1,y);
v.pop_back();
}
}
main(){
int i,j;
scan2(n,m)
for (i=1;i<=n;++i){
for (j=1;j<=m;++j){
cin>>q[i][j];
}
}
cin>>k;
v.pb(q[1][1]);
dfs(1,1);
v = *ans.rbegin();
for (i=0;i<v.size();++i){
cout <<v[i];
}
}
Compilation message
kthpath.cpp: In function 'void dfs(long long int, long long int)':
kthpath.cpp:30:24: warning: comparison of integer expressions of different signedness: 'std::multiset<std::vector<char> >::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
30 | if (ans.size() > k)ans.erase(it);
| ~~~~~~~~~~~^~~
kthpath.cpp: At global scope:
kthpath.cpp:46:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
46 | main(){
| ^
kthpath.cpp: In function 'int main()':
kthpath.cpp:59:15: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
59 | for (i=0;i<v.size();++i){
| ~^~~~~~~~~
kthpath.cpp:12:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
12 | #define scan2(a,b) scanf("%lld %lld",&a, &b);
| ~~~~~^~~~~~~~~~~~~~~~~~~~
kthpath.cpp:48:5: note: in expansion of macro 'scan2'
48 | scan2(n,m)
| ^~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Correct |
1 ms |
364 KB |
Output is correct |
| 3 |
Correct |
1 ms |
364 KB |
Output is correct |
| 4 |
Correct |
315 ms |
29548 KB |
Output is correct |
| 5 |
Correct |
1 ms |
364 KB |
Output is correct |
| 6 |
Correct |
207 ms |
8940 KB |
Output is correct |
| 7 |
Execution timed out |
2105 ms |
227540 KB |
Time limit exceeded |
| 8 |
Halted |
0 ms |
0 KB |
- |
