Submission #580679

#TimeUsernameProblemLanguageResultExecution timeMemory
580679georgievskiyVision Program (IOI19_vision)C++17
0 / 100
0 ms212 KiB
#include "vision.h" #include <bits/stdc++.h> using namespace std; #define pii pair<int,int> void construct_network(int n, int m, int k) { int p = 0; vector<pii> link; for (int i = 0; i < 1; i++) { for (int j = 0; j < 1; j++) { vector<int> o; for (int t = 0; t <= k; t++) { int i1 = i + t, j1 = j - (k - t); int i2 = i1, j2 = j + (k - t); if (i1 < n && j1 >= 0) o.push_back(i1 * m + j1); if (i2 < n && j2 < m && t > 0 && t < k) o.push_back(i2 * m + j2); } if (o.size()) { //cout << i << ' ' << j << " : "; //for (auto x : o) // cout << x << ' '; //cout << '\n'; link.push_back({i * m + j, p + n * m}); add_or(o); p++; } } } for (auto t : link) { add_and(vector<int>({t.first, t.second})); // cout << t.first << ' ' << t.second << '\n'; } vector<int> fin; for (int ind = n * m + p; ind < n * m + 2 * p; ind++) { fin.push_back(ind); } add_or(fin); return; }
#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...