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