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