oj.uz

Submission #699234

# Submission time Handle Problem Language Result Execution time Memory
699234 2023-02-16T08:03:38 Z maomao90 Joker (BOI20_joker) C++17
14 / 100
 2000 ms 9148 KB 
// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
using namespace std;

#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 200005;

int n, m, q;
int u[MAXN], v[MAXN];
vii ql[MAXN];

int p[MAXN], rnk[MAXN];
bool col[MAXN];
viii undostk;
void init() {
    undostk.clear();
    REP (i, 1, n + 1) {
        p[i] = i;
        rnk[i] = 1;
        col[i] = 0;
    }
}
ii findp(int u) {
    if (p[u] == u) {
        return {u, 0};
    }
    auto [tp, c] = findp(p[u]);
    return {tp, c ^ col[u]};
}
bool join(int a, int b) {
    auto [pa, ca] = findp(a);
    auto [pb, cb] = findp(b);
    if (pa == pb) {
        if (ca == cb) {
            return 0;
        }
        undostk.pb({-1, -1, -1});
        return 1;
    }
    if (rnk[pa] < rnk[pb]) {
        swap(pa, pb);
    }
    bool delta = 0;
    if (rnk[pa] == rnk[pb]) {
        delta = 1;
        rnk[pa]++;
    }
    undostk.pb({pa, pb, delta});
    p[pb] = pa;
    col[pb] = ca == cb;
    return 1;
}
void undo() {
    assert(!undostk.empty());
    auto [pa, pb, delta] = undostk.back(); undostk.pop_back();
    if (pa == -1) {
        return;
    }
    p[pb] = pb;
    col[pb] = 0;
    rnk[pa] -= delta;
}

int main() {
#ifndef DEBUG
    ios::sync_with_stdio(0), cin.tie(0);
#endif
    cin >> n >> m >> q;
    REP (i, 1, m + 1) {
        cin >> u[i] >> v[i];
    }
    init();
    REP (i, 0, q) {
        int l, r; cin >> l >> r;
        //ql[l].pb(r);
        while (!undostk.empty()) {
            undo();
        }
        bool pos = 1;
        REP (j, 1, l) {
            if (!join(u[j], v[j])) {
                pos = 0;
                break;
            }
        }
        if (!pos) {
            cout << "YES\n";
            continue;
        }
        REP (j, r + 1, m + 1) {
            if (!join(u[j], v[j])) {
                pos = 0;
                break;
            }
        }
        if (!pos) {
            cout << "YES\n";
            continue;
        }
        cout << "NO\n";
    }
    return 0;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 4 ms 5072 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 4 ms 4948 KB Output is correct
13 Correct 3 ms 5008 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 4960 KB Output is correct
16 Correct 3 ms 4956 KB Output is correct
17 Correct 3 ms 5048 KB Output is correct
18 Correct 3 ms 4952 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 3 ms 4948 KB Output is correct
24 Correct 3 ms 4948 KB Output is correct
25 Correct 3 ms 4948 KB Output is correct
26 Correct 3 ms 4948 KB Output is correct
27 Correct 3 ms 4948 KB Output is correct
28 Correct 3 ms 4948 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 4 ms 5072 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 4 ms 4948 KB Output is correct
13 Correct 3 ms 5008 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 4960 KB Output is correct
16 Correct 3 ms 4956 KB Output is correct
17 Correct 3 ms 5048 KB Output is correct
18 Correct 3 ms 4952 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 3 ms 4948 KB Output is correct
24 Correct 3 ms 4948 KB Output is correct
25 Correct 3 ms 4948 KB Output is correct
26 Correct 3 ms 4948 KB Output is correct
27 Correct 3 ms 4948 KB Output is correct
28 Correct 3 ms 4948 KB Output is correct
29 Correct 41 ms 5088 KB Output is correct
30 Correct 40 ms 5120 KB Output is correct
31 Correct 35 ms 5096 KB Output is correct
32 Correct 24 ms 5092 KB Output is correct
33 Correct 15 ms 5084 KB Output is correct
34 Correct 29 ms 5124 KB Output is correct
35 Correct 48 ms 5116 KB Output is correct
36 Correct 33 ms 5076 KB Output is correct
37 Correct 64 ms 5120 KB Output is correct
38 Correct 75 ms 5076 KB Output is correct
39 Correct 44 ms 5076 KB Output is correct
40 Correct 31 ms 5088 KB Output is correct
41 Correct 31 ms 5092 KB Output is correct
42 Correct 33 ms 5092 KB Output is correct
43 Correct 44 ms 5076 KB Output is correct
44 Correct 47 ms 5096 KB Output is correct
45 Correct 41 ms 5096 KB Output is correct
46 Correct 47 ms 5048 KB Output is correct
47 Correct 38 ms 5080 KB Output is correct
48 Correct 39 ms 5088 KB Output is correct
49 Correct 45 ms 5104 KB Output is correct
50 Correct 46 ms 5124 KB Output is correct
51 Correct 37 ms 5084 KB Output is correct
52 Correct 38 ms 5076 KB Output is correct
53 Correct 39 ms 5076 KB Output is correct
54 Correct 47 ms 5116 KB Output is correct

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Execution timed out 2092 ms 9148 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 4 ms 5072 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 4 ms 4948 KB Output is correct
13 Correct 3 ms 5008 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 4960 KB Output is correct
16 Correct 3 ms 4956 KB Output is correct
17 Correct 3 ms 5048 KB Output is correct
18 Correct 3 ms 4952 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 3 ms 4948 KB Output is correct
24 Correct 3 ms 4948 KB Output is correct
25 Correct 3 ms 4948 KB Output is correct
26 Correct 3 ms 4948 KB Output is correct
27 Correct 3 ms 4948 KB Output is correct
28 Correct 3 ms 4948 KB Output is correct
29 Execution timed out 2092 ms 9148 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #5
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 4 ms 5072 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 4 ms 4948 KB Output is correct
13 Correct 3 ms 5008 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 4960 KB Output is correct
16 Correct 3 ms 4956 KB Output is correct
17 Correct 3 ms 5048 KB Output is correct
18 Correct 3 ms 4952 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 3 ms 4948 KB Output is correct
24 Correct 3 ms 4948 KB Output is correct
25 Correct 3 ms 4948 KB Output is correct
26 Correct 3 ms 4948 KB Output is correct
27 Correct 3 ms 4948 KB Output is correct
28 Correct 3 ms 4948 KB Output is correct
29 Correct 41 ms 5088 KB Output is correct
30 Correct 40 ms 5120 KB Output is correct
31 Correct 35 ms 5096 KB Output is correct
32 Correct 24 ms 5092 KB Output is correct
33 Correct 15 ms 5084 KB Output is correct
34 Correct 29 ms 5124 KB Output is correct
35 Correct 48 ms 5116 KB Output is correct
36 Correct 33 ms 5076 KB Output is correct
37 Correct 64 ms 5120 KB Output is correct
38 Correct 75 ms 5076 KB Output is correct
39 Correct 44 ms 5076 KB Output is correct
40 Correct 31 ms 5088 KB Output is correct
41 Correct 31 ms 5092 KB Output is correct
42 Correct 33 ms 5092 KB Output is correct
43 Correct 44 ms 5076 KB Output is correct
44 Correct 47 ms 5096 KB Output is correct
45 Correct 41 ms 5096 KB Output is correct
46 Correct 47 ms 5048 KB Output is correct
47 Correct 38 ms 5080 KB Output is correct
48 Correct 39 ms 5088 KB Output is correct
49 Correct 45 ms 5104 KB Output is correct
50 Correct 46 ms 5124 KB Output is correct
51 Correct 37 ms 5084 KB Output is correct
52 Correct 38 ms 5076 KB Output is correct
53 Correct 39 ms 5076 KB Output is correct
54 Correct 47 ms 5116 KB Output is correct
55 Execution timed out 2089 ms 9116 KB Time limit exceeded
56 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 4 ms 5072 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 4 ms 4948 KB Output is correct
13 Correct 3 ms 5008 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 4960 KB Output is correct
16 Correct 3 ms 4956 KB Output is correct
17 Correct 3 ms 5048 KB Output is correct
18 Correct 3 ms 4952 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 3 ms 4948 KB Output is correct
24 Correct 3 ms 4948 KB Output is correct
25 Correct 3 ms 4948 KB Output is correct
26 Correct 3 ms 4948 KB Output is correct
27 Correct 3 ms 4948 KB Output is correct
28 Correct 3 ms 4948 KB Output is correct
29 Correct 41 ms 5088 KB Output is correct
30 Correct 40 ms 5120 KB Output is correct
31 Correct 35 ms 5096 KB Output is correct
32 Correct 24 ms 5092 KB Output is correct
33 Correct 15 ms 5084 KB Output is correct
34 Correct 29 ms 5124 KB Output is correct
35 Correct 48 ms 5116 KB Output is correct
36 Correct 33 ms 5076 KB Output is correct
37 Correct 64 ms 5120 KB Output is correct
38 Correct 75 ms 5076 KB Output is correct
39 Correct 44 ms 5076 KB Output is correct
40 Correct 31 ms 5088 KB Output is correct
41 Correct 31 ms 5092 KB Output is correct
42 Correct 33 ms 5092 KB Output is correct
43 Correct 44 ms 5076 KB Output is correct
44 Correct 47 ms 5096 KB Output is correct
45 Correct 41 ms 5096 KB Output is correct
46 Correct 47 ms 5048 KB Output is correct
47 Correct 38 ms 5080 KB Output is correct
48 Correct 39 ms 5088 KB Output is correct
49 Correct 45 ms 5104 KB Output is correct
50 Correct 46 ms 5124 KB Output is correct
51 Correct 37 ms 5084 KB Output is correct
52 Correct 38 ms 5076 KB Output is correct
53 Correct 39 ms 5076 KB Output is correct
54 Correct 47 ms 5116 KB Output is correct
55 Execution timed out 2092 ms 9148 KB Time limit exceeded
56 Halted 0 ms 0 KB -