# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1127638 | ALTAKEXE | Robots (APIO13_robots) | C++17 | 25 ms | 19012 KiB |
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
const int INF = 1e9;
const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};
vector<string> s(500);
bool vis[500][500][4];
vector<int> v[250000];
vector<int> ind;
tuple<int, int, int> p[500][500][4];
pair<int, int> st[500][500][4];
vector<int> c1(500, INF), c2(500, INF);
queue<pair<int, int>> q;
vector<bool> ok(500, 0);
int n, w, h;
void next()
{
for (int i = 0; i < h; i++)
for (int j = 0; j < w; j++)
for (int k = 0; k < 4; k++)
p[i][j][k] = {-1, -1, -1};
for (int i = 0; i < h; i++)
for (int j = 0; j < w; j++)
for (int k = 0; k < 4; k++)
{
auto &[x, y, t] = p[i][j][k];
if (k == 0)
{
if (i == 0)
# | 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... |