QOJ.ac

QOJ

The 2nd Universal Cup Finals is coming! Check out our event page, schedule, and competition rules!

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#746765	#5307. Subgraph Isomorphism	Moemi_	WA	51ms	3860kb	C++20	1.5kb	2024-11-14 15:29:08	2024-11-14 15:29:09

Judging History

This is the latest submission verdict.

[2024-11-14 15:29:09]
Judged

Verdict: WA
Time: 51ms
Memory: 3860kb

Show

[2024-11-14 15:29:08]
Submitted

answer

#include <iostream>
#include <cstring>
#include <algorithm>
#include <map>
#include <vector>
#include <set>
#include <queue>
#include <cmath>
#include <stack>
#include <cstring>
#include <iomanip>
#include <unordered_map>
#include <numeric>

#define sc_int(x) scanf("%d", &x)

#define x first
#define y second
#define pb push_back

using namespace std;

const int N = 2e5 + 10, M = 5010, MOD = 80112002;
const int inf = 1e9;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<string, int> PSI;
typedef pair<LL, LL> PLL;
typedef pair<double, double> PDD;
typedef pair<char, int> PCI;
typedef pair<string, string> PSS;

LL n, m;

void solve() 
{
    cin >> n >> m;
    vector<PII> a(m);
    vector<int> d(n + 1);
    for(auto &t : a) cin >> t.x >> t.y, d[t.x] ++, d[t.y] ++;
    if(m != n && m != n - 1) cout << "NO" << endl;
    else 
    {
        if(m == n - 1) cout << "YES" << endl;
        else
        {
            for(int i = 1; i <= n; i ++)
            {
                if(d[i] != 2) 
                {
                    cout << "NO" << endl;
                    return;
                }
            }
            cout << "YES" << endl;
        }
    }
}

int main()
{
    // freopen("input.txt","r",stdin);
    // freopen("output.txt","w",stdout);
    ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    int T = 1;
    cin >> T;
    while(T --)
    {
        solve();
    }
}

源文件, 语言: C++20

詳細信息

Test #1:

score: 100

Accepted

time: 0ms

memory: 3564kb

input:

output:

YES
YES
NO
YES

result:

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

Test #2:

score: -100

Wrong Answer

time: 51ms

memory: 3860kb

input:

output:

YES
YES
YES
YES
YES
NO
YES
NO
NO
YES
YES
NO
NO
NO
NO
NO
NO
YES
NO
NO
NO
NO
YES
NO
NO
NO
NO
NO
NO
NO
YES
YES
NO
YES
YES
NO
NO
NO
NO
NO
NO
NO
NO
NO
YES
NO
NO
NO
YES
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
YES
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
N...

result:

wrong answer expected YES, found NO [39th token]