QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#361604	#6305. Chinese Checker	Zxc200611^#	AC ✓	38ms	3756kb	C++14	2.7kb	2024-03-23 11:56:36	2024-03-23 11:56:37

Judging History

你现在查看的是最新测评结果

[2024-03-23 11:56:37]
评测

测评结果：AC
用时：38ms
内存：3756kb

查看

[2024-03-23 11:56:36]
提交

answer

/*
跳棋棋盘上有一些跳棋，可以选一个跳棋 x 跳若干步，对每个跳棋求出它能跳到棋盘上哪些位置。
*/
#include<bits/stdc++.h>
using namespace std;
// map 17*17
const int mpl=17;
pair<int,int> mph[]={
	{0 ,-1},
	{13,13},{12,13},{11,13},{10,13},
	{5 ,17},{5 ,16},{5 ,15},{5 ,14},{5 ,13},
	{4 ,13},{3 ,13},{2 ,13},{1 ,13},
	{5 ,8 },{5 ,7 },{5 ,6 },{5 ,5 }
};
struct Edge
{
	int ex,ey;
	int ty;
};
int mp[20][20];
int n;
const int dir[3][2]={{1,0},{0,1},{1,-1}};
vector<Edge> t[20][20];
int vis[20][20];
pair<int,int> transform(int px,int py)
{
	if(px>= 5&&px<= 9) py-=(9-px);
	if(px>=14&&px<=17) py+=(px-9);
	return make_pair(5+px-py,4+py);
}
int dfs(int x,int y)
{
	int res=1;
	vis[x][y]=1;
	for(Edge e:t[x][y])
	{
		if(vis[e.ex][e.ey])
			continue;
		res+=dfs(e.ex,e.ey);
	}
	return res;
}
int calc(int sx,int sy)
{
	for(int i=1;i<=mpl;i++)
	{
		for(int j=1;j<=mpl;j++)
		{
			t[i][j].clear();
			vis[i][j]=0;
		}
	}
	for(int i=1;i<=mpl;i++)
	{
		for(int j=1;j<=mpl;j++)
		{
			if(mp[i][j]!=1||(i==sx&&j==sy))
				continue;
			for(int d=0;d<3;d++)
			{
				int ux=i,uy=j,vx=i,vy=j;
				for(int k=1;k<=mpl;k++)
				{
					ux-=dir[d][0],uy-=dir[d][1];
					if(ux<1||ux>mpl||uy<1||uy>mpl||mp[ux][uy]==-1)
						break;
					vx+=dir[d][0],vy+=dir[d][1];
					if(vx<1||vx>mpl||vy<1||vy>mpl||mp[vx][vy]==-1)
						break;
					if(mp[ux][uy]==0) t[vx][vy].push_back((Edge){ux,uy,mp[vx][vy]});
					                //   cout<<"("<<vx<<","<<vy<<") -> ("<<ux<<","<<uy<<") ty="<<mp[vx][vy]<<endl;
					if(mp[vx][vy]==0) t[ux][uy].push_back((Edge){vx,vy,mp[ux][uy]});
					                //   cout<<"("<<ux<<","<<uy<<") -> ("<<vx<<","<<vy<<") ty="<<mp[ux][uy]<<endl;
					if((mp[ux][uy]-(ux==sx&&uy==sy))||(mp[vx][vy]-(vx==sx&&vy==sy)))
						break;
				}
			}
		}
	}
	return dfs(sx,sy)-1;
}
int main()
{
	int T;
	cin>>T;
	for(int _=1;_<=T;_++)
	{
		for(int i=1;i<=mpl;i++)
		{
			for(int j=1;j<=mpl;j++)
				mp[i][j]=-1;
		}
		for(int i=1;i<=mpl;i++)
		{
			for(int j=mph[i].first;j<=mph[i].second;j++)
				mp[i][j]=0;
		}
		cin>>n;
		for(int i=1;i<=n;i++)
		{
			int x,y;
			cin>>x>>y;
			pair<int,int> p=transform(x,y);
			// cout<<x<<" "<<y<<" -> "<<p.first<<" "<<p.second<<endl;
			mp[p.first][p.second]=1;
		}
		// for(int i=1;i<=mpl;i++)
		// {
		// 	for(int j=1;j<=mpl;j++)
		// 		cout<<("#.O"[mp[i][j]+1])<<" ";
		// 	cout<<endl;
		// }
		int ans=0;
		for(int i=1;i<=mpl;i++)
		{
			for(int j=1;j<=mpl;j++)
			{
				if(mp[i][j]==1)
				{
					int res=calc(i,j);
					// cout<<"("<<i<<","<<j<<") : "<<res<<endl;
					ans+=res;
				}
			}
		}
		cout<<ans<<'\n';
	}
}
/*
2
9 4
9 6

1
5
11 4
9 4
10 3
14 2
7 7
*/

源文件, 语言: C++14

详细

Test #1:

score: 100

Accepted

time: 0ms

memory: 3748kb

input:

output:

result:

ok 5 number(s): "0 1 2 6 13"

Test #2:

score: 0

Accepted

time: 17ms

memory: 3744kb

input:

output:

result:

ok 100 numbers

Test #3:

score: 0

Accepted

time: 18ms

memory: 3684kb

input:

output:

result:

ok 100 numbers

Test #4:

score: 0

Accepted

time: 18ms

memory: 3756kb

input:

output:

result:

ok 100 numbers

Test #5:

score: 0

Accepted

time: 19ms

memory: 3696kb

input:

output:

result:

ok 100 numbers

Test #6:

score: 0

Accepted

time: 17ms

memory: 3704kb

input:

output:

result:

ok 100 numbers

Test #7:

score: 0

Accepted

time: 14ms

memory: 3704kb

input:

output:

result:

ok 100 numbers

Test #8:

score: 0

Accepted

time: 15ms

memory: 3684kb

input:

output:

result:

ok 100 numbers

Test #9:

score: 0

Accepted

time: 17ms

memory: 3744kb

input:

output:

result:

ok 100 numbers

Test #10:

score: 0

Accepted

time: 38ms

memory: 3628kb

input:

output:

result:

ok 100 numbers