NOI批量评测 - 记录详情

foo.cc: In function 'bool dfs(int)':
foo.cc:37:17: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   37 |                 for(int i=1;i<=n;i++)cout<<p[i],putchar(' ');putchar('\n');
      |                 ^~~
foo.cc:37:62: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   37 |                 for(int i=1;i<=n;i++)cout<<p[i],putchar(' ');putchar('\n');
      |                                                              ^~~~~~~
Expand

#	状态分数	耗时	内存占用

#1	Accepted 4	17ms	404 KiB
#2	Accepted 4	28ms	436 KiB
#3	Time Exceeded 0	≥2700ms	≥532 KiB
#4	Time Exceeded 0	≥2701ms	≥532 KiB
#5	Time Exceeded 0	≥2700ms	≥536 KiB
#6	Time Exceeded 0	≥2700ms	≥532 KiB
#7	Time Exceeded 0	≥2700ms	≥404 KiB
#8	Time Exceeded 0	≥2701ms	≥404 KiB
#9	Time Exceeded 0	≥2701ms	≥404 KiB
#10	Time Exceeded 0	≥2701ms	≥404 KiB
#11	Time Exceeded 0	≥2701ms	≥404 KiB
#12	Time Exceeded 0	≥2701ms	≥6.1 MiB
#13	Time Exceeded 0	≥2701ms	≥6 MiB
#14	Time Exceeded 0	≥2701ms	≥6 MiB
#15	Time Exceeded 0	≥2701ms	≥6 MiB
#16	Time Exceeded 0	≥2700ms	≥1.8 MiB
#17	Time Exceeded 0	≥2701ms	≥4.9 MiB
#18	Time Exceeded 0	≥2701ms	≥5.6 MiB
#19	Time Exceeded 0	≥2700ms	≥4.6 MiB
#20	Time Exceeded 0	≥2700ms	≥4.6 MiB
#21	Time Exceeded 0	≥2701ms	≥4.7 MiB
#22	Time Exceeded 0	≥2701ms	≥4.6 MiB
#23	Time Exceeded 0	≥2701ms	≥4.8 MiB
#24	Time Exceeded 0	≥2701ms	≥4.6 MiB
#25	Time Exceeded 0	≥2701ms	≥4.6 MiB

#include<bits/stdc++.h>
#define  rd read()
#define fi first
#define se second
#define mkp make_pair
using namespace std;
using pii=pair<int,int>;
typedef long long ll;
int read(){
	int s=0;bool f=0;char c=getchar();
	while(!isdigit(c)){if(c=='-')f=1;c=getchar();}
	while(isdigit(c)){s=(s<<3)+(s<<1)+(c^48);c=getchar();}
	return f?-s:s;
}
void write(int x){
	static int St[50],Top;Top=0;
	if(!x){putchar('0');return ;}
	if(x<0){putchar('-');x=-x;}
	while(x)St[++Top]=x%10,x/=10;
	while(Top)putchar(St[Top--]^48);
	return ;
}
const int N=1e5+5;
int used[N],q[N],p[N],n,m;
pii eg[N],g[N];
bool dfs(int u){
	if(u>n){
		for(int i=1;i<=m;i++){
			int x=q[eg[i].fi],y=q[eg[i].se];
			g[i]=mkp(min(x,y),max(x,y));
		}
		for(int i=1;i<=m;i++){
			for(int j=1;j<=m;j++){
				if(g[i].fi<g[j].fi&&g[j].fi<g[i].se&&g[i].se<g[j].se){return 0;}
			}
		}
		for(int i=1;i<=n;i++)cout<<p[i],putchar(' ');putchar('\n');
		return 1;
	}
	for(int i=1;i<=n;i++){
		if(used[i])continue;
		used[i]=1;q[i]=u;p[u]=i;if(dfs(u+1))return 1;used[i]=0;
	}
	return 0;
}
void solve(int cid){
	n=rd,m=rd;
	for(int i=1;i<=m;i++){
		eg[i].fi=rd,eg[i].se=rd;
	}
	dfs(1);
	for(int i=1;i<=n;i++)used[i]=0;
}
signed main(){
	freopen("graperm.in","r",stdin);
	freopen("graperm.out","w",stdout);
	int c=rd,T=rd;
	while(T--){
		solve(c);
	}
	return 0;
}

递交者: TJ-0007
题目: NOISX2025GFC NOISX2025GFC
比赛: 【官方数据 TJ】联合省选 2025 批量测试
语言: C++14(O2)
代码长度: 1.3 KiB
递交时间: 2025-3-6 13:24:39
评测时间: 2025-3-6 13:36:35

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

8 Time Exceeded

代码

信息

还没有账户？

登录