QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#103192	#5745. Graph Isomorphism	willow^#	WA	15ms	3532kb	C++14	654b	2023-05-04 18:26:57	2023-05-04 18:27:00

Judging History

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

[2023-08-10 23:21:45]
System Update: QOJ starts to keep a history of the judgings of all the submissions.

[2023-05-04 18:27:00]
评测

测评结果：WA
用时：15ms
内存：3532kb

查看

[2023-05-04 18:26:57]
提交

answer

#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
int T, n, m, d[maxn];
int main() {
	for(scanf("%d", &T); T --; ) {
		scanf("%d%d", &n, &m);
		for(int i = 1; i <= n; ++ i)
			d[i] = 0;
		for(int i = 1, u, v; i <= m; ++ i) {
			scanf("%d%d", &u, &v);
			++ d[u], ++ d[v];
		}
		sort(d + 1, d + n + 1);
		if(d[1] == 0 && d[n] == 0) {
			puts("YES");
		}
		else if(d[1] == 1 && d[n - 1] == 1 && d[n] == n - 1) {
			puts("YES");
		}
		else if(d[1] == n - 1 && d[n] == n - 1) {
			puts("YES");
		}
		else if(d[1] == 0 && d[2] == n - 2 && d[n] == n - 2) {
			puts("YES");
		}
		else {
			puts("NO");
		}
	}
}

源文件, 语言: C++14

詳細信息

Test #1:

score: 100

Accepted

time: 2ms

memory: 3428kb

input:

output:

YES
YES
NO

result:

ok 3 token(s): yes count is 2, no count is 1

Test #2:

score: 0

Accepted

time: 10ms

memory: 3532kb

input:

output:

YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
...

result:

ok 39982 token(s): yes count is 39982, no count is 0

Test #3:

score: -100

Wrong Answer

time: 15ms

memory: 3376kb

input:

output:

YES
YES
YES
YES
YES
NO
NO
YES
NO
YES
YES
YES
YES
YES
NO
NO
YES
YES
YES
NO
YES
YES
YES
NO
YES
YES
YES
YES
YES
YES
YES
YES
NO
NO
YES
YES
YES
YES
NO
NO
NO
YES
YES
YES
YES
YES
YES
YES
YES
NO
YES
YES
YES
YES
YES
YES
NO
YES
NO
YES
YES
YES
NO
YES
YES
NO
YES
NO
YES
NO
YES
YES
YES
YES
NO
YES
YES
YES
YES
YES
...

result:

wrong answer expected YES, found NO [83rd token]