oj.uz

Submission #337901

# Submission time Handle Problem Language Result Execution time Memory
337901 2020-12-22T05:25:23 Z beksultan04 K-th path (IZhO11_kthpath) C++14
0 / 100
 466 ms 262148 KB 
#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;
vector <vector <char >> ans;
char q[50][50];
void dfs(int x,int y){
    if (x == n && m == y){
        cnt++;
        ans.pb(v);
        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);
    sort(all(ans));
    for (i=0;i<ans[k-1].size();++i){
        cout <<ans[k-1][i];
    }
}

Compilation message

kthpath.cpp:43:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   43 | main(){
      |      ^
kthpath.cpp: In function 'int main()':
kthpath.cpp:55:15: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |     for (i=0;i<ans[k-1].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:45:5: note: in expansion of macro 'scan2'
   45 |     scan2(n,m)
      |     ^~~~~

Subtask #1
0 / 100.0

# 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 466 ms 45200 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 442 ms 52220 KB Output is correct
7 Runtime error 443 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
8 Halted 0 ms 0 KB -