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