# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
986429 | thinknoexit | Vision Program (IOI19_vision) | C++17 | 0 ms | 0 KiB |
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;
using ll = long long;
int a[202][202], r[202], c[202];
int n, m;
void construct_network(int H, int W, int K) {
n = H, m = W;
for (int i = 0;i < n;i++) {
for (int j = 0;j < m;j++) {
a[i][j] = i * m + j;
}
}
for (int i = 0;i < n;i++) {
vector<int> Q;
for (int j = 0;j < m;j++) Q.push_back(a[i][j]);
r[i] = add_xor(Q);
}
for (int j = 0;j < m;j++) {
vector<int> Q;
for (int i = 0;i < n;i++) Q.push_back(a[i][j]);
c[j] = add_xor(Q);
}
int same_rol = 0, same_col = 0;
{
vector<int> Q;
for (int i = 0;i < n;i++) Q.push_back(r[i]);
same_rol = add_not(add_or(Q));
}
{
vector<int> Q;
for (int i = 0;i < m;i++) Q.push_back(c[i]);
same_col = add_not(add_or(Q));
}
int adj_rol = 0, adj_col = 0;
{
vector<int> Q;
for (int i = 0;i < n - 1;i++) Q.push_back(add_and({ r[i], r[i + 1] }));
adj_rol = add_or(Q);
}
{
vector<int> Q;
for (int i = 0;i < m - 1;i++) Q.push_back(add_and({ c[i], c[i + 1] }));
adj_col = add_or(Q);
}
add_or({ add_xor(same_rol, adj_col), add_xor(same_col, adj_rol) });
}