oj.uz

답안 #338199

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
338199 2020-12-22T16:56:59 Z beksultan04 K번째 경로 (IZhO11_kthpath) C++14
100 / 100
 2 ms 364 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+11,INF=1e9+7;
int n,dp[31][33],m;
string ans = "";
char p[33][33];
int rec(int x,int y){
    int j = x+y;
    if (ans[j] != p[x][y] && ans[j]!='*')ret 0;
    if (x == n-1 && m-1 == y)ret 1;
    if (dp[x][y] != -1)ret dp[x][y];
    int res = 0;

    if (x+1 < n){
        res += rec(x+1,y);
    }
    if (y+1<m){
        res += rec(x,y+1);
    }



    ret dp[x][y]=res;

}

main(){
    int i,j,k;
    scan2(n,m)
    int len = n+m-1;
    for (i=0;i<n;++i){
        for (j=0;j<m;++j){
            cin>>p[i][j];
        }
    }
    for (i=0;i<len;++i)ans+='*';
    cin>>k;
    ans[0] = p[0][0];
    for (i=1;i<len;++i){
        for (j=0;j<26;++j){
            ans[i] = j+'a';
            memset(dp,-1,sizeof dp);
            int x = rec(0,0);
            if (x >= k)break;
            k-=x;
        }
    }
    cout <<ans;
}

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: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
100.0 / 100.0

# 결과 실행 시간 메모리 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 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 2 ms 364 KB Output is correct
19 Correct 2 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct