답안 #898218

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
898218	2024-01-04T11:41:24 Z	GrandTiger1729	Joker (BOI20_joker)	C++17	14 / 100	2000 ms	9208 KB

Joker

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

struct DSU
{
    vector<int> rt, sz;
    vector<int> stk;
    DSU(int n)
    {
        rt.resize(n);
        iota(rt.begin(), rt.end(), 0);
        sz.resize(n, 1);
    }
    int find(int u)
    {
        if (u == rt[u])
        {
            return u;
        }
        return find(rt[u]);
    }
    bool same(int u, int v)
    {
        return find(u) == find(v);
    }
    void unite(int u, int v)
    {
        u = find(u), v = find(v);
        if (u == v)
        {
            stk.push_back(-1);
            return;
        }
        if (sz[u] > sz[v])
        {
            swap(u, v);
        }
        rt[u] = v;
        sz[v] += sz[u];
        stk.push_back(u);
    }
    void undo()
    {
        int u = stk.back();
        stk.pop_back();
        if (u == -1)
        {
            return;
        }
        int v = rt[u];
        sz[v] -= sz[u];
        rt[u] = u;
    }
};

const int B = 450;
int main()
{
    cin.tie(0)->sync_with_stdio(0);
    int n, m, q;
    cin >> n >> m >> q;
    vector<pair<int, int>> ed(m);
    for (int i = 0; i < m; i++)
    {
        int u, v;
        cin >> u >> v;
        u--, v--;
        ed[i] = make_pair(u, v);
    }
    vector<int> rr(m, -1);
    for (int r = 0; r < m; r++)
    {
        DSU dsu(2 * n);
        bool f = 0;
        for (int i = m - 1; i > r; i--)
        {
            auto [u, v] = ed[i];
            dsu.unite(u, v + n);
            dsu.unite(u + n, v);
            if (dsu.same(u, v))
            {
                f = 1;
                break;
            }
        }
        if (f)
        {
            continue;
        }
        int l = 0;
        while (l <= r)
        {
            auto [u, v] = ed[l];
            dsu.unite(u, v + n);
            dsu.unite(u + n, v);
            if (dsu.same(u, v))
            {
                for (int j = 0; j <= l; j++)
                {
                    dsu.undo();
                    dsu.undo();
                }
                break;
            }
            l++;
        }
        rr[r] = l;
    }
    // for (int b = 0; b * B < m; b++)
    // {
    //     int l1 = b * B, l2 = min(m, (b + 1) * B);
    //     int r = -1;
    //     DSU dsu(2 * n);
    //     for (int i = 0; i < l1; i++)
    //     {
    //         auto [u, v] = ed[i];
    //         dsu.unite(u, v + n);
    //         dsu.unite(u + n, v);
    //         if (dsu.same(u, v))
    //         {
    //             r = i;
    //             break;
    //         }
    //     }
    //     if (r != -1)
    //     {
    //         break;
    //     }
    //     for (int i = l1; i < l2; i++)
    //     {
    //         auto [u, v] = ed[i];
    //         dsu.unite(u, v + n);
    //         dsu.unite(u + n, v);
    //         if (dsu.same(u, v))
    //         {
    //             r = i;
    //             break;
    //         }
    //     }
    //     if (r == -1)
    //     {
    //         r = m - 1;
    //         while (r >= l2)
    //         {
    //             auto [u, v] = ed[r];
    //             dsu.unite(u, v + n);
    //             dsu.unite(u + n, v);
    //             if (dsu.same(u, v))
    //             {
    //                 dsu.undo();
    //                 dsu.undo();
    //                 break;
    //             }
    //             r--;
    //         }
    //         for (int i = m - 1; i > r; i--)
    //         {
    //             dsu.undo();
    //             dsu.undo();
    //         }
    //         for (int i = l1; i < l2; i++)
    //         {
    //             dsu.undo();
    //             dsu.undo();
    //         }
    //     }
    //     else
    //     {
    //         for (int i = l1; i <= r; i++)
    //         {
    //             dsu.undo();
    //             dsu.undo();
    //         }
    //         r = m - 1;
    //     }
    //     for (int i = m - 1; i > r; i--)
    //     {
    //         auto [u, v] = ed[i];
    //         dsu.unite(u, v + n);
    //         dsu.unite(u + n, v);
    //     }
    //     for (int i = r; i >= l1 && !dsu.same(ed[i].first, ed[i].second); i--)
    //     {
    //         int l = l1;
    //         while (l < l2 && l <= i)
    //         {
    //             auto [u, v] = ed[l];
    //             dsu.unite(u, v + n);
    //             dsu.unite(u + n, v);
    //             if (dsu.same(u, v))
    //             {
    //                 for (int j = l1; j <= l; j++)
    //                 {
    //                     dsu.undo();
    //                     dsu.undo();
    //                 }
    //                 break;
    //             }
    //             l++;
    //         }
    //         rr[i] = l;
    //         auto [u, v] = ed[i];
    //         dsu.unite(u, v + n);
    //         dsu.unite(u + n, v);
    //     }
    // }
    while (q--)
    {
        int l, r;
        cin >> l >> r;
        l--, r--;
        cout << (rr[r] >= l ? "NO" : "YES") << '\n';
    }
    return 0;
}

Subtask #1

6.0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	460 KB	Output is correct
8	Correct	1 ms	456 KB	Output is correct
9	Correct	1 ms	344 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	2 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	452 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	344 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct

Subtask #2

8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	460 KB	Output is correct
8	Correct	1 ms	456 KB	Output is correct
9	Correct	1 ms	344 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	2 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	452 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	344 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	13 ms	548 KB	Output is correct
30	Correct	25 ms	348 KB	Output is correct
31	Correct	28 ms	860 KB	Output is correct
32	Correct	16 ms	344 KB	Output is correct
33	Correct	9 ms	348 KB	Output is correct
34	Correct	32 ms	580 KB	Output is correct
35	Correct	36 ms	556 KB	Output is correct
36	Correct	24 ms	544 KB	Output is correct
37	Correct	43 ms	600 KB	Output is correct
38	Correct	48 ms	344 KB	Output is correct
39	Correct	19 ms	348 KB	Output is correct
40	Correct	19 ms	344 KB	Output is correct
41	Correct	19 ms	348 KB	Output is correct
42	Correct	19 ms	348 KB	Output is correct
43	Correct	25 ms	348 KB	Output is correct
44	Correct	25 ms	600 KB	Output is correct
45	Correct	23 ms	348 KB	Output is correct
46	Correct	30 ms	348 KB	Output is correct
47	Correct	25 ms	344 KB	Output is correct
48	Correct	30 ms	348 KB	Output is correct
49	Correct	25 ms	348 KB	Output is correct
50	Correct	27 ms	344 KB	Output is correct
51	Correct	25 ms	348 KB	Output is correct
52	Correct	25 ms	348 KB	Output is correct
53	Correct	27 ms	520 KB	Output is correct
54	Correct	30 ms	344 KB	Output is correct

Subtask #3

0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Execution timed out	2047 ms	6488 KB	Time limit exceeded
4	Halted	0 ms	0 KB	-

Subtask #4

0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	460 KB	Output is correct
8	Correct	1 ms	456 KB	Output is correct
9	Correct	1 ms	344 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	2 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	452 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	344 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Execution timed out	2047 ms	6488 KB	Time limit exceeded
30	Halted	0 ms	0 KB	-

Subtask #5

0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	460 KB	Output is correct
8	Correct	1 ms	456 KB	Output is correct
9	Correct	1 ms	344 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	2 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	452 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	344 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	13 ms	548 KB	Output is correct
30	Correct	25 ms	348 KB	Output is correct
31	Correct	28 ms	860 KB	Output is correct
32	Correct	16 ms	344 KB	Output is correct
33	Correct	9 ms	348 KB	Output is correct
34	Correct	32 ms	580 KB	Output is correct
35	Correct	36 ms	556 KB	Output is correct
36	Correct	24 ms	544 KB	Output is correct
37	Correct	43 ms	600 KB	Output is correct
38	Correct	48 ms	344 KB	Output is correct
39	Correct	19 ms	348 KB	Output is correct
40	Correct	19 ms	344 KB	Output is correct
41	Correct	19 ms	348 KB	Output is correct
42	Correct	19 ms	348 KB	Output is correct
43	Correct	25 ms	348 KB	Output is correct
44	Correct	25 ms	600 KB	Output is correct
45	Correct	23 ms	348 KB	Output is correct
46	Correct	30 ms	348 KB	Output is correct
47	Correct	25 ms	344 KB	Output is correct
48	Correct	30 ms	348 KB	Output is correct
49	Correct	25 ms	348 KB	Output is correct
50	Correct	27 ms	344 KB	Output is correct
51	Correct	25 ms	348 KB	Output is correct
52	Correct	25 ms	348 KB	Output is correct
53	Correct	27 ms	520 KB	Output is correct
54	Correct	30 ms	344 KB	Output is correct
55	Execution timed out	2045 ms	9208 KB	Time limit exceeded
56	Halted	0 ms	0 KB	-

Subtask #6

0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	460 KB	Output is correct
8	Correct	1 ms	456 KB	Output is correct
9	Correct	1 ms	344 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	2 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	452 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	344 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	13 ms	548 KB	Output is correct
30	Correct	25 ms	348 KB	Output is correct
31	Correct	28 ms	860 KB	Output is correct
32	Correct	16 ms	344 KB	Output is correct
33	Correct	9 ms	348 KB	Output is correct
34	Correct	32 ms	580 KB	Output is correct
35	Correct	36 ms	556 KB	Output is correct
36	Correct	24 ms	544 KB	Output is correct
37	Correct	43 ms	600 KB	Output is correct
38	Correct	48 ms	344 KB	Output is correct
39	Correct	19 ms	348 KB	Output is correct
40	Correct	19 ms	344 KB	Output is correct
41	Correct	19 ms	348 KB	Output is correct
42	Correct	19 ms	348 KB	Output is correct
43	Correct	25 ms	348 KB	Output is correct
44	Correct	25 ms	600 KB	Output is correct
45	Correct	23 ms	348 KB	Output is correct
46	Correct	30 ms	348 KB	Output is correct
47	Correct	25 ms	344 KB	Output is correct
48	Correct	30 ms	348 KB	Output is correct
49	Correct	25 ms	348 KB	Output is correct
50	Correct	27 ms	344 KB	Output is correct
51	Correct	25 ms	348 KB	Output is correct
52	Correct	25 ms	348 KB	Output is correct
53	Correct	27 ms	520 KB	Output is correct
54	Correct	30 ms	344 KB	Output is correct
55	Execution timed out	2047 ms	6488 KB	Time limit exceeded
56	Halted	0 ms	0 KB	-