Submission #388876

#TimeUsernameProblemLanguageResultExecution timeMemory
388876SuhaibSawalha1Vision Program (IOI19_vision)C++17
41 / 100
918 ms1252 KiB
#include "vision.h" #include <bits/stdc++.h> using namespace std; int dist (array<int, 2> a, array<int, 2> b) { return abs(a[0] - b[0]) + abs(a[1] - b[1]); } void construct_network(int n, int m, int k) { auto val = [&] (int i, int j) { return i * m + j; }; vector<int> OR; int cur = n * m; int q = 1e4 - 1; for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { for (int h = i; h < n; ++h) { for (int w = (i == h ? j : 0); w < m; ++w) { if (dist({i, j}, {h, w}) == k && q) { --q; add_and({val(i, j), val(h, w)}); OR.push_back(cur++); } } } } } 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...