QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#577135	#9310. Permutation Counting 4	alpha	TL	0ms	7652kb	C++20	846b	2024-09-20 08:24:15	2024-09-20 08:24:16

Judging History

你现在查看的是最新测评结果

[2024-09-20 08:24:16]
评测

测评结果：TL
用时：0ms
内存：7652kb

查看

[2024-09-20 08:24:15]
提交

answer

#define _CRT_SECURE_NO_WARNINGS  1
#include<iostream>
#include<utility>
#include<queue> 
#include<stack> 
#include<string.h>
#include<malloc.h>
#include<functional>
#include<math.h>
#include<vector>
#include<cmath>
#include<iomanip>
#include<sstream>
#include<cctype>
#include<algorithm>
#include<bitset>
#include<map>
int pre[1000006];
int find(int x) {
	if (x == pre[x])
		return x;
	pre[x] = find(pre[x]);
	return pre[x];
}
int main() {
	int t;
	scanf("%d", &t);
	while (t--) {
		int n;
		for (int i = 0; i <= 1000000; i++)
			pre[i] = i;
		scanf("%d", &n);
		bool judge = 1;
		for (int i = 0; i < n; i++) {
			int a, b;
			scanf("%d%d", &a, &b);
			if (find(a - 1) == find(b))
				judge = 0;
			else
				pre[find(a - 1)] = find(b);
		}
		if (judge)
			printf("1\n");
		else
			printf("0\n");
	}
}

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 7652kb

input:

output:

result:

ok 4 tokens

Test #2:

score: -100

Time Limit Exceeded

input:

output: