#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
int h,w,k;
int get_pos(int x,int y){
return x*w + y;
}
void construct_network(int H, int W, int K) {
h = H;
w = W;
k = K;
map<int,int> row,col;
int cnt = h*w;
add_not(0);
cnt++;
add_or({0,cnt-1});
int pos_1 = cnt++;
for(int i = 0;i<h;i++){
vector<int> v;
for(int j = 0;j<w;j++){
v.push_back(get_pos(i,j));
}
add_or(v);
row[i] = cnt++;
}
for(int i = 0;i<w;i++){
vector<int> v;
for(int j = 0;j<h;j++){
v.push_back(get_pos(j,i));
}
add_or(v);
col[i] = cnt++;
}
map<int,int> row_dif,col_dif;
for(int i = h-1;i>0;i--){
vector<int> candidates;
set<int> s;
for(int j = 0;j<h;j++){
if(j + i < h){
s.insert(j);
}
}
while(s.size()){
vector<int> ask1;
int num = *s.begin();
ask1.push_back(row[num]);
ask1.push_back(row[num + i]);
s.erase(num);
add_and(ask1);
candidates.push_back(cnt++);
}
add_or(candidates);
int now = cnt++;
if(i != h-1){
candidates.clear();
for(int j = i + 1;j<h;j++){
candidates.push_back(row_dif[j]);
}
add_or(candidates);
int highers = cnt++;
add_not(highers);
int not_highers = cnt++;
candidates = {now,not_highers};
add_and(candidates);
row_dif[i] = cnt++;
}
else{
row_dif[i] = now;
}
}
vector<int> tmp;
for(int i = 1;i<h;i++){
tmp.push_back(row_dif[i]);
}
if(h > 1){
add_or(tmp);
int ps = cnt++;
add_not({ps});
row_dif[0] = cnt++;
}
else{
add_or({pos_1});
row_dif[0] = cnt++;
}
for(int i = w-1;i>0;i--){
vector<int> candidates;
set<int> s;
for(int j = 0;j<w;j++){
if(j + i < w){
s.insert(j);
}
}
while(s.size()){
vector<int> ask1;
int num = *s.begin();
ask1.push_back(col[num]);
ask1.push_back(col[num + i]);
s.erase(num);
add_and(ask1);
candidates.push_back(cnt++);
}
add_or(candidates);
int now = cnt++;
if(i != w-1){
candidates.clear();
for(int j = i + 1;j<w;j++){
candidates.push_back(row_dif[j]);
}
add_or(candidates);
int highers = cnt++;
add_not(highers);
int not_highers = cnt++;
candidates = {now,not_highers};
add_and(candidates);
col_dif[i] = cnt++;
}
else{
col_dif[i] = now;
}
}
tmp.clear();
for(int i = 1;i<w;i++){
tmp.push_back(col_dif[i]);
}
if(w > 1){
add_or(tmp);
int ps = cnt++;
add_not({ps});
col_dif[0] = cnt++;
}
else{
add_or({pos_1});
col_dif[0] = cnt++;
}
vector<int> candidates;
for(int i = 0;i<=min(h-1,k);i++){
if(0 <= k-i && k-i < w){
add_and({row_dif[i],col_dif[k-i]});
candidates.push_back(cnt++);
}
}
add_or(candidates);
int answer = cnt++;
}
Compilation message
vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:145:6: warning: unused variable 'answer' [-Wunused-variable]
145 | int answer = cnt++;
| ^~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
on inputs (0, 0), (0, 1), expected 1, but computed 0 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
on inputs (0, 0), (0, 1), expected 1, but computed 0 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
on inputs (0, 0), (0, 1), expected 1, but computed 0 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
on inputs (0, 0), (0, 1), expected 1, but computed 0 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
4 ms |
1104 KB |
WA in grader: Too many instructions |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
6 ms |
928 KB |
Output is correct |
| 4 |
Incorrect |
6 ms |
904 KB |
on inputs (0, 0), (27, 4), expected 1, but computed 0 |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
4 ms |
1360 KB |
WA in grader: Too many instructions |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
on inputs (0, 0), (0, 1), expected 1, but computed 0 |
| 2 |
Halted |
0 ms |
0 KB |
- |
