제출 #1048423

#제출 시각아이디문제언어결과실행 시간메모리
1048423TahirAliyevVision Program (IOI19_vision)C++17
0 / 100
1 ms984 KiB
#include "vision.h" #include <bits/stdc++.h> using namespace std; void construct_network(int H, int W, int K) { for(int i = 0; i < H; i++){ for(int j = 0; j < W; j++){ if(add_not(i * W + j)) continue; vector<int> v; for(int k = 0; k <= K; k++){ int x = i + k, y = j + K - k; if(x < 0 || x >= H || y < 0 || y >= W) continue; v.push_back(x * W + y); x = i + k, y = j - (K - k); if(x < 0 || x >= H || y < 0 || y >= W) continue; v.push_back(x * W + y); x = i - k, y = j + K - k; if(x < 0 || x >= H || y < 0 || y >= W) continue; v.push_back(x * W + y); x = i - k, y = j - (K - k); if(x < 0 || x >= H || y < 0 || y >= W) continue; v.push_back(x * W + y); } if(add_or(v)) 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...