#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
int h, w, k;
int cw;
int pnt(int x, int y)
{
return x + (y * w);
}
int has2(vi v)
{
return add_and({ add_or(v), add_not(add_xor(v)) });
} // 4 puertas
int hasmultiple(vi v)
{
int res = add_xor({ 0, 0 });
int prev = v[0];
for (int i = 1; i < v.size(); i++) {
res = add_or({ res, add_and({ prev, v[i] }) });
prev = add_or({ prev, v[i] });
}
return res;
}
void construct_network(int H, int W, int K)
{
h = H;
w = W;
k = K;
vi d1;
for (int d = -200; d < 200; d++) {
vi th;
for (int i = 0; i < w; i++)
for (int j = 0; j < h; j++)
if (abs(i - j + d) <= k)
th.push_back(pnt(i, j));
if (th.size())
d1.push_back(has2(th));
}
vi d2;
for (int d = -200; d < 200; d++) {
vi th;
for (int i = 0; i < w; i++)
for (int j = 0; j < h; j++)
if (abs(j - i + d) <= k)
th.push_back(pnt(i, j));
if (th.size())
d2.push_back(has2(th));
}
vi d3;
for (int d = -200; d < 200; d++) {
vi th;
for (int i = 0; i < w; i++)
for (int j = 0; j < h; j++)
if (abs(i - j + d) < k)
th.push_back(pnt(i, j));
if (th.size())
d3.push_back(has2(th));
}
vi d4;
for (int d = -200; d < 200; d++) {
vi th;
for (int i = 0; i < w; i++)
for (int j = 0; j < h; j++)
if (abs(j - i + d) < k)
th.push_back(pnt(i, j));
if (th.size())
d4.push_back(has2(th));
}
int tc = add_and({ add_or(d3), add_or(d4) });
int nf = add_and({ add_or(d1), add_or(d2) });
add_and({ nf, add_not(tc) });
}
Compilation message
vision.cpp: In function 'int hasmultiple(vi)':
vision.cpp:24:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
24 | for (int i = 1; i < v.size(); i++) {
| ~~^~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
on inputs (0, 0), (0, 2), expected 0, but computed 1 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
on inputs (0, 0), (0, 2), expected 0, but computed 1 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
on inputs (0, 0), (0, 2), expected 0, but computed 1 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
on inputs (0, 0), (0, 2), expected 0, but computed 1 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
468 KB |
on inputs (0, 0), (0, 2), expected 0, but computed 1 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Incorrect |
1 ms |
212 KB |
on inputs (0, 0), (1, 1), expected 1, but computed 0 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
126 ms |
7004 KB |
on inputs (126, 120), (176, 169), expected 0, but computed 1 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
on inputs (0, 0), (0, 2), expected 0, but computed 1 |
2 |
Halted |
0 ms |
0 KB |
- |