# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
499020 | PoPularPlusPlus | Pohlepko (COCI16_pohlepko) | C++17 | 244 ms | 11980 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;
int main() {
// your code goes here
int n , m;
cin >> n >> m;
char arr[n][m];
for(int i = 0; i < n; i++){
for(int j = 0; j < m; j++)cin >> arr[i][j];
}
bool vis[n][m];
memset(vis,0,sizeof vis);
vis[0][0] = 1;
if(n > 1)vis[1][0] = 1;
if(m > 1)vis[0][1] = 1;
for(int di = 1; di < n + m; di++){
char mn = 'z';
for(int j = 0; j <= min(di , m - 1); j++){
if(di - j >= n){
continue;
}
int i = di - j;
if(vis[i][j]){
mn = min(mn , arr[i][j]);
}
}
for(int j = 0; j <= min(di , m - 1); j++){
if(di - j >= n){
continue;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |