20210815 打地鼠,竞赛图,糖果,树

char readc() { char c=getchar(); while(!isdigit(c))c=getchar(); return c; }

const int N = 2e3+5;
int n,k,s[N][N];

int ans;

int query(int a,int b,int c,int d)
	{ return s[c][d] - s[c][b-1] - s[a-1][d] + s[a-1][b-1]; }

signed main() {
//	freopen("a.in","r",stdin);
//	freopen("a.out","w",stdout);
	read(n,k);
	For(i,1,n) For(j,1,n) s[i][j] = s[i-1][j]+s[i][j-1]-s[i-1][j-1]+readc()-'0';
	For(i,1,n-k+1) For(j,1,n-k+1) ckmax(ans,query(i,j,i+k-1,j+k-1));
	write(ans);
	return iocl();
}

const int N = 25;
int T,n,w[N];

int all,to[1<<N];
bool f[1<<N];

void solve() {
	read(n); all = (1<<n--)-1;
	to[0] = all;
	For(i,0,n) {
		w[i] = 0;
		For(j,0,n) { int x; read(x); w[i] |= x<<j; }
		to[1<<i] = w[i];
	}
	For(s,1,all) to[s] = to[s^(s&-s)] & to[s&-s];
	For(s,0,all) f[s] = 1;
	For(s,1,all) if( f[s] && f[s|to[s]] )
		for(int t = to[s]; t; t = (t-1)&to[s]) f[s|t] = 0;
	int ans = 0;
	For(s,0,all) ans += f[s];
	write(ans);
}

signed main() {
	read(T);
	while( T-- ) {
		mem(to,0,all);
		solve();
	}
	return iocl();
}

const int N = 405, mod = 1e9+7;
int n,a[N],b[N];

int m,pa[N],pb[N];
LL ans,f[N][N][N/3],g[N][N][N/3];

signed main() {
	read(n); m = n/3;
	For(i,1,n) read(a[i]), pa[a[i]] = i;
	For(i,1,n) read(b[i]), pb[b[i]] = i;
	f[1][1][0] = 1;
	For(i,1,n) For(j,1,n) For(k,0,m) {
		f[i][j][k] %= mod, g[i][j][k] %= mod;
		if( pb[a[i]] < j ) f[i+1][j][k] += f[i][j][k]; // 不合法：光移不选
		else {
			g[i][j][k] += f[i][j][k]; // 更新第二行
			if( k ) f[i+1][j][k-1] += f[i][j][k] * k;
			// 更新第三行：有k个选择，选后候选集合-1
		}
		if( pa[b[j]] < i ) g[i][j+1][k] += g[i][j][k]; // 类似
		else if( b[j] != a[i] ) {
			if( k ) g[i][j+1][k-1] += g[i][j][k] * k;
			f[i+1][j+1][k+1] += g[i][j][k];
			// 更新下一列：候选集合多了一个数
		}
	}
	For(i,1,n) ans += f[n+1][i][0] % mod; ans %= mod;
	for(int i = n; i; i -= 3) ans = ans * (i-1) * (i-2) %mod;
	/*
	DP 时确定了c中m个数，但没确定顺序和其他数，此处考虑
	对于选的m个数，每次一定放在空位的第一个，其他两个对应的数可以随意放在
	其他空位中，第一次有(n-1)(n-2)个，第二次有(n-4)(n-5)......
	*/
	write(ans);
	return iocl();
}

const int N = 3e5+5;
int n,q;
vector<int> to[N];

int ind,fa[N],dep[N],siz[N],son[N],top[N],dfn[N];

struct Q {
	int sum,lc,rc; 
	Q(int sum=0,int lc=0,int rc=0):sum(sum),lc(lc),rc(rc){}
};
Q operator + (Q l,Q r)
	{ return Q{l.sum+r.sum+(l.rc&&r.lc&&l.rc!=r.lc),l.lc,r.rc}; }

#define ls (u<<1)
#define rs (u<<1|1)
namespace seg {
struct Node { int l,r,cov; Q c; } t[N*4];
void up(int u) { t[u].c = t[ls].c + t[rs].c; }
void down(int u,int x)
	{ t[u].c.lc = t[u].c.rc = t[u].cov = x, t[u].c.sum = 0; }
void down(int u)
	{ if( t[u].cov ) down(ls,t[u].cov), down(rs,t[u].cov), t[u].cov = 0; }
void build(int u,int l,int r) {
	t[u] = Node{l,r,0,Q{r-l,-l,-r}};
	if( l == r ) return;
	int mid = l+r>>1;
	build(ls,l,mid), build(rs,mid+1,r);
}
void modify(int u,int l,int r,int x) {
	if( l <= t[u].l && t[u].r <= r ) return down(u,x), void();
	down(u);
	if( l <= t[ls].r ) modify(ls,l,r,x);
	if( t[rs].l <= r ) modify(rs,l,r,x);
	up(u);
}
Q query(int u,int l,int r) {
	if( l <= t[u].l && t[u].r <= r ) return t[u].c;
	down(u);
	if( r <= t[ls].r ) return query(ls,l,r);
	if( t[rs].l <= l ) return query(rs,l,r);
	return query(ls,l,r) + query(rs,l,r);
}
}
#undef ls
#undef rs

void dfs1(int u,int fa) {
	::fa[u] = fa, dep[u] = dep[fa]+1, siz[u] = 1;
	for(int v : to[u]) if( v != fa ) {
		dfs1(v,u);
		siz[u] += siz[v];
		if( siz[v] > siz[son[u]] ) son[u] = v;
	}
}
void dfs2(int u,int top) {
	::top[u] = top, dfn[u] = ++ind;
	if( son[u] ) dfs2(son[u],top);
	for(int v : to[u]) if( v != fa[u] && v != son[u] ) dfs2(v,v);
}
void modify(int u,int v,int x) {
	while( top[u] != top[v] ) {
		if( dep[top[u]] < dep[top[v]] ) swap(u,v);
		seg::modify(1,dfn[top[u]],dfn[u],x);
		u = fa[top[u]];
	}
	if( dep[u] > dep[v] ) swap(u,v);
	seg::modify(1,dfn[u],dfn[v],x);
}
int query(int u,int v) {
	Q x,y;
	while( top[u] != top[v] ) {
		if( dep[top[u]] < dep[top[v]] ) swap(u,v), swap(x,y);
		x = seg::query(1,dfn[top[u]],dfn[u]) + x;
		u = fa[top[u]];
	}
	if( dep[u] > dep[v] ) swap(u,v), swap(x,y);
	swap(x.lc,x.rc);
	return ((x + seg::query(1,dfn[u],dfn[v])) + y).sum;
}

signed main() {
//	freopen("d.in","r",stdin);
//	freopen("d.out","w",stdout);
	read(n);
	For(i,1,n-1) { int x,y; read(x,y); to[x].pb(y), to[y].pb(x); }
	dfs1(1,0), dfs2(1,1), seg::build(1,1,n);
	read(q);
	For(i,1,q) {
		int op,x,y; read(op,x,y);
		if( op == 1 ) modify(x,y,i);
		else write(query(x,y));
	}
	return iocl();
}