#include<bits/stdc++.h>
#include "vision.h"
using namespace std ;
void construct_network(int n, int m, int k)
{
if(k == 1)
{
int ls_or = n * m ;
for(int x1 = 0 ; x1 < n ; x1++)
for(int y1 = 0 ; y1 < m ; y1++)
{
set<int> s ;
vector<int> v ;
for(int q = -k ; q <= k ; q++)
{
int x2 = x1 + q, y2 = y1 + k - abs(q), y3 = y1 - k + abs(q) ;
if(x2 < n && y2 < m && x2 >= 0 && y2 >= 0)
s.insert(x2 * m + y2) ;
if(x2 < n && y3 < m && x2 >= 0 && y3 >= 0)
s.insert(x2 * m + y3) ;
}
if(s.size())
{
for(int i : s)
v.push_back(i) ;
add_or(v) ;
v.clear() ;
v.push_back(ls_or) ;
v.push_back(x1 * m + y1) ;
if(add_and(v))
return ;
ls_or += 2 ;
}
}
return ;
}
int ls_or = n * m ;
for(int x1 = 0 ; x1 < n ; x1++)
for(int y1 = 0 ; y1 < m ; y1++)
{
vector<int> v ;
for(int q = -k ; q <= k ; q++)
{
int x2 = x1 + q, y2 = y1 + k - abs(q) ;
if(x2 < n && y2 < m && x2 >= 0 && y2 >= 0)
v.push_back(x2 * m + y2) ;
}
if(v.size())
{
add_or(v) ;
v.clear() ;
v.push_back(ls_or) ;
v.push_back(x1 * m + y1) ;
add_and(v) ;
ls_or += 2 ;
}
}
vector<int> abu ;
for(int i = n * m + 1 ; i < ls_or ; i += 2)
abu.push_back(i) ;
add_or(abu) ;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
on inputs (0, 1), (0, 2), expected 1, but computed 0 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
on inputs (0, 1), (0, 2), expected 1, but computed 0 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
on inputs (0, 1), (0, 2), expected 1, but computed 0 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
on inputs (0, 1), (0, 2), expected 1, but computed 0 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
on inputs (0, 1), (0, 2), expected 1, but computed 0 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
8 ms |
1232 KB |
Output is correct |
5 |
Correct |
6 ms |
976 KB |
Output is correct |
6 |
Correct |
3 ms |
596 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
0 ms |
212 KB |
Output is correct |
9 |
Incorrect |
3 ms |
1616 KB |
WA in grader: Too many instructions |
10 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
on inputs (80, 199), (81, 199), expected 1, but computed 0 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
on inputs (0, 1), (0, 2), expected 1, but computed 0 |
2 |
Halted |
0 ms |
0 KB |
- |