#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 210;
vector <int> resp;
vector <int> col[MAXN], ln[MAXN];
int d0c, d0l;
int idc[MAXN], idl[MAXN];
int d1l, d1c;
void construct_network(int h, int w, int k) {
for(int i = 0; i < h; i++) {
for(int j = 0; j < w; j++) {
int id = i * w + j;
col[j].push_back(id);
ln[i].push_back(id);
}
}
for(int i = 0; i < h; i++) idl[i] = add_or(ln[i]);
for(int i = 0; i < w; i++) idc[i] = add_or(col[i]);
vector <int> cl, l;
for(int i = 0; i < h; i++) l.push_back(idl[i]);
for(int i = 0; i < w; i++) cl.push_back(idc[i]);
d0c = add_xor(cl); d0l = add_xor(l);
cl.clear(); l.clear();
for(int i = 0; i < h - 1; i++) {
vector <int> t;
t.push_back(idl[i]); t.push_back(idl[i + 1]);
l.push_back(add_and(t));
}
d1l = add_or(l);
for(int i = 0; i < w - 1; i++) {
vector <int> t;
t.push_back(idc[i]); t.push_back(idc[i + 1]);
cl.push_back(add_and(t));
}
d1c = add_or(cl);
vector <int> t, t1, t2;
t1.push_back(d0c); t1.push_back(d1l);
t2.push_back(d1c); t2.push_back(d0l);
t.push_back(add_and(t1)); t.push_back(add_and(t2));
add_or(t);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
204 KB |
WA in grader: Instruction with no inputs |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
204 KB |
WA in grader: Instruction with no inputs |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
204 KB |
WA in grader: Instruction with no inputs |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
204 KB |
WA in grader: Instruction with no inputs |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
332 KB |
WA in grader: Instruction with no inputs |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Incorrect |
1 ms |
208 KB |
on inputs (0, 0), (0, 1), expected 0, but computed 1 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
10 ms |
1512 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
2 ms |
308 KB |
Output is correct |
4 |
Correct |
3 ms |
432 KB |
Output is correct |
5 |
Incorrect |
1 ms |
332 KB |
WA in grader: Instruction with no inputs |
6 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
204 KB |
WA in grader: Instruction with no inputs |
2 |
Halted |
0 ms |
0 KB |
- |