# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
62226 | kingpig9 | Dango Maker (JOI18_dango_maker) | C++11 | 201 ms | 113084 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;
typedef long long ll;
typedef pair<int, int> pii;
const int MAXN = 3010;
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
#define fillchar(a, s) memset((a), (s), sizeof(a))
void setmax (int &a, int b) {
if (a < b) {
a = b;
}
}
int N, M;
char S[MAXN][MAXN];
int dp[MAXN][3]; //0: none. 1: vert. 2: horiz.
int main() {
//The biggest hint: GO BY DIAGONALS not by horizontal/vertical.
scanf("%d %d", &N, &M);
for (int i = 1; i <= N; i++) {
scanf("%s", S[i] + 1);
}
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... |