제출 #723841

#제출 시각아이디문제언어결과실행 시간메모리
723841GrandTiger1729Vision Program (IOI19_vision)C++17
12 / 100
1 ms976 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 idx = [&](int i, int j) -> int { return i * m + j; }; int cur = n * m; for (int i = 0; i < n; i++) for (int j = 0; j < m - K; j++){ add_and({idx(i, j), idx(i, j + K)}); cur++; } for (int i = 0; i < n - K; i++) for (int j = 0; j < m; j++){ add_and({idx(i + K, j), idx(i, j)}); cur++; } vector<int> res; for (int i = n * m; i < cur; i++) res.push_back(i); 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...