oj.uz

답안 #800633

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
800633 2023-08-01T17:10:16 Z TB_ Joker (BOI20_joker) C++17
14 / 100
 2000 ms 20880 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;


int degree[200001], height[200001], p[200001], siz[200001], extraHeight[200001];

struct UnionFind{
    vector<pair<pii, pii>> updates; // pUpdates, sizUpdate
    vi possibleUpdate, extraHeightUpdate;
    int n;
    int possible = 0;
    UnionFind(int n) : n(n) {
        memset(height, 0, sizeof(height));
        memset(extraHeight, 0, sizeof(extraHeight));
        memset(degree, 0, sizeof(degree));
        memset(p, 0, sizeof(p));
        memset(siz, 1, sizeof(siz)); 
        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 = 500;
    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;
            if(uf.possible) {
                ans[que] = 1;
                continue;
            }
            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 2 ms 4180 KB Output is correct
2 Correct 2 ms 4180 KB Output is correct
3 Correct 2 ms 4180 KB Output is correct
4 Correct 2 ms 4180 KB Output is correct
5 Correct 2 ms 4180 KB Output is correct
6 Correct 2 ms 4168 KB Output is correct
7 Correct 2 ms 4180 KB Output is correct
8 Correct 2 ms 4180 KB Output is correct
9 Correct 2 ms 4180 KB Output is correct
10 Correct 2 ms 4180 KB Output is correct
11 Correct 2 ms 4168 KB Output is correct
12 Correct 2 ms 4180 KB Output is correct
13 Correct 2 ms 4180 KB Output is correct
14 Correct 3 ms 4180 KB Output is correct
15 Correct 2 ms 4180 KB Output is correct
16 Correct 2 ms 4180 KB Output is correct
17 Correct 2 ms 4180 KB Output is correct
18 Correct 2 ms 4180 KB Output is correct
19 Correct 2 ms 4180 KB Output is correct
20 Correct 2 ms 4180 KB Output is correct
21 Correct 2 ms 4180 KB Output is correct
22 Correct 2 ms 4180 KB Output is correct
23 Correct 2 ms 4180 KB Output is correct
24 Correct 2 ms 4172 KB Output is correct
25 Correct 2 ms 4180 KB Output is correct
26 Correct 2 ms 4180 KB Output is correct
27 Correct 2 ms 4180 KB Output is correct
28 Correct 2 ms 4180 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4180 KB Output is correct
2 Correct 2 ms 4180 KB Output is correct
3 Correct 2 ms 4180 KB Output is correct
4 Correct 2 ms 4180 KB Output is correct
5 Correct 2 ms 4180 KB Output is correct
6 Correct 2 ms 4168 KB Output is correct
7 Correct 2 ms 4180 KB Output is correct
8 Correct 2 ms 4180 KB Output is correct
9 Correct 2 ms 4180 KB Output is correct
10 Correct 2 ms 4180 KB Output is correct
11 Correct 2 ms 4168 KB Output is correct
12 Correct 2 ms 4180 KB Output is correct
13 Correct 2 ms 4180 KB Output is correct
14 Correct 3 ms 4180 KB Output is correct
15 Correct 2 ms 4180 KB Output is correct
16 Correct 2 ms 4180 KB Output is correct
17 Correct 2 ms 4180 KB Output is correct
18 Correct 2 ms 4180 KB Output is correct
19 Correct 2 ms 4180 KB Output is correct
20 Correct 2 ms 4180 KB Output is correct
21 Correct 2 ms 4180 KB Output is correct
22 Correct 2 ms 4180 KB Output is correct
23 Correct 2 ms 4180 KB Output is correct
24 Correct 2 ms 4172 KB Output is correct
25 Correct 2 ms 4180 KB Output is correct
26 Correct 2 ms 4180 KB Output is correct
27 Correct 2 ms 4180 KB Output is correct
28 Correct 2 ms 4180 KB Output is correct
29 Correct 9 ms 4308 KB Output is correct
30 Correct 8 ms 4436 KB Output is correct
31 Correct 7 ms 4364 KB Output is correct
32 Correct 16 ms 4416 KB Output is correct
33 Correct 6 ms 4436 KB Output is correct
34 Correct 7 ms 4468 KB Output is correct
35 Correct 16 ms 4452 KB Output is correct
36 Correct 10 ms 4388 KB Output is correct
37 Correct 9 ms 4452 KB Output is correct
38 Correct 12 ms 4444 KB Output is correct
39 Correct 97 ms 4436 KB Output is correct
40 Correct 17 ms 4388 KB Output is correct
41 Correct 20 ms 4436 KB Output is correct
42 Correct 13 ms 4436 KB Output is correct
43 Correct 10 ms 4440 KB Output is correct
44 Correct 10 ms 4432 KB Output is correct
45 Correct 4 ms 4436 KB Output is correct
46 Correct 6 ms 4436 KB Output is correct
47 Correct 119 ms 4440 KB Output is correct
48 Correct 20 ms 4448 KB Output is correct
49 Correct 24 ms 4436 KB Output is correct
50 Correct 21 ms 4436 KB Output is correct
51 Correct 105 ms 4424 KB Output is correct
52 Correct 90 ms 4416 KB Output is correct
53 Correct 57 ms 4436 KB Output is correct
54 Correct 18 ms 4436 KB Output is correct

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4180 KB Output is correct
2 Correct 2 ms 4180 KB Output is correct
3 Correct 79 ms 16596 KB Output is correct
4 Correct 100 ms 20880 KB Output is correct
5 Correct 74 ms 13968 KB Output is correct
6 Correct 78 ms 16336 KB Output is correct
7 Correct 80 ms 16184 KB Output is correct
8 Execution timed out 2044 ms 15216 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4180 KB Output is correct
2 Correct 2 ms 4180 KB Output is correct
3 Correct 2 ms 4180 KB Output is correct
4 Correct 2 ms 4180 KB Output is correct
5 Correct 2 ms 4180 KB Output is correct
6 Correct 2 ms 4168 KB Output is correct
7 Correct 2 ms 4180 KB Output is correct
8 Correct 2 ms 4180 KB Output is correct
9 Correct 2 ms 4180 KB Output is correct
10 Correct 2 ms 4180 KB Output is correct
11 Correct 2 ms 4168 KB Output is correct
12 Correct 2 ms 4180 KB Output is correct
13 Correct 2 ms 4180 KB Output is correct
14 Correct 3 ms 4180 KB Output is correct
15 Correct 2 ms 4180 KB Output is correct
16 Correct 2 ms 4180 KB Output is correct
17 Correct 2 ms 4180 KB Output is correct
18 Correct 2 ms 4180 KB Output is correct
19 Correct 2 ms 4180 KB Output is correct
20 Correct 2 ms 4180 KB Output is correct
21 Correct 2 ms 4180 KB Output is correct
22 Correct 2 ms 4180 KB Output is correct
23 Correct 2 ms 4180 KB Output is correct
24 Correct 2 ms 4172 KB Output is correct
25 Correct 2 ms 4180 KB Output is correct
26 Correct 2 ms 4180 KB Output is correct
27 Correct 2 ms 4180 KB Output is correct
28 Correct 2 ms 4180 KB Output is correct
29 Correct 79 ms 16596 KB Output is correct
30 Correct 100 ms 20880 KB Output is correct
31 Correct 74 ms 13968 KB Output is correct
32 Correct 78 ms 16336 KB Output is correct
33 Correct 80 ms 16184 KB Output is correct
34 Execution timed out 2044 ms 15216 KB Time limit exceeded
35 Halted 0 ms 0 KB -

Subtask #5
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4180 KB Output is correct
2 Correct 2 ms 4180 KB Output is correct
3 Correct 2 ms 4180 KB Output is correct
4 Correct 2 ms 4180 KB Output is correct
5 Correct 2 ms 4180 KB Output is correct
6 Correct 2 ms 4168 KB Output is correct
7 Correct 2 ms 4180 KB Output is correct
8 Correct 2 ms 4180 KB Output is correct
9 Correct 2 ms 4180 KB Output is correct
10 Correct 2 ms 4180 KB Output is correct
11 Correct 2 ms 4168 KB Output is correct
12 Correct 2 ms 4180 KB Output is correct
13 Correct 2 ms 4180 KB Output is correct
14 Correct 3 ms 4180 KB Output is correct
15 Correct 2 ms 4180 KB Output is correct
16 Correct 2 ms 4180 KB Output is correct
17 Correct 2 ms 4180 KB Output is correct
18 Correct 2 ms 4180 KB Output is correct
19 Correct 2 ms 4180 KB Output is correct
20 Correct 2 ms 4180 KB Output is correct
21 Correct 2 ms 4180 KB Output is correct
22 Correct 2 ms 4180 KB Output is correct
23 Correct 2 ms 4180 KB Output is correct
24 Correct 2 ms 4172 KB Output is correct
25 Correct 2 ms 4180 KB Output is correct
26 Correct 2 ms 4180 KB Output is correct
27 Correct 2 ms 4180 KB Output is correct
28 Correct 2 ms 4180 KB Output is correct
29 Correct 9 ms 4308 KB Output is correct
30 Correct 8 ms 4436 KB Output is correct
31 Correct 7 ms 4364 KB Output is correct
32 Correct 16 ms 4416 KB Output is correct
33 Correct 6 ms 4436 KB Output is correct
34 Correct 7 ms 4468 KB Output is correct
35 Correct 16 ms 4452 KB Output is correct
36 Correct 10 ms 4388 KB Output is correct
37 Correct 9 ms 4452 KB Output is correct
38 Correct 12 ms 4444 KB Output is correct
39 Correct 97 ms 4436 KB Output is correct
40 Correct 17 ms 4388 KB Output is correct
41 Correct 20 ms 4436 KB Output is correct
42 Correct 13 ms 4436 KB Output is correct
43 Correct 10 ms 4440 KB Output is correct
44 Correct 10 ms 4432 KB Output is correct
45 Correct 4 ms 4436 KB Output is correct
46 Correct 6 ms 4436 KB Output is correct
47 Correct 119 ms 4440 KB Output is correct
48 Correct 20 ms 4448 KB Output is correct
49 Correct 24 ms 4436 KB Output is correct
50 Correct 21 ms 4436 KB Output is correct
51 Correct 105 ms 4424 KB Output is correct
52 Correct 90 ms 4416 KB Output is correct
53 Correct 57 ms 4436 KB Output is correct
54 Correct 18 ms 4436 KB Output is correct
55 Execution timed out 2032 ms 13024 KB Time limit exceeded
56 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4180 KB Output is correct
2 Correct 2 ms 4180 KB Output is correct
3 Correct 2 ms 4180 KB Output is correct
4 Correct 2 ms 4180 KB Output is correct
5 Correct 2 ms 4180 KB Output is correct
6 Correct 2 ms 4168 KB Output is correct
7 Correct 2 ms 4180 KB Output is correct
8 Correct 2 ms 4180 KB Output is correct
9 Correct 2 ms 4180 KB Output is correct
10 Correct 2 ms 4180 KB Output is correct
11 Correct 2 ms 4168 KB Output is correct
12 Correct 2 ms 4180 KB Output is correct
13 Correct 2 ms 4180 KB Output is correct
14 Correct 3 ms 4180 KB Output is correct
15 Correct 2 ms 4180 KB Output is correct
16 Correct 2 ms 4180 KB Output is correct
17 Correct 2 ms 4180 KB Output is correct
18 Correct 2 ms 4180 KB Output is correct
19 Correct 2 ms 4180 KB Output is correct
20 Correct 2 ms 4180 KB Output is correct
21 Correct 2 ms 4180 KB Output is correct
22 Correct 2 ms 4180 KB Output is correct
23 Correct 2 ms 4180 KB Output is correct
24 Correct 2 ms 4172 KB Output is correct
25 Correct 2 ms 4180 KB Output is correct
26 Correct 2 ms 4180 KB Output is correct
27 Correct 2 ms 4180 KB Output is correct
28 Correct 2 ms 4180 KB Output is correct
29 Correct 9 ms 4308 KB Output is correct
30 Correct 8 ms 4436 KB Output is correct
31 Correct 7 ms 4364 KB Output is correct
32 Correct 16 ms 4416 KB Output is correct
33 Correct 6 ms 4436 KB Output is correct
34 Correct 7 ms 4468 KB Output is correct
35 Correct 16 ms 4452 KB Output is correct
36 Correct 10 ms 4388 KB Output is correct
37 Correct 9 ms 4452 KB Output is correct
38 Correct 12 ms 4444 KB Output is correct
39 Correct 97 ms 4436 KB Output is correct
40 Correct 17 ms 4388 KB Output is correct
41 Correct 20 ms 4436 KB Output is correct
42 Correct 13 ms 4436 KB Output is correct
43 Correct 10 ms 4440 KB Output is correct
44 Correct 10 ms 4432 KB Output is correct
45 Correct 4 ms 4436 KB Output is correct
46 Correct 6 ms 4436 KB Output is correct
47 Correct 119 ms 4440 KB Output is correct
48 Correct 20 ms 4448 KB Output is correct
49 Correct 24 ms 4436 KB Output is correct
50 Correct 21 ms 4436 KB Output is correct
51 Correct 105 ms 4424 KB Output is correct
52 Correct 90 ms 4416 KB Output is correct
53 Correct 57 ms 4436 KB Output is correct
54 Correct 18 ms 4436 KB Output is correct
55 Correct 79 ms 16596 KB Output is correct
56 Correct 100 ms 20880 KB Output is correct
57 Correct 74 ms 13968 KB Output is correct
58 Correct 78 ms 16336 KB Output is correct
59 Correct 80 ms 16184 KB Output is correct
60 Execution timed out 2044 ms 15216 KB Time limit exceeded
61 Halted 0 ms 0 KB -