oj.uz

Submission #898698

# Submission time Handle Problem Language Result Execution time Memory
898698 2024-01-05T03:29:49 Z gaga999 Joker (BOI20_joker) C++17
49 / 100
 2000 ms 10320 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];
pii rm[N << 1];
int *qs[B], sz[B], pp[B];

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]);
        sz[l[i] / B]++;
        // qs[l[i] / B].pb(i);
    }
    for (int i = 0; i < B; i++)
        qs[i] = new int[sz[i]];
    for (int i = 0; i < q; i++)
        qs[l[i] / B][pp[l[i] / B]++] = i;
    init(ds, -1);
    for (int t = 0, cl = 0; cl <= m; t++, cl += B)
    {
        sort(qs[t], qs[t] + sz[t], [&](int a, int b)
             { return r[a] > r[b]; });
        bool ok = 0;
        for (int i = 1; i < cl; i++)
        {
            if (ok)
                break;
            if (f(u[i]) == f(v[i]))
                ok = 1;
            else
                add(i);
        }
        int cr = m;
        for (int kk = 0; kk < sz[t]; kk++)
        {
            int i = qs[t][kk];
            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 = max(1, cl); j < l[i]; j++)
                    {
                        if (f(v[j]) == f(u[j]))
                        {
                            an[i] = 1;
                            break;
                        }
                        add(j);
                    }
                    undo(pl);
                }
            }
        }
        undo(-1);
    }
    for (int i = 0; i < q; i++)
        puts(an[i] ? "YES" : "NO");
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 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 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 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 3 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 1 ms 4444 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 4440 KB Output is correct
28 Correct 1 ms 4440 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 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 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 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 3 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 1 ms 4444 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 4440 KB Output is correct
28 Correct 1 ms 4440 KB Output is correct
29 Correct 5 ms 4444 KB Output is correct
30 Correct 3 ms 4444 KB Output is correct
31 Correct 3 ms 4648 KB Output is correct
32 Correct 3 ms 4444 KB Output is correct
33 Correct 2 ms 4444 KB Output is correct
34 Correct 2 ms 4444 KB Output is correct
35 Correct 4 ms 4444 KB Output is correct
36 Correct 3 ms 4444 KB Output is correct
37 Correct 4 ms 4444 KB Output is correct
38 Correct 8 ms 4444 KB Output is correct
39 Correct 4 ms 4444 KB Output is correct
40 Correct 3 ms 4444 KB Output is correct
41 Correct 4 ms 4444 KB Output is correct
42 Correct 3 ms 4444 KB Output is correct
43 Correct 1 ms 4444 KB Output is correct
44 Correct 2 ms 4444 KB Output is correct
45 Correct 2 ms 4440 KB Output is correct
46 Correct 1 ms 4444 KB Output is correct
47 Correct 3 ms 4444 KB Output is correct
48 Correct 3 ms 4444 KB Output is correct
49 Correct 4 ms 4444 KB Output is correct
50 Correct 3 ms 4444 KB Output is correct
51 Correct 3 ms 4444 KB Output is correct
52 Correct 3 ms 4444 KB Output is correct
53 Correct 3 ms 4444 KB Output is correct
54 Correct 4 ms 4444 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 677 ms 9828 KB Output is correct
4 Correct 1064 ms 9824 KB Output is correct
5 Correct 944 ms 9720 KB Output is correct
6 Correct 735 ms 9828 KB Output is correct
7 Correct 695 ms 9824 KB Output is correct
8 Correct 1382 ms 10080 KB Output is correct
9 Correct 1284 ms 10320 KB Output is correct
10 Correct 995 ms 10076 KB Output is correct
11 Correct 823 ms 9824 KB Output is correct
12 Correct 969 ms 10064 KB Output is correct
13 Correct 1308 ms 9824 KB Output is correct
14 Correct 1374 ms 9828 KB Output is correct
15 Correct 1166 ms 10064 KB Output is correct
16 Correct 928 ms 9828 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 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 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 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 3 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 1 ms 4444 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 4440 KB Output is correct
28 Correct 1 ms 4440 KB Output is correct
29 Correct 677 ms 9828 KB Output is correct
30 Correct 1064 ms 9824 KB Output is correct
31 Correct 944 ms 9720 KB Output is correct
32 Correct 735 ms 9828 KB Output is correct
33 Correct 695 ms 9824 KB Output is correct
34 Correct 1382 ms 10080 KB Output is correct
35 Correct 1284 ms 10320 KB Output is correct
36 Correct 995 ms 10076 KB Output is correct
37 Correct 823 ms 9824 KB Output is correct
38 Correct 969 ms 10064 KB Output is correct
39 Correct 1308 ms 9824 KB Output is correct
40 Correct 1374 ms 9828 KB Output is correct
41 Correct 1166 ms 10064 KB Output is correct
42 Correct 928 ms 9828 KB Output is correct
43 Correct 847 ms 10064 KB Output is correct
44 Correct 1172 ms 9828 KB Output is correct
45 Correct 1043 ms 10068 KB Output is correct
46 Correct 823 ms 9828 KB Output is correct
47 Correct 844 ms 9832 KB Output is correct
48 Correct 1325 ms 9932 KB Output is correct
49 Correct 914 ms 10080 KB Output is correct
50 Correct 1051 ms 9828 KB Output is correct
51 Correct 1006 ms 10064 KB Output is correct
52 Correct 1016 ms 9824 KB Output is correct
53 Correct 1537 ms 9820 KB Output is correct
54 Correct 1630 ms 10064 KB Output is correct
55 Correct 1326 ms 9820 KB Output is correct
56 Correct 1166 ms 9824 KB Output is correct

Subtask #5
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 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 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 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 3 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 1 ms 4444 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 4440 KB Output is correct
28 Correct 1 ms 4440 KB Output is correct
29 Correct 5 ms 4444 KB Output is correct
30 Correct 3 ms 4444 KB Output is correct
31 Correct 3 ms 4648 KB Output is correct
32 Correct 3 ms 4444 KB Output is correct
33 Correct 2 ms 4444 KB Output is correct
34 Correct 2 ms 4444 KB Output is correct
35 Correct 4 ms 4444 KB Output is correct
36 Correct 3 ms 4444 KB Output is correct
37 Correct 4 ms 4444 KB Output is correct
38 Correct 8 ms 4444 KB Output is correct
39 Correct 4 ms 4444 KB Output is correct
40 Correct 3 ms 4444 KB Output is correct
41 Correct 4 ms 4444 KB Output is correct
42 Correct 3 ms 4444 KB Output is correct
43 Correct 1 ms 4444 KB Output is correct
44 Correct 2 ms 4444 KB Output is correct
45 Correct 2 ms 4440 KB Output is correct
46 Correct 1 ms 4444 KB Output is correct
47 Correct 3 ms 4444 KB Output is correct
48 Correct 3 ms 4444 KB Output is correct
49 Correct 4 ms 4444 KB Output is correct
50 Correct 3 ms 4444 KB Output is correct
51 Correct 3 ms 4444 KB Output is correct
52 Correct 3 ms 4444 KB Output is correct
53 Correct 3 ms 4444 KB Output is correct
54 Correct 4 ms 4444 KB Output is correct
55 Correct 941 ms 8528 KB Output is correct
56 Execution timed out 2065 ms 8284 KB Time limit exceeded
57 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 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 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 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 3 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 1 ms 4444 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 4440 KB Output is correct
28 Correct 1 ms 4440 KB Output is correct
29 Correct 5 ms 4444 KB Output is correct
30 Correct 3 ms 4444 KB Output is correct
31 Correct 3 ms 4648 KB Output is correct
32 Correct 3 ms 4444 KB Output is correct
33 Correct 2 ms 4444 KB Output is correct
34 Correct 2 ms 4444 KB Output is correct
35 Correct 4 ms 4444 KB Output is correct
36 Correct 3 ms 4444 KB Output is correct
37 Correct 4 ms 4444 KB Output is correct
38 Correct 8 ms 4444 KB Output is correct
39 Correct 4 ms 4444 KB Output is correct
40 Correct 3 ms 4444 KB Output is correct
41 Correct 4 ms 4444 KB Output is correct
42 Correct 3 ms 4444 KB Output is correct
43 Correct 1 ms 4444 KB Output is correct
44 Correct 2 ms 4444 KB Output is correct
45 Correct 2 ms 4440 KB Output is correct
46 Correct 1 ms 4444 KB Output is correct
47 Correct 3 ms 4444 KB Output is correct
48 Correct 3 ms 4444 KB Output is correct
49 Correct 4 ms 4444 KB Output is correct
50 Correct 3 ms 4444 KB Output is correct
51 Correct 3 ms 4444 KB Output is correct
52 Correct 3 ms 4444 KB Output is correct
53 Correct 3 ms 4444 KB Output is correct
54 Correct 4 ms 4444 KB Output is correct
55 Correct 677 ms 9828 KB Output is correct
56 Correct 1064 ms 9824 KB Output is correct
57 Correct 944 ms 9720 KB Output is correct
58 Correct 735 ms 9828 KB Output is correct
59 Correct 695 ms 9824 KB Output is correct
60 Correct 1382 ms 10080 KB Output is correct
61 Correct 1284 ms 10320 KB Output is correct
62 Correct 995 ms 10076 KB Output is correct
63 Correct 823 ms 9824 KB Output is correct
64 Correct 969 ms 10064 KB Output is correct
65 Correct 1308 ms 9824 KB Output is correct
66 Correct 1374 ms 9828 KB Output is correct
67 Correct 1166 ms 10064 KB Output is correct
68 Correct 928 ms 9828 KB Output is correct
69 Correct 847 ms 10064 KB Output is correct
70 Correct 1172 ms 9828 KB Output is correct
71 Correct 1043 ms 10068 KB Output is correct
72 Correct 823 ms 9828 KB Output is correct
73 Correct 844 ms 9832 KB Output is correct
74 Correct 1325 ms 9932 KB Output is correct
75 Correct 914 ms 10080 KB Output is correct
76 Correct 1051 ms 9828 KB Output is correct
77 Correct 1006 ms 10064 KB Output is correct
78 Correct 1016 ms 9824 KB Output is correct
79 Correct 1537 ms 9820 KB Output is correct
80 Correct 1630 ms 10064 KB Output is correct
81 Correct 1326 ms 9820 KB Output is correct
82 Correct 1166 ms 9824 KB Output is correct
83 Correct 941 ms 8528 KB Output is correct
84 Execution timed out 2065 ms 8284 KB Time limit exceeded
85 Halted 0 ms 0 KB -