NOI批量评测 - 记录详情

#	状态分数	耗时	内存占用

#1	Wrong Answer 0 读取到 4，应为 6。	3ms	404 KiB
#2	Wrong Answer 0 读取到 6，应为 9。	4ms	404 KiB
#3	Time Exceeded 0	≥2700ms	≥408 KiB
#4	Time Exceeded 0	≥2687ms	≥404 KiB
#5	Runtime Error 0 Segmentation fault	2ms	508 KiB
#6	Time Exceeded 0	≥2701ms	≥404 KiB
#7	Time Exceeded 0	≥2701ms	≥404 KiB
#8	Time Exceeded 0	≥2700ms	≥280 KiB
#9	Time Exceeded 0	≥2701ms	≥404 KiB
#10	Time Exceeded 0	≥2701ms	≥404 KiB
#11	Time Exceeded 0	≥2701ms	≥408 KiB
#12	Runtime Error 0 Segmentation fault	2ms	536 KiB
#13	Runtime Error 0 Segmentation fault	2ms	420 KiB
#14	Runtime Error 0 Segmentation fault	2ms	512 KiB
#15	Runtime Error 0 Segmentation fault	2ms	532 KiB
#16	Runtime Error 0 Segmentation fault	2ms	404 KiB
#17	Runtime Error 0 Segmentation fault	3ms	412 KiB
#18	Runtime Error 0 Segmentation fault	2ms	636 KiB
#19	Runtime Error 0 Segmentation fault	2ms	444 KiB
#20	Runtime Error 0 Segmentation fault	3ms	452 KiB
#21	Runtime Error 0 Segmentation fault	2ms	532 KiB
#22	Runtime Error 0 Segmentation fault	2ms	404 KiB
#23	Runtime Error 0 Segmentation fault	2ms	532 KiB
#24	Runtime Error 0 Segmentation fault	2ms	536 KiB
#25	Runtime Error 0 Segmentation fault	2ms	508 KiB

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(a,b,c) for(int a=b;a<=c;++a)
#define dep(a,b,c) for(int a=b;a>=c;--a)
const int N = 3e6+7; const int inf = 1e9+7; const int mod = 1e9+7;
int c,T;
int n,m;
int p[107],a[107],b[107],fp[107],pd[107],u[107],v[107];
bool maxptd=0;
inline void dfs(int x)
{
	if(maxptd==1) return;
	if(x==n+1)
	{
		rep(i,1,n) a[i]=fp[u[i]];
		rep(i,1,n) b[i]=fp[v[i]];
		rep(i,1,n) rep(j,1,n)
		    if(a[i]<a[j]&&a[j]<b[i]&&b[i]<b[j])
		        return;
		rep(i,1,n) cout<<p[i]<<" ";
		cout<<endl;
		maxptd=1; return;
	}
	rep(i,1,n)
	{
		if(pd[i]==0)
		{
			pd[i]=1;
			p[x]=i; fp[i]=x;
			dfs(x+1);if(maxptd==1) return;
			pd[i]=0;
		}
	}
	return;
}
signed main()
{
	freopen("graperm.in","r",stdin);
	freopen("graperm.out","w",stdout);
	cin>>c>>T;
	    while(T--)
	    {
			maxptd=0;
		    cin>>n>>m;
		    rep(i,1,m) { cin>>u[i]>>v[i]; if(u[i]>v[i]) swap(u[i],v[i]); }
		    memset(pd,0,sizeof(pd));
		    dfs(1);
	    }
	return 0;
}

递交者: JX-043
题目: NOISX2025GFC NOISX2025GFC
比赛: 【官方数据 JX】联合省选 2025 批量测试
语言: C++14(O2, GCC 9.3.0)
代码长度: 990 Bytes
递交时间: 2025-3-6 22:57:07
评测时间: 2025-3-7 10:32:13

分数: 0
总耗时: 21630ms
峰值时间: 2701ms
峰值内存: 636 KiB

0 Runtime Error

代码

信息

还没有账户？

登录