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 pb push_back
const int N=205;
int h,w,k,a[N][N];
int Get(int i,int j){return a[i][j];}
void SolveBF(){
int tmp=0;
for(int i=0;i<h;i++)for(int j=0;j<w;j++)a[i][j]=tmp++;
vector<int> ask;
int cnt=h*w;
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
for(int x=i;x<h;x++){
for(int y=j;y<w;y++){
int dist=abs(x-i)+abs(y-j);
if(dist!=k)continue;
add_and({Get(i,j),Get(x,y)});
ask.pb(cnt);
cnt++;
}
}
}
}
if((int)ask.size()==0){
add_not(1);
return;
}
add_or(ask);
}
void construct_network(int H,int W,int K){
h=H,w=W,k=K;
if(max(H,W)<=30){
SolveBF();
return;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |