QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#88325	#5745. Graph Isomorphism	changtu	WA	22ms	5824kb	C++20	1.1kb	2023-03-15 21:36:27	2023-03-15 21:36:27

Judging History

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

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

[2023-03-15 21:36:27]
评测

测评结果：WA
用时：22ms
内存：5824kb

查看

[2023-03-15 21:36:27]
提交

answer

#include <set>
#include <map>
#include <random>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

#define endl '\n'
using LL=long long;
using ULL=unsigned long long;
constexpr int N=1e5+10;
vector<int> adj[N];
mt19937_64 gen=mt19937_64(random_device{}());
ULL rnd[N],hsh[N];

void solve() {
    int n,m;
    cin>>n>>m;
    LL tot=1LL*n*(n-1)/2+1;
    for(int i=1;i<=n;i++) rnd[i]=gen();
    for(int i=1;i<=n;i++) hsh[i]=0;
    for(int i=1;i<=m;i++) {
        int u,v;
        cin>>u>>v;
        hsh[u]^=rnd[v];
        hsh[v]^=rnd[u];
    }
    
    map<ULL,int> cnt;
    for(int i=1;i<=n;i++) cnt[hsh[i]]++;
    for(auto [_,x]:cnt) tot-=1LL*x*(x-1)/2;
    for(int i=1;i<=n;i++) hsh[i]^=rnd[i];
    cnt.clear();
    for(int i=1;i<=n;i++) cnt[hsh[i]]++;
    for(auto [_,x]:cnt) tot-=1LL*x*(x-1)/2;

    LL num=0;
    for(auto [_,x]:cnt) if(x==2) num++;
    tot-=num*(num-1);
    
    if(tot<=n) cout<<"YES"<<endl;
    else cout<<"NO"<<endl;
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(nullptr);
    int t;
    cin>>t;
    while(t--) solve();
    return 0;
}

源文件, 语言: C++20

详细

Test #1:

score: 100

Accepted

time: 4ms

memory: 5692kb

input:

output:

YES
YES
NO

result:

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

Test #2:

score: 0

Accepted

time: 22ms

memory: 5824kb

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

memory: 5764kb

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]