oj.uz

답안 #648632

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
648632 2022-10-07T08:33:23 Z mychecksedad Joker (BOI20_joker) C++17
14 / 100
 2000 ms 37576 KB 
/* Author : Mychecksdead */
#include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef long double ld;
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define PI 3.1415926535
#define pb push_back
#define setp() cout << setprecision(15)
#define all(x) x.begin(), x.end()
#define oset tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
#define debug(x) cerr << #x << " is " << x << '\n';
const int N = 1e6+100, M = 2e5+10, F = 2147483646, K = 20;

struct Dsu {
    vector<int> s, p, c;
    vector<bool> bp;
    Dsu(int n){
        s.resize(n+1, 1);
        p.resize(n+1);
        c.resize(n+1);
        bp.resize(n+1);
        for(int i = 0; i <= n; ++i) p[i] = i, c[i] = 0, bp[i] = 1;
    }
    int find(int v){
        if(p[v] != v){
            int parity = c[v];
            p[v] = find(p[v]);
            c[v] ^= parity;
        }
        return p[v];
    }
    void merge(int a, int b){
        int x = a, y = b;
        a = find(a);
        b = find(b);
        if(a == b){
            if(c[x] == c[y])
                bp[a] = 0;
        }
        else{
            if(s[a] > s[b]){
                swap(a, b);
            }
            s[b] += s[a];
            p[a] = b;
            c[a] = c[a]^c[b]^1;
            bp[b] = bp[a] & bp[b];
        }
    }
};


int n, m, q, l, r;
bool ok;
vector<pair<int, int>> g[N], edges;
bitset<M> vis, pos;
void dfs(int v, int p, bool c){
    vis[v] = 1;
    pos[v] = c;
    for(auto k: g[v]){
        int u = k.first;
        if(l <= k.second && k.second <= r) continue;
        if(u != p){
            if(vis[u])
                ok |= pos[v] == pos[u];
            else
                dfs(u, v, !c);
        }
    }
}
void solve(){
    cin >> n >> m >> q;
    for(int i = 0; i < m; ++i){
        int u, v; cin >> u >> v;
        g[u].pb({v, i + 1});
        g[v].pb({u, i + 1});
        edges.pb({u, v});
    }
    if(n <= 2000 || q <= 2000){
        for(int i = 0; i < q; ++i){
            cin >> l >> r;
            vis = 0;
            ok = 0;
            for(int v = 1; v <= n; ++v) if(!ok && !vis[v]) dfs(v, v, 0);
            if(ok) cout << "YES\n";
            else cout << "NO\n";
        }
    }
    else{
        vector<pair<int, int>> queries[205];
        vector<int> qq(q + 1);
        for(int i = 1; i <= q; ++i){
            cin >> l >> r;
            queries[l].pb({r, i});
        }
        for(int i = 1; i <= 200; ++i){
            if(queries[i].empty()) continue;
            Dsu d(n);
            ok = 0;
            for(int j = 1; j < i; ++j){
                d.merge(edges[j - 1].first, edges[j - 1].second);
                ok |= !d.bp[edges[j - 1].first] | !d.bp[edges[j - 1].second];
            }
            sort(all(queries[i]), [&](const pair<int, int> &a, const pair<int, int> &b){
                return a.first > b.first;
            });
            int cur = m;
            for(auto k: queries[i]){
                while(cur > k.first){
                    d.merge(edges[cur - 1].first, edges[cur - 1].second);
                    ok |= !d.bp[edges[cur - 1].first] | !d.bp[edges[cur - 1].second];
                    cur--;
                }
                if(ok) qq[k.second] = 1;
            }
        }
        for(int i = 1; i <= q; ++i) cout << (qq[i] ? "YES\n" : "NO\n");
    }
}



int main(){
    cin.tie(0); ios::sync_with_stdio(0);
    int T = 1, aa;
    // cin >> T;aa=T;
    while(T--){
        // cout << "Case #" << aa-T << ": ";
        solve();
        cout << '\n';
    }
    return 0;
 
}

Compilation message

Joker.cpp: In function 'int main()':
Joker.cpp:129:16: warning: unused variable 'aa' [-Wunused-variable]
  129 |     int T = 1, aa;
      |                ^~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 23828 KB Output is correct
2 Correct 13 ms 23836 KB Output is correct
3 Correct 12 ms 23816 KB Output is correct
4 Correct 12 ms 23776 KB Output is correct
5 Correct 18 ms 23836 KB Output is correct
6 Correct 12 ms 23764 KB Output is correct
7 Correct 16 ms 23836 KB Output is correct
8 Correct 15 ms 23764 KB Output is correct
9 Correct 16 ms 23832 KB Output is correct
10 Correct 16 ms 23824 KB Output is correct
11 Correct 16 ms 23832 KB Output is correct
12 Correct 15 ms 23836 KB Output is correct
13 Correct 16 ms 23836 KB Output is correct
14 Correct 16 ms 23840 KB Output is correct
15 Correct 17 ms 23764 KB Output is correct
16 Correct 15 ms 23836 KB Output is correct
17 Correct 15 ms 23856 KB Output is correct
18 Correct 17 ms 23828 KB Output is correct
19 Correct 17 ms 23832 KB Output is correct
20 Correct 15 ms 23836 KB Output is correct
21 Correct 17 ms 23804 KB Output is correct
22 Correct 15 ms 23836 KB Output is correct
23 Correct 14 ms 23808 KB Output is correct
24 Correct 13 ms 23764 KB Output is correct
25 Correct 16 ms 23764 KB Output is correct
26 Correct 14 ms 23788 KB Output is correct
27 Correct 14 ms 23764 KB Output is correct
28 Correct 14 ms 23764 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 23828 KB Output is correct
2 Correct 13 ms 23836 KB Output is correct
3 Correct 12 ms 23816 KB Output is correct
4 Correct 12 ms 23776 KB Output is correct
5 Correct 18 ms 23836 KB Output is correct
6 Correct 12 ms 23764 KB Output is correct
7 Correct 16 ms 23836 KB Output is correct
8 Correct 15 ms 23764 KB Output is correct
9 Correct 16 ms 23832 KB Output is correct
10 Correct 16 ms 23824 KB Output is correct
11 Correct 16 ms 23832 KB Output is correct
12 Correct 15 ms 23836 KB Output is correct
13 Correct 16 ms 23836 KB Output is correct
14 Correct 16 ms 23840 KB Output is correct
15 Correct 17 ms 23764 KB Output is correct
16 Correct 15 ms 23836 KB Output is correct
17 Correct 15 ms 23856 KB Output is correct
18 Correct 17 ms 23828 KB Output is correct
19 Correct 17 ms 23832 KB Output is correct
20 Correct 15 ms 23836 KB Output is correct
21 Correct 17 ms 23804 KB Output is correct
22 Correct 15 ms 23836 KB Output is correct
23 Correct 14 ms 23808 KB Output is correct
24 Correct 13 ms 23764 KB Output is correct
25 Correct 16 ms 23764 KB Output is correct
26 Correct 14 ms 23788 KB Output is correct
27 Correct 14 ms 23764 KB Output is correct
28 Correct 14 ms 23764 KB Output is correct
29 Correct 88 ms 23920 KB Output is correct
30 Correct 105 ms 23996 KB Output is correct
31 Correct 113 ms 24020 KB Output is correct
32 Correct 99 ms 24020 KB Output is correct
33 Correct 82 ms 24000 KB Output is correct
34 Correct 139 ms 24020 KB Output is correct
35 Correct 130 ms 24008 KB Output is correct
36 Correct 58 ms 24020 KB Output is correct
37 Correct 116 ms 24012 KB Output is correct
38 Correct 95 ms 23984 KB Output is correct
39 Correct 93 ms 24008 KB Output is correct
40 Correct 95 ms 24032 KB Output is correct
41 Correct 97 ms 24140 KB Output is correct
42 Correct 90 ms 24024 KB Output is correct
43 Correct 97 ms 24000 KB Output is correct
44 Correct 112 ms 24020 KB Output is correct
45 Correct 126 ms 24020 KB Output is correct
46 Correct 123 ms 24012 KB Output is correct
47 Correct 90 ms 23972 KB Output is correct
48 Correct 92 ms 23892 KB Output is correct
49 Correct 99 ms 24004 KB Output is correct
50 Correct 104 ms 23996 KB Output is correct
51 Correct 90 ms 23976 KB Output is correct
52 Correct 103 ms 24020 KB Output is correct
53 Correct 132 ms 24016 KB Output is correct
54 Correct 125 ms 23996 KB Output is correct

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 23828 KB Output is correct
2 Correct 13 ms 23836 KB Output is correct
3 Incorrect 140 ms 34572 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 23828 KB Output is correct
2 Correct 13 ms 23836 KB Output is correct
3 Correct 12 ms 23816 KB Output is correct
4 Correct 12 ms 23776 KB Output is correct
5 Correct 18 ms 23836 KB Output is correct
6 Correct 12 ms 23764 KB Output is correct
7 Correct 16 ms 23836 KB Output is correct
8 Correct 15 ms 23764 KB Output is correct
9 Correct 16 ms 23832 KB Output is correct
10 Correct 16 ms 23824 KB Output is correct
11 Correct 16 ms 23832 KB Output is correct
12 Correct 15 ms 23836 KB Output is correct
13 Correct 16 ms 23836 KB Output is correct
14 Correct 16 ms 23840 KB Output is correct
15 Correct 17 ms 23764 KB Output is correct
16 Correct 15 ms 23836 KB Output is correct
17 Correct 15 ms 23856 KB Output is correct
18 Correct 17 ms 23828 KB Output is correct
19 Correct 17 ms 23832 KB Output is correct
20 Correct 15 ms 23836 KB Output is correct
21 Correct 17 ms 23804 KB Output is correct
22 Correct 15 ms 23836 KB Output is correct
23 Correct 14 ms 23808 KB Output is correct
24 Correct 13 ms 23764 KB Output is correct
25 Correct 16 ms 23764 KB Output is correct
26 Correct 14 ms 23788 KB Output is correct
27 Correct 14 ms 23764 KB Output is correct
28 Correct 14 ms 23764 KB Output is correct
29 Incorrect 140 ms 34572 KB Output isn't correct
30 Halted 0 ms 0 KB -

Subtask #5
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 23828 KB Output is correct
2 Correct 13 ms 23836 KB Output is correct
3 Correct 12 ms 23816 KB Output is correct
4 Correct 12 ms 23776 KB Output is correct
5 Correct 18 ms 23836 KB Output is correct
6 Correct 12 ms 23764 KB Output is correct
7 Correct 16 ms 23836 KB Output is correct
8 Correct 15 ms 23764 KB Output is correct
9 Correct 16 ms 23832 KB Output is correct
10 Correct 16 ms 23824 KB Output is correct
11 Correct 16 ms 23832 KB Output is correct
12 Correct 15 ms 23836 KB Output is correct
13 Correct 16 ms 23836 KB Output is correct
14 Correct 16 ms 23840 KB Output is correct
15 Correct 17 ms 23764 KB Output is correct
16 Correct 15 ms 23836 KB Output is correct
17 Correct 15 ms 23856 KB Output is correct
18 Correct 17 ms 23828 KB Output is correct
19 Correct 17 ms 23832 KB Output is correct
20 Correct 15 ms 23836 KB Output is correct
21 Correct 17 ms 23804 KB Output is correct
22 Correct 15 ms 23836 KB Output is correct
23 Correct 14 ms 23808 KB Output is correct
24 Correct 13 ms 23764 KB Output is correct
25 Correct 16 ms 23764 KB Output is correct
26 Correct 14 ms 23788 KB Output is correct
27 Correct 14 ms 23764 KB Output is correct
28 Correct 14 ms 23764 KB Output is correct
29 Correct 88 ms 23920 KB Output is correct
30 Correct 105 ms 23996 KB Output is correct
31 Correct 113 ms 24020 KB Output is correct
32 Correct 99 ms 24020 KB Output is correct
33 Correct 82 ms 24000 KB Output is correct
34 Correct 139 ms 24020 KB Output is correct
35 Correct 130 ms 24008 KB Output is correct
36 Correct 58 ms 24020 KB Output is correct
37 Correct 116 ms 24012 KB Output is correct
38 Correct 95 ms 23984 KB Output is correct
39 Correct 93 ms 24008 KB Output is correct
40 Correct 95 ms 24032 KB Output is correct
41 Correct 97 ms 24140 KB Output is correct
42 Correct 90 ms 24024 KB Output is correct
43 Correct 97 ms 24000 KB Output is correct
44 Correct 112 ms 24020 KB Output is correct
45 Correct 126 ms 24020 KB Output is correct
46 Correct 123 ms 24012 KB Output is correct
47 Correct 90 ms 23972 KB Output is correct
48 Correct 92 ms 23892 KB Output is correct
49 Correct 99 ms 24004 KB Output is correct
50 Correct 104 ms 23996 KB Output is correct
51 Correct 90 ms 23976 KB Output is correct
52 Correct 103 ms 24020 KB Output is correct
53 Correct 132 ms 24016 KB Output is correct
54 Correct 125 ms 23996 KB Output is correct
55 Execution timed out 2050 ms 37576 KB Time limit exceeded
56 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 23828 KB Output is correct
2 Correct 13 ms 23836 KB Output is correct
3 Correct 12 ms 23816 KB Output is correct
4 Correct 12 ms 23776 KB Output is correct
5 Correct 18 ms 23836 KB Output is correct
6 Correct 12 ms 23764 KB Output is correct
7 Correct 16 ms 23836 KB Output is correct
8 Correct 15 ms 23764 KB Output is correct
9 Correct 16 ms 23832 KB Output is correct
10 Correct 16 ms 23824 KB Output is correct
11 Correct 16 ms 23832 KB Output is correct
12 Correct 15 ms 23836 KB Output is correct
13 Correct 16 ms 23836 KB Output is correct
14 Correct 16 ms 23840 KB Output is correct
15 Correct 17 ms 23764 KB Output is correct
16 Correct 15 ms 23836 KB Output is correct
17 Correct 15 ms 23856 KB Output is correct
18 Correct 17 ms 23828 KB Output is correct
19 Correct 17 ms 23832 KB Output is correct
20 Correct 15 ms 23836 KB Output is correct
21 Correct 17 ms 23804 KB Output is correct
22 Correct 15 ms 23836 KB Output is correct
23 Correct 14 ms 23808 KB Output is correct
24 Correct 13 ms 23764 KB Output is correct
25 Correct 16 ms 23764 KB Output is correct
26 Correct 14 ms 23788 KB Output is correct
27 Correct 14 ms 23764 KB Output is correct
28 Correct 14 ms 23764 KB Output is correct
29 Correct 88 ms 23920 KB Output is correct
30 Correct 105 ms 23996 KB Output is correct
31 Correct 113 ms 24020 KB Output is correct
32 Correct 99 ms 24020 KB Output is correct
33 Correct 82 ms 24000 KB Output is correct
34 Correct 139 ms 24020 KB Output is correct
35 Correct 130 ms 24008 KB Output is correct
36 Correct 58 ms 24020 KB Output is correct
37 Correct 116 ms 24012 KB Output is correct
38 Correct 95 ms 23984 KB Output is correct
39 Correct 93 ms 24008 KB Output is correct
40 Correct 95 ms 24032 KB Output is correct
41 Correct 97 ms 24140 KB Output is correct
42 Correct 90 ms 24024 KB Output is correct
43 Correct 97 ms 24000 KB Output is correct
44 Correct 112 ms 24020 KB Output is correct
45 Correct 126 ms 24020 KB Output is correct
46 Correct 123 ms 24012 KB Output is correct
47 Correct 90 ms 23972 KB Output is correct
48 Correct 92 ms 23892 KB Output is correct
49 Correct 99 ms 24004 KB Output is correct
50 Correct 104 ms 23996 KB Output is correct
51 Correct 90 ms 23976 KB Output is correct
52 Correct 103 ms 24020 KB Output is correct
53 Correct 132 ms 24016 KB Output is correct
54 Correct 125 ms 23996 KB Output is correct
55 Incorrect 140 ms 34572 KB Output isn't correct
56 Halted 0 ms 0 KB -