#include <bits/stdc++.h>
#pragma GCC optimize ("Ofast")
#pragma GCC target ("avx2")
using namespace std;
class input {
private:
FILE* fin;
const int sz = 10000;
char* buff, c;
int p;
const char stop = char(-51);
char read()
{
if (p == sz)
{
fread(buff, 1, sz, fin);
p = 0;
return buff[p++];
}
else
return buff[p++];
}
bool digit(char c)
{
return c >= '0' && c <= '9';
}
public:
input(const char* name)
{
c = '-';
buff = new char[sz];
p = 0;
fin = fopen(name, "r");
fread(buff, 1, sz, fin);
}
void close()
{
fclose(fin);
}
void open(const char* name)
{
c = '-';
p = sz;
fin = fopen(name, "r");
}
bool eof()
{
int i = p;
while (true)
{
while (i < sz && (buff[i] == ' ' || buff[i] == '\n'))
i++;
if (i != sz)
{
if (buff[i] == stop)
return 1;
return 0;
}
else
{
fread(buff, 1, sz, fin);
p = 0;
i = 0;
}
}
}
input& operator >> (int& n)
{
c = read();
while (c == ' ' || c == '\n')
c = read();
n = 0;
int sng = 1;
if (c == '-')
sng = -1, c = read();
while (digit(c))
n = n * 10 + (c - '0'), c = read();
n *= sng;
return *this;
}
input& operator >> (long long& n)
{
c = read();
while (c == ' ' || c == '\n')
c = read();
n = 0;
int sng = 1;
if (c == '-')
sng = -1, c = read();
while (digit(c))
n = n * 10 + (c - '0'), c = read();
n *= sng;
return *this;
}
input& operator >> (unsigned long long& n)
{
c = read();
while (c == ' ' || c == '\n')
c = read();
n = 0;
int sng = 1;
if (c == '-')
sng = -1, c = read();
while (digit(c))
n = n * 10 + (c - '0'), c = read();
n *= sng;
return *this;
}
input& operator >> (char& ch)
{
c = read();
while (c == ' ' || c == '\n')
c = read();
ch = c;
return *this;
}
input& operator >> (string& n)
{
c = read();
while (c == ' ' || c == '\n')
c = read();
n = "";
while (c != ' ' && c != '\n' && c != '\0')
n += c, c = read();
return *this;
}
input& operator >> (double& n)
{
c = read();
while (c == ' ' || c == '\n')
c = read();
n = 0;
while (digit(c))
n = n * 10 + (c - '0'), c = read();
if (c != '.')
return *this;
c = read();
double p10 = 10;
while (digit(c))
n = n + double(c - '0') / p10, c = read(), p10 *= 10;
return *this;
}
input& operator >> (char* s)
{
c = read();
while (c == ' ' || c == '\n')
c = read();
while (c != ' ' && c != '\n')
*s = c, s++, c = read();
*s = '\0';
return *this;
}
void getline(string& s)
{
s = "";
c = read();
while (c == ' ')
c = read();
while (c != '\n')
s += c, c = read();
}
};
class output {
private:
FILE* fout;
const int sz = 10000;
char* buff;
int p;
void write(char ch)
{
if (p == sz)
{
fwrite(buff, 1, sz, fout);
p = 0;
buff[p++] = ch;
}
else
buff[p++] = ch;
}
public:
output(const char* name)
{
buff = new char[sz];
p = 0;
fout = fopen(name, "w");
}
~output()
{
fwrite(buff, 1, p, fout);
}
output& operator << (int n)
{
if (n < 0)
write('-'), n *= -1;
if (n == 0)
{
write(n + '0');
return *this;
}
if (n / 10 != 0)
*this << (n / 10);
write(('0' + (n % 10)));
return *this;
}
output& operator << (long long n)
{
if (n < 0)
{
write('-');
n *= -1;
}
if (n < 10)
{
write(n + '0');
return *this;
}
*this << (n / 10);
write((n % 10) + '0');
return *this;
}
output& operator << (unsigned long long n)
{
if (n < 0)
{
write('-');
n *= -1;
}
if (n < 10)
{
write(n + '0');
return *this;
}
*this << (n / 10);
write((n % 10) + '0');
return *this;
}
output& operator << (char c)
{
write(c);
return *this;
}
void precision(double n, int x)
{
*this << int(n);
if (!x)
return;
write('.');
n -= int(n);
n *= 10;
for (int i = 1; i <= x; i++)
{
*this << int(n);
n -= int(n);
n *= 10;
}
}
output& operator << (string n)
{
for (auto i : n)
write(i);
return *this;
}
};
ifstream fin("number.in");
ofstream fout("number.out");
typedef pair <int, int> pr;
int k, n, m, a[501][501][9][9], nr;
char c[501][501];
const int inf = 1000000000;
pr go[4][501][501];
int poz[501][501][9][9] = { 0 };
class heap {
private:
int sz;
struct nod {
int i, j;
unsigned l, r;
bool operator < (nod& aux)
{
return a[i][j][l][r] < a[aux.i][aux.j][aux.l][aux.l];
}
};
nod* h;
void up(int k)
{
while (k > 1)
{
int k2 = k / 2;
if (h[k] < h[k2])
{
swap(poz[h[k].i][h[k].j][h[k].l][h[k].r], poz[h[k2].i][h[k2].j][h[k2].l][h[k2].r]);
swap(h[k], h[k2]), k = k2;
}
else
break;
}
}
void down(int k)
{
while (2 * k <= sz)
{
int k2 = 2 * k;
if (h[k2] < h[k])
{
swap(poz[h[k].i][h[k].j][h[k].l][h[k].r], poz[h[k2].i][h[k2].j][h[k2].l][h[k2].r]);
swap(h[k], h[k2]), k = k2;
}
else
break;
}
}
public:
heap()
{
sz = 0;
h = new nod[300001];
}
void add(nod x)
{
sz++;
h[sz] = x;
poz[x.i][x.j][x.l][x.r] = sz;
up(sz);
}
void pop()
{
swap(h[1], h[sz]);
swap(poz[h[1].i][h[1].j][h[1].l][h[1].r], poz[h[sz].i][h[sz].j][h[sz].l][h[sz].r]);
poz[h[sz].i][h[sz].j][h[sz].l][h[sz].r] = 0;
sz--;
down(1);
}
void update(nod x)
{
if (!poz[x.i][x.j][x.l][x.r])
add(x);
else
{
up(poz[x.i][x.j][x.l][x.r]);
down(poz[x.i][x.j][x.l][x.r]);
}
}
nod top()
{
return h[1];
}
bool empty()
{
return sz == 0;
}
};
void afis(pr aux)
{
cout << aux.first << ' ' << aux.second << '\n';
}
// 0 - Up, 1 - Left, 2 - Down, 3 - Right
int d1[] = { -1, 0, 1, 0 };
int d2[] = { 0, 1, 0, -1 };
inline bool in(int& i, int& j)
{
return i >= 1 && i <= n && j >= 1 && j <= m;
}
inline void prev(int& dir)
{
dir--;
if (dir == -1)
dir = 3;
}
inline void next(int& dir)
{
dir++;
if (dir == 4)
dir = 0;
}
pr get(int dir, int i, int j)
{
if (!in(i, j) || c[i][j] == 'x')
{
next(dir);
next(dir);
return { i + d1[dir], j + d2[dir] };
}
if (go[dir][i][j].first)
return go[dir][i][j];
nr++;
int nxDir = dir;
if (c[i][j] == 'A')
prev(nxDir);
else if (c[i][j] == 'C')
next(nxDir);
pr aux = get(nxDir, i + d1[nxDir], j + d2[nxDir]);
go[dir][i][j] = aux;
return aux;
}
inline bool digit(char& c)
{
return c >= '0' && c <= '9';
}
bool update(pr p, int val, int& l, int& r)
{
if (a[p.first][p.second][l][r] > val)
{
a[p.first][p.second][l][r] = val;
return 1;
}
return 0;
}
heap H;
void lee()
{
int l, r, i, j, x, y;
while (!H.empty())
{
nr++;
i = H.top().i;
j = H.top().j;
l = H.top().l;
r = H.top().r;
H.pop();
for (int p = 0; p <= 3; p++)
{
x = go[p][i][j].first;
y = go[p][i][j].second;
if (update({ x, y }, a[i][j][l][r] + 1, l, r))
H.update({ x, y, unsigned(l), unsigned(r)});
}
}
}
int main()
{
int v[5] = {0};
cout << v[6];
return 0;
ios::sync_with_stdio(false);
cin.tie(0);
fin >> k >> m >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
{
for (int l = 0; l < k; l++)
for (int p = 0; p < k; p++)
a[i][j][l][p] = inf;
fin >> c[i][j];
if (digit(c[i][j]))
c[i][j]--;
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
for (int l = 0; l <= 3; l++)
get(l, i, j);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
if (digit(c[i][j]))
{
int aux = (c[i][j] - '0');
update({ i, j }, 0, aux, aux);
H.add({ i, j, unsigned(aux), unsigned(aux) });
}
lee();
for (int l = 2; l <= k; l++)
for (int p = 0; p < k - l + 1; p++)
{
int q = p + l - 1;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
{
for (int t = p; t < q; t++)
update({ i, j }, a[i][j][p][t] + a[i][j][t + 1][q], p, q);
H.add({ i, j, unsigned(p), unsigned(q)});
}
lee();
}
int mini = inf;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
mini = min(mini, a[i][j][0][k - 1]);
if (mini == inf)
cout << -1;
else
cout << mini;
return 0;
}
Compilation message
robots.cpp: In function 'int main()':
robots.cpp:558:14: warning: array subscript 6 is above array bounds of 'int [5]' [-Warray-bounds]
558 | cout << v[6];
| ^
robots.cpp:557:7: note: while referencing 'v'
557 | int v[5] = {0};
| ^
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
