#include <bits/stdc++.h>
#include "vision.h"
#define pb push_back
#define ll long long
#define x first
#define y second
using namespace std;
int h,w;
int id(int y, int x)
{
return y*w+x;
}
void construct_network(int H, int W, int k)
{
h=H, w=W;
vector<int> pot;
for(int y=0;y<h;y++)
for(int x=0;x<w;x++)
{
vector<int> ask;
for(int i=0;i<=k && x+i<w;i++)
{
if(y-k+i>=0) ask.pb(id(y-k+i,x+i));
if(y+k-i>=0) ask.pb(id(y+k-i,x+i));
}
if((int)(ask.size())==0) continue;
int A=add_or(ask);
pot.pb(add_and(vector<int>{A,id(y,x)}));
}
add_or(pot);
return;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
5 ms |
256 KB |
WA in grader: Invalid index |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
5 ms |
256 KB |
WA in grader: Invalid index |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
5 ms |
256 KB |
WA in grader: Invalid index |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
5 ms |
256 KB |
WA in grader: Invalid index |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
5 ms |
376 KB |
WA in grader: Invalid index |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
376 KB |
Output is correct |
2 |
Incorrect |
5 ms |
256 KB |
WA in grader: Invalid index |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
7 ms |
1140 KB |
WA in grader: Too many instructions |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
5 ms |
256 KB |
WA in grader: Invalid index |
2 |
Halted |
0 ms |
0 KB |
- |