# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
982318 | irmuun | Vision Program (IOI19_vision) | 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<bits/stdc++.h>
#include "vision.h"
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()
void construct_network(int H,int W,int K){
vector<array<int,3>>C;
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
C.pb({i,j,i*W+j});
}
}
int cur=H*W;
vector<int>Ns;
for(int i=0;i<C.size();i++){
vector<int>ask;
for(int j=0;j<C.size();j++){
if(abs(C[i][0]-C[j][0])+abs(C[i][1]-C[j][1])==K){
Ns.pb(C[j][2]);
}
}
if(!ask.empty()){
add_or(ask);
add_and({cur,C[i]});
Ns.pb(cur+1);
cur+=2;
}
}
add_or(Ns);
}