NOI批量评测 - 记录详情

#	状态分数	耗时	内存占用

#1	Accepted 4	16ms	404 KiB
#2	Accepted 4	27ms	440 KiB
#3	Wrong Answer 0 Standard answer longer than user output.	1ms	404 KiB
#4	Wrong Answer 0 Standard answer longer than user output.	1ms	320 KiB
#5	Wrong Answer 0 Standard answer longer than user output.	1ms	404 KiB
#6	Wrong Answer 0 Standard answer longer than user output.	1ms	404 KiB
#7	Wrong Answer 0 Standard answer longer than user output.	1ms	404 KiB
#8	Wrong Answer 0 Standard answer longer than user output.	1ms	404 KiB
#9	Wrong Answer 0 Standard answer longer than user output.	1ms	404 KiB
#10	Wrong Answer 0 Standard answer longer than user output.	1ms	404 KiB
#11	Wrong Answer 0 Standard answer longer than user output.	1ms	404 KiB
#12	Wrong Answer 0 Standard answer longer than user output.	1ms	404 KiB
#13	Wrong Answer 0 Standard answer longer than user output.	1ms	404 KiB
#14	Wrong Answer 0 Standard answer longer than user output.	1ms	404 KiB
#15	Wrong Answer 0 Standard answer longer than user output.	1ms	404 KiB
#16	Wrong Answer 0 Standard answer longer than user output.	1ms	404 KiB
#17	Wrong Answer 0 Standard answer longer than user output.	1ms	404 KiB
#18	Wrong Answer 0 Standard answer longer than user output.	1ms	404 KiB
#19	Wrong Answer 0 Standard answer longer than user output.	1ms	408 KiB
#20	Wrong Answer 0 Standard answer longer than user output.	1ms	360 KiB
#21	Wrong Answer 0 Standard answer longer than user output.	1ms	404 KiB
#22	Wrong Answer 0 Standard answer longer than user output.	1ms	404 KiB
#23	Wrong Answer 0 Standard answer longer than user output.	1ms	404 KiB
#24	Wrong Answer 0 Standard answer longer than user output.	1ms	404 KiB
#25	Wrong Answer 0 Standard answer longer than user output.	1ms	408 KiB

#include <bits/stdc++.h>
using namespace std;
const int N = 2055;
int c, T, n, m, bg;
struct node {
	int l, r;
} a[N];
int mp[N][N];
int ans[N], tr[N], tmp[N], vis[N]; 
bool cmp(node x, node y) {
	return x.l == y.l ? x.r < y.r : x.l < y.l;
}
void update(int x, int pos) {
	int tmp = ans[x];
	for (int i = x - 1; i >= pos; i--) ans[i + 1] = ans[i];
	ans[pos] = tmp;
	for (int i = 1; i <= n; i++) tr[ans[i]] = i;
}
void dfs(int x) {
	if (bg) return ;
	if (x > n) {
		for (int i = 1; i <= n; i++) tr[ans[i]] = i;
		int flag = 0;
		for (int i = 1; i <= m; i++) {
			if (tr[a[i].l] > tr[a[i].r]) swap(a[i].l, a[i].r);
		} 
		for (int i = 1; i <= m; i++) {
			for (int j = 1; j <= m; j++) {
				if (tr[a[i].l] < tr[a[j].l] and tr[a[j].l] < tr[a[i].r] and tr[a[i].r] < tr[a[j].r]) {
					flag = 1;
					break;
				}
			}
			if (flag) break;
		} 
		if (flag == 0) bg = 1;
		return ;
	}
	for (int i = 1; i <= n; i++) {
		if (vis[i]) continue;
		vis[i] = 1;
		ans[x] = i;
		dfs(x + 1);
		vis[i] = 0;
		if (bg) break;
	}
	return ;
}
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 <= n; i++) ans[i] = tr[i] = i;
//		for (int i = 1; i <= m; i++) {
//			scanf("%d%d", &a[i].l, &a[i].r);
//			if (a[i].l > a[i].r) swap(a[i].l, a[i].r);
//		}
//		sort(a + 1, a + 1 + m, cmp);
//		for (int i = 1; i <= m; i++) {
//			for (int j = i + 1; j <= m; j++) {
//				if (tr[a[i].l] > tr[a[i].r]) swap(a[i].l, a[i].r);
//				if (tr[a[j].l] > tr[a[j].r]) swap(a[j].l, a[j].r);
//				if (tr[a[i].l] < tr[a[j].l] and tr[a[j].l] < tr[a[i].r] and tr[a[i].r] < tr[a[j].r]) {
//					update(tr[a[j].r], tr[a[i].r]);
//				}
//			}
//		}
//		for (int i = 1; i <= n; i++) printf("%d ", ans[i]);
//		printf("\n");
//	}
	if (c <= 2) {
		while (T--) {
			scanf("%d%d", &n, &m);
			for (int i = 1; i <= m; i++) {
				scanf("%d%d", &a[i].l, &a[i].r);
				
			}
			bg = 0;
			for (int i = 1; i <= n; i++) vis[i] = 0;
			dfs(1);
			for (int i = 1; i <= n; i++) printf("%d ", ans[i]);
			printf("\n");
		}		
	}
	return 0;
}

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

分数: 8
总耗时: 72ms
峰值时间: 27ms
峰值内存: 440 KiB

8 Wrong Answer

代码

信息

还没有账户？

登录