NOI批量评测 - 记录详情

foo.cc: In function 'long long int get_p(long long int)':
foo.cc:45:1: warning: control reaches end of non-void function [-Wreturn-type]
   45 | }
      | ^
Expand

#	状态分数	耗时	内存占用

#1	Accepted 4	72ms	424 KiB
#2	Accepted 4	131ms	424 KiB
#3	Time Exceeded 0	≥2700ms	≥404 KiB
#4	Time Exceeded 0	≥2701ms	≥404 KiB
#5	Time Exceeded 0	≥2701ms	≥404 KiB
#6	Time Exceeded 0	≥2700ms	≥404 KiB
#7	Time Exceeded 0	≥2701ms	≥404 KiB
#8	Time Exceeded 0	≥2700ms	≥404 KiB
#9	Time Exceeded 0	≥2701ms	≥404 KiB
#10	Time Exceeded 0	≥2701ms	≥404 KiB
#11	Time Exceeded 0	≥2700ms	≥404 KiB
#12	Runtime Error 0 Segmentation fault	2ms	532 KiB
#13	Runtime Error 0 Segmentation fault	2ms	532 KiB
#14	Runtime Error 0 Segmentation fault	2ms	532 KiB
#15	Runtime Error 0 Segmentation fault	2ms	532 KiB
#16	Runtime Error 0 Segmentation fault	2ms	532 KiB
#17	Runtime Error 0 Segmentation fault	2ms	532 KiB
#18	Runtime Error 0 Segmentation fault	2ms	532 KiB
#19	Runtime Error 0 Segmentation fault	1ms	532 KiB
#20	Runtime Error 0 Segmentation fault	2ms	532 KiB
#21	Runtime Error 0 Segmentation fault	2ms	532 KiB
#22	Runtime Error 0 Segmentation fault	2ms	532 KiB
#23	Runtime Error 0 Segmentation fault	2ms	532 KiB
#24	Runtime Error 0 Segmentation fault	1ms	532 KiB
#25	Runtime Error 0 Segmentation fault	1ms	532 KiB

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define Air
namespace io{
	int read(){
		int t=0,f=1;
		char ch=getchar();
		while(ch<'0'||ch>'9'){
			if(ch=='-')f=-f;
			ch=getchar();
		}
		while(ch>='0'&&ch<='9'){
			t=t*10+ch-'0';
			ch=getchar();
		}
		return f*t;
	}
	void write(int x){
		if(x<0){
			x=-x;
			putchar('-');
		}
		if(x>=10){
			write(x/10);
		}
		putchar(x%10+'0');
	}
}
using namespace io;
int n;
int m;
int TCS;
const int N=4010;
int pai[N];
struct Edge{
	int x,y;
}edg[N];
int get_p(int x){
	for(int i=1;i<=n;i++){
		if(pai[i]==x){
			return i;
		}
	}
}
void work(){
	n=read();
	m=read();
	for(int i=1;i<=m;i++){
		edg[i]={read(),read()};
	}	
	for(int i=1;i<=n;i++){
		pai[i]=i;
	}
	do{
		bool flag=0;
		for(int i=1;i<=m;i++){
			for(int j=1;j<=m;j++){
				if(i==j)continue;
				int xx1=get_p(edg[i].x);
				int yy1=get_p(edg[i].y);
				int xx2=get_p(edg[j].x);
				int yy2=get_p(edg[j].y);
				if(min(xx1,yy1)<min(xx2,yy2)&&min(xx2,yy2)<max(xx1,yy1)&&max(xx1,yy1)<max(xx2,yy2)){
					flag=1;
					break;
				}
			}
			if(flag)break;
		}	
		if(!flag){
			for(int i=1;i<=n;i++){
				write(pai[i]);
				putchar(' ');
			}
			putchar('\n');
			break;
		}
	}while(next_permutation(pai+1,pai+1+n));
}
signed main(){
#ifdef Air
	freopen("graperm.in","r",stdin);
	freopen("graperm.out","w",stdout);
#endif
	TCS=read();
	int T=read();
	while(T--){
		work();
	}
	return 0;
}

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

分数: 8
总耗时: 24530ms
峰值时间: 2701ms
峰值内存: 532 KiB

8 Runtime Error

代码

信息

还没有账户？

登录