# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
59559 | zadrga | Dango Maker (JOI18_dango_maker) | C++14 | 1202 ms | 123924 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.
/*
Idea:
- http://codeforces.com/blog/entry/57637?#comment-413356 (Problem 3)
*/
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF (1 << 30)
#define MOD (1000 * 1000 * 1000 + 7)
#define maxn 3111
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pii;
char str[maxn][maxn];
int dp[maxn][maxn][3];
int n, m;
bool can(int x, int y, char c){
if(x < 1 || x > n || y < 1 || y > m)
return 0;
return (str[x][y] == c);
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... |