# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1169099 | mnbvcxz123 | Maja (COCI18_maja) | C++20 | 274 ms | 616 KiB |
#include <bits/stdc++.h>
#define mp make_pair
#define X first
#define Y second
#define taskname "Maja"
using namespace std;
typedef long long ll;
typedef pair <int, int> ii;
const int N = 101;
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, 1, 0, -1};
int m, n, k, a, b, c[N][N];
ll dp[2][N][N];
void readInput(){
scanf("%d %d %d %d %d", &m, &n, &a, &b, &k);
for(int i = 1; i <= m; i++)
for(int j = 1; j <= n; j++)
scanf("%d", &c[i][j]);
}
int inside(int x, int y){
return (1 <= x && x <= m && 1 <= y && y <= n);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |