#include "vision.h"
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
//#define int long long
#define pii pair<int,int>
#define vi vector<int>
#define ff first
#define ss second
#define sp << " " <<
#define all(x) x.begin(),x.end()
#define big(x) ((int)(x.size()))
using namespace std;
const int MOD = 1e9+7, LIM = 1e6+1, inf = 2e9;
void construct_network(int H, int W, int K) {
auto pixel = [&](int x,int y) {
return x*W+y;
};
vi rows;
for (int i = 0;i<H;i++) {
vi v;
for (int j = 0;j<W;j++) v.push_back(pixel(i,j));
rows.push_back(add_xor(v));
}
int any1 = add_or(rows);
vi cols;
for (int i = 0;i<W;i++) {
vi v;
for (int j = 0;j<H;j++) v.push_back(pixel(j,i));
cols.push_back(add_xor(v));
}
int any2 = add_or(cols);
vi try1,try2;
for (int i = 0;i<H-1;i++) {
try1.push_back(add_and({rows[i],rows[i+1]}));
}
for (int i = 0;i<W-1;i++) {
try2.push_back(add_and({cols[i],cols[i+1]}));
}
add_and({add_xor({any1,any2}),add_or({add_or(try1),add_or(try2)})});
}
# | 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... |