# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
75155 | bogdan10bos | Dango Maker (JOI18_dango_maker) | C++14 | 416 ms | 113424 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;
//#define FILE_IO
int N, M, ans;
char a[3005][3005];
int dp[3005][3][3];
int main()
{
#ifdef FILE_IO
freopen("1.in", "r", stdin);
freopen("1.out", "w", stdout);
#endif
scanf("%d%d\n", &N, &M);
for(int i = 1; i <= N; i++)
scanf("%s", a[i] + 1);
for(int l = 4; l <= N + M; l++)
{
int st = max(1, l - M);
for(int i = 1; i <= N; i++)
for(int j = 0; j < 3; j++)
for(int k = 0; k < 3; k++)
dp[i][j][k] = 0;
int mx = 0;
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... |