QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#326204	#5745. Graph Isomorphism	ushg8877	WA	33ms	3796kb	C++14	667b	2024-02-12 16:37:40	2024-02-12 16:37:40

Judging History

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

[2024-02-12 16:37:40]
评测

测评结果：WA
用时：33ms
内存：3796kb

查看

[2024-02-12 16:37:40]
提交

answer

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define MP make_pair
mt19937 rnd(time(0));
const int MAXN=1e5+5;
int n,m,d[MAXN];
void solve(){
	cin>>n>>m;
	for(int i=1;i<=n;i++) d[i]=0;
	for(int i=1;i<=m;i++){
		int u,v;cin>>u>>v;
		d[u]++;d[v]++;
	}
	if(n<=3) return cout<<"YES"<<endl,void();
	if(n==4&&max({d[1],d[2],d[3],d[4]})==2&&min({d[1],d[2],d[3],d[4]})==2)
			return cout<<"YES"<<endl,void();
	int cnt=0;
	for(int i=1;i<=n;i++) if(d[i]==n-1) cnt++;
	if(cnt==1&&m==n-1||cnt==n) cout<<"YES"<<endl;
	else cout<<"NO"<<endl;
}
int main(){
	ios::sync_with_stdio(false);
	int _;cin>>_;
	while(_--) solve();
	return 0;
}

源文件, 语言: C++14

详细

Test #1:

score: 100

Accepted

time: 0ms

memory: 3724kb

input:

output:

YES
YES
NO

result:

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

Test #2:

score: 0

Accepted

time: 16ms

memory: 3796kb

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: 33ms

memory: 3792kb

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 [93rd token]