QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#364166	#8056. Travel 2	ucup-team2219^#	AC ✓	168ms	5952kb	C++14	1.5kb	2024-03-24 12:40:59	2024-04-08 15:39:48

Judging History

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

[2024-04-08 15:39:48]
管理员手动重测该提交记录

测评结果：AC
用时：168ms
内存：5952kb

查看

[2024-03-24 12:41:00]
评测

测评结果：100
用时：135ms
内存：5956kb

查看

[2024-03-24 12:40:59]
提交

answer

#include<bits/stdc++.h>
using namespace std;
struct edg
{
	int x,y;
	edg(int nx=0,int ny=0){x=nx;y=ny;}
	bool operator<(const edg&z)const
	{
		if(x!=z.x)return x<z.x;
		return y<z.y;
	}
};
int T,n,m;
int tot[2505];
int d[2505];
int f[2505],fp[2505],fr[2505];
int vis[2505];
int vr[2505],tt,ttt;
set<edg>st;
set<edg>::iterator it;
void init()
{
	for(int i=0;i<=n+1;i++)tot[i]=vr[i]=d[i]=f[i]=fp[i]=vis[i]=fr[i]=0;
	st.clear();	
}
void dfs(int p)
{
	if(tot[p]>=d[p])
	{
		vr[p]=1;
		if(fr[p]==0)return;
		printf("> %d\n",fr[p]);
		fflush(stdout);
		scanf("%d%d",&tt,&ttt);
		dfs(f[p]);
		return;
	}
	int v,dd;
	printf("> %d\n",++tot[p]);
	fflush(stdout);
	scanf("%d %d",&v,&dd);
	st.insert(edg(min(v,p),max(v,p)));
	if(v==f[p])
	{
		fr[p]=tot[p];
		if(tot[p]<d[p])
		{
			printf("> %d\n",fp[p]);
			fflush(stdout);
			scanf("%d%d",&tt,&ttt);
			dfs(p);
			return;
		}
		else
		{
			vr[p]=1;
			dfs(v);
			return;
		}
	}
	if(vis[v])
	{
		
		dfs(v);
		return;
	}
	vis[v]=1;
	n++;
	d[v]=dd;
	f[v]=p;
	fp[v]=tot[p];
	//ex.push_back(p);
	//ey.push_back(v);
	dfs(v);
	return;
}
char s[10];
int main()
{
	scanf("%d",&T);
	while(T--)
	{
		n=0;//scanf("%d%d",&n,&m);
		int x,dd;
		scanf("%d%d",&x,&dd);
		d[x]=dd;
		vis[x]=1;
		n++;
		dfs(x);
		printf("!");
		//assert(st.size()==m);
		for(it=st.begin();it!=st.end();it++)printf(" %d %d",(*it).x,(*it).y);
		printf("\n");
		fflush(stdout);
		scanf("%s",s);
		//assert(s[0]=='C');
		init();
	}
	return 0;
}

源文件, 语言: C++14

详细

Test #1:

score: 100

Accepted

time: 1ms

memory: 3904kb

input:

output:

> 1
> 1
! 1 2
> 1
> 1
> 1
> 2
> 1
> 2
> 1
> 3
> 2
> 1
! 1 2 1 3 1 4 2 4

result:

ok correct! (2 test cases)

Test #2:

score: 0

Accepted

time: 119ms

memory: 3796kb

input:

output:

> 1
> 1
> 1
> 2
> 1
> 2
> 2
> 1
> 3
> 2
> 2
> 3
> 1
> 4
> 1
> 4
> 2
> 1
> 5
> 1
> 5
> 2
> 3
> 1
> 6
> 2
> 3
> 3
> 2
> 2
> 3
> 2
> 3
> 3
> 4
> 1
> 7
> 5
> 4
> 3
> 2
> 3
> 3
> 4
> 4
> 3
> 4
> 4
> 5
> 4
> 5
> 4
> 2
> 5
> 6
> 5
> 6
> 6
> 6
> 7
> 7
> 6
> 8
> 5
> 9
> 7
> 4
> 5
> 7
> 6
> 5
> 4
> 6
> 7
> 8
...

result:

ok correct! (1000 test cases)

Test #3:

score: 0

Accepted

time: 128ms

memory: 3872kb

input:

output:

> 1
> 1
> 1
> 2
> 1
> 2
> 1
> 2
> 2
> 1
> 3
> 1
> 3
> 2
> 3
> 1
> 4
> 1
> 4
> 2
> 1
> 5
> 1
> 5
> 2
> 3
> 3
> 2
> 2
> 3
> 4
> 2
> 3
> 3
> 1
> 6
> 2
> 2
> 3
> 1
> 7
> 2
> 3
> 3
> 1
> 8
> 1
> 8
> 2
> 3
> 1
> 9
> 1
> 9
> 2
> 4
> 3
> 4
> 1
> 10
> 4
> 2
> 1
> 11
> 2
> 3
> 3
> 3
> 5
> 4
> 4
> 5
> 6
> 5
> ...

result:

ok correct! (500 test cases)

Test #4:

score: 0

Accepted

time: 125ms

memory: 3948kb

input:

output:

> 1
> 1
> 1
> 2
> 1
> 2
> 1
> 2
> 2
> 1
> 3
> 1
> 3
> 2
> 1
> 4
> 1
> 4
> 2
> 1
> 5
> 1
> 5
> 2
> 1
> 6
> 1
> 6
> 2
> 1
> 7
> 1
> 7
> 2
> 1
> 8
> 1
> 8
> 2
> 1
> 9
> 1
> 9
> 2
> 1
> 10
> 1
> 10
> 2
> 1
> 11
> 2
> 2
> 3
> 1
> 12
> 1
> 12
> 2
> 1
> 13
> 1
> 13
> 2
> 1
> 14
> 1
> 14
> 2
> 1
> 15
> 1
> ...

result:

ok correct! (100 test cases)

Test #5:

score: 0

Accepted

time: 140ms

memory: 4628kb

input:

output:

> 1
> 1
> 1
> 2
> 1
> 2
> 1
> 2
> 2
> 1
> 3
> 1
> 3
> 2
> 1
> 4
> 1
> 4
> 2
> 1
> 5
> 1
> 5
> 2
> 1
> 6
> 1
> 6
> 2
> 1
> 7
> 1
> 7
> 2
> 1
> 8
> 1
> 8
> 2
> 1
> 9
> 1
> 9
> 2
> 1
> 10
> 1
> 10
> 2
> 1
> 11
> 1
> 11
> 2
> 1
> 12
> 1
> 12
> 2
> 1
> 13
> 1
> 13
> 2
> 1
> 14
> 1
> 14
> 2
> 1
> 15
> 1
>...

result:

ok correct! (10 test cases)

Test #6:

score: 0

Accepted

time: 168ms

memory: 5952kb

input:

output:

> 1
> 1
> 1
> 2
> 1
> 2
> 1
> 2
> 2
> 1
> 3
> 1
> 3
> 2
> 1
> 4
> 1
> 4
> 2
> 1
> 5
> 1
> 5
> 2
> 1
> 6
> 1
> 6
> 2
> 1
> 7
> 1
> 7
> 2
> 1
> 8
> 1
> 8
> 2
> 1
> 9
> 2
> 1
> 10
> 1
> 10
> 2
> 1
> 11
> 1
> 11
> 2
> 1
> 12
> 1
> 12
> 2
> 1
> 13
> 1
> 13
> 2
> 1
> 14
> 1
> 14
> 2
> 1
> 15
> 1
> 15
> 2
...

result:

ok correct! (4 test cases)

Test #7:

score: 0

Accepted

time: 117ms

memory: 5808kb

input:

output:

> 1
> 1
> 1
> 2
> 1
> 2
> 1
> 2
> 2
> 1
> 3
> 1
> 3
> 2
> 1
> 4
> 1
> 4
> 2
> 1
> 5
> 1
> 5
> 2
> 3
> 1
> 6
> 1
> 6
> 2
> 1
> 7
> 1
> 7
> 2
> 3
> 3
> 1
> 8
> 1
> 8
> 2
> 1
> 9
> 1
> 9
> 2
> 1
> 10
> 1
> 10
> 2
> 1
> 11
> 1
> 11
> 2
> 1
> 12
> 1
> 12
> 2
> 1
> 13
> 1
> 13
> 2
> 1
> 14
> 1
> 14
> 2
> ...

result:

ok correct! (4 test cases)

Test #8:

score: 0

Accepted

time: 60ms

memory: 5904kb

input:

output:

> 1
> 1
> 1
> 2
> 1
> 2
> 2
> 2
> 3
> 1
> 3
> 2
> 3
> 3
> 3
> 4
> 1
> 4
> 2
> 4
> 3
> 4
> 4
> 4
> 5
> 1
> 5
> 2
> 5
> 3
> 5
> 4
> 5
> 5
> 5
> 6
> 1
> 6
> 2
> 6
> 3
> 6
> 4
> 6
> 5
> 6
> 6
> 6
> 7
> 1
> 7
> 2
> 7
> 3
> 7
> 4
> 7
> 5
> 7
> 6
> 7
> 7
> 7
> 8
> 1
> 8
> 2
> 8
> 3
> 8
> 4
> 8
> 5
> 8
> 6
...

result:

ok correct! (4 test cases)

Test #9:

score: 0

Accepted

time: 42ms

memory: 4952kb

input:

output:

> 1
> 1
> 1
> 2
> 1
> 2
> 2
> 1
> 2
> 2
> 3
> 1
> 3
> 2
> 4
> 1
> 4
> 2
> 5
> 1
> 5
> 2
> 6
> 1
> 6
> 2
> 7
> 1
> 7
> 2
> 8
> 1
> 8
> 2
> 9
> 1
> 9
> 2
> 10
> 1
> 10
> 2
> 11
> 1
> 11
> 2
> 12
> 1
> 12
> 2
> 13
> 1
> 13
> 2
> 14
> 1
> 14
> 2
> 15
> 1
> 15
> 2
> 16
> 1
> 16
> 2
> 17
> 1
> 17
> 2
> 18...

result:

ok correct! (4 test cases)

Extra Test:

score: 0

Extra Test Passed