Submission #648443

#TimeUsernameProblemLanguageResultExecution timeMemory
648443stevancvVision Program (IOI19_vision)C++14
0 / 100
1 ms212 KiB
#include <bits/stdc++.h> #include "vision.h" #define ll long long #define ld long double #define sp ' ' #define en '\n' #define smin(a, b) a = min(a, b) #define smax(a, b) a = max(a, b) using namespace std; const int N = 1e5 + 2; void construct_network(int n, int m, int k) { auto Convert = [&] (int x, int y) { return x * m + y; }; for (int i = 0; i < n; i++) { vector<int> a; for (int j = 0; j < m; j++) a.push_back(Convert(i, j)); if (!add_or(a)) continue; int j = -1; for (int z = 0; z < m; z++) { if (!add_not(Convert(i, z))) { j = z; break; } } a.clear(); for (int r = i; r <= min(n - 1, i + k); r++) { int u = k - r + i; if (j - u >= 0) a.push_back(Convert(r, j - u)); if (j + u < m) a.push_back(Convert(r, j + u)); } add_or(a); 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...