This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
void construct_network(int H, int W, int K) {
// at most 10 000 instructions
// at most 1 000 000 input
auto cell = [&](int x,int y) -> int {
return x*W+y;
};
vector<int> que;
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
vector<int> q;
for(int x=0;x<=K;x++){
int a = x,b = K-x;
if(i+a < H && j+b < W){
int ni = i+a, nj = j+b;
q.push_back(cell(ni,nj));
}
if(i+a < H && j-b >= 0){
int ni = i+a, nj = j-b;
q.push_back(cell(ni,nj));
}
}
if(q.size() > 0){
int nxt = add_or(q);
que.push_back(add_and({cell(i,j),nxt}));
}
}
}
add_or(que);
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |