Submission #390628

#TimeUsernameProblemLanguageResultExecution timeMemory
390628SuhaibSawalha1Vision Program (IOI19_vision)C++17
14 / 100
17 ms1228 KiB
#include "vision.h" #include <bits/stdc++.h> using namespace std; void construct_network(int n, int m, int k) { vector<int> OR; if (k == 1) { vector<int> row(n), col(m); for (int i = 0; i < n; ++i) { vector<int> p; for (int j = 0; j < m; ++j) { p.push_back(i * m + j); } row[i] = add_or(p); } for (int j = 0; j < m; ++j) { vector<int> p; for (int i = 0; i < n; ++i) { p.push_back(i * m + j); } col[j] = add_or(p); } int xor_for_rows = add_xor(row), xor_for_cols = add_xor(col); for (int i = 1; i < n; ++i) { OR.push_back(add_and({row[i - 1], row[i], xor_for_cols})); } for (int i = 1; i < m; ++i) { OR.push_back(add_and({col[i - 1], col[i], xor_for_rows})); } } else { int q = 1e4 - 1; for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { vector<int> ask; for (int r = k; ~r; --r) { for (int dj : {j + k - r, j - k + r}) { if (i + r < n && dj < m && dj > -1) { ask.push_back((i + r) * m + dj); } } } if (ask.size() && q > 1) { q -= 2; OR.push_back(add_and({i * m + j, add_xor(ask)})); } } } } add_or(OR); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...