oj.uz

Submission #898764

# Submission time Handle Problem Language Result Execution time Memory
898764 2024-01-05T05:35:35 Z gaga999 Joker (BOI20_joker) C++17
100 / 100
 1709 ms 15332 KB 
#include <cstdio>
#include <stdio.h>
#include <iostream>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stdlib.h>
#include <cstring>
#include <string.h>
#include <string>
#include <sstream>
#include <assert.h>
#include <climits>
#include <sstream>
#include <numeric>
#include <time.h>
#include <limits.h>
#include <list>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <iomanip>
#include <complex>
#include <chrono>
#include <fstream>
#include <functional>
#include <unistd.h>
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx,avx2,bmi,bmi2,lzcnt,popcnt")
#define lowbit(x) ((x) & -(x))
#define ml(a, b) ((1ll * (a) * (b)) % M)
#define tml(a, b) (a) = ((1ll * (a) * (b)) % M)
#define ad(a, b) ((0ll + (a) + (b)) % M)
#define tad(a, b) (a) = ((0ll + (a) + (b)) % M)
#define mi(a, b) ((0ll + M + (a) - (b)) % M)
#define tmi(a, b) (a) = ((0ll + M + (a) - (b)) % M)
#define tmin(a, b) (a) = min((a), (b))
#define tmax(a, b) (a) = max((a), (b))
#define iter(a) (a).begin(), (a).end()
#define riter(a) (a).rbegin(), (a).rend()
#define init(a, b) memset((a), (b), sizeof(a))
#define cpy(a, b) memcpy((a), (b), sizeof(a))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define pb emplace_back
#define mpr make_pair
#define ls(i) ((i) << 1)
#define rs(i) ((i) << 1 | 1)
#define INF 0x3f3f3f3f
#define NIF 0xc0c0c0c0
#define eps 1e-9
#define F first
#define S second
#define AC cin.tie(0)->sync_with_stdio(0)
using namespace std;
typedef long long llt;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<llt, llt> pll;
typedef complex<double> cd;
// const int M = 998244353;

// random_device rm;
// mt19937 rg(rm());
// default_random_engine rg(rm());
// uniform_int_distribution<int> rd(INT_MIN, INT_MAX);
// uniform_real_distribution<double> rd(0, M_PI);

void db() { cerr << "\n"; }
template <class T, class... U>
void db(T a, U... b) { cerr << a << " ", db(b...); }

inline char gc()
{
    const static int SZ = 1 << 16;
    static char buf[SZ], *p1, *p2;
    if (p1 == p2 && (p2 = buf + fread(p1 = buf, 1, SZ, stdin), p1 == p2))
        return -1;
    return *p1++;
}
void rd() {}
template <typename T, typename... U>
void rd(T &x, U &...y)
{
    x = 0;
    bool f = 0;
    char c = gc();
    while (!isdigit(c))
        f ^= !(c ^ 45), c = gc();
    while (isdigit(c))
        x = (x << 1) + (x << 3) + (c ^ 48), c = gc();
    f && (x = -x), rd(y...);
}

template <typename T>
void prt(T x)
{
    if (x < 0)
        putchar('-'), x = -x;
    if (x > 9)
        prt(x / 10);
    putchar((x % 10) ^ 48);
}

const int N = 2e5 + 5, B = 450;
int u[N], v[N], l[N], r[N], ds[N << 1], ln = -1, n;
bool an[N], vd[N];
pii rm[N << 1];
vector<int> qs[N];

int f(int x)
{
    return ds[x] < 0 ? x : f(ds[x]);
}

inline void mg(int i, int j)
{
    i = f(i), j = f(j);
    if (i != j)
    {
        if (ds[i] > ds[j])
            swap(i, j);
        rm[++ln] = mpr(j, ds[j]);
        ds[i] += ds[j], ds[j] = i;
    }
}

inline void undo(int p)
{
    while (ln > p)
        ds[ds[rm[ln].F]] -= rm[ln].S, ds[rm[ln].F] = rm[ln].S, ln--;
}

inline void add(int i)
{
    mg(u[i], v[i] + n), mg(v[i], u[i] + n);
}

signed main()
{
    int m, q;
    rd(n, m, q);
    for (int i = 1; i <= m; i++)
        rd(u[i], v[i]);
    for (int i = 0; i < q; i++)
    {
        rd(l[i], r[i]);
        qs[l[i] / B].pb(i);
    }
    init(ds, -1);
    for (int t = 0, cl = 0; cl <= m; t++, cl += B)
    {
        sort(iter(qs[t]), [&](int a, int b)
             { return r[a] > r[b]; });
        bool ok = 0;
        for (int i = 0; i < cl; i++)
        {
            if (i <= 0)
                continue;
            if (ok)
                break;
            if (f(u[i]) == f(v[i]))
                ok = 1;
            else
                add(i);
        }
        if (ok)
            break;
        int cr = m;
        for (int i : qs[t])
        {
            vd[i] = 1;
            if (ok)
                an[i] = 1;
            else
            {
                while (cr > r[i])
                {
                    if (f(u[cr]) == f(v[cr]))
                        ok = 1;
                    else
                        add(cr--);
                    if (ok)
                        break;
                }
                if (ok)
                    an[i] = 1;
                else
                {
                    int pl = ln;
                    for (int j = cl; j < l[i]; j++)
                    {
                        if (j <= 0)
                            continue;
                        if (f(v[j]) == f(u[j]))
                        {
                            an[i] = 1;
                            break;
                        }
                        add(j);
                    }
                    undo(pl);
                }
            }
        }
        init(ds, -1), ln = -1;
    }
    for (int i = 0; i < q; i++)
        puts(an[i] || !vd[i] ? "YES" : "NO");
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12892 KB Output is correct
2 Correct 2 ms 12700 KB Output is correct
3 Correct 2 ms 12892 KB Output is correct
4 Correct 2 ms 12892 KB Output is correct
5 Correct 2 ms 12892 KB Output is correct
6 Correct 2 ms 12892 KB Output is correct
7 Correct 2 ms 12888 KB Output is correct
8 Correct 2 ms 12892 KB Output is correct
9 Correct 3 ms 12892 KB Output is correct
10 Correct 2 ms 12892 KB Output is correct
11 Correct 2 ms 12888 KB Output is correct
12 Correct 2 ms 12892 KB Output is correct
13 Correct 2 ms 12892 KB Output is correct
14 Correct 2 ms 12892 KB Output is correct
15 Correct 2 ms 12892 KB Output is correct
16 Correct 2 ms 12892 KB Output is correct
17 Correct 2 ms 12924 KB Output is correct
18 Correct 2 ms 12892 KB Output is correct
19 Correct 2 ms 12892 KB Output is correct
20 Correct 2 ms 12892 KB Output is correct
21 Correct 3 ms 12892 KB Output is correct
22 Correct 3 ms 12892 KB Output is correct
23 Correct 3 ms 12892 KB Output is correct
24 Correct 2 ms 12888 KB Output is correct
25 Correct 3 ms 12892 KB Output is correct
26 Correct 2 ms 12892 KB Output is correct
27 Correct 2 ms 12892 KB Output is correct
28 Correct 2 ms 12892 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12892 KB Output is correct
2 Correct 2 ms 12700 KB Output is correct
3 Correct 2 ms 12892 KB Output is correct
4 Correct 2 ms 12892 KB Output is correct
5 Correct 2 ms 12892 KB Output is correct
6 Correct 2 ms 12892 KB Output is correct
7 Correct 2 ms 12888 KB Output is correct
8 Correct 2 ms 12892 KB Output is correct
9 Correct 3 ms 12892 KB Output is correct
10 Correct 2 ms 12892 KB Output is correct
11 Correct 2 ms 12888 KB Output is correct
12 Correct 2 ms 12892 KB Output is correct
13 Correct 2 ms 12892 KB Output is correct
14 Correct 2 ms 12892 KB Output is correct
15 Correct 2 ms 12892 KB Output is correct
16 Correct 2 ms 12892 KB Output is correct
17 Correct 2 ms 12924 KB Output is correct
18 Correct 2 ms 12892 KB Output is correct
19 Correct 2 ms 12892 KB Output is correct
20 Correct 2 ms 12892 KB Output is correct
21 Correct 3 ms 12892 KB Output is correct
22 Correct 3 ms 12892 KB Output is correct
23 Correct 3 ms 12892 KB Output is correct
24 Correct 2 ms 12888 KB Output is correct
25 Correct 3 ms 12892 KB Output is correct
26 Correct 2 ms 12892 KB Output is correct
27 Correct 2 ms 12892 KB Output is correct
28 Correct 2 ms 12892 KB Output is correct
29 Correct 7 ms 12892 KB Output is correct
30 Correct 5 ms 12892 KB Output is correct
31 Correct 4 ms 12892 KB Output is correct
32 Correct 4 ms 12892 KB Output is correct
33 Correct 3 ms 12892 KB Output is correct
34 Correct 3 ms 12892 KB Output is correct
35 Correct 5 ms 12888 KB Output is correct
36 Correct 4 ms 12892 KB Output is correct
37 Correct 5 ms 12972 KB Output is correct
38 Correct 6 ms 12892 KB Output is correct
39 Correct 5 ms 12888 KB Output is correct
40 Correct 5 ms 12888 KB Output is correct
41 Correct 4 ms 12892 KB Output is correct
42 Correct 4 ms 12976 KB Output is correct
43 Correct 3 ms 12888 KB Output is correct
44 Correct 3 ms 12892 KB Output is correct
45 Correct 3 ms 12892 KB Output is correct
46 Correct 3 ms 12948 KB Output is correct
47 Correct 4 ms 12892 KB Output is correct
48 Correct 4 ms 12892 KB Output is correct
49 Correct 4 ms 12892 KB Output is correct
50 Correct 4 ms 12892 KB Output is correct
51 Correct 5 ms 12892 KB Output is correct
52 Correct 5 ms 12892 KB Output is correct
53 Correct 5 ms 12892 KB Output is correct
54 Correct 5 ms 12892 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12892 KB Output is correct
2 Correct 2 ms 12700 KB Output is correct
3 Correct 184 ms 14832 KB Output is correct
4 Correct 659 ms 15052 KB Output is correct
5 Correct 584 ms 14792 KB Output is correct
6 Correct 210 ms 14824 KB Output is correct
7 Correct 198 ms 14844 KB Output is correct
8 Correct 420 ms 15092 KB Output is correct
9 Correct 334 ms 15048 KB Output is correct
10 Correct 235 ms 15080 KB Output is correct
11 Correct 287 ms 14788 KB Output is correct
12 Correct 234 ms 14788 KB Output is correct
13 Correct 464 ms 14792 KB Output is correct
14 Correct 395 ms 15040 KB Output is correct
15 Correct 266 ms 14832 KB Output is correct
16 Correct 222 ms 14832 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12892 KB Output is correct
2 Correct 2 ms 12700 KB Output is correct
3 Correct 2 ms 12892 KB Output is correct
4 Correct 2 ms 12892 KB Output is correct
5 Correct 2 ms 12892 KB Output is correct
6 Correct 2 ms 12892 KB Output is correct
7 Correct 2 ms 12888 KB Output is correct
8 Correct 2 ms 12892 KB Output is correct
9 Correct 3 ms 12892 KB Output is correct
10 Correct 2 ms 12892 KB Output is correct
11 Correct 2 ms 12888 KB Output is correct
12 Correct 2 ms 12892 KB Output is correct
13 Correct 2 ms 12892 KB Output is correct
14 Correct 2 ms 12892 KB Output is correct
15 Correct 2 ms 12892 KB Output is correct
16 Correct 2 ms 12892 KB Output is correct
17 Correct 2 ms 12924 KB Output is correct
18 Correct 2 ms 12892 KB Output is correct
19 Correct 2 ms 12892 KB Output is correct
20 Correct 2 ms 12892 KB Output is correct
21 Correct 3 ms 12892 KB Output is correct
22 Correct 3 ms 12892 KB Output is correct
23 Correct 3 ms 12892 KB Output is correct
24 Correct 2 ms 12888 KB Output is correct
25 Correct 3 ms 12892 KB Output is correct
26 Correct 2 ms 12892 KB Output is correct
27 Correct 2 ms 12892 KB Output is correct
28 Correct 2 ms 12892 KB Output is correct
29 Correct 184 ms 14832 KB Output is correct
30 Correct 659 ms 15052 KB Output is correct
31 Correct 584 ms 14792 KB Output is correct
32 Correct 210 ms 14824 KB Output is correct
33 Correct 198 ms 14844 KB Output is correct
34 Correct 420 ms 15092 KB Output is correct
35 Correct 334 ms 15048 KB Output is correct
36 Correct 235 ms 15080 KB Output is correct
37 Correct 287 ms 14788 KB Output is correct
38 Correct 234 ms 14788 KB Output is correct
39 Correct 464 ms 14792 KB Output is correct
40 Correct 395 ms 15040 KB Output is correct
41 Correct 266 ms 14832 KB Output is correct
42 Correct 222 ms 14832 KB Output is correct
43 Correct 321 ms 14824 KB Output is correct
44 Correct 881 ms 14844 KB Output is correct
45 Correct 822 ms 14840 KB Output is correct
46 Correct 320 ms 15032 KB Output is correct
47 Correct 334 ms 14788 KB Output is correct
48 Correct 358 ms 15104 KB Output is correct
49 Correct 251 ms 15332 KB Output is correct
50 Correct 473 ms 14788 KB Output is correct
51 Correct 449 ms 14788 KB Output is correct
52 Correct 418 ms 15044 KB Output is correct
53 Correct 685 ms 14840 KB Output is correct
54 Correct 598 ms 14824 KB Output is correct
55 Correct 472 ms 14788 KB Output is correct
56 Correct 414 ms 14824 KB Output is correct

Subtask #5
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12892 KB Output is correct
2 Correct 2 ms 12700 KB Output is correct
3 Correct 2 ms 12892 KB Output is correct
4 Correct 2 ms 12892 KB Output is correct
5 Correct 2 ms 12892 KB Output is correct
6 Correct 2 ms 12892 KB Output is correct
7 Correct 2 ms 12888 KB Output is correct
8 Correct 2 ms 12892 KB Output is correct
9 Correct 3 ms 12892 KB Output is correct
10 Correct 2 ms 12892 KB Output is correct
11 Correct 2 ms 12888 KB Output is correct
12 Correct 2 ms 12892 KB Output is correct
13 Correct 2 ms 12892 KB Output is correct
14 Correct 2 ms 12892 KB Output is correct
15 Correct 2 ms 12892 KB Output is correct
16 Correct 2 ms 12892 KB Output is correct
17 Correct 2 ms 12924 KB Output is correct
18 Correct 2 ms 12892 KB Output is correct
19 Correct 2 ms 12892 KB Output is correct
20 Correct 2 ms 12892 KB Output is correct
21 Correct 3 ms 12892 KB Output is correct
22 Correct 3 ms 12892 KB Output is correct
23 Correct 3 ms 12892 KB Output is correct
24 Correct 2 ms 12888 KB Output is correct
25 Correct 3 ms 12892 KB Output is correct
26 Correct 2 ms 12892 KB Output is correct
27 Correct 2 ms 12892 KB Output is correct
28 Correct 2 ms 12892 KB Output is correct
29 Correct 7 ms 12892 KB Output is correct
30 Correct 5 ms 12892 KB Output is correct
31 Correct 4 ms 12892 KB Output is correct
32 Correct 4 ms 12892 KB Output is correct
33 Correct 3 ms 12892 KB Output is correct
34 Correct 3 ms 12892 KB Output is correct
35 Correct 5 ms 12888 KB Output is correct
36 Correct 4 ms 12892 KB Output is correct
37 Correct 5 ms 12972 KB Output is correct
38 Correct 6 ms 12892 KB Output is correct
39 Correct 5 ms 12888 KB Output is correct
40 Correct 5 ms 12888 KB Output is correct
41 Correct 4 ms 12892 KB Output is correct
42 Correct 4 ms 12976 KB Output is correct
43 Correct 3 ms 12888 KB Output is correct
44 Correct 3 ms 12892 KB Output is correct
45 Correct 3 ms 12892 KB Output is correct
46 Correct 3 ms 12948 KB Output is correct
47 Correct 4 ms 12892 KB Output is correct
48 Correct 4 ms 12892 KB Output is correct
49 Correct 4 ms 12892 KB Output is correct
50 Correct 4 ms 12892 KB Output is correct
51 Correct 5 ms 12892 KB Output is correct
52 Correct 5 ms 12892 KB Output is correct
53 Correct 5 ms 12892 KB Output is correct
54 Correct 5 ms 12892 KB Output is correct
55 Correct 302 ms 13408 KB Output is correct
56 Correct 1477 ms 13416 KB Output is correct
57 Correct 536 ms 13648 KB Output is correct
58 Correct 186 ms 13400 KB Output is correct
59 Correct 386 ms 13648 KB Output is correct
60 Correct 402 ms 13404 KB Output is correct
61 Correct 364 ms 13812 KB Output is correct
62 Correct 403 ms 13404 KB Output is correct
63 Correct 418 ms 13412 KB Output is correct
64 Correct 379 ms 13404 KB Output is correct
65 Correct 446 ms 13416 KB Output is correct

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12892 KB Output is correct
2 Correct 2 ms 12700 KB Output is correct
3 Correct 2 ms 12892 KB Output is correct
4 Correct 2 ms 12892 KB Output is correct
5 Correct 2 ms 12892 KB Output is correct
6 Correct 2 ms 12892 KB Output is correct
7 Correct 2 ms 12888 KB Output is correct
8 Correct 2 ms 12892 KB Output is correct
9 Correct 3 ms 12892 KB Output is correct
10 Correct 2 ms 12892 KB Output is correct
11 Correct 2 ms 12888 KB Output is correct
12 Correct 2 ms 12892 KB Output is correct
13 Correct 2 ms 12892 KB Output is correct
14 Correct 2 ms 12892 KB Output is correct
15 Correct 2 ms 12892 KB Output is correct
16 Correct 2 ms 12892 KB Output is correct
17 Correct 2 ms 12924 KB Output is correct
18 Correct 2 ms 12892 KB Output is correct
19 Correct 2 ms 12892 KB Output is correct
20 Correct 2 ms 12892 KB Output is correct
21 Correct 3 ms 12892 KB Output is correct
22 Correct 3 ms 12892 KB Output is correct
23 Correct 3 ms 12892 KB Output is correct
24 Correct 2 ms 12888 KB Output is correct
25 Correct 3 ms 12892 KB Output is correct
26 Correct 2 ms 12892 KB Output is correct
27 Correct 2 ms 12892 KB Output is correct
28 Correct 2 ms 12892 KB Output is correct
29 Correct 7 ms 12892 KB Output is correct
30 Correct 5 ms 12892 KB Output is correct
31 Correct 4 ms 12892 KB Output is correct
32 Correct 4 ms 12892 KB Output is correct
33 Correct 3 ms 12892 KB Output is correct
34 Correct 3 ms 12892 KB Output is correct
35 Correct 5 ms 12888 KB Output is correct
36 Correct 4 ms 12892 KB Output is correct
37 Correct 5 ms 12972 KB Output is correct
38 Correct 6 ms 12892 KB Output is correct
39 Correct 5 ms 12888 KB Output is correct
40 Correct 5 ms 12888 KB Output is correct
41 Correct 4 ms 12892 KB Output is correct
42 Correct 4 ms 12976 KB Output is correct
43 Correct 3 ms 12888 KB Output is correct
44 Correct 3 ms 12892 KB Output is correct
45 Correct 3 ms 12892 KB Output is correct
46 Correct 3 ms 12948 KB Output is correct
47 Correct 4 ms 12892 KB Output is correct
48 Correct 4 ms 12892 KB Output is correct
49 Correct 4 ms 12892 KB Output is correct
50 Correct 4 ms 12892 KB Output is correct
51 Correct 5 ms 12892 KB Output is correct
52 Correct 5 ms 12892 KB Output is correct
53 Correct 5 ms 12892 KB Output is correct
54 Correct 5 ms 12892 KB Output is correct
55 Correct 184 ms 14832 KB Output is correct
56 Correct 659 ms 15052 KB Output is correct
57 Correct 584 ms 14792 KB Output is correct
58 Correct 210 ms 14824 KB Output is correct
59 Correct 198 ms 14844 KB Output is correct
60 Correct 420 ms 15092 KB Output is correct
61 Correct 334 ms 15048 KB Output is correct
62 Correct 235 ms 15080 KB Output is correct
63 Correct 287 ms 14788 KB Output is correct
64 Correct 234 ms 14788 KB Output is correct
65 Correct 464 ms 14792 KB Output is correct
66 Correct 395 ms 15040 KB Output is correct
67 Correct 266 ms 14832 KB Output is correct
68 Correct 222 ms 14832 KB Output is correct
69 Correct 321 ms 14824 KB Output is correct
70 Correct 881 ms 14844 KB Output is correct
71 Correct 822 ms 14840 KB Output is correct
72 Correct 320 ms 15032 KB Output is correct
73 Correct 334 ms 14788 KB Output is correct
74 Correct 358 ms 15104 KB Output is correct
75 Correct 251 ms 15332 KB Output is correct
76 Correct 473 ms 14788 KB Output is correct
77 Correct 449 ms 14788 KB Output is correct
78 Correct 418 ms 15044 KB Output is correct
79 Correct 685 ms 14840 KB Output is correct
80 Correct 598 ms 14824 KB Output is correct
81 Correct 472 ms 14788 KB Output is correct
82 Correct 414 ms 14824 KB Output is correct
83 Correct 302 ms 13408 KB Output is correct
84 Correct 1477 ms 13416 KB Output is correct
85 Correct 536 ms 13648 KB Output is correct
86 Correct 186 ms 13400 KB Output is correct
87 Correct 386 ms 13648 KB Output is correct
88 Correct 402 ms 13404 KB Output is correct
89 Correct 364 ms 13812 KB Output is correct
90 Correct 403 ms 13404 KB Output is correct
91 Correct 418 ms 13412 KB Output is correct
92 Correct 379 ms 13404 KB Output is correct
93 Correct 446 ms 13416 KB Output is correct
94 Correct 468 ms 14940 KB Output is correct
95 Correct 1709 ms 14956 KB Output is correct
96 Correct 771 ms 15188 KB Output is correct
97 Correct 347 ms 15188 KB Output is correct
98 Correct 356 ms 14948 KB Output is correct
99 Correct 424 ms 15188 KB Output is correct
100 Correct 299 ms 15188 KB Output is correct
101 Correct 514 ms 15196 KB Output is correct
102 Correct 594 ms 14936 KB Output is correct
103 Correct 701 ms 14944 KB Output is correct
104 Correct 664 ms 14924 KB Output is correct
105 Correct 620 ms 14956 KB Output is correct
106 Correct 693 ms 14928 KB Output is correct
107 Correct 531 ms 14784 KB Output is correct
108 Correct 655 ms 15024 KB Output is correct
109 Correct 680 ms 14928 KB Output is correct
110 Correct 683 ms 14928 KB Output is correct
111 Correct 683 ms 14944 KB Output is correct
112 Correct 699 ms 14952 KB Output is correct
113 Correct 688 ms 15188 KB Output is correct
114 Correct 695 ms 14932 KB Output is correct
115 Correct 692 ms 15188 KB Output is correct
116 Correct 690 ms 14992 KB Output is correct