oj.uz

답안 #800503

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
800503 2023-08-01T15:39:28 Z TB_ Joker (BOI20_joker) C++17
71 / 100
 2000 ms 29564 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-1)/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 224 KB Output is correct
3 Correct 1 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 352 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 340 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 340 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 224 KB Output is correct
3 Correct 1 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 352 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 340 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 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 9 ms 468 KB Output is correct
30 Correct 11 ms 468 KB Output is correct
31 Correct 9 ms 564 KB Output is correct
32 Correct 8 ms 528 KB Output is correct
33 Correct 4 ms 468 KB Output is correct
34 Correct 6 ms 468 KB Output is correct
35 Correct 10 ms 468 KB Output is correct
36 Correct 7 ms 536 KB Output is correct
37 Correct 10 ms 580 KB Output is correct
38 Correct 10 ms 576 KB Output is correct
39 Correct 8 ms 568 KB Output is correct
40 Correct 14 ms 468 KB Output is correct
41 Correct 8 ms 516 KB Output is correct
42 Correct 8 ms 536 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 468 KB Output is correct
46 Correct 4 ms 468 KB Output is correct
47 Correct 8 ms 532 KB Output is correct
48 Correct 8 ms 496 KB Output is correct
49 Correct 10 ms 552 KB Output is correct
50 Correct 11 ms 564 KB Output is correct
51 Correct 9 ms 468 KB Output is correct
52 Correct 9 ms 468 KB Output is correct
53 Correct 15 ms 552 KB Output is correct
54 Correct 16 ms 472 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 224 KB Output is correct
3 Correct 79 ms 20172 KB Output is correct
4 Correct 100 ms 24052 KB Output is correct
5 Correct 88 ms 23352 KB Output is correct
6 Correct 96 ms 20116 KB Output is correct
7 Correct 98 ms 20180 KB Output is correct
8 Correct 80 ms 18780 KB Output is correct
9 Correct 81 ms 20236 KB Output is correct
10 Correct 92 ms 24296 KB Output is correct
11 Correct 83 ms 20200 KB Output is correct
12 Correct 101 ms 23256 KB Output is correct
13 Correct 82 ms 17020 KB Output is correct
14 Correct 95 ms 18628 KB Output is correct
15 Correct 87 ms 21740 KB Output is correct
16 Correct 88 ms 24104 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 224 KB Output is correct
3 Correct 1 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 352 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 340 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 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 79 ms 20172 KB Output is correct
30 Correct 100 ms 24052 KB Output is correct
31 Correct 88 ms 23352 KB Output is correct
32 Correct 96 ms 20116 KB Output is correct
33 Correct 98 ms 20180 KB Output is correct
34 Correct 80 ms 18780 KB Output is correct
35 Correct 81 ms 20236 KB Output is correct
36 Correct 92 ms 24296 KB Output is correct
37 Correct 83 ms 20200 KB Output is correct
38 Correct 101 ms 23256 KB Output is correct
39 Correct 82 ms 17020 KB Output is correct
40 Correct 95 ms 18628 KB Output is correct
41 Correct 87 ms 21740 KB Output is correct
42 Correct 88 ms 24104 KB Output is correct
43 Correct 311 ms 20128 KB Output is correct
44 Correct 351 ms 24000 KB Output is correct
45 Correct 337 ms 23988 KB Output is correct
46 Correct 309 ms 20136 KB Output is correct
47 Correct 356 ms 20152 KB Output is correct
48 Correct 170 ms 20296 KB Output is correct
49 Correct 148 ms 24204 KB Output is correct
50 Correct 350 ms 19384 KB Output is correct
51 Correct 391 ms 21744 KB Output is correct
52 Correct 403 ms 24056 KB Output is correct
53 Correct 492 ms 17088 KB Output is correct
54 Correct 455 ms 19336 KB Output is correct
55 Correct 446 ms 21680 KB Output is correct
56 Correct 507 ms 24056 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 224 KB Output is correct
3 Correct 1 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 352 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 340 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 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 9 ms 468 KB Output is correct
30 Correct 11 ms 468 KB Output is correct
31 Correct 9 ms 564 KB Output is correct
32 Correct 8 ms 528 KB Output is correct
33 Correct 4 ms 468 KB Output is correct
34 Correct 6 ms 468 KB Output is correct
35 Correct 10 ms 468 KB Output is correct
36 Correct 7 ms 536 KB Output is correct
37 Correct 10 ms 580 KB Output is correct
38 Correct 10 ms 576 KB Output is correct
39 Correct 8 ms 568 KB Output is correct
40 Correct 14 ms 468 KB Output is correct
41 Correct 8 ms 516 KB Output is correct
42 Correct 8 ms 536 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 468 KB Output is correct
46 Correct 4 ms 468 KB Output is correct
47 Correct 8 ms 532 KB Output is correct
48 Correct 8 ms 496 KB Output is correct
49 Correct 10 ms 552 KB Output is correct
50 Correct 11 ms 564 KB Output is correct
51 Correct 9 ms 468 KB Output is correct
52 Correct 9 ms 468 KB Output is correct
53 Correct 15 ms 552 KB Output is correct
54 Correct 16 ms 472 KB Output is correct
55 Correct 361 ms 16464 KB Output is correct
56 Correct 998 ms 20408 KB Output is correct
57 Correct 626 ms 19556 KB Output is correct
58 Correct 819 ms 16492 KB Output is correct
59 Correct 1514 ms 16492 KB Output is correct
60 Correct 1664 ms 18844 KB Output is correct
61 Correct 692 ms 16488 KB Output is correct
62 Correct 835 ms 19512 KB Output is correct
63 Correct 925 ms 14248 KB Output is correct
64 Correct 1037 ms 17308 KB Output is correct
65 Correct 1044 ms 19612 KB Output is correct

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 224 KB Output is correct
3 Correct 1 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 352 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 340 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 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 9 ms 468 KB Output is correct
30 Correct 11 ms 468 KB Output is correct
31 Correct 9 ms 564 KB Output is correct
32 Correct 8 ms 528 KB Output is correct
33 Correct 4 ms 468 KB Output is correct
34 Correct 6 ms 468 KB Output is correct
35 Correct 10 ms 468 KB Output is correct
36 Correct 7 ms 536 KB Output is correct
37 Correct 10 ms 580 KB Output is correct
38 Correct 10 ms 576 KB Output is correct
39 Correct 8 ms 568 KB Output is correct
40 Correct 14 ms 468 KB Output is correct
41 Correct 8 ms 516 KB Output is correct
42 Correct 8 ms 536 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 468 KB Output is correct
46 Correct 4 ms 468 KB Output is correct
47 Correct 8 ms 532 KB Output is correct
48 Correct 8 ms 496 KB Output is correct
49 Correct 10 ms 552 KB Output is correct
50 Correct 11 ms 564 KB Output is correct
51 Correct 9 ms 468 KB Output is correct
52 Correct 9 ms 468 KB Output is correct
53 Correct 15 ms 552 KB Output is correct
54 Correct 16 ms 472 KB Output is correct
55 Correct 79 ms 20172 KB Output is correct
56 Correct 100 ms 24052 KB Output is correct
57 Correct 88 ms 23352 KB Output is correct
58 Correct 96 ms 20116 KB Output is correct
59 Correct 98 ms 20180 KB Output is correct
60 Correct 80 ms 18780 KB Output is correct
61 Correct 81 ms 20236 KB Output is correct
62 Correct 92 ms 24296 KB Output is correct
63 Correct 83 ms 20200 KB Output is correct
64 Correct 101 ms 23256 KB Output is correct
65 Correct 82 ms 17020 KB Output is correct
66 Correct 95 ms 18628 KB Output is correct
67 Correct 87 ms 21740 KB Output is correct
68 Correct 88 ms 24104 KB Output is correct
69 Correct 311 ms 20128 KB Output is correct
70 Correct 351 ms 24000 KB Output is correct
71 Correct 337 ms 23988 KB Output is correct
72 Correct 309 ms 20136 KB Output is correct
73 Correct 356 ms 20152 KB Output is correct
74 Correct 170 ms 20296 KB Output is correct
75 Correct 148 ms 24204 KB Output is correct
76 Correct 350 ms 19384 KB Output is correct
77 Correct 391 ms 21744 KB Output is correct
78 Correct 403 ms 24056 KB Output is correct
79 Correct 492 ms 17088 KB Output is correct
80 Correct 455 ms 19336 KB Output is correct
81 Correct 446 ms 21680 KB Output is correct
82 Correct 507 ms 24056 KB Output is correct
83 Correct 361 ms 16464 KB Output is correct
84 Correct 998 ms 20408 KB Output is correct
85 Correct 626 ms 19556 KB Output is correct
86 Correct 819 ms 16492 KB Output is correct
87 Correct 1514 ms 16492 KB Output is correct
88 Correct 1664 ms 18844 KB Output is correct
89 Correct 692 ms 16488 KB Output is correct
90 Correct 835 ms 19512 KB Output is correct
91 Correct 925 ms 14248 KB Output is correct
92 Correct 1037 ms 17308 KB Output is correct
93 Correct 1044 ms 19612 KB Output is correct
94 Correct 1104 ms 21168 KB Output is correct
95 Execution timed out 2048 ms 29564 KB Time limit exceeded
96 Halted 0 ms 0 KB -