oj.uz

답안 #699228

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
699228 2023-02-16T07:43:08 Z maomao90 Joker (BOI20_joker) C++17
14 / 100
 2000 ms 9676 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];

bool pos;
int p[MAXN], rnk[MAXN];
bool col[MAXN];
void init() {
    pos = 1;
    REP (i, 1, n + 1) {
        p[i] = i;
        rnk[i] = 1;
        col[i] = 0;
    }
}
int findp(int u) {
    if (p[u] == u) {
        return u;
    }
    int op = p[u];
    p[u] = findp(p[u]);
    col[u] ^= col[op];
    return p[u];
}
void join(int a, int b) {
    int pa = findp(a), pb = findp(b);
    if (pa == pb) {
        if (col[a] == col[b]) {
            pos = 0;
        }
        return;
    }
    if (rnk[pa] < rnk[pb]) {
        swap(pa, pb);
        swap(a, b);
    }
    if (rnk[pa] == rnk[pb]) {
        rnk[pa]++;
    }
    p[pb] = pa;
    col[pb] = col[a] == col[b];
}

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];
    }
    REP (i, 0, q) {
        int l, r; cin >> l >> r;
        //ql[l].pb(r);
        init();
        REP (j, 1, l) {
            join(u[j], v[j]);
            if (!pos) {
                break;
            }
        }
        if (!pos) {
            cout << "YES\n";
            continue;
        }
        REP (j, r + 1, m + 1) {
            join(u[j], v[j]);
            if (!pos) {
                break;
            }
        }
        if (!pos) {
            cout << "YES\n";
            continue;
        }
        cout << "NO\n";
    }
    return 0;
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 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 5028 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 5076 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 5032 KB Output is correct
16 Correct 3 ms 5032 KB Output is correct
17 Correct 3 ms 5032 KB Output is correct
18 Correct 3 ms 4948 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 5036 KB Output is correct
23 Correct 3 ms 4948 KB Output is correct
24 Correct 3 ms 5032 KB Output is correct
25 Correct 3 ms 5036 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 5032 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 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 5028 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 5076 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 5032 KB Output is correct
16 Correct 3 ms 5032 KB Output is correct
17 Correct 3 ms 5032 KB Output is correct
18 Correct 3 ms 4948 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 5036 KB Output is correct
23 Correct 3 ms 4948 KB Output is correct
24 Correct 3 ms 5032 KB Output is correct
25 Correct 3 ms 5036 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 5032 KB Output is correct
29 Correct 27 ms 5092 KB Output is correct
30 Correct 26 ms 5076 KB Output is correct
31 Correct 24 ms 5076 KB Output is correct
32 Correct 15 ms 5104 KB Output is correct
33 Correct 10 ms 5076 KB Output is correct
34 Correct 22 ms 5076 KB Output is correct
35 Correct 30 ms 5096 KB Output is correct
36 Correct 21 ms 5100 KB Output is correct
37 Correct 39 ms 5104 KB Output is correct
38 Correct 45 ms 5112 KB Output is correct
39 Correct 30 ms 5104 KB Output is correct
40 Correct 21 ms 5076 KB Output is correct
41 Correct 21 ms 5080 KB Output is correct
42 Correct 24 ms 5104 KB Output is correct
43 Correct 27 ms 5076 KB Output is correct
44 Correct 27 ms 5108 KB Output is correct
45 Correct 26 ms 5076 KB Output is correct
46 Correct 28 ms 5108 KB Output is correct
47 Correct 21 ms 5076 KB Output is correct
48 Correct 23 ms 5076 KB Output is correct
49 Correct 26 ms 5096 KB Output is correct
50 Correct 28 ms 5076 KB Output is correct
51 Correct 22 ms 5076 KB Output is correct
52 Correct 23 ms 5108 KB Output is correct
53 Correct 24 ms 5076 KB Output is correct
54 Correct 30 ms 5092 KB Output is correct

Subtask #3
0 / 25.0

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

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 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 5028 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 5076 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 5032 KB Output is correct
16 Correct 3 ms 5032 KB Output is correct
17 Correct 3 ms 5032 KB Output is correct
18 Correct 3 ms 4948 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 5036 KB Output is correct
23 Correct 3 ms 4948 KB Output is correct
24 Correct 3 ms 5032 KB Output is correct
25 Correct 3 ms 5036 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 5032 KB Output is correct
29 Execution timed out 2086 ms 7536 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #5
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 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 5028 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 5076 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 5032 KB Output is correct
16 Correct 3 ms 5032 KB Output is correct
17 Correct 3 ms 5032 KB Output is correct
18 Correct 3 ms 4948 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 5036 KB Output is correct
23 Correct 3 ms 4948 KB Output is correct
24 Correct 3 ms 5032 KB Output is correct
25 Correct 3 ms 5036 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 5032 KB Output is correct
29 Correct 27 ms 5092 KB Output is correct
30 Correct 26 ms 5076 KB Output is correct
31 Correct 24 ms 5076 KB Output is correct
32 Correct 15 ms 5104 KB Output is correct
33 Correct 10 ms 5076 KB Output is correct
34 Correct 22 ms 5076 KB Output is correct
35 Correct 30 ms 5096 KB Output is correct
36 Correct 21 ms 5100 KB Output is correct
37 Correct 39 ms 5104 KB Output is correct
38 Correct 45 ms 5112 KB Output is correct
39 Correct 30 ms 5104 KB Output is correct
40 Correct 21 ms 5076 KB Output is correct
41 Correct 21 ms 5080 KB Output is correct
42 Correct 24 ms 5104 KB Output is correct
43 Correct 27 ms 5076 KB Output is correct
44 Correct 27 ms 5108 KB Output is correct
45 Correct 26 ms 5076 KB Output is correct
46 Correct 28 ms 5108 KB Output is correct
47 Correct 21 ms 5076 KB Output is correct
48 Correct 23 ms 5076 KB Output is correct
49 Correct 26 ms 5096 KB Output is correct
50 Correct 28 ms 5076 KB Output is correct
51 Correct 22 ms 5076 KB Output is correct
52 Correct 23 ms 5108 KB Output is correct
53 Correct 24 ms 5076 KB Output is correct
54 Correct 30 ms 5092 KB Output is correct
55 Execution timed out 2067 ms 9676 KB Time limit exceeded
56 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 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 5028 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 5076 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 5032 KB Output is correct
16 Correct 3 ms 5032 KB Output is correct
17 Correct 3 ms 5032 KB Output is correct
18 Correct 3 ms 4948 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 5036 KB Output is correct
23 Correct 3 ms 4948 KB Output is correct
24 Correct 3 ms 5032 KB Output is correct
25 Correct 3 ms 5036 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 5032 KB Output is correct
29 Correct 27 ms 5092 KB Output is correct
30 Correct 26 ms 5076 KB Output is correct
31 Correct 24 ms 5076 KB Output is correct
32 Correct 15 ms 5104 KB Output is correct
33 Correct 10 ms 5076 KB Output is correct
34 Correct 22 ms 5076 KB Output is correct
35 Correct 30 ms 5096 KB Output is correct
36 Correct 21 ms 5100 KB Output is correct
37 Correct 39 ms 5104 KB Output is correct
38 Correct 45 ms 5112 KB Output is correct
39 Correct 30 ms 5104 KB Output is correct
40 Correct 21 ms 5076 KB Output is correct
41 Correct 21 ms 5080 KB Output is correct
42 Correct 24 ms 5104 KB Output is correct
43 Correct 27 ms 5076 KB Output is correct
44 Correct 27 ms 5108 KB Output is correct
45 Correct 26 ms 5076 KB Output is correct
46 Correct 28 ms 5108 KB Output is correct
47 Correct 21 ms 5076 KB Output is correct
48 Correct 23 ms 5076 KB Output is correct
49 Correct 26 ms 5096 KB Output is correct
50 Correct 28 ms 5076 KB Output is correct
51 Correct 22 ms 5076 KB Output is correct
52 Correct 23 ms 5108 KB Output is correct
53 Correct 24 ms 5076 KB Output is correct
54 Correct 30 ms 5092 KB Output is correct
55 Execution timed out 2086 ms 7536 KB Time limit exceeded
56 Halted 0 ms 0 KB -