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"
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
const int N = 1e5 + 2;
void construct_network(int n, int m, int k) {
auto Convert = [&] (int x, int y) {
return x * m + y;
};
for (int i = 0; i < n; i++) {
vector<int> a;
for (int j = 0; j < m; j++) a.push_back(Convert(i, j));
if (!add_or(a)) continue;
int j = -1;
for (int z = 0; z < m; z++) {
if (!add_not(Convert(i, z))) {
j = z;
break;
}
}
a.clear();
for (int r = i; r <= min(n - 1, i + k); r++) {
int u = k - r + i;
if (j - u >= 0) a.push_back(Convert(r, j - u));
if (j + u < m) a.push_back(Convert(r, j + u));
}
add_or(a);
return;
}
}
# | 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... |