#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int dist(ll a, ll b,int W){
return abs(a%W-b%W) + abs(a/W-b/W);
}
void construct_network(int H, int W, int K) {
vector<int> Ns;
ll it = 0;
vector<bool> vis(H*W);
for(int i = 0; i < W*H-1; i++){
Ns.push_back(i);
vis[i] = 1;
for(int j = 0; j < W*H; j++){
if(dist(i, j, W) == K && !vis[j]){
Ns.push_back(j);
}
}
add_or(Ns);
add_xor(Ns);
add_not(i);
Ns.clear();
it+=3;
}
cerr << it << " ";
for(int i = H*W; i < H*W+it; i++) Ns.push_back(i);
if(!Ns.empty()) add_xor(Ns);
else add_or({0, 1});
}
# |
Verdict |
Execution time |
Memory |
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 |
- |
# |
Verdict |
Execution time |
Memory |
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 |
- |
# |
Verdict |
Execution time |
Memory |
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 |
- |
# |
Verdict |
Execution time |
Memory |
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 |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
340 KB |
on inputs (0, 0), (0, 198), expected 0, but computed 1 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
300 KB |
on inputs (0, 0), (0, 1), expected 1, but computed 0 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1093 ms |
712 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
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 |
- |