QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#75411	#5307. Subgraph Isomorphism	team1377^#	WA	70ms	5832kb	C++14	959b	2023-02-05 09:38:03	2023-02-05 09:38:07

Judging History

你现在查看的是测评时间为 2023-02-05 09:38:07 的历史记录

[2023-10-15 17:24:13]
管理员手动重测本题所有提交记录

测评结果：WA
用时：49ms
内存：5820kb

查看

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

[2023-02-05 09:38:07]
评测

测评结果：0
用时：70ms
内存：5832kb

查看

[2023-02-05 09:38:03]
提交

answer

#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 5;

vector<int> G[N];

signed main()
{
    int T;
    scanf("%d", &T);
    while (T--) {
        int n, m;
        scanf("%d%d", &n, &m);
        for (int i = 1; i <= n; ++i) {
            G[i].clear();
        }
        for (int i = 1; i <= m; ++i) {
            int x, y;
            scanf("%d%d", &x, &y);
            G[x].push_back(y);
            G[y].push_back(x);
        }
        if (m == n - 1) {
            puts("YES");
        } else if (m != n) {
            puts("NO");
        } else {
            int flag = 1;
            for (int i = 1; i <= n; ++i) {
                if (G[i].size() != 2) {
                    flag = 0;
                    break;
                }
            }
            if (flag) {
                puts("YES");
            } else {
                puts("NO");
            }
        }
    }
    return 0;
}

源文件, 语言: C++14

详细

Test #1:

score: 100

Accepted

time: 0ms

memory: 5832kb

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

memory: 5720kb

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]