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