# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
634417 | nguyentu | Dango Maker (JOI18_dango_maker) | C++14 | 311 ms | 18144 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>
#pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define ii pair<int , int>
#define iv pair<ii , ii>
#define iii pair<int , ii>
#define fi first
#define se second
#define int long long
const int inf = 1e18 + 7;
const int MAX_N = 3e3 + 7;
const int MOD = 1e9 + 7;
// f[i][0] : khong co thang cuoi cung
// f[i][1] : thang cuoi cung duoc su dung la nam hang ngang
// f[i][2] : thang cuoi cung duoc su dung la nam` hang cot
int f[MAX_N][3];
char a[MAX_N][MAX_N];
int n , m;
bool c(int x , int y , char d) {
return (0 <= x && x < n && 0 <= y && y < m && a[x][y] == d);
}
signed main() {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |