제출 #1246840

#제출 시각아이디문제언어결과실행 시간메모리
1246840gunnsteinnVision Program (IOI19_vision)C++20
29 / 100
1 ms332 KiB
#include <bits/stdc++.h> #include "vision.h" using namespace std; using int_t = int64_t; bool is_in_range(int_t x, int_t y, int_t h, int_t w) { return (0 <= x && x < h && 0 <= y && y < w); } void construct_network(int h, int w, int k) { vector<int> final_instruction; int_t valid_count = 0; for (int i = 0; i < h; i++) { for (int j = 0; j < w; j++) { for (int x = 0; x <= k; x++) { if (is_in_range(i + x, j + (k - x), h, w)) { valid_count++; final_instruction.push_back(add_and({w * i + j, w * (i + x) + (j + (k - x))})); } if (is_in_range(i - x, j + (k - x), h, w)) { valid_count++; final_instruction.push_back(add_and({w * i + j, w * (i - x) + (j + (k - x))})); } } if (max(h, w) > 10) { add_or(final_instruction); return; } } } add_or(final_instruction); }
#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...