# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
604741 | almothana05 | Flight to the Ford (BOI22_communication) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "vision.h"
#include "bits\stdc++.h"
int row , col;
pair<int ,int>cmp , comp;
vector<int>num , opt , erg;
pair<int , int> trnasf(int x){
return {x % col , x / col};
}
using namspace std;
void construct_network(int H, int W , int K) {
row = H;
col = W;
int menge = row * col , pl = menge;
for(int i = 0 ; i < menge ; i++){
cmp = transf(i);
for(int j = i + 1 ; j < menge ; j++){
comp = transf(j);
if(abs(cmp.first - comp.first) + abs(cmp.second - comp.second) == K){
opt.push_back(j);
}
}
if(opt.size()){
add_or(opt);
pl++;
add_and({i , pl - 1});
num.push_back(pl);
pl++;
}
opt.clear();
}
add_or(num);
}