# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
43331 | 2018-03-13T19:31:55 Z | Hassoony | Pohlepko (COCI16_pohlepko) | C++14 | 1000 ms | 25328 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]); 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=0;i<m;i++)cout<<ans[0][i]<<endl; 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]+a[0][j]; continue; } s1=a[i][j]+ans[0][j]; s2=a[i][j]+ans[1][j+1]; ans[1][j]=min(s1,s2); } swap(ans[0],ans[1]); for(int j=0;j<MX;j++)ans[1][j]=""; } cout<<ans[0][0]<<endl; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Incorrect | 15 ms | 1508 KB | Output isn't correct |
3 | Correct | 2 ms | 1508 KB | Output is correct |
4 | Correct | 3 ms | 1508 KB | Output is correct |
5 | Correct | 9 ms | 2240 KB | Output is correct |
6 | Correct | 114 ms | 2892 KB | Output is correct |
7 | Incorrect | 741 ms | 10724 KB | Output isn't correct |
8 | Execution timed out | 1074 ms | 20748 KB | Time limit exceeded |
9 | Incorrect | 5 ms | 20748 KB | Output isn't correct |
10 | Correct | 28 ms | 20748 KB | Output is correct |
11 | Correct | 59 ms | 20748 KB | Output is correct |
12 | Incorrect | 183 ms | 20748 KB | Output isn't correct |
13 | Incorrect | 158 ms | 20748 KB | Output isn't correct |
14 | Execution timed out | 1074 ms | 25328 KB | Time limit exceeded |
15 | Correct | 9 ms | 25328 KB | Output is correct |
16 | Execution timed out | 1014 ms | 25328 KB | Time limit exceeded |