# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
602751 | 2022-07-23T10:59:58 Z | misteg168 | Vision Program (IOI19_vision) | C++17 | 0 ms | 0 KB |
#include "vision.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; ll dist(ll a, ll b,int W){ return abs(a%W-b%W) + abs(a/W-b/W); } void construct_network(int H, int W, int K) { vector<int> Ns; ll it = 0; for(int i = 0; i < W*H; i++){ for(int j = 0; j < W*H; j++){ if(dist(i, j, W) == k) add_and({i, j}), it++; } } for(int i = H*W; i < H*W+it; i++) NS.push_back(i); add_or(NS); }