NOI批量评测 - 记录详情

foo.cc: In function 'int main()':
foo.cc:19:15: warning: 'memset' used with constant zero length parameter; this could be due to transposed parameters [-Wmemset-transposed-args]
   19 |         memset(x,sizeof(x),0);
      |         ~~~~~~^~~~~~~~~~~~~~~
foo.cc: In function 'int dfs(int, int, int)':
foo.cc:13:1: warning: control reaches end of non-void function [-Wreturn-type]
   13 | }
      | ^
Expand

#	状态分数	耗时	内存占用

#1	Runtime Error 0 Segmentation fault	0ms	156 KiB
#2	Runtime Error 0 Segmentation fault	0ms	156 KiB
#3	Runtime Error 0 Segmentation fault	0ms	260 KiB
#4	Runtime Error 0 Segmentation fault	0ms	156 KiB
#5	Runtime Error 0 Segmentation fault	0ms	156 KiB
#6	Runtime Error 0 Segmentation fault	0ms	156 KiB
#7	Runtime Error 0 Segmentation fault	0ms	260 KiB
#8	Runtime Error 0 Segmentation fault	0ms	156 KiB
#9	Runtime Error 0 Segmentation fault	0ms	156 KiB
#10	Runtime Error 0 Segmentation fault	0ms	156 KiB
#11	Runtime Error 0 Segmentation fault	0ms	156 KiB
#12	Runtime Error 0 Segmentation fault	0ms	156 KiB
#13	Runtime Error 0 Segmentation fault	0ms	156 KiB
#14	Runtime Error 0 Segmentation fault	0ms	156 KiB
#15	Runtime Error 0 Segmentation fault	0ms	156 KiB
#16	Runtime Error 0 Segmentation fault	0ms	260 KiB
#17	Runtime Error 0 Segmentation fault	0ms	156 KiB
#18	Runtime Error 0 Segmentation fault	0ms	156 KiB
#19	Runtime Error 0 Segmentation fault	0ms	156 KiB
#20	Runtime Error 0 Segmentation fault	0ms	156 KiB
#21	Runtime Error 0 Segmentation fault	0ms	156 KiB
#22	Runtime Error 0 Segmentation fault	0ms	156 KiB
#23	Runtime Error 0 Segmentation fault	0ms	156 KiB
#24	Runtime Error 0 Segmentation fault	0ms	156 KiB
#25	Runtime Error 0 Segmentation fault	0ms	156 KiB

#include <bits/stdc++.h>
using namespace std;
int x[20000][20000];
int n,u,v,q,l,r,k;
int dfs(int x1,int y,int z)
{
	if(x[x1][z]==0) return 0;
	for(int i=0;i<y;i++)
	{
		dfs(i,n,z+1);
		
	}
}
int main()
{
	freopen("query.in","r",stdin);
	freopen("query.out","w",stdout);
	cin>>n;
	memset(x,sizeof(x),0);
	for(int i=0;i<n-1;i++)
	{
		cin>>u>>v;
		x[u][v]=x[v][u]=1;
	}
	dfs(0,n-1,0);
	cin>>q;
	for(int i=0;i<n-1;i++)
	{
		cin>>l>>r>>k;
		cout<<3<<endl;
	} 
	fclose(stdin);
	fclose(stdout);
	return 0;
}

递交者: TJ-0097
题目: NOIP2024D NOIP2024D
比赛: 【民间数据】NOIP2024 TJ 批量测试
语言: C++14(O2)
代码长度: 537 Bytes
递交时间: 2024-12-1 0:49:51
评测时间: 2024-12-1 1:10:12

分数: 0
总耗时: 7ms
峰值时间: 0ms
峰值内存: 260 KiB

0 Runtime Error

代码

信息

还没有账户？

登录