# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1104361 | ALTAKEXE | Robots (APIO13_robots) | C++17 | 1 ms | 4432 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>
#define ll long long
#define ff first
#define ss second
#define inf INT_MAX
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FAR(i, a, b) for (int i = (a); i >= (b); i--)
#define all(x) (x.begin(), x.end())
using namespace std;
const int MAXN = 505;
const int INF = 1e18;
pair<int, int> nx[MAXN][MAXN][4];
int dis[MAXN][MAXN][10];
int N, W, H, cnt;
char A[MAXN][MAXN];
pair<int, int> robots[10];
int main()
{
cin >> N >> W >> H;
for (int i = 1; i <= H; ++i)
for (int j = 1; j <= W; ++j)
{
cin >> A[i][j];
if ('0' < A[i][j] && A[i][j] <= '9')
robots[A[i][j] - '1'] = make_pair(i, j), ++cnt;
}
for (int i = 1; i <= H; ++i)
{
nx[i][W + 1][0] = make_pair(i, W);
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... |