# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
243457 | N1NT3NDO | Pohlepko (COCI16_pohlepko) | C++14 | 67 ms | 65540 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define pb push_back
using namespace std;
int n,m;
int main()
{
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> n >> m;
char c[n][m];
string dp[n][m];
for(short i=0;i<n;i++)
for(short j=0;j<m;j++) cin >> c[i][j];
dp[0][0]=c[0][0];
for(short i=0;i<n;i++)
for(short j=0;j<m;j++)
if (i-1>=0 && j-1>=0)
dp[i][j]=min(dp[i-1][j],dp[i][j-1])+c[i][j];
else if (i-1>=0 && j-1<0) dp[i][j]=dp[i-1][j]+c[i][j];
else if (i-1<0 && j-1>=0) dp[i][j]=dp[i][j-1]+c[i][j];
cout << dp[n-1][m-1];
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |