oj.uz

Submission #800255

# Submission time Handle Problem Language Result Execution time Memory
800255 2023-08-01T12:50:05 Z TB_ Joker (BOI20_joker) C++17
39 / 100
 2000 ms 58860 KB 
#include <bits/stdc++.h>
using namespace std;

// #undef _GLIBCXX_DEBUG                // disable run-time bound checking, etc
// #pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
// #pragma GCC optimize ("unroll-loops")

// #pragma GCC target("bmi,bmi2,lzcnt,popcnt")                      // bit manipulation
// #pragma GCC target("movbe")                                      // byte swap
// #pragma GCC target("aes,pclmul,rdrnd")                           // encryption
// #pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2") // SIMD

// #include <bits/extc++.h>
// using namespace __gnu_pbds;
// template<class T>using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
// template<class T>using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define ll long long
#define INF (ll)1e9+7
#define fo(i, n) for(int i=0;i<((ll)n);i++)
#define deb(x) cout << #x << " = " << x << endl;
#define deb2(x, y) cout << #x << " = " << x << ", " << #y << " = " << y << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define LSOne(S) ((S) & (-S))
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
inline int readint(){ int v = 0; char c; while((c = getchar()) != EOF && c != ' ' && c != '\n'){ v *= 10; v += c - '0'; } return v; }
inline int readintsigned() { int v = 0; int sign = 1; char c = getchar(); if (c == '-') { sign = -1; } else { v += c - '0'; } while ((c = getchar()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } return v * sign; }
inline string readstring() { string s; char c; while ((c = getchar()) != EOF && c != '\n' && c != ' ') { s.push_back(c); } return s; }
template <class result_t=std::chrono::milliseconds,class clock_t=std::chrono::steady_clock,class duration_t = std::chrono::milliseconds>
auto since(std::chrono::time_point<clock_t, duration_t> const& start){return std::chrono::duration_cast<result_t>(clock_t::now() - start);}
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<vpii> vvpii;
typedef vector<vpl> vvpl;



struct UnionFind{
    vl degree, height, p, siz, extraHeight;
    vector<vvpl> updates; // pUpdates, heightUpdate, sizUpdate
    vi possibleUpdate, extraHeightUpdate;
    int n;
    int possible = 0;
    UnionFind(int n) : n(n) {
        height.assign(n, 0);
        extraHeight.assign(n, 0);
        degree.assign(n, 0); 
        p.assign(n, 0); 
        siz.assign(n, 1); 
        fo(i, n) p[i] = i;
    }

    int find(int x){
        if(x == p[x]) return x;
        // updates[updates.size()-1][0].pb({x, p[x]});
        updates[updates.size()-1][1].pb({x, height[x]});
        int res = find(p[x]);
        height[x] = height[p[x]]+1+extraHeight[x];
        return res;
    }


    void addEdge(int a, int b){
        possibleUpdate.pb(possible);
        extraHeightUpdate.pb(-1);
        updates.pb({{}, {}, {}});
        int a2 = find(a);
        int b2 = find(b);
        if(a2==b2){
            if(height[a]%2 == height[b]%2) possible++;
        }else{
            if(siz[b2] > siz[a2]) {
                swap(a2, b2);
                swap(a, b);
            }
            updates[updates.size()-1][2].pb({a2, siz[a2]});
            updates[updates.size()-1][0].pb({b2, p[b2]});
            siz[a2] += siz[b2];
            p[b2] = a2;
            if((height[b2]%2 == height[b]%2)^(height[a2]%2 == height[a]%2)){
                extraHeight[b2]++;
                extraHeightUpdate[extraHeightUpdate.size()-1] = b2;
            }
        }
    }  


    void backtrack(){
        possible = possibleUpdate[possibleUpdate.size()-1];
        int heightupdate = extraHeightUpdate[extraHeightUpdate.size()-1];
        if(heightupdate != -1) extraHeight[heightupdate]--;
        for(auto up : updates[possibleUpdate.size()-1][0]) p[up.F] = up.S;
        for(auto up : updates[possibleUpdate.size()-1][1]) height[up.F] = up.S;
        for(auto up : updates[possibleUpdate.size()-1][2]) siz[up.F] = up.S;
        updates.pop_back();
        possibleUpdate.pop_back();
        extraHeightUpdate.pop_back();
    }  
};


int main() {
    // cout << fixed << setprecision(20);
    // auto start = std::chrono::steady_clock::now(); // since(start).count()
    cin.tie(0)->sync_with_stdio(0);

    int n, m, q, from, to, que;
    vpl edges;
    cin >> n >> m >> q;
    fo(i, m){
        cin >> from >> to;
        edges.pb({from-1, to-1});
    }

    vector<vector<tuple<int, int, int>>> queries(1000);
    int sqN = sqrt(200000);
    fo(x, q){
        cin >> from >> to;
        queries[from/sqN].pb({to-1, from-1, x});
    }
    fo(i, 1000){
        sort(rall(queries[i]));
    }
    UnionFind uf(n);
    vi ans(q, 0);
    int lo = 0;
    fo(section, 1000){
        int hi = m-1;
        if(!queries[section].size()) continue;
        fo(i, sqN*section-lo) 
            uf.addEdge(edges[lo+i].F, edges[lo+i].S);
        lo = sqN*section;
        for(auto query : queries[section]){
            tie(to, from, que) = query;
            fo(i, hi-to) uf.addEdge(edges[hi-i].F,edges[hi-i].S);
            hi=to;

            fo(i, from-lo) 
                uf.addEdge(edges[lo+i].F, edges[lo+i].S);
            if(uf.possible) ans[que] = 1;
            fo(i, from-sqN*section)
                uf.backtrack();
            lo = sqN*section;
        }
        while(uf.possibleUpdate.size()-lo)
            uf.backtrack();
    }
    fo(i, q) cout << (ans[i]?"YES\n":"NO\n");


    return 0;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 3 ms 340 KB Output is correct
9 Correct 3 ms 340 KB Output is correct
10 Correct 3 ms 340 KB Output is correct
11 Correct 3 ms 316 KB Output is correct
12 Correct 3 ms 340 KB Output is correct
13 Correct 3 ms 340 KB Output is correct
14 Correct 3 ms 340 KB Output is correct
15 Correct 3 ms 340 KB Output is correct
16 Correct 3 ms 404 KB Output is correct
17 Correct 3 ms 340 KB Output is correct
18 Correct 3 ms 340 KB Output is correct
19 Correct 3 ms 340 KB Output is correct
20 Correct 3 ms 340 KB Output is correct
21 Correct 3 ms 340 KB Output is correct
22 Correct 3 ms 320 KB Output is correct
23 Correct 3 ms 340 KB Output is correct
24 Correct 3 ms 340 KB Output is correct
25 Correct 3 ms 340 KB Output is correct
26 Correct 3 ms 340 KB Output is correct
27 Correct 4 ms 340 KB Output is correct
28 Correct 3 ms 340 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 3 ms 340 KB Output is correct
9 Correct 3 ms 340 KB Output is correct
10 Correct 3 ms 340 KB Output is correct
11 Correct 3 ms 316 KB Output is correct
12 Correct 3 ms 340 KB Output is correct
13 Correct 3 ms 340 KB Output is correct
14 Correct 3 ms 340 KB Output is correct
15 Correct 3 ms 340 KB Output is correct
16 Correct 3 ms 404 KB Output is correct
17 Correct 3 ms 340 KB Output is correct
18 Correct 3 ms 340 KB Output is correct
19 Correct 3 ms 340 KB Output is correct
20 Correct 3 ms 340 KB Output is correct
21 Correct 3 ms 340 KB Output is correct
22 Correct 3 ms 320 KB Output is correct
23 Correct 3 ms 340 KB Output is correct
24 Correct 3 ms 340 KB Output is correct
25 Correct 3 ms 340 KB Output is correct
26 Correct 3 ms 340 KB Output is correct
27 Correct 4 ms 340 KB Output is correct
28 Correct 3 ms 340 KB Output is correct
29 Correct 58 ms 668 KB Output is correct
30 Correct 70 ms 892 KB Output is correct
31 Correct 75 ms 920 KB Output is correct
32 Correct 64 ms 852 KB Output is correct
33 Correct 63 ms 876 KB Output is correct
34 Correct 67 ms 924 KB Output is correct
35 Correct 72 ms 900 KB Output is correct
36 Correct 48 ms 892 KB Output is correct
37 Correct 57 ms 944 KB Output is correct
38 Correct 58 ms 944 KB Output is correct
39 Correct 59 ms 940 KB Output is correct
40 Correct 63 ms 864 KB Output is correct
41 Correct 65 ms 868 KB Output is correct
42 Correct 62 ms 852 KB Output is correct
43 Correct 64 ms 880 KB Output is correct
44 Correct 80 ms 904 KB Output is correct
45 Correct 83 ms 920 KB Output is correct
46 Correct 75 ms 940 KB Output is correct
47 Correct 54 ms 876 KB Output is correct
48 Correct 61 ms 876 KB Output is correct
49 Correct 85 ms 904 KB Output is correct
50 Correct 64 ms 916 KB Output is correct
51 Correct 65 ms 864 KB Output is correct
52 Correct 66 ms 892 KB Output is correct
53 Correct 66 ms 912 KB Output is correct
54 Correct 69 ms 932 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 127 ms 50268 KB Output is correct
4 Correct 174 ms 54920 KB Output is correct
5 Correct 179 ms 54104 KB Output is correct
6 Correct 138 ms 50740 KB Output is correct
7 Correct 170 ms 58860 KB Output is correct
8 Correct 149 ms 50992 KB Output is correct
9 Correct 181 ms 52900 KB Output is correct
10 Correct 165 ms 56380 KB Output is correct
11 Correct 148 ms 51528 KB Output is correct
12 Correct 154 ms 52540 KB Output is correct
13 Correct 160 ms 49104 KB Output is correct
14 Correct 151 ms 50936 KB Output is correct
15 Correct 159 ms 54584 KB Output is correct
16 Correct 178 ms 56244 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 3 ms 340 KB Output is correct
9 Correct 3 ms 340 KB Output is correct
10 Correct 3 ms 340 KB Output is correct
11 Correct 3 ms 316 KB Output is correct
12 Correct 3 ms 340 KB Output is correct
13 Correct 3 ms 340 KB Output is correct
14 Correct 3 ms 340 KB Output is correct
15 Correct 3 ms 340 KB Output is correct
16 Correct 3 ms 404 KB Output is correct
17 Correct 3 ms 340 KB Output is correct
18 Correct 3 ms 340 KB Output is correct
19 Correct 3 ms 340 KB Output is correct
20 Correct 3 ms 340 KB Output is correct
21 Correct 3 ms 340 KB Output is correct
22 Correct 3 ms 320 KB Output is correct
23 Correct 3 ms 340 KB Output is correct
24 Correct 3 ms 340 KB Output is correct
25 Correct 3 ms 340 KB Output is correct
26 Correct 3 ms 340 KB Output is correct
27 Correct 4 ms 340 KB Output is correct
28 Correct 3 ms 340 KB Output is correct
29 Correct 127 ms 50268 KB Output is correct
30 Correct 174 ms 54920 KB Output is correct
31 Correct 179 ms 54104 KB Output is correct
32 Correct 138 ms 50740 KB Output is correct
33 Correct 170 ms 58860 KB Output is correct
34 Correct 149 ms 50992 KB Output is correct
35 Correct 181 ms 52900 KB Output is correct
36 Correct 165 ms 56380 KB Output is correct
37 Correct 148 ms 51528 KB Output is correct
38 Correct 154 ms 52540 KB Output is correct
39 Correct 160 ms 49104 KB Output is correct
40 Correct 151 ms 50936 KB Output is correct
41 Correct 159 ms 54584 KB Output is correct
42 Correct 178 ms 56244 KB Output is correct
43 Execution timed out 2065 ms 31484 KB Time limit exceeded
44 Halted 0 ms 0 KB -

Subtask #5
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 3 ms 340 KB Output is correct
9 Correct 3 ms 340 KB Output is correct
10 Correct 3 ms 340 KB Output is correct
11 Correct 3 ms 316 KB Output is correct
12 Correct 3 ms 340 KB Output is correct
13 Correct 3 ms 340 KB Output is correct
14 Correct 3 ms 340 KB Output is correct
15 Correct 3 ms 340 KB Output is correct
16 Correct 3 ms 404 KB Output is correct
17 Correct 3 ms 340 KB Output is correct
18 Correct 3 ms 340 KB Output is correct
19 Correct 3 ms 340 KB Output is correct
20 Correct 3 ms 340 KB Output is correct
21 Correct 3 ms 340 KB Output is correct
22 Correct 3 ms 320 KB Output is correct
23 Correct 3 ms 340 KB Output is correct
24 Correct 3 ms 340 KB Output is correct
25 Correct 3 ms 340 KB Output is correct
26 Correct 3 ms 340 KB Output is correct
27 Correct 4 ms 340 KB Output is correct
28 Correct 3 ms 340 KB Output is correct
29 Correct 58 ms 668 KB Output is correct
30 Correct 70 ms 892 KB Output is correct
31 Correct 75 ms 920 KB Output is correct
32 Correct 64 ms 852 KB Output is correct
33 Correct 63 ms 876 KB Output is correct
34 Correct 67 ms 924 KB Output is correct
35 Correct 72 ms 900 KB Output is correct
36 Correct 48 ms 892 KB Output is correct
37 Correct 57 ms 944 KB Output is correct
38 Correct 58 ms 944 KB Output is correct
39 Correct 59 ms 940 KB Output is correct
40 Correct 63 ms 864 KB Output is correct
41 Correct 65 ms 868 KB Output is correct
42 Correct 62 ms 852 KB Output is correct
43 Correct 64 ms 880 KB Output is correct
44 Correct 80 ms 904 KB Output is correct
45 Correct 83 ms 920 KB Output is correct
46 Correct 75 ms 940 KB Output is correct
47 Correct 54 ms 876 KB Output is correct
48 Correct 61 ms 876 KB Output is correct
49 Correct 85 ms 904 KB Output is correct
50 Correct 64 ms 916 KB Output is correct
51 Correct 65 ms 864 KB Output is correct
52 Correct 66 ms 892 KB Output is correct
53 Correct 66 ms 912 KB Output is correct
54 Correct 69 ms 932 KB Output is correct
55 Execution timed out 2066 ms 47992 KB Time limit exceeded
56 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 3 ms 340 KB Output is correct
9 Correct 3 ms 340 KB Output is correct
10 Correct 3 ms 340 KB Output is correct
11 Correct 3 ms 316 KB Output is correct
12 Correct 3 ms 340 KB Output is correct
13 Correct 3 ms 340 KB Output is correct
14 Correct 3 ms 340 KB Output is correct
15 Correct 3 ms 340 KB Output is correct
16 Correct 3 ms 404 KB Output is correct
17 Correct 3 ms 340 KB Output is correct
18 Correct 3 ms 340 KB Output is correct
19 Correct 3 ms 340 KB Output is correct
20 Correct 3 ms 340 KB Output is correct
21 Correct 3 ms 340 KB Output is correct
22 Correct 3 ms 320 KB Output is correct
23 Correct 3 ms 340 KB Output is correct
24 Correct 3 ms 340 KB Output is correct
25 Correct 3 ms 340 KB Output is correct
26 Correct 3 ms 340 KB Output is correct
27 Correct 4 ms 340 KB Output is correct
28 Correct 3 ms 340 KB Output is correct
29 Correct 58 ms 668 KB Output is correct
30 Correct 70 ms 892 KB Output is correct
31 Correct 75 ms 920 KB Output is correct
32 Correct 64 ms 852 KB Output is correct
33 Correct 63 ms 876 KB Output is correct
34 Correct 67 ms 924 KB Output is correct
35 Correct 72 ms 900 KB Output is correct
36 Correct 48 ms 892 KB Output is correct
37 Correct 57 ms 944 KB Output is correct
38 Correct 58 ms 944 KB Output is correct
39 Correct 59 ms 940 KB Output is correct
40 Correct 63 ms 864 KB Output is correct
41 Correct 65 ms 868 KB Output is correct
42 Correct 62 ms 852 KB Output is correct
43 Correct 64 ms 880 KB Output is correct
44 Correct 80 ms 904 KB Output is correct
45 Correct 83 ms 920 KB Output is correct
46 Correct 75 ms 940 KB Output is correct
47 Correct 54 ms 876 KB Output is correct
48 Correct 61 ms 876 KB Output is correct
49 Correct 85 ms 904 KB Output is correct
50 Correct 64 ms 916 KB Output is correct
51 Correct 65 ms 864 KB Output is correct
52 Correct 66 ms 892 KB Output is correct
53 Correct 66 ms 912 KB Output is correct
54 Correct 69 ms 932 KB Output is correct
55 Correct 127 ms 50268 KB Output is correct
56 Correct 174 ms 54920 KB Output is correct
57 Correct 179 ms 54104 KB Output is correct
58 Correct 138 ms 50740 KB Output is correct
59 Correct 170 ms 58860 KB Output is correct
60 Correct 149 ms 50992 KB Output is correct
61 Correct 181 ms 52900 KB Output is correct
62 Correct 165 ms 56380 KB Output is correct
63 Correct 148 ms 51528 KB Output is correct
64 Correct 154 ms 52540 KB Output is correct
65 Correct 160 ms 49104 KB Output is correct
66 Correct 151 ms 50936 KB Output is correct
67 Correct 159 ms 54584 KB Output is correct
68 Correct 178 ms 56244 KB Output is correct
69 Execution timed out 2065 ms 31484 KB Time limit exceeded
70 Halted 0 ms 0 KB -