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