Submission #723970

#TimeUsernameProblemLanguageResultExecution timeMemory
723970GrandTiger1729Vision Program (IOI19_vision)C++17
0 / 100
1 ms296 KiB
#include "vision.h" #ifndef EVAL #include "grader.cpp" #endif #include <bits/stdc++.h> using namespace std; void construct_network(int n, int m, int K){ auto valid = [&](int i, int j) -> bool { return 0 <= i && i < n && 0 <= j && j < m; }; auto idx = [&](int i, int j) -> int { return i * m + j; }; vector<int> res; for (int k = 0; k <= K; k++){ if (k != 0 && valid(K - k, k)){ res.push_back(add_and({idx(0, 0), idx(K - k, k)})); } } add_or(res); }
#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...