# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
86228 | MatesV13 | Pohlepko (COCI16_pohlepko) | C++11 | 83 ms | 66560 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>
using namespace std;
long long n, m;
string word, unos[2000][2000], iznos[2000][2000];
int main (){
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m;
for (int i=0;i<n;i++){
cin >> word;
for(int j=0;j<m;j++){
unos[i][j] = word[j];
}
}
iznos[0][0] = unos[0][0];
for (int i=0;i<n;i++){
for (int j=0;j<m;j++){
if (i==0 && j==0) continue;
else if (i==0) iznos[0][j] = iznos[0][j-1] + unos[0][j];
else if (j==0) iznos[i][0] = iznos[i-1][0] + unos[i][0];
else{
if (iznos[i-1][j] < iznos[i][j-1]) iznos[i][j] = iznos[i-1][j] + unos[i][j];
else iznos[i][j] = iznos[i][j-1] + unos[i][j];
}
}
}
cout << iznos[n-1][m-1];
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |