QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#708170#5307. Subgraph IsomorphismcbdsopaWA 384ms20300kbC++146.4kb2024-11-03 20:00:432024-11-03 20:00:45

Judging History

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

  • [2024-11-03 20:00:45]
  • 评测
  • 测评结果：WA
  • 用时：384ms
  • 内存：20300kb
查看
  • [2024-11-03 20:00:43]
  • 提交

answer

// #define LawrenceSivan
#pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")

#include <bits/stdc++.h>
using namespace std;

using i64 = long long;
using ull = unsigned long long;
using d64 = long double;

#define INF 0x3f3f3f3f
// #define int i64

constexpr int maxn = 1e5 + 5;
constexpr int base = 131;
constexpr double eps = 1e-8;

namespace IO {
template<typename T>
inline void read(T &x) {
    x = 0;
    T f = 1;
    char ch = getchar();

    while (!isdigit(ch)) {if (ch == '-')f = -1; ch = getchar();}

    while (isdigit(ch)) {x = x * 10 + (ch ^ 48); ch = getchar();}

    x *= f;
}

template <typename T, typename... Args>
inline void read(T &t, Args &... args) {
    read(t);
    read(args...);
}

template<typename T>
void write(T x) {
    if (x < 0)putchar('-'), x = -x;

    if (x > 9)write(x / 10);

    putchar(x % 10 + '0');
}

template<typename T, typename... Args>
void write(T t, Args... args) {
    write(t);
    putchar(' ');
    write(args...);
}
}
using namespace IO;
const int N = 1e5;
vector <int> G[N + 3];
std::vector<int>ed;
bool in[N + 3];
bool dfs2(int u, int fa, int mst) {
    if (u != fa && u == mst) {
        return true;
    }

    for (int v : G[u]) {
        if (v == fa) continue;

        if (dfs2(v, u, mst)) {
            ed.push_back(u);
            in[u] = 1;
            return true;
        }
    }

    return false;
}
const int p = 1145141;
int pp = 13331;
int mod = 998244353;
ull P[2 * N + 3];

i64 PP[2 * N + 3];
struct Hash {
    int len;
    ull h;
    i64 h2;
    friend Hash operator + (const Hash &x, const int &y) {
        Hash z;
        z.len = x.len + 1;
        z.h = x.h * p + y;
        z.h2 = ((x.h2 * pp) % mod + y) % mod;

        return z;
    }
    friend Hash operator + (const Hash &x, const Hash &y) {
        Hash z;
        z.len = x.len + y.len;
        z.h = x.h * P[y.len] + y.h;
        z.h2 = ((x.h2 * PP[y.len]) % mod + y.h2) % mod;
        return z;
    }
    friend bool operator < (const Hash &x, const Hash &y) {
        if (x.len == y.len) {
            if (x.h == y.h)
                return x.h2 < y.h2;
            else return x.h < y.h;
        }

        return x.len < y.len;
    }
    friend bool operator == (const Hash &x, const Hash &y) {
        return x.len == y.len && x.h == y.h && x.h2 == y.h2;
    }
};
Hash has[N + 3];
std::vector<Hash>tmp;
//std::map<std::pair<int, int>, bool>ex;
void calc(int u, int fa) {

    for (int v : G[u]) {
        if (in[v]) continue;

        if (v == fa) continue;

        calc(v, u);
    }

    Hash ans = {0, 0, 0};
    ans = ans + 1;
    tmp.clear();

    for (int v : G[u]) {
        if (in[v]) continue;

        if (v == fa) continue;

        tmp.push_back(has[v]);
    }

    std::sort(tmp.begin(), tmp.end());

    for (Hash it : tmp) {
        ans = ans + it;
    }

    ans = ans + 2;
    has[u] = ans;
}
inline void solve(int tt) {
    int n, m;
    cin >> n >> m;

    for (int i = 1; i <= n; ++i) {
        G[i].clear();
    }


    for (int i = 1, u, v; i <= m; i++) {
        cin >> u >> v;

        G[u].push_back(v);
        G[v].push_back(u);
    }
    if (m  == n - 1) {
        cout << "YES" << endl;
        return;
    }
    vector <int> vis(n + 1);
    //ex.clear();
    function <void(int, int)> dfs = [&](int u, int fa) {
        vis[u]++;

        for (auto v : G[u]) {
            if (v == fa) continue;
			/*
            if (ex.find(std::make_pair(u, v)) == ex.end())
                ex[std::make_pair(u, v)] =
                    ex[std::make_pair(v, u)] = 1;
            else continue;
			*/
            if (vis[v]) {
                vis[v]++;
                continue;
            }

            dfs(v, u);
        }
    };
    dfs(1, 1);
    int allnum = 0;
    int rt = 0;

    for (int i = n; i >= 1; i--) {
        in[i] = 0;

        //fprintf(stderr,"%d\n",vis[i]);
        if (vis[i] >= 2)allnum++, rt = i;

        if (vis[i] > 2) {
            cout << "NO" << endl;
            return;
        }
    }

    if (allnum / 2 >= 2) {
        cout << "NO" << endl;
        return;
    }

    ed.clear();
    //fprintf(stderr,"%d\n",rt);
    dfs2(rt, rt, rt);


    // for (auto x : ed) {
    //     cout << x << endl;
    // }

    // cout << ed.size() << endl;

    if (ed.size() % 2 == 0) {
		
        // cout << "!!!!" << endl;
        Hash H0 = {0, 0, 0};
        Hash H1 = {0, 0, 0};

        for (int i = 0; i < ed.size(); i += 2) {
            int u1 = ed[i], u2 = ed[i + 1];
            calc(u1, u1);
			if(tt == 35410) std::cout << u1 << " " << u2 << " ";
            //fprintf(stderr,"! %d %d %llu\n",u, has[u].len, has[u].h);
            if (H0.len == 0) {
                H0 = has[u1];
            } else {
                if (!(H0 == has[u1])) {
                    printf("NO\n");
                    return;
                }
            }

            calc(u2, u2);

            //fprintf(stderr,"! %d %d %llu\n",u, has[u].len, has[u].h);
            if (H1.len == 0) {
                H1 = has[u2];
            } else {
                if (!(H1 == has[u2])) {
                    printf("NO\n");
                    return;
                }
            }
        }
			if(tt == 35410){
				std::cout << endl;
				return;
			}
		
    } else {
        Hash H0 = {0, 0, 0};

        for (int u : ed) {
            calc(u, u);

            //fprintf(stderr,"! %d %d %llu\n",u, has[u].len, has[u].h);
            if (H0.len == 0) {
                H0 = has[u];
            } else {
                if (!(H0 == has[u])) {
                    printf("NO\n");
                    return;
                }
            }
        }
    }

    printf("YES\n");
}
std::mt19937 rd(time(0) + clock() +114514);
signed main() {
 //   freopen("a.in", "r", stdin);
  //  freopen("a.out", "w", stdout);

    int T = 1;
    cin >> T;
    P[0] = 0;

    for (int i = 1; i <= N * 2; ++i) {
        P[i] = P[i - 1] * p;
    }
    pp = (int)rd() + 1;
    mod = (int)rd() + 1;
    if(pp > mod) std::swap(pp, mod);
    PP[0] = 0;

    for (int i = 1; i <= N * 2; ++i) {
        PP[i] = (i64)PP[i - 1] * pp % mod;
    }



    for (int i = 1; i <= T; i++) {
        solve(i);
    }



    return 0;
}
/*
1
6 6
1 2
2 3
2 4
3 5
4 5
5 6

*/
Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 10000kb

input:

4
7 6
1 2
2 3
3 4
4 5
5 6
3 7
3 3
1 2
2 3
3 1
5 5
1 2
2 3
3 4
4 1
1 5
1 0

output:

YES
YES
NO
YES

result:

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

Test #2:

score: 0
Accepted
time: 129ms
memory: 10736kb

input:

33192
2 1
1 2
3 2
1 3
2 3
3 3
1 2
1 3
2 3
4 3
1 4
2 4
3 4
4 3
1 3
1 4
2 4
4 4
1 3
1 4
2 4
3 4
4 4
1 3
1 4
2 3
2 4
4 5
1 3
1 4
2 3
2 4
3 4
4 6
1 2
1 3
1 4
2 3
2 4
3 4
5 4
1 5
2 5
3 5
4 5
5 4
1 4
1 5
2 5
3 5
5 5
1 4
1 5
2 5
3 5
4 5
5 5
1 4
1 5
2 4
3 5
4 5
5 5
1 4
1 5
2 4
2 5
3 5
5 6
1 4
1 5
2 4
2 5
3 ...

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
YES
NO
NO
NO
NO
NO
YES
NO
NO
NO
YES
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
YES
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO...

result:

ok 33192 token(s): yes count is 58, no count is 33134

Test #3:

score: 0
Accepted
time: 167ms
memory: 9564kb

input:

40000
9 24
1 4
1 6
1 7
1 9
2 5
2 7
2 8
2 9
3 5
3 7
3 8
3 9
4 6
4 8
4 9
5 6
5 8
5 9
6 7
6 8
6 9
7 8
7 9
8 9
9 21
1 4
1 6
1 7
1 8
2 5
2 7
2 8
2 9
3 5
3 7
3 9
4 6
4 8
4 9
5 6
5 9
6 7
6 8
6 9
7 8
8 9
9 21
1 4
1 6
1 7
1 8
2 5
2 7
2 8
2 9
3 5
3 7
3 9
4 6
4 8
4 9
5 6
5 9
6 7
6 8
6 9
7 8
7 9
9 22
1 4
1 6
1 ...

output:

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
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
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
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
...

result:

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

Test #4:

score: 0
Accepted
time: 147ms
memory: 9420kb

input:

40000
9 16
1 4
1 6
1 8
1 9
2 5
2 7
2 8
2 9
3 6
3 7
4 7
5 8
6 9
7 8
7 9
8 9
9 16
1 4
1 6
1 8
1 9
2 5
2 7
2 8
2 9
3 6
3 7
4 7
5 8
5 9
7 8
7 9
8 9
9 16
1 4
1 6
1 8
1 9
2 5
2 7
2 8
2 9
3 6
3 7
4 7
5 8
5 9
6 9
7 8
8 9
9 16
1 4
1 6
1 8
1 9
2 5
2 7
2 8
2 9
3 6
3 7
4 7
5 8
5 9
6 9
7 8
7 9
9 17
1 4
1 6
1 8
1...

output:

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
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
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
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
...

result:

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

Test #5:

score: 0
Accepted
time: 144ms
memory: 10200kb

input:

40000
9 17
1 5
1 6
1 7
1 8
2 5
2 7
2 9
3 6
3 8
3 9
4 7
4 8
4 9
5 7
5 8
5 9
6 9
9 18
1 5
1 6
1 7
1 8
2 5
2 7
2 9
3 6
3 8
3 9
4 7
4 8
4 9
5 7
5 8
5 9
6 9
8 9
9 18
1 5
1 6
1 7
1 8
2 5
2 7
2 9
3 6
3 8
3 9
4 7
4 8
4 9
5 7
5 8
5 9
6 9
7 9
9 19
1 5
1 6
1 7
1 8
2 5
2 7
2 9
3 6
3 8
3 9
4 7
4 8
4 9
5 7
5 8
5 ...

output:

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
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
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
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
...

result:

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

Test #6:

score: 0
Accepted
time: 132ms
memory: 9676kb

input:

40000
9 17
1 5
1 6
1 7
1 8
2 6
2 7
2 8
2 9
3 7
3 9
4 9
5 8
6 7
6 8
6 9
7 9
8 9
9 16
1 5
1 6
1 7
1 8
2 6
2 7
2 8
2 9
3 7
3 9
4 9
5 8
5 9
6 7
6 8
8 9
9 16
1 5
1 6
1 7
1 8
2 6
2 7
2 8
2 9
3 7
3 9
4 9
5 8
5 9
6 7
6 8
7 9
9 17
1 5
1 6
1 7
1 8
2 6
2 7
2 8
2 9
3 7
3 9
4 9
5 8
5 9
6 7
6 8
7 9
8 9
9 17
1 5
1...

output:

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
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
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
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
...

result:

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

Test #7:

score: 0
Accepted
time: 111ms
memory: 10408kb

input:

40000
9 15
1 5
1 8
1 9
2 6
2 7
2 9
3 6
3 7
4 7
4 8
4 9
5 8
6 9
7 9
8 9
9 13
1 5
1 8
1 9
2 6
2 7
2 9
3 6
3 7
4 7
4 8
4 9
5 8
5 9
9 14
1 5
1 8
1 9
2 6
2 7
2 9
3 6
3 7
4 7
4 8
4 9
5 8
5 9
8 9
9 14
1 5
1 8
1 9
2 6
2 7
2 9
3 6
3 7
4 7
4 8
4 9
5 8
5 9
7 9
9 15
1 5
1 8
1 9
2 6
2 7
2 9
3 6
3 7
4 7
4 8
4 9
5...

output:

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
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
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
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
...

result:

ok 40000 token(s): yes count is 1, no count is 39999

Test #8:

score: 0
Accepted
time: 132ms
memory: 10704kb

input:

40000
9 8
1 9
2 9
3 9
4 9
5 9
6 9
7 9
8 9
9 8
1 8
1 9
2 9
3 9
4 9
5 9
6 9
7 9
9 9
1 8
1 9
2 9
3 9
4 9
5 9
6 9
7 9
8 9
9 8
1 8
2 8
3 9
4 9
5 9
6 9
7 9
8 9
9 8
1 8
1 9
2 8
3 9
4 9
5 9
6 9
7 9
9 9
1 8
1 9
2 8
3 9
4 9
5 9
6 9
7 9
8 9
9 9
1 8
1 9
2 8
2 9
3 9
4 9
5 9
6 9
7 9
9 10
1 8
1 9
2 8
2 9
3 9
4 9
5...

output:

YES
YES
NO
YES
YES
NO
NO
NO
YES
YES
NO
NO
NO
NO
NO
YES
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
YES
NO
NO
YES
NO
YES
NO
NO
NO
NO
NO
NO
NO
YES
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
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
YES
NO
YES
NO
NO
NO
N...

result:

ok 40000 token(s): yes count is 50, no count is 39950

Test #9:

score: 0
Accepted
time: 77ms
memory: 9876kb

input:

1393
25 100
1 2
1 3
1 4
1 5
1 6
1 7
1 8
1 9
2 3
2 4
2 5
2 10
2 11
2 12
2 13
3 4
3 5
3 14
3 17
3 18
3 19
4 5
4 15
4 20
4 22
4 23
5 16
5 21
5 24
5 25
6 7
6 8
6 9
6 10
6 14
6 15
6 16
7 8
7 9
7 11
7 17
7 20
7 21
8 9
8 12
8 18
8 22
8 24
9 13
9 19
9 23
9 25
10 11
10 12
10 13
10 14
10 15
10 16
11 12
11 13
...

output:

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
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
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
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
...

result:

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

Test #10:

score: 0
Accepted
time: 173ms
memory: 9772kb

input:

3000
35 280
1 2
1 3
1 4
1 5
1 6
1 7
1 8
1 9
1 10
1 11
1 12
1 13
1 14
1 15
1 16
1 17
2 3
2 4
2 5
2 6
2 7
2 8
2 18
2 19
2 20
2 21
2 22
2 23
2 24
2 25
2 26
3 11
3 12
3 13
3 16
3 17
3 18
3 21
3 24
3 25
3 26
3 27
3 32
3 34
3 35
4 10
4 14
4 15
4 16
4 17
4 19
4 20
4 24
4 25
4 26
4 28
4 31
4 33
4 35
5 9
5 1...

output:

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
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
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
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
...

result:

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

Test #11:

score: 0
Accepted
time: 384ms
memory: 16224kb

input:

30
28171 28170
2482 5158
15414 17513
7825 17196
10171 8545
8850 13596
3314 9296
5490 15625
18905 9569
24135 6453
360 718
65 27875
13734 20008
20072 4447
23395 24852
11440 1818
20672 13049
13770 6079
19115 24044
22134 24300
15787 3053
6462 6652
3200 14184
20621 629
1328 5200
7181 17707
4515 18911
249...

output:

YES
NO
NO
NO
YES
YES
NO
NO
NO
NO
YES
NO
NO
NO
YES
YES
YES
NO
YES
NO
NO
NO
NO
NO
YES
YES
NO
NO
YES
YES

result:

ok 30 token(s): yes count is 12, no count is 18

Test #12:

score: 0
Accepted
time: 362ms
memory: 15664kb

input:

30
3658 3658
1673 1805
115 1360
145 1722
3398 2869
700 3578
2145 60
3563 2682
2957 307
2443 1048
3581 2555
2368 2336
1023 3041
664 412
1950 552
3425 1162
3159 3296
1373 1763
1336 3591
1119 1992
1912 354
3573 3124
1351 1022
3047 2879
2521 1939
1683 1679
1070 1259
1342 1637
732 2576
2167 3067
2742 514...

output:

NO
NO
YES
YES
NO
YES
YES
NO
NO
NO
YES
NO
NO
NO
YES
NO
YES
YES
NO
YES
NO
YES
NO
YES
NO
YES
YES
NO
NO
NO

result:

ok 30 token(s): yes count is 13, no count is 17

Test #13:

score: 0
Accepted
time: 354ms
memory: 15320kb

input:

30
6200 6199
2543 3295
1003 4780
4627 4563
5620 660
1731 3047
1198 3343
3419 4710
2488 3843
3722 4576
752 3212
5313 4025
4612 286
1967 1397
36 2212
1206 928
4689 1268
2831 4376
4334 3028
1040 1514
5636 5331
4257 571
5182 5007
1629 208
2345 3406
5280 4999
2607 2254
6192 1403
5075 3889
3389 5294
3682 ...

output:

YES
NO
YES
YES
YES
NO
YES
NO
NO
NO
YES
NO
NO
YES
NO
YES
NO
NO
YES
YES
YES
NO
NO
YES
YES
YES
NO
YES
NO
YES

result:

ok 30 token(s): yes count is 16, no count is 14

Test #14:

score: 0
Accepted
time: 355ms
memory: 16016kb

input:

30
14491 14490
6052 10994
13301 461
1336 9631
10722 4121
9829 5812
11883 5039
4854 6739
4064 11033
466 6698
2959 4374
3041 3663
5616 3289
458 788
4018 8915
13689 2763
14153 14146
2336 9011
7827 11114
9235 13235
4091 5135
8099 10920
4359 13623
10194 870
3222 11124
13620 2624
4477 7638
12926 10795
506...

output:

YES
YES
NO
NO
YES
NO
NO
NO
YES
NO
YES
NO
YES
YES
YES
YES
NO
NO
YES
YES
YES
YES
YES
YES
YES
YES
NO
YES
NO
NO

result:

ok 30 token(s): yes count is 18, no count is 12

Test #15:

score: 0
Accepted
time: 345ms
memory: 18940kb

input:

30
100000 99999
58634 53166
60069 39545
82578 88227
56874 85747
22905 28646
92672 64752
22373 59305
22541 59348
44095 65942
4988 67515
10343 77755
60473 69842
23600 65125
30620 9705
23682 88606
90443 30376
64660 28469
49987 74473
95538 6848
57849 92719
41776 11339
34932 41927
53269 36288
27451 77680...

output:

YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
NO
YES
NO
NO
YES
YES
NO
NO
NO
YES
YES
NO
NO
NO
NO
NO
NO
NO
YES
YES

result:

ok 30 token(s): yes count is 12, no count is 18

Test #16:

score: 0
Accepted
time: 373ms
memory: 19768kb

input:

30
28822 28821
18849 2213
3904 10406
22000 14733
3382 11686
18120 2209
16720 21313
27796 11273
2151 1627
14221 1730
28679 13010
13611 8540
8923 13036
14093 25113
28268 1341
22450 5687
24407 28379
28185 19130
9949 4590
19825 24477
24266 21368
15658 20039
19834 22900
10711 27768
21931 21505
701 5260
2...

output:

YES
NO
YES
YES
NO
YES
YES
YES
NO
NO
NO
NO
NO
NO
YES
NO
NO
YES
YES
YES
NO
NO
YES
NO
NO
YES
YES
NO
NO
YES

result:

ok 30 token(s): yes count is 14, no count is 16

Test #17:

score: 0
Accepted
time: 356ms
memory: 20300kb

input:

30
94155 94155
59782 9369
85417 55440
49151 38561
70569 2997
58372 92455
55440 13968
23987 25454
31693 59782
28401 47143
70435 87698
29557 80207
71824 24642
52316 53847
52316 49058
26005 29924
42139 19301
57171 76189
41506 59782
41871 88927
2997 10080
41910 83200
52724 3425
55302 18910
72572 45110
6...

output:

NO
YES
NO
YES
YES
NO
YES
NO
NO
YES
YES
NO
YES
NO
YES
NO
YES
YES
NO
YES
YES
YES
NO
NO
YES
NO
NO
NO
NO
NO

result:

ok 30 token(s): yes count is 14, no count is 16

Test #18:

score: -100
Wrong Answer
time: 246ms
memory: 9828kb

input:

100000
8 8
7 6
2 8
4 2
7 1
4 3
7 2
6 3
5 6
19 18
7 19
17 10
16 2
1 17
9 2
13 18
8 13
1 6
2 5
5 3
14 5
15 7
2 13
13 7
2 4
2 12
11 7
13 6
36 35
32 14
3 19
9 27
31 20
3 13
3 20
7 8
20 6
28 33
24 5
17 20
12 20
11 24
18 16
25 20
10 30
36 16
15 3
2 16
21 28
21 24
24 12
34 25
17 1
11 2
6 27
29 7
26 20
5 23...

output:

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

result:

wrong output format YES or NO expected, but 10 found [35410th token]
English 繁體中文 简体中文

Server Time: 2024-12-02 18:33:44 | OpenSource Project