Submission #293684

#TimeUsernameProblemLanguageResultExecution timeMemory
293684evpipisVision Program (IOI19_vision)C++17
12 / 100
2 ms1148 KiB
#include "vision.h" #include <bits/stdc++.h> using namespace std; #define pb push_back int n, m, k, cnt; bool exist(int i, int j){ return (0 <= i && i < n && 0 <= j && j < m); } int match(int i, int j){ return i*m + j; } void construct_network(int H, int W, int K) { n = H, m = W, k = K, cnt = n*m-1; vector<int> fin; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++){ vector<int> temp; for (int x = i, y = j+k; y > j; x++, y--) if (exist(x, y)) temp.pb(match(x, y)); for (int x = i+k, y = j; x > i; x--, y--) if (exist(x, y)) temp.pb(match(x, y)); if (temp.empty()) continue; add_and(temp), ++cnt; add_and({cnt, match(i, j)}); fin.pb(++cnt); } //if (fin.empty()) printf("it is empty\n"); add_or(fin); }
#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...