This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "vision.h"
using namespace std;
int H, W, K;
set <pair <int, int>> mp;
int id(int x, int y) {
return x * W + y;
}
void construct_network(int h, int w, int k) {
H = h, W = w, K = k;
vector <int> vec;
for(int i = 0; i < H; i++) {
for(int j = 0; j < W; j++) {
for(int k = 0; k < H; k++) {
int l = K - abs(i - k);
if(l < 0 or l >= W) {
continue;
}
int a = id(i, j), b = id(k, l);
if(!mp.count(make_pair(a, b))) {
mp.insert(make_pair(a, b));
mp.insert(make_pair(b, a));
vec.push_back(add_and(vector <int> ({a, b})));
}
}
}
}
add_or(vec);
}
# | 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... |