QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#808638	#8056. Travel 2	HanZhongBalls	AC ✓	162ms	35560kb	C++14	1.7kb	2024-12-10 22:44:58	2024-12-10 22:44:58

Judging History

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

[2024-12-10 22:44:58]
评测

测评结果：AC
用时：162ms
内存：35560kb

查看

[2024-12-10 22:44:58]
提交

answer

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
#define F first
#define S second
#define RE register
#define random(x) (rand() % (x))
#define LOG(a, b) (log(a) / log(b))
#define N 3005
#define mod 998244353
#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3fll
int n=1,m=0,d[N],a[N][N],cr[N];
vector<int> g[N];
inline void pnt(int i){
	printf("> %d\n",i);
	fflush(stdout);
	/*
	printf("n=%d\n",n);
	for(int i=1;i<=10;++i){
		if(d[i]==0) continue;
		printf("%d %d %d:",i,cr[i],d[i]);
		for(int j=1;j<=10;++j){
			printf("%d ",a[i][j]);
		}puts("");
	}
	*/
}
int dfs1(int u){
	int v,w;
	while(cr[u]<d[u]){
		++cr[u];pnt(cr[u]);
		scanf("%d%d",&v,&w);
		a[u][v]=cr[u];
		if(d[v]==0){
			++n;
			g[u].push_back(v);
			d[v]=w;
		}
		if(dfs1(v)) return 1;
	}
	return 1;
}
void dfs2(int u){
	int t,w;
	dfs1(u);
	//printf("dfs2 at %d\n",u);
	//fflush(stdout);
	for(auto v:g[u]){
		pnt(a[u][v]);
		scanf("%d%d",&t,&w);
		dfs2(v);
		pnt(a[v][u]);
		scanf("%d%d",&t,&w);
	}
}
char s_cor[N];
int main(){
	int T,u,v;
	scanf("%d",&T);
	while(T--){
		scanf("%d%d",&u,&v);d[u]=v;
		dfs2(u);
		/*
		for(int i=1;i<=10;++i){
			printf("%d:",i);
			for(auto v:g[i]) printf("%d ",v);
			puts("");
		}
		*/
		printf("!");
		for(int i=1;i<=n;++i){
			for(int j=i+1;j<=n;++j){
				if(a[i][j]){
					printf(" %d %d",i,j);
				}
			}
		}
		puts("");
		fflush(stdout);
		scanf("%s",s_cor);
		for(int i=1;i<=n;++i){
			g[i].clear();d[i]=0;cr[i]=0;
			for(int j=1;j<=n;++j) a[i][j]=0;
		}
		n=1;
	}
	return 0;
}

源文件, 语言: C++14

詳細信息

Test #1:

score: 100

Accepted

time: 1ms

memory: 4004kb

input:

output:

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

result:

ok correct! (2 test cases)

Test #2:

score: 0

Accepted

time: 136ms

memory: 3964kb

input:

output:

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

result:

ok correct! (1000 test cases)

Test #3:

score: 0

Accepted

time: 113ms

memory: 4000kb

input:

output:

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

result:

ok correct! (500 test cases)

Test #4:

score: 0

Accepted

time: 148ms

memory: 4484kb

input:

output:

> 1
> 1
> 2
> 1
> 3
> 1
> 4
> 1
> 5
> 1
> 6
> 1
> 7
> 1
> 8
> 1
> 9
> 1
> 10
> 1
> 11
> 1
> 12
> 1
> 13
> 1
> 14
> 1
> 15
> 1
> 16
> 1
> 17
> 1
> 18
> 1
> 19
> 1
> 20
> 1
> 21
> 1
> 22
> 1
> 23
> 1
> 24
> 1
> 25
> 1
> 26
> 1
> 27
> 1
> 28
> 1
> 29
> 1
> 30
> 1
> 31
> 1
> 32
> 1
> 33
> 1
> 34
> 1
> 3...

result:

ok correct! (100 test cases)

Test #5:

score: 0

Accepted

time: 105ms

memory: 16652kb

input:

output:

> 1
> 1
> 2
> 1
> 3
> 1
> 4
> 1
> 5
> 1
> 6
> 1
> 7
> 1
> 8
> 1
> 9
> 1
> 10
> 1
> 11
> 1
> 12
> 1
> 13
> 1
> 14
> 1
> 15
> 1
> 16
> 1
> 17
> 1
> 18
> 1
> 19
> 1
> 20
> 1
> 21
> 1
> 22
> 1
> 23
> 1
> 24
> 1
> 25
> 1
> 26
> 1
> 27
> 1
> 28
> 1
> 29
> 1
> 30
> 1
> 31
> 1
> 32
> 1
> 33
> 1
> 34
> 1
> 3...

result:

ok correct! (10 test cases)

Test #6:

score: 0

Accepted

time: 162ms

memory: 18420kb

input:

output:

> 1
> 1
> 2
> 1
> 3
> 1
> 4
> 1
> 5
> 1
> 6
> 1
> 7
> 1
> 8
> 1
> 9
> 1
> 10
> 1
> 11
> 1
> 12
> 1
> 13
> 1
> 14
> 1
> 15
> 1
> 16
> 1
> 17
> 1
> 18
> 1
> 19
> 1
> 20
> 1
> 21
> 1
> 22
> 1
> 23
> 1
> 24
> 1
> 25
> 1
> 26
> 1
> 27
> 1
> 28
> 1
> 29
> 1
> 30
> 1
> 31
> 1
> 32
> 1
> 33
> 1
> 34
> 1
> 3...

result:

ok correct! (4 test cases)

Test #7:

score: 0

Accepted

time: 110ms

memory: 8248kb

input:

output:

> 1
> 1
> 2
> 1
> 3
> 1
> 4
> 1
> 5
> 1
> 6
> 1
> 7
> 1
> 8
> 1
> 9
> 1
> 10
> 1
> 11
> 1
> 12
> 1
> 13
> 1
> 14
> 1
> 15
> 1
> 16
> 1
> 17
> 1
> 18
> 1
> 19
> 1
> 20
> 1
> 21
> 1
> 22
> 1
> 23
> 1
> 24
> 1
> 25
> 1
> 26
> 1
> 27
> 1
> 28
> 1
> 29
> 1
> 30
> 1
> 31
> 1
> 32
> 1
> 33
> 1
> 34
> 1
> 3...

result:

ok correct! (4 test cases)

Test #8:

score: 0

Accepted

time: 65ms

memory: 34472kb

input:

output:

> 1
> 1
> 2
> 1
> 3
> 1
> 4
> 1
> 5
> 1
> 6
> 1
> 7
> 1
> 8
> 1
> 9
> 1
> 10
> 1
> 11
> 1
> 12
> 1
> 13
> 1
> 14
> 1
> 15
> 1
> 16
> 1
> 17
> 1
> 18
> 1
> 19
> 1
> 20
> 1
> 21
> 1
> 22
> 1
> 23
> 1
> 24
> 1
> 25
> 1
> 26
> 1
> 27
> 1
> 28
> 1
> 29
> 1
> 30
> 1
> 31
> 1
> 32
> 1
> 33
> 1
> 34
> 1
> 3...

result:

ok correct! (4 test cases)

Test #9:

score: 0

Accepted

time: 117ms

memory: 35560kb

input:

output:

> 1
> 1
> 2
> 1
> 3
> 1
> 4
> 1
> 5
> 1
> 6
> 1
> 7
> 1
> 8
> 1
> 9
> 1
> 10
> 1
> 11
> 1
> 12
> 1
> 13
> 1
> 14
> 1
> 15
> 1
> 16
> 1
> 17
> 1
> 18
> 1
> 19
> 1
> 20
> 1
> 21
> 1
> 22
> 1
> 23
> 1
> 24
> 1
> 25
> 1
> 26
> 1
> 27
> 1
> 28
> 1
> 29
> 1
> 30
> 1
> 31
> 1
> 32
> 1
> 33
> 1
> 34
> 1
> 3...

result:

ok correct! (4 test cases)

Extra Test:

score: 0

Extra Test Passed