# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1125459 | ALTAKEXE | Robots (APIO13_robots) | C++17 | 433 ms | 142472 KiB |
#include <bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define INF INT_MAX
#define FOR(i, b) for (int i = 0; i < (b); i++)
#define FAR(i, a, b) for (int i = (a); i >= (b); i--)
#define all(x) (x.begin(), x.end())
const int MOD = 1e9 + 7;
using namespace std;
const int MV = 502 * 502;
const int ME = 502 * 502 * 4 * 2;
struct point
{
point() {}
point(int x, int y) : x(x), y(y) {}
int x, y;
int value() { return 500 * (x - 1) + y; }
} inp[10]; // robots
int n, w, h;
int xx[4] = {-1, 0, 1, 0}, yy[4] = {0, 1, 0, -1};
char ch[510][510];
bool wall[510][510];
bool m_check[4][510][510];
bool A[510][510], C[510][510];
bool p[MV];
int Q[MV][2];
short b_check[MV];
int Dp[9][9][502][502];
typedef pair<int, int> P;
# | 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... |