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];
int n, m;
bool in(int i, int j) {
return 0 <= i && i < n && 0 <= j && j < 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;
}
}
vector<int> ans;
for (int i = 0;i < 1;i++) {
for (int j = 0;j < 1;j++) {
vector<int> Q;
int ii = i, jj = j + K;
while (jj != j) {
if (in(ii, jj)) Q.push_back(a[ii][jj]);
ii++;
jj--;
}
while (ii != i) {
if (in(ii, jj)) Q.push_back(a[ii][jj]);
ii--;
jj--;
}
if (!Q.empty()) ans.push_back(add_and({ a[i][j], add_xor(Q) }));
}
}
add_or(ans);
}
# | 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... |