# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1167900 | CrabCNH | Dango Maker (JOI18_dango_maker) | C++20 | 171 ms | 35820 KiB |
#include <bits/stdc++.h>
#define task "BriantheCrab"
#define int long long
#define pii pair <int, int>
#define fi first
#define se second
#define szf sizeof
#define sz(s) (int)((s).size())
using namespace std;
template <class T> void mini (T &t, T f) {if (t > f) t = f;}
template <class T> void maxi (T &t, T f) {if (t < f) t = f;}
const int maxN = 3e3 + 5;
const int inf = 1e18 + 7;
const int mod = 1e9 + 7;
int n, m;
char a[maxN][maxN];
bool visited[maxN][maxN];
bool t1[maxN][maxN], t2[maxN][maxN];;
vector <pair <bool, bool>> all;
int dp[maxN][3];
bool isValid (int x, int y) {
return (x >= 1 && y >= 1 && x <= n && y <= m);
}
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... |