class BlackBox {
public:
BlackBox(int n, int m) {
}
int open(int index, int direction) {
}
void close(int index) {
}
};
/**
* Your BlackBox object will be instantiated and called as such:
* BlackBox* obj = new BlackBox(n, m);
* int param_1 = obj->open(index,direction);
* obj->close(index);
*/
type BlackBox struct {
Hole []bool
P []int
N []int
T int
L int
M int
Num int
}
func Constructor(n int, m int) BlackBox {
Box := new(BlackBox)
Box.M = m
Box.Num = n
l := 2*m + 2*n
Box.L = l
Box.Hole = make([]bool, Box.L)
Box.T = 0
Box.P = make([]int, Box.L)
Box.N = make([]int, Box.L)
for i := 0; i < l; i++ {
Box.P[i] = (l - i) % l
Box.N[i] = (m * 2 - i + l) % l
}
return *Box
}
func (this *BlackBox) Open(index int, direction int) int {
if !this.Hole[index] {
this.T ++
this.Hole[index] = true
}
if this.T == 1 {
return index
} else {
for {
if direction == 1 {
index = this.P[index]
} else {
index = this.N[index]
}
direction = -direction
if this.Hole[index] {
break;
}
}
}
return index
}
func (this *BlackBox) Close(index int) {
this.Hole[index] = false
this.T--
}
/**
* Your BlackBox object will be instantiated and called as such:
* obj := Constructor(n, m);
* param_1 := obj.Open(index,direction);
* obj.Close(index);
*/
from sortedcontainers import SortedList
class BlackBox:
def __init__(self, n: int, m: int):
corners, T = {0, m, m + n, m + n + m, m + n + m + n}, m + n + m + n
def getnext(idx, dr):
if dr > 0: nid = T - idx
else: nid = (T - (idx + n) - n) % T
ndr = dr if nid in corners else -dr
return nid, ndr
seen = set()
glen, gid, node_book = [0] * (m + n + m + n), 0, dict()
for cur in product(range(m + n + m + n), (1, -1)):
if cur in seen: continue
while cur not in seen:
seen.add(cur)
node_book[cur] = (gid, glen[gid]); glen[gid] += 1
cur = getnext(*cur)
gid += 1
self.node_book, self.opened_book = node_book, [SortedList() for _ in range(gid)]
def open(self, index: int, dr: int) -> int:
for dr in (-dr, dr):
gid, oid = self.node_book[index, dr]
if (oid, index) not in self.opened_book[gid]:
self.opened_book[gid].add((oid, index))
rid = self.opened_book[gid].bisect_right((oid, index)) % len(self.opened_book[gid])
res = self.opened_book[gid][rid][1]
return res
def close(self, index: int) -> None:
for dr in (1, -1):
gid, oid = self.node_book[index, dr]
self.opened_book[gid].remove((oid, index))
# Your BlackBox object will be instantiated and called as such:
# obj = BlackBox(n, m)
# param_1 = obj.open(index,direction)
# obj.close(index)
public class BlackBox {
boolean[] state;// 存储index下标小洞的打开状态：false表示关闭，true表示打开
int[] clock;// 存储index小洞沿y=x方向将要照射的下一个小洞的index
int[] anticlock;// 存储index小洞沿y=-x方向将要照射的下一个小洞的index
BlackBox(int n, int m) {
int cnt = 2 * (m + n);
state = new boolean[cnt];
clock = new int[cnt];
anticlock = new int[cnt];
for (int index = 0; index < cnt; index++) {
clock[index] = (cnt - index + cnt) % cnt;
anticlock[index] = (2 * m - index + cnt) % cnt;
state[index] = false;
}
}
public int open(int index, int direction) {
int I = index;// 保存起点
state[index] = true;// 打开小洞
// 选择下一个反射点
if (direction == 1)
index = clock[index];
else
index = anticlock[index];
// 改变反射方向
direction *= -1;
// 反射操作尽量不要封装成函数,否则容易超时
while (state[index] == false) {// 若该点是闭合状态,则继续反射
// 如果下一个点是角，则光最终会原路返回起点
if (clock[index] == index || anticlock[index] == index)
return I;
// 选择下一个反射点
if (direction == 1)
index = clock[index];
else
index = anticlock[index];
// 改变反射方向
direction *= -1;
}
return index;// 若该点是打开状态,则从该点射出
}
public void close(int index) {
state[index] = false;
}
};
/**
* Your BlackBox object will be instantiated and called as such:
* BlackBox obj = new BlackBox(n, m);
* int param_1 = obj.open(index,direction);
* obj.close(index);
*/
{:height="200px"}
{:height="200px"}
{:height="200px"}{:height="300px"}