QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#311711	#8056. Travel 2	do_while_true	AC ✓	218ms	4644kb	C++14	1.0kb	2024-01-22 17:34:42	2024-01-22 17:34:43

Judging History

你现在查看的是测评时间为 2024-01-22 17:34:43 的历史记录

[2024-04-10 01:46:19]
管理员手动重测该提交记录

测评结果：AC
用时：213ms
内存：4884kb

查看

[2024-01-22 17:34:43]
评测

测评结果：100
用时：218ms
内存：4644kb

查看

[2024-01-22 17:34:42]
提交

answer

#include<bits/stdc++.h>
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define pii pair<int,int>
using namespace std;
const int N=2500;
int T,fa[N+10],pnt[N+10];map<int,int> id[2501];
vector<pii> edge;
void mian()
{
	memset(fa,0,sizeof(fa)),memset(pnt,0,sizeof(pnt)),edge.clear();
	for(int i=1;i<=N;++i)id[i].clear();
	int u,odeg;
	cin>>u>>odeg;int st=u;
	fa[u]=-1;
	while(1)
	{
		if(pnt[u]==odeg)
		{
			if(u==st)
			{
				cout<<"! ";
				for(int i=1;i<=N;++i)for(auto p:id[i])if(i<p.fi)cout<<i<<" "<<p.fi<<" ";
				cout<<endl;
				fflush(stdout);
				return;
			}
			cout<<"> "<<id[u][fa[u]]<<endl;
			fflush(stdout);
			cin>>u>>odeg;
			continue;
		}
		++pnt[u];
		cout<<"> "<<pnt[u]<<endl;
		fflush(stdout);
		int v,odeg2;
		cin>>v>>odeg2;
		id[u][v]=pnt[u];
		if(v==fa[u])
		{
			cout<<"> "<<id[v][u]<<endl;
			fflush(stdout);
			cin>>u>>odeg;
			continue;
		}
		if(!fa[v])fa[v]=u;
		u=v,odeg=odeg2;
	}
}
int main()
{
	int T;cin>>T;string ss;
	while(T--)mian(),cin>>ss;
}

Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3928kb

input:

output:

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

result:

ok correct

Test #2:

score: 0

Accepted

time: 167ms

memory: 3720kb

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

Test #3:

score: 0

Accepted

time: 192ms

memory: 3600kb

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

Test #4:

score: 0

Accepted

time: 176ms

memory: 3912kb

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

Test #5:

score: 0

Accepted

time: 218ms

memory: 3980kb

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

Test #6:

score: 0

Accepted

time: 158ms

memory: 4588kb

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

Test #7:

score: 0

Accepted

time: 155ms

memory: 4644kb

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

Test #8:

score: 0

Accepted

time: 104ms

memory: 4628kb

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

Test #9:

score: 0

Accepted

time: 81ms

memory: 4344kb

input:

output:

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

result:

ok correct

Extra Test:

score: 0

Extra Test Passed