이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
void construct_network(int H, int W, int K) {
for(int i = 0; i < H; i++){
for(int j = 0; j < W; j++){
if(add_not(i * W + j)) continue;
vector<int> v;
for(int k = 0; k <= K; k++){
int x = i + k, y = j + K - k;
if(x < 0 || x >= H || y < 0 || y >= W) continue;
v.push_back(x * W + y);
x = i + k, y = j - (K - k);
if(x < 0 || x >= H || y < 0 || y >= W) continue;
v.push_back(x * W + y);
x = i - k, y = j + K - k;
if(x < 0 || x >= H || y < 0 || y >= W) continue;
v.push_back(x * W + y);
x = i - k, y = j - (K - k);
if(x < 0 || x >= H || y < 0 || y >= W) continue;
v.push_back(x * W + y);
}
if(add_or(v)) return;
}
}
}
# | 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... |