oj.uz

답안 #17856

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
17856 2016-01-12T14:02:24 Z Elibay K번째 경로 (IZhO11_kthpath) C++14
0 / 100
 0 ms 2256 KB 
#include <bits/stdc++.h>

using namespace std;
const int MaxN = 30 + 17, INF = 1e9;
long long d[MaxN][MaxN], n, m, q;

char a[MaxN][MaxN];
vector < string > g[MaxN][MaxN];
int main ()
{
    ios_base :: sync_with_stdio (0);
    #ifdef Elibay
        freopen (".in", "r", stdin);
    #endif
    cin >> n >> m;
    for (int i = 1; i <= n; ++ i)
        for (int j = 1; j <= m; ++ j)
            cin >> a[i][j];
    cin >> q;
    string w = "" + a[1][1];
    g[1][1].push_back (w);
    for (int i = 1; i <= n; ++ i)
    {
        for (int j = 1; j <= m; ++ j)
        {
            if (i - 1 >= 1)
            {
                for (int k = 0; k < g[i - 1][j].size(); ++ k)
                    g[i][j].push_back (g[i - 1][j][k] + a[i][j]);    
            } 
            if (j - 1 >= 1)
            {
                for (int k = 0; k < g[i][j - 1].size(); ++ k)
                    g[i][j].push_back (g[i][j - 1][k] + a[i][j]);    
            } 
        }
    }
    -- q;
    sort (g[n][m].begin (), g[n][m].end ());
    cout << a[1][1] + g[n][m][q];
    return 0;
}

Compilation message

kthpath.cpp: In function 'int main()':
kthpath.cpp:28:35: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for (int k = 0; k < g[i - 1][j].size(); ++ k)
                                   ^
kthpath.cpp:33:35: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for (int k = 0; k < g[i][j - 1].size(); ++ k)
                                   ^

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 2256 KB Output isn't correct
2 Halted 0 ms 0 KB -