oj.uz

Submission #898829

# Submission time Handle Problem Language Result Execution time Memory
898829 2024-01-05T07:20:47 Z gaga999 Joker (BOI20_joker) C++17
100 / 100
 113 ms 11124 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;
int u[N], v[N], an[N], ds[N << 1], ln = -1, n;
pii rm[N << 1];

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);
}

void slv(int l, int r, int qr)
{
    if (l > r)
        return;
    int md = (l + r) >> 1, pln = ln;
    for (int i = max(1, l); i <= md; i++)
    {
        if (f(u[i]) == f(v[i]))
        {
            fill(an + i, an + r + 1, qr);
            undo(pln), slv(l, i - 1, qr);
            return;
        }
        else
            add(i);
    }
    slv(md + 1, r, qr);
    for (int i = qr - 1; i > md; i--)
    {
        if (f(u[i]) == f(v[i]))
        {
            an[md] = i, undo(pln);
            for (int j = qr - 1; j > i; j--)
                add(j);
            slv(l, md - 1, i + 1), undo(pln);
            return;
        }
        else
            add(i);
    }
}

signed main()
{
    int m, q, l, r;
    rd(n, m, q);
    for (int i = 1; i <= m; i++)
        rd(u[i], v[i]);
    init(ds, -1);
    slv(0, m, m + 1);
    while (q--)
        rd(l, r), puts(r < an[l - 1] ? "YES" : "NO");
}

Subtask #1
6.0 / 6.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4696 KB Output is correct
3 Correct 54 ms 8048 KB Output is correct
4 Correct 17 ms 8048 KB Output is correct
5 Correct 50 ms 8044 KB Output is correct
6 Correct 53 ms 10292 KB Output is correct
7 Correct 48 ms 10324 KB Output is correct
8 Correct 77 ms 10324 KB Output is correct
9 Correct 78 ms 10604 KB Output is correct
10 Correct 112 ms 10572 KB Output is correct
11 Correct 70 ms 10324 KB Output is correct
12 Correct 78 ms 10608 KB Output is correct
13 Correct 93 ms 10320 KB Output is correct
14 Correct 72 ms 10292 KB Output is correct
15 Correct 110 ms 10528 KB Output is correct
16 Correct 107 ms 10576 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4696 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4448 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4440 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4440 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4492 KB Output is correct
24 Correct 1 ms 4440 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 1 ms 4444 KB Output is correct
27 Correct 1 ms 4472 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 54 ms 8048 KB Output is correct
30 Correct 17 ms 8048 KB Output is correct
31 Correct 50 ms 8044 KB Output is correct
32 Correct 53 ms 10292 KB Output is correct
33 Correct 48 ms 10324 KB Output is correct
34 Correct 77 ms 10324 KB Output is correct
35 Correct 78 ms 10604 KB Output is correct
36 Correct 112 ms 10572 KB Output is correct
37 Correct 70 ms 10324 KB Output is correct
38 Correct 78 ms 10608 KB Output is correct
39 Correct 93 ms 10320 KB Output is correct
40 Correct 72 ms 10292 KB Output is correct
41 Correct 110 ms 10528 KB Output is correct
42 Correct 107 ms 10576 KB Output is correct
43 Correct 53 ms 10580 KB Output is correct
44 Correct 20 ms 10324 KB Output is correct
45 Correct 105 ms 11092 KB Output is correct
46 Correct 51 ms 10576 KB Output is correct
47 Correct 46 ms 10576 KB Output is correct
48 Correct 89 ms 10576 KB Output is correct
49 Correct 113 ms 10580 KB Output is correct
50 Correct 73 ms 10844 KB Output is correct
51 Correct 76 ms 10832 KB Output is correct
52 Correct 81 ms 10956 KB Output is correct
53 Correct 103 ms 10588 KB Output is correct
54 Correct 93 ms 10592 KB Output is correct
55 Correct 105 ms 10836 KB Output is correct
56 Correct 102 ms 10848 KB Output is correct

Subtask #5
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4696 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4448 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4440 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4440 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4492 KB Output is correct
24 Correct 1 ms 4440 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 1 ms 4444 KB Output is correct
27 Correct 1 ms 4472 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 1 ms 4440 KB Output is correct
30 Correct 2 ms 4444 KB Output is correct
31 Correct 1 ms 4444 KB Output is correct
32 Correct 1 ms 4444 KB Output is correct
33 Correct 1 ms 4444 KB Output is correct
34 Correct 2 ms 4580 KB Output is correct
35 Correct 2 ms 4576 KB Output is correct
36 Correct 1 ms 4444 KB Output is correct
37 Correct 1 ms 4444 KB Output is correct
38 Correct 1 ms 4444 KB Output is correct
39 Correct 1 ms 4444 KB Output is correct
40 Correct 1 ms 4444 KB Output is correct
41 Correct 1 ms 4444 KB Output is correct
42 Correct 1 ms 4440 KB Output is correct
43 Correct 1 ms 4580 KB Output is correct
44 Correct 2 ms 4440 KB Output is correct
45 Correct 1 ms 4444 KB Output is correct
46 Correct 2 ms 4444 KB Output is correct
47 Correct 2 ms 4444 KB Output is correct
48 Correct 2 ms 4444 KB Output is correct
49 Correct 2 ms 4440 KB Output is correct
50 Correct 2 ms 4576 KB Output is correct
51 Correct 1 ms 4444 KB Output is correct
52 Correct 1 ms 4444 KB Output is correct
53 Correct 2 ms 4444 KB Output is correct
54 Correct 1 ms 4440 KB Output is correct
55 Correct 47 ms 9296 KB Output is correct
56 Correct 12 ms 9296 KB Output is correct
57 Correct 40 ms 9312 KB Output is correct
58 Correct 45 ms 9316 KB Output is correct
59 Correct 78 ms 9316 KB Output is correct
60 Correct 100 ms 9312 KB Output is correct
61 Correct 87 ms 9308 KB Output is correct
62 Correct 72 ms 9300 KB Output is correct
63 Correct 65 ms 9052 KB Output is correct
64 Correct 84 ms 9296 KB Output is correct
65 Correct 97 ms 9312 KB Output is correct

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4696 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4448 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4440 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4440 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4492 KB Output is correct
24 Correct 1 ms 4440 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 1 ms 4444 KB Output is correct
27 Correct 1 ms 4472 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 1 ms 4440 KB Output is correct
30 Correct 2 ms 4444 KB Output is correct
31 Correct 1 ms 4444 KB Output is correct
32 Correct 1 ms 4444 KB Output is correct
33 Correct 1 ms 4444 KB Output is correct
34 Correct 2 ms 4580 KB Output is correct
35 Correct 2 ms 4576 KB Output is correct
36 Correct 1 ms 4444 KB Output is correct
37 Correct 1 ms 4444 KB Output is correct
38 Correct 1 ms 4444 KB Output is correct
39 Correct 1 ms 4444 KB Output is correct
40 Correct 1 ms 4444 KB Output is correct
41 Correct 1 ms 4444 KB Output is correct
42 Correct 1 ms 4440 KB Output is correct
43 Correct 1 ms 4580 KB Output is correct
44 Correct 2 ms 4440 KB Output is correct
45 Correct 1 ms 4444 KB Output is correct
46 Correct 2 ms 4444 KB Output is correct
47 Correct 2 ms 4444 KB Output is correct
48 Correct 2 ms 4444 KB Output is correct
49 Correct 2 ms 4440 KB Output is correct
50 Correct 2 ms 4576 KB Output is correct
51 Correct 1 ms 4444 KB Output is correct
52 Correct 1 ms 4444 KB Output is correct
53 Correct 2 ms 4444 KB Output is correct
54 Correct 1 ms 4440 KB Output is correct
55 Correct 54 ms 8048 KB Output is correct
56 Correct 17 ms 8048 KB Output is correct
57 Correct 50 ms 8044 KB Output is correct
58 Correct 53 ms 10292 KB Output is correct
59 Correct 48 ms 10324 KB Output is correct
60 Correct 77 ms 10324 KB Output is correct
61 Correct 78 ms 10604 KB Output is correct
62 Correct 112 ms 10572 KB Output is correct
63 Correct 70 ms 10324 KB Output is correct
64 Correct 78 ms 10608 KB Output is correct
65 Correct 93 ms 10320 KB Output is correct
66 Correct 72 ms 10292 KB Output is correct
67 Correct 110 ms 10528 KB Output is correct
68 Correct 107 ms 10576 KB Output is correct
69 Correct 53 ms 10580 KB Output is correct
70 Correct 20 ms 10324 KB Output is correct
71 Correct 105 ms 11092 KB Output is correct
72 Correct 51 ms 10576 KB Output is correct
73 Correct 46 ms 10576 KB Output is correct
74 Correct 89 ms 10576 KB Output is correct
75 Correct 113 ms 10580 KB Output is correct
76 Correct 73 ms 10844 KB Output is correct
77 Correct 76 ms 10832 KB Output is correct
78 Correct 81 ms 10956 KB Output is correct
79 Correct 103 ms 10588 KB Output is correct
80 Correct 93 ms 10592 KB Output is correct
81 Correct 105 ms 10836 KB Output is correct
82 Correct 102 ms 10848 KB Output is correct
83 Correct 47 ms 9296 KB Output is correct
84 Correct 12 ms 9296 KB Output is correct
85 Correct 40 ms 9312 KB Output is correct
86 Correct 45 ms 9316 KB Output is correct
87 Correct 78 ms 9316 KB Output is correct
88 Correct 100 ms 9312 KB Output is correct
89 Correct 87 ms 9308 KB Output is correct
90 Correct 72 ms 9300 KB Output is correct
91 Correct 65 ms 9052 KB Output is correct
92 Correct 84 ms 9296 KB Output is correct
93 Correct 97 ms 9312 KB Output is correct
94 Correct 54 ms 10972 KB Output is correct
95 Correct 94 ms 10848 KB Output is correct
96 Correct 54 ms 10832 KB Output is correct
97 Correct 47 ms 10832 KB Output is correct
98 Correct 51 ms 10844 KB Output is correct
99 Correct 81 ms 11088 KB Output is correct
100 Correct 83 ms 11088 KB Output is correct
101 Correct 73 ms 10944 KB Output is correct
102 Correct 97 ms 10832 KB Output is correct
103 Correct 101 ms 10916 KB Output is correct
104 Correct 83 ms 10836 KB Output is correct
105 Correct 106 ms 10988 KB Output is correct
106 Correct 106 ms 11012 KB Output is correct
107 Correct 37 ms 11124 KB Output is correct
108 Correct 55 ms 10856 KB Output is correct
109 Correct 52 ms 10852 KB Output is correct
110 Correct 53 ms 10836 KB Output is correct
111 Correct 52 ms 10832 KB Output is correct
112 Correct 57 ms 11044 KB Output is correct
113 Correct 52 ms 10852 KB Output is correct
114 Correct 51 ms 10836 KB Output is correct
115 Correct 60 ms 10836 KB Output is correct
116 Correct 51 ms 10872 KB Output is correct