【EB2 2015年六月第92绿】TSC EB2->EB3 PD 2011.12 RD 2014.2 - 未名空间MITBBS历史存档

国际科技财经博客移民网络热点娱乐民生时事公众号

Redian新闻

>未名空间

>EB23 - 劳工卡

【EB2 2015年六月第92绿】TSC EB2->EB3 PD 2011.12 RD 2014.2

【EB2 2015年六月第92绿】TSC EB2->EB3 PD 2011.12 RD 2014.2# EB23 - 劳工卡

z*22015-06-25 07:06

1 楼

8 -1 4
3 -1 -1
5 2 2
total region =2，一個是 83522. 另一個是4，
-1就是當一個分隔區域的 separator
如何最快就出一個 given 2d matrix 有多少個 regions? DFS? run time = ???
謝謝

j*a2015-06-25 07:06

2 楼

forgot to kiss Liza flower and yoyo, if his wife doesn't complain:)
Lisa shared the best RFE EVL info with me although I didn't got EVL RFE.
Yoyo is the generator of downgrade. I can't think of any board member that
is so helpful on this mitbbs!
your card has been ordered for both principle applicant and spouse.
PD 2011,12
RD 2014,2
EB2-EB3
EAD approved 2nd time Mar 2015 for 2 years
relink at 5/1/15 but didn't work until I found my lovely congressman
secretary. She followed up and found me still in EB3 category.
then send my EB2 I-140 to her liaison. Then they replied to her say ok we
can approve her visa number.
RFE for medical 6/3/15
RFE material received and showed on website 6/11/15
anxiously waiting for the card production since 6/1/15
contacted congrassman twice but she didn't heard back from TSC liaison.
she emailed TSC directly today just to make sure. Then got greened in the
afternoon!
What a lovely congrassman secretory!
filed so many SRs about 5 or 6...out of normal processing time!
timeline已加在downgrade那一tab

u*g2015-06-25 07:06

3 楼

你要最快的话可能是disjoint set吧。。？

n*h2015-06-25 07:06

4 楼

gxgx

r*h2015-06-25 07:06

5 楼

我的想法是，首先从任意一个非separator的点开始，做dfs分离出一个region。途中将
所有遇到的separator送进一个队列。然后每次从队列里面送出一个separator，遍历和
他相邻的还未被访问的其他region，或者将和他相邻的还未入过队列的separator入队
。直到队列变成空。
总时间复杂度是matrix的元素个数。

【在 z***2 的大作中提到】

: 8 -1 4
: 3 -1 -1
: 5 2 2
: total region =2，一個是 83522. 另一個是4，
: -1就是當一個分隔區域的 separator
: 如何最快就出一個 given 2d matrix 有多少個 regions? DFS? run time = ???
: 謝謝

L*M2015-06-25 07:06

6 楼

恭喜恭喜

f*t2015-06-25 07:06

7 楼

这样？O(n)，n是matrix元素数目
void dfs(hash_set&s, vector>& matrix,int row,int col)
{
int dir[4][2] = {{1,0},{-1,0},{0,1},{0,-1}};
s.insert(row*matrix[0].size()+col);
for(int i=0;i<4;i++)
{
int newRow = row+dir[i][0],newCol = col+dir[i][1];
if(newRow>=0&&newnewCol>=0&&newColmatrix[newRow][newCol]!=-1)
dfs(s,matrix,newRow,newCol);
}
}
int regionNum(vector>& matrix)
{
//special case return
hash_set s;
int region = 0;
for(int i=0;ifor(int j=0;jif(s.find(i*matrix[0].size()+j)!=s.end()&&matrix[i][j]!=-1)
{
dfs(s,matrix,i,j);
region++;
}
return region;
}

P*12015-06-25 07:06

8 楼

cong

r*h2015-06-25 07:06

9 楼

是哦。。。直接找未遍历的分区中某一点就行
我想复杂了。。

【在 f******t 的大作中提到】

: 这样？O(n)，n是matrix元素数目
: void dfs(hash_set&s, vector>& matrix,int row,int col)
: {
: int dir[4][2] = {{1,0},{-1,0},{0,1},{0,-1}};
: s.insert(row*matrix[0].size()+col);
: for(int i=0;i<4;i++)
: {
: int newRow = row+dir[i][0],newCol = col+dir[i][1];
: if(newRow>=0&&new: newCol>=0&&newCol

x*u2015-06-25 07:06

10 楼

cong!zhan!

【在 j*******a 的大作中提到】

: forgot to kiss Liza flower and yoyo, if his wife doesn't complain:)
: Lisa shared the best RFE EVL info with me although I didn't got EVL RFE.
: Yoyo is the generator of downgrade. I can't think of any board member that
: is so helpful on this mitbbs!
: your card has been ordered for both principle applicant and spouse.
: PD 2011,12
: RD 2014,2
: EB2-EB3
: EAD approved 2nd time Mar 2015 for 2 years
: relink at 5/1/15 but didn't work until I found my lovely congressman