oj.uz

답안 #963205

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
963205 2024-04-14T17:44:19 Z biank K번째 경로 (IZhO11_kthpath) C++14
100 / 100
 2 ms 604 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 30;

using ll = long long;

ll dp[MAX_N][MAX_N][2];
char g[MAX_N][MAX_N];

ll ways(int n, int m, string &s) {
    memset(dp, 0, sizeof dp);
    dp[0][0][g[0][0] != s[0]] = 1;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (i != 0) {
                dp[i][j][1] += dp[i - 1][j][1];
                if (g[i][j] <= s[i + j]) {
                    dp[i][j][g[i][j] != s[i + j]] += dp[i - 1][j][0];
                }
            }
            if (j != 0) {
                dp[i][j][1] += dp[i][j - 1][1];
                if (g[i][j] <= s[i + j]) {
                    dp[i][j][g[i][j] != s[i + j]] += dp[i][j - 1][0];
                }
            }
        }
    }
    return dp[n - 1][m - 1][0] + dp[n - 1][m - 1][1];
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    
    int n, m;
    cin >> n >> m;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            cin >> g[i][j];
        }
    }
    ll k;
    cin >> k;
    
    string ans{g[0][0]};
    for (int i = 0; i < n + m - 2; i++) {
        int lo = -1, hi = 25;
        while (lo + 1 < hi) {
            int mid = (lo + hi) / 2;
            string s = ans + char('a' + mid);
            s.resize(n + m - 1, 'z');
            if (ways(n, m, s) >= k) {
                hi = mid;
            } else {
                lo = mid;
            }
        }
        ans += char('a' + hi);
    }
    cout << ans << '\n';
    
    return 0;
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 464 KB Output is correct
7 Correct 1 ms 456 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 2 ms 456 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 2 ms 344 KB Output is correct
20 Correct 2 ms 344 KB Output is correct