NOI批量评测 - 记录详情

foo.cc: In function 'int main()':
foo.cc:31:6: warning: 'D' may be used uninitialized in this function [-Wmaybe-uninitialized]
   31 |      if(B>D) swap(B,D);
      |      ^~
foo.cc:30:6: warning: 'C' may be used uninitialized in this function [-Wmaybe-uninitialized]
   30 |      if(A>C) swap(A,C);
      |      ^~
foo.cc:31:6: warning: 'B' may be used uninitialized in this function [-Wmaybe-uninitialized]
   31 |      if(B>D) swap(B,D);
      |      ^~
foo.cc:30:6: warning: 'A' may be used uninitialized in this function [-Wmaybe-uninitialized]
   30 |      if(A>C) swap(A,C);
      |      ^~
Expand

#	状态分数	耗时	内存占用

#1	Accepted 4	611ms	440 KiB
#2	Accepted 4	885ms	444 KiB
#3	Time Exceeded 0	≥2701ms	≥404 KiB
#4	Time Exceeded 0	≥2700ms	≥412 KiB
#5	Time Exceeded 0	≥2700ms	≥404 KiB
#6	Time Exceeded 0	≥2700ms	≥404 KiB
#7	Time Exceeded 0	≥2701ms	≥404 KiB
#8	Time Exceeded 0	≥2696ms	≥412 KiB
#9	Time Exceeded 0	≥2700ms	≥404 KiB
#10	Time Exceeded 0	≥2700ms	≥452 KiB
#11	Time Exceeded 0	≥2700ms	≥404 KiB
#12	Time Exceeded 0	≥2700ms	≥1.1 MiB
#13	Time Exceeded 0	≥2701ms	≥1.1 MiB
#14	Time Exceeded 0	≥2701ms	≥1.1 MiB
#15	Time Exceeded 0	≥2700ms	≥1.1 MiB
#16	Time Exceeded 0	≥2700ms	≥1.4 MiB
#17	Time Exceeded 0	≥2701ms	≥1.4 MiB
#18	Time Exceeded 0	≥2701ms	≥1.4 MiB
#19	Time Exceeded 0	≥2700ms	≥788 KiB
#20	Time Exceeded 0	≥2701ms	≥788 KiB
#21	Time Exceeded 0	≥2701ms	≥852 KiB
#22	Time Exceeded 0	≥2701ms	≥740 KiB
#23	Time Exceeded 0	≥2700ms	≥788 KiB
#24	Time Exceeded 0	≥2700ms	≥788 KiB
#25	Time Exceeded 0	≥2700ms	≥788 KiB

#include<bits/stdc++.h>
using namespace std;
int c,T;
int n,m;
int a[200005],b[200005];
int ans[2009];
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	freopen("graperm.in","r",stdin);
	freopen("graperm.out","w",stdout);
	cin>>c>>T;
	while(T--){
		cin>>n>>m;
		for(int i=1;i<=n;i++) ans[i]=i;
		for(int i=1;i<=m;i++){
			cin>>a[i]>>b[i];
		}
		do{
			bool flag=1;
			for(int i=1;i<=m;i++){
				for(int j=1;j<=m;j++){
					int A,B,C,D;
					for(int k=1;k<=n;k++){
						if(ans[k]==a[i]) A=k;
						if(ans[k]==a[j]) B=k;
						if(ans[k]==b[i]) C=k;
						if(ans[k]==b[j]) D=k;
					}
					if(A>C) swap(A,C);
					if(B>D) swap(B,D);
					if(A<B && B<C && C<D) flag=0;
				}
			}
			if(flag) break;
		}while(next_permutation(ans+1,ans+n+1));
		for(int i=1;i<=n;i++) cout<<ans[i]<<" \n"[i==n];
		
	}
	return 0;
}

递交者: HL-S005
题目: NOISX2025GFC NOISX2025GFC
比赛: 【官方数据 HL】联合省选 2025 批量测试
语言: C++14(O2, GCC 9.3.0)
代码长度: 852 Bytes
递交时间: 2025-3-7 14:30:46
评测时间: 2025-3-7 14:32:26

分数: 8
总耗时: ≥63603ms
峰值时间: ≥2701ms
峰值内存: ≥1.4 MiB

8 Time Exceeded

代码

信息

还没有账户？

登录