# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1053453 | elazarkoren | Toy (CEOI24_toy) | C++17 | 6 ms | 13148 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>
#include <ext/pb_ds/assoc_container.hpp>
#define x first
#define y second
#define all(v) v.begin(), v.end()
#define chkmin(a, b) a = min(a, b)
#define chkmax(a, b) a = max(a, b)
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef pair<ll, ll> pii;
typedef vector<pii> vii;
typedef vector<bool> vb;
typedef vector<vb> vvb;
const int MAX_N = 1505;
int dx[] = {0, 0, -1, 1}, dy[] = {1, -1, 0, 0};
int dp_u[MAX_N][MAX_N], dp_d[MAX_N][MAX_N], dp_l[MAX_N][MAX_N], dp_r[MAX_N][MAX_N];
int n, m, k, l;
bool Check(int x, int y, int nx, int ny) {
if (x == nx) {
int u = max(dp_u[x][y], dp_u[nx][ny]);
int d = min(dp_d[x][y], dp_d[nx][ny]);
return d - u + 1 >= k;
}
int le = max(dp_l[x][y], dp_l[nx][ny]);
int r = min(dp_r[x][y], dp_r[nx][ny]);
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |