답안 #43337

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
43337 2018-03-13T19:39:40 Z Hassoony Pohlepko (COCI16_pohlepko) C++14
65 / 80
1000 ms 14424 KB
#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
const int MX=2009;
int n,m;
char a[MX][MX];
string ans[2][MX],s1,s2;
int main(){
    scanf("%d%d",&n,&m);
    for(int i=0;i<n;i++)scanf("%s",&a[i]);
    if(m==1){
        for(int i=0;i<n;i++)s1+=a[i][0];
        cout<<s1<<endl;
        return 0;
    }
    if(n==1){
        for(int i=0;i<m;i++)s1+=a[0][i];
        cout<<s1<<endl;
        return 0;
    }
    ans[0][m-1]=a[n-1][m-1];
    for(int i=m-2;i>=0;i--)ans[0][i]=a[n-1][i]+ans[0][i+1];
    for(int i=n-2;i>=0;i--){
        for(int j=m-1;j>=0;j--){
            if(j==m-1){
                ans[1][j]=a[i][j]+ans[0][j];
                continue;
            }
            ans[1][j]=min(a[i][j]+ans[0][j],a[i][j]+ans[1][j+1]);
        }
        for(int j=0;j<m;j++)ans[0][j]=ans[1][j],ans[1][j]="";
    }
    cout<<ans[0][0]<<endl;
}

Compilation message

pohlepko.cpp: In function 'int main()':
pohlepko.cpp:11:41: warning: format '%s' expects argument of type 'char*', but argument 2 has type 'char (*)[2009]' [-Wformat=]
     for(int i=0;i<n;i++)scanf("%s",&a[i]);
                                         ^
pohlepko.cpp:10:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&n,&m);
                        ^
pohlepko.cpp:11:42: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i=0;i<n;i++)scanf("%s",&a[i]);
                                          ^
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 1504 KB Output is correct
3 Correct 2 ms 1504 KB Output is correct
4 Correct 2 ms 1504 KB Output is correct
5 Correct 6 ms 2164 KB Output is correct
6 Correct 118 ms 2548 KB Output is correct
7 Correct 828 ms 8860 KB Output is correct
8 Execution timed out 1067 ms 14368 KB Time limit exceeded
9 Correct 3 ms 14368 KB Output is correct
10 Correct 24 ms 14368 KB Output is correct
11 Correct 67 ms 14368 KB Output is correct
12 Correct 219 ms 14368 KB Output is correct
13 Correct 108 ms 14368 KB Output is correct
14 Execution timed out 1071 ms 14424 KB Time limit exceeded
15 Correct 6 ms 14424 KB Output is correct
16 Execution timed out 1080 ms 14424 KB Time limit exceeded