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 "vision.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fr first
#define sc second
#define mp make_pair
#define all(x) x.begin(),x.end()
void construct_network(int n, int m, int k) {
// std::vector<int> Ns;
// Ns = {0, 1};
// int a = add_and(Ns);
// Ns = {0, a};
// int b = add_or(Ns);
// Ns = {0, 1, b};
// int c = add_xor(Ns);
// add_not(c);
vector<pair<int,int>> wtf = {{1,1},{1,-1},{-1,1},{-1,-1}};
int last = n*m-1;
// for(int i = 0; i < n; i++) {
// for(int j = 0; j < m; j++) {
// for(int ii = 0; ii < n; ii++) {
// for(int jj = 0; jj < m; jj++) {
// if(abs(i-ii)+abs(j-jj) == k && i*m+j < ii*m+jj) {
// last = add_and(vector<int>{i*m+j,ii*m+jj});
// }
// }
// }
// }
// }
for(int i = 0; i < n; i++) {
for(int j = 0; j < m; j++) {
for(int d1 = 0; d1 <= k; d1++) {
for(auto X : wtf) {
int ii = i+d1*X.fr;
int jj = j+(k-d1)*X.sc;
if(ii >= 0 && ii < n && jj >= 0 && jj < m && i*m+j < ii*m+jj) {
last = add_and(vector<int>{i*m+j,ii*m+jj});
}
}
}
}
}
vector<int> vec;
for(int i = n*m; i <= last; i++) vec.pb(i);
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... |