NOI批量评测 - 记录详情

#	状态分数	耗时	内存占用

#1	Accepted 4	50ms	412 KiB
#2	Accepted 4	87ms	420 KiB
#3	Runtime Error 0 Segmentation fault	1ms	404 KiB
#4	Runtime Error 0 Segmentation fault	1ms	404 KiB
#5	Runtime Error 0 Segmentation fault	1ms	404 KiB
#6	Runtime Error 0 Segmentation fault	1ms	404 KiB
#7	Runtime Error 0 Segmentation fault	1ms	404 KiB
#8	Runtime Error 0 Segmentation fault	1ms	404 KiB
#9	Runtime Error 0 Segmentation fault	1ms	404 KiB
#10	Runtime Error 0 Segmentation fault	1ms	408 KiB
#11	Runtime Error 0 Segmentation fault	1ms	404 KiB
#12	Runtime Error 0 Segmentation fault	1ms	404 KiB
#13	Runtime Error 0 Segmentation fault	1ms	404 KiB
#14	Runtime Error 0 Segmentation fault	1ms	404 KiB
#15	Runtime Error 0 Segmentation fault	1ms	408 KiB
#16	Runtime Error 0 Segmentation fault	1ms	404 KiB
#17	Runtime Error 0 Segmentation fault	1ms	408 KiB
#18	Runtime Error 0 Segmentation fault	1ms	404 KiB
#19	Runtime Error 0 Segmentation fault	1ms	404 KiB
#20	Runtime Error 0 Segmentation fault	1ms	404 KiB
#21	Runtime Error 0 Segmentation fault	1ms	404 KiB
#22	Runtime Error 0 Segmentation fault	1ms	404 KiB
#23	Runtime Error 0 Segmentation fault	1ms	404 KiB
#24	Runtime Error 0 Segmentation fault	1ms	404 KiB
#25	Runtime Error 0 Segmentation fault	1ms	408 KiB

#include<bits/stdc++.h>
using namespace std;
int c,T,n,m;
int a[12],b[12];
int u[30],v[30];
int x[30],y[30];
void f(){
	for(int i=n;i>=1;i--){
		int t=1;
		while(a[i]+t<=n){
			if(b[a[i]+t]>i){
				swap(a[i],a[b[a[i]+t]]);
				b[a[i]]=i;
				sort(a+i+1,a+n+1);
				for(int j=i+1;j<=n;j++) b[a[j]]=j;
				return;
			}
			t++;
		}
	}
}
bool ch(int o,int p){
	if(x[o]<x[p]&&x[p]<y[o]&&y[o]<y[p]) return true;
	return false;
}
int main(){
	freopen("graperm.in","r",stdin);
	freopen("graperm.out","w",stdout);
	scanf("%d%d",&c,&T);
	while(T--){
		scanf("%d%d",&n,&m);
		for(int i=1;i<=m;i++){
			scanf("%d%d",&u[i],&v[i]);
		}
		for(int i=1;i<=n;i++) a[i]=b[i]=i;
		bool flag;
		flag=false;
		for(int i=1;i<=m;i++){
			x[i]=b[u[i]],y[i]=b[v[i]];
			if(x[i]>y[i]) swap(x[i],y[i]);
			for(int j=1;j<i;j++){
				if(ch(j,i)||ch(i,j))
					flag=true;
			}
		}
		while(flag){
			f();
			flag=false;
			for(int i=1;i<=m;i++){
				x[i]=b[u[i]],y[i]=b[v[i]];
				if(x[i]>y[i]) swap(x[i],y[i]);
				for(int j=1;j<i;j++){
					if(ch(j,i)||ch(i,j))
						flag=true;
				}
			}
		}
		for(int i=1;i<=n;i++) printf("%d ",a[i]);
		puts("");
	}
	return 0;
}

递交者: HA-033
题目: NOISX2025GFC NOISX2025GFC
比赛: 【官方数据 HA】联合省选 2025 批量测试
语言: C++14(O2)
代码长度: 1.2 KiB
递交时间: 2025-3-6 13:11:46
评测时间: 2025-3-6 13:17:08

分数: 8
总耗时: 169ms
峰值时间: 87ms
峰值内存: 420 KiB

8 Runtime Error

代码

信息

还没有账户？

登录