oj.uz

답안 #800484

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
800484 2023-08-01T15:23:43 Z TB_ Joker (BOI20_joker) C++17
71 / 100
 1632 ms 28476 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<pair<pii, pii>> updates; // pUpdates, 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;
        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({{-1, -1}, {-1, -1}});
        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] = {{b2, p[b2]}, {a2, siz[a2]}};
            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 rollback(){
        possible = possibleUpdate[possibleUpdate.size()-1];
        int heightupdate = extraHeightUpdate[extraHeightUpdate.size()-1];
        if(heightupdate != -1) extraHeight[heightupdate]--;
        pair<pl, pl> up = updates[updates.size()-1];
        if(up.F.F != -1){
            p[up.F.F] = up.F.S;
            siz[up.S.F] = up.S.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 = 800;
    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;
            if(uf.possible) {
                ans[que] = 1;
                continue;
            }

            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.rollback();
            lo = sqN*section;
        }
        while(uf.possibleUpdate.size()-lo)
            uf.rollback();
    }
    fo(i, q) cout << (ans[i]?"YES\n":"NO\n");


    exit(0);
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 260 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 324 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 260 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 324 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 10 ms 540 KB Output is correct
30 Correct 11 ms 584 KB Output is correct
31 Correct 9 ms 596 KB Output is correct
32 Correct 5 ms 532 KB Output is correct
33 Correct 4 ms 468 KB Output is correct
34 Correct 6 ms 596 KB Output is correct
35 Correct 10 ms 596 KB Output is correct
36 Correct 7 ms 460 KB Output is correct
37 Correct 10 ms 596 KB Output is correct
38 Correct 10 ms 588 KB Output is correct
39 Correct 8 ms 584 KB Output is correct
40 Correct 9 ms 468 KB Output is correct
41 Correct 8 ms 568 KB Output is correct
42 Correct 8 ms 576 KB Output is correct
43 Correct 3 ms 468 KB Output is correct
44 Correct 3 ms 468 KB Output is correct
45 Correct 3 ms 596 KB Output is correct
46 Correct 5 ms 596 KB Output is correct
47 Correct 9 ms 468 KB Output is correct
48 Correct 8 ms 468 KB Output is correct
49 Correct 9 ms 588 KB Output is correct
50 Correct 8 ms 588 KB Output is correct
51 Correct 8 ms 468 KB Output is correct
52 Correct 9 ms 564 KB Output is correct
53 Correct 9 ms 588 KB Output is correct
54 Correct 10 ms 596 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 75 ms 24208 KB Output is correct
4 Correct 84 ms 27564 KB Output is correct
5 Correct 92 ms 27508 KB Output is correct
6 Correct 89 ms 24424 KB Output is correct
7 Correct 86 ms 24120 KB Output is correct
8 Correct 82 ms 22092 KB Output is correct
9 Correct 81 ms 23608 KB Output is correct
10 Correct 88 ms 27704 KB Output is correct
11 Correct 88 ms 24036 KB Output is correct
12 Correct 89 ms 27364 KB Output is correct
13 Correct 84 ms 20912 KB Output is correct
14 Correct 84 ms 22552 KB Output is correct
15 Correct 110 ms 25756 KB Output is correct
16 Correct 90 ms 28216 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 260 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 324 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 75 ms 24208 KB Output is correct
30 Correct 84 ms 27564 KB Output is correct
31 Correct 92 ms 27508 KB Output is correct
32 Correct 89 ms 24424 KB Output is correct
33 Correct 86 ms 24120 KB Output is correct
34 Correct 82 ms 22092 KB Output is correct
35 Correct 81 ms 23608 KB Output is correct
36 Correct 88 ms 27704 KB Output is correct
37 Correct 88 ms 24036 KB Output is correct
38 Correct 89 ms 27364 KB Output is correct
39 Correct 84 ms 20912 KB Output is correct
40 Correct 84 ms 22552 KB Output is correct
41 Correct 110 ms 25756 KB Output is correct
42 Correct 90 ms 28216 KB Output is correct
43 Correct 293 ms 24480 KB Output is correct
44 Correct 343 ms 28032 KB Output is correct
45 Correct 327 ms 28476 KB Output is correct
46 Correct 321 ms 24572 KB Output is correct
47 Correct 348 ms 24496 KB Output is correct
48 Correct 150 ms 24088 KB Output is correct
49 Correct 144 ms 28364 KB Output is correct
50 Correct 338 ms 23660 KB Output is correct
51 Correct 359 ms 26168 KB Output is correct
52 Correct 341 ms 28472 KB Output is correct
53 Correct 403 ms 21224 KB Output is correct
54 Correct 511 ms 23664 KB Output is correct
55 Correct 441 ms 26248 KB Output is correct
56 Correct 436 ms 28440 KB Output is correct

Subtask #5
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 260 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 324 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 10 ms 540 KB Output is correct
30 Correct 11 ms 584 KB Output is correct
31 Correct 9 ms 596 KB Output is correct
32 Correct 5 ms 532 KB Output is correct
33 Correct 4 ms 468 KB Output is correct
34 Correct 6 ms 596 KB Output is correct
35 Correct 10 ms 596 KB Output is correct
36 Correct 7 ms 460 KB Output is correct
37 Correct 10 ms 596 KB Output is correct
38 Correct 10 ms 588 KB Output is correct
39 Correct 8 ms 584 KB Output is correct
40 Correct 9 ms 468 KB Output is correct
41 Correct 8 ms 568 KB Output is correct
42 Correct 8 ms 576 KB Output is correct
43 Correct 3 ms 468 KB Output is correct
44 Correct 3 ms 468 KB Output is correct
45 Correct 3 ms 596 KB Output is correct
46 Correct 5 ms 596 KB Output is correct
47 Correct 9 ms 468 KB Output is correct
48 Correct 8 ms 468 KB Output is correct
49 Correct 9 ms 588 KB Output is correct
50 Correct 8 ms 588 KB Output is correct
51 Correct 8 ms 468 KB Output is correct
52 Correct 9 ms 564 KB Output is correct
53 Correct 9 ms 588 KB Output is correct
54 Correct 10 ms 596 KB Output is correct
55 Correct 376 ms 18788 KB Output is correct
56 Correct 999 ms 22948 KB Output is correct
57 Correct 628 ms 22148 KB Output is correct
58 Correct 783 ms 18816 KB Output is correct
59 Correct 1507 ms 18824 KB Output is correct
60 Correct 1632 ms 21336 KB Output is correct
61 Correct 706 ms 18840 KB Output is correct
62 Correct 885 ms 22136 KB Output is correct
63 Correct 861 ms 16444 KB Output is correct
64 Correct 1020 ms 19676 KB Output is correct
65 Correct 1014 ms 22196 KB Output is correct

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 260 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 324 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 10 ms 540 KB Output is correct
30 Correct 11 ms 584 KB Output is correct
31 Correct 9 ms 596 KB Output is correct
32 Correct 5 ms 532 KB Output is correct
33 Correct 4 ms 468 KB Output is correct
34 Correct 6 ms 596 KB Output is correct
35 Correct 10 ms 596 KB Output is correct
36 Correct 7 ms 460 KB Output is correct
37 Correct 10 ms 596 KB Output is correct
38 Correct 10 ms 588 KB Output is correct
39 Correct 8 ms 584 KB Output is correct
40 Correct 9 ms 468 KB Output is correct
41 Correct 8 ms 568 KB Output is correct
42 Correct 8 ms 576 KB Output is correct
43 Correct 3 ms 468 KB Output is correct
44 Correct 3 ms 468 KB Output is correct
45 Correct 3 ms 596 KB Output is correct
46 Correct 5 ms 596 KB Output is correct
47 Correct 9 ms 468 KB Output is correct
48 Correct 8 ms 468 KB Output is correct
49 Correct 9 ms 588 KB Output is correct
50 Correct 8 ms 588 KB Output is correct
51 Correct 8 ms 468 KB Output is correct
52 Correct 9 ms 564 KB Output is correct
53 Correct 9 ms 588 KB Output is correct
54 Correct 10 ms 596 KB Output is correct
55 Correct 75 ms 24208 KB Output is correct
56 Correct 84 ms 27564 KB Output is correct
57 Correct 92 ms 27508 KB Output is correct
58 Correct 89 ms 24424 KB Output is correct
59 Correct 86 ms 24120 KB Output is correct
60 Correct 82 ms 22092 KB Output is correct
61 Correct 81 ms 23608 KB Output is correct
62 Correct 88 ms 27704 KB Output is correct
63 Correct 88 ms 24036 KB Output is correct
64 Correct 89 ms 27364 KB Output is correct
65 Correct 84 ms 20912 KB Output is correct
66 Correct 84 ms 22552 KB Output is correct
67 Correct 110 ms 25756 KB Output is correct
68 Correct 90 ms 28216 KB Output is correct
69 Correct 293 ms 24480 KB Output is correct
70 Correct 343 ms 28032 KB Output is correct
71 Correct 327 ms 28476 KB Output is correct
72 Correct 321 ms 24572 KB Output is correct
73 Correct 348 ms 24496 KB Output is correct
74 Correct 150 ms 24088 KB Output is correct
75 Correct 144 ms 28364 KB Output is correct
76 Correct 338 ms 23660 KB Output is correct
77 Correct 359 ms 26168 KB Output is correct
78 Correct 341 ms 28472 KB Output is correct
79 Correct 403 ms 21224 KB Output is correct
80 Correct 511 ms 23664 KB Output is correct
81 Correct 441 ms 26248 KB Output is correct
82 Correct 436 ms 28440 KB Output is correct
83 Correct 376 ms 18788 KB Output is correct
84 Correct 999 ms 22948 KB Output is correct
85 Correct 628 ms 22148 KB Output is correct
86 Correct 783 ms 18816 KB Output is correct
87 Correct 1507 ms 18824 KB Output is correct
88 Correct 1632 ms 21336 KB Output is correct
89 Correct 706 ms 18840 KB Output is correct
90 Correct 885 ms 22136 KB Output is correct
91 Correct 861 ms 16444 KB Output is correct
92 Correct 1020 ms 19676 KB Output is correct
93 Correct 1014 ms 22196 KB Output is correct
94 Incorrect 1000 ms 26132 KB Output isn't correct
95 Halted 0 ms 0 KB -