oj.uz

답안 #800824

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

UnionFind uf(200001);
vpl edges;
vi ans(200001, -1);

void solve(int lo, int hi, int r){
    if(hi < lo) return;

    int mid = (lo + hi) / 2;
    int preSizeLo = uf.updates.size();
    fo(i, mid-lo){
        uf.unite(edges[lo+i].F, edges[lo+i].S);
        if(uf.possible){
            for(int j = mid; j <= hi; j++) ans[j] = r; 
            while(uf.updates.size() != preSizeLo) uf.rollback();
            solve(lo, mid-1, r);
            return;
        }
    }
    int preSizeHi = uf.updates.size();
    for(int i = r; i >= max(lo, mid-1); i--){
        if(uf.possible){
            ans[mid] = i;
            break;
        }
        uf.unite(edges[i].F, edges[i].S);
    }
    while(uf.updates.size() != preSizeHi) uf.rollback();
    uf.unite(edges[mid].F, edges[mid].S);
    solve(mid+1, hi, r);
    while(uf.updates.size() != preSizeLo) uf.rollback();
    for(int i = r; i > max(lo, ans[mid]); i--)
        uf.unite(edges[i].F, edges[i].S);
    solve(lo, mid-1, ans[mid]);
}


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;
    cin >> n >> m >> q;
    fo(i, m){
        cin >> from >> to;
        edges.pb({from-1, to-1});
    }

    solve(0, m-1, m-1);

    fo(x, q){
        cin >> from >> to;
        cout << (ans[from-1]>=to-1?"YES\n":"NO\n");      
    }
    


    exit(0);
}

Compilation message

Joker.cpp: In function 'void solve(int, int, int)':
Joker.cpp:124:37: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<std::pair<int, int>, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  124 |             while(uf.updates.size() != preSizeLo) uf.rollback();
      |                   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
Joker.cpp:137:29: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<std::pair<int, int>, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  137 |     while(uf.updates.size() != preSizeHi) uf.rollback();
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
Joker.cpp:140:29: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<std::pair<int, int>, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  140 |     while(uf.updates.size() != preSizeLo) uf.rollback();
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
Joker.cpp: In function 'int main()':
Joker.cpp:152:28: warning: unused variable 'que' [-Wunused-variable]
  152 |     int n, m, q, from, to, que;
      |                            ^~~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 4 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 2 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 2 ms 4948 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 3 ms 5032 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 2 ms 5044 KB Output is correct
21 Correct 2 ms 4948 KB Output is correct
22 Correct 2 ms 5036 KB Output is correct
23 Correct 2 ms 4948 KB Output is correct
24 Correct 2 ms 4948 KB Output is correct
25 Correct 2 ms 5036 KB Output is correct
26 Correct 2 ms 4948 KB Output is correct
27 Correct 2 ms 5036 KB Output is correct
28 Correct 2 ms 4948 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 4 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 2 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 2 ms 4948 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 3 ms 5032 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 2 ms 5044 KB Output is correct
21 Correct 2 ms 4948 KB Output is correct
22 Correct 2 ms 5036 KB Output is correct
23 Correct 2 ms 4948 KB Output is correct
24 Correct 2 ms 4948 KB Output is correct
25 Correct 2 ms 5036 KB Output is correct
26 Correct 2 ms 4948 KB Output is correct
27 Correct 2 ms 5036 KB Output is correct
28 Correct 2 ms 4948 KB Output is correct
29 Correct 4 ms 5048 KB Output is correct
30 Correct 3 ms 5076 KB Output is correct
31 Correct 4 ms 5096 KB Output is correct
32 Correct 3 ms 5044 KB Output is correct
33 Correct 3 ms 5076 KB Output is correct
34 Correct 3 ms 5172 KB Output is correct
35 Correct 3 ms 5076 KB Output is correct
36 Correct 3 ms 5076 KB Output is correct
37 Correct 4 ms 5172 KB Output is correct
38 Correct 7 ms 5204 KB Output is correct
39 Correct 3 ms 5076 KB Output is correct
40 Correct 3 ms 5076 KB Output is correct
41 Correct 3 ms 5076 KB Output is correct
42 Correct 3 ms 5076 KB Output is correct
43 Correct 4 ms 5076 KB Output is correct
44 Correct 3 ms 5048 KB Output is correct
45 Correct 3 ms 5076 KB Output is correct
46 Correct 3 ms 5076 KB Output is correct
47 Correct 4 ms 5040 KB Output is correct
48 Correct 3 ms 5076 KB Output is correct
49 Correct 4 ms 5076 KB Output is correct
50 Correct 5 ms 5076 KB Output is correct
51 Correct 4 ms 5076 KB Output is correct
52 Correct 4 ms 5076 KB Output is correct
53 Correct 3 ms 5076 KB Output is correct
54 Correct 3 ms 5076 KB Output is correct

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 141 ms 14280 KB Output is correct
4 Execution timed out 2041 ms 18364 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 4 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 2 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 2 ms 4948 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 3 ms 5032 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 2 ms 5044 KB Output is correct
21 Correct 2 ms 4948 KB Output is correct
22 Correct 2 ms 5036 KB Output is correct
23 Correct 2 ms 4948 KB Output is correct
24 Correct 2 ms 4948 KB Output is correct
25 Correct 2 ms 5036 KB Output is correct
26 Correct 2 ms 4948 KB Output is correct
27 Correct 2 ms 5036 KB Output is correct
28 Correct 2 ms 4948 KB Output is correct
29 Correct 141 ms 14280 KB Output is correct
30 Execution timed out 2041 ms 18364 KB Time limit exceeded
31 Halted 0 ms 0 KB -

Subtask #5
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 4 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 2 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 2 ms 4948 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 3 ms 5032 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 2 ms 5044 KB Output is correct
21 Correct 2 ms 4948 KB Output is correct
22 Correct 2 ms 5036 KB Output is correct
23 Correct 2 ms 4948 KB Output is correct
24 Correct 2 ms 4948 KB Output is correct
25 Correct 2 ms 5036 KB Output is correct
26 Correct 2 ms 4948 KB Output is correct
27 Correct 2 ms 5036 KB Output is correct
28 Correct 2 ms 4948 KB Output is correct
29 Correct 4 ms 5048 KB Output is correct
30 Correct 3 ms 5076 KB Output is correct
31 Correct 4 ms 5096 KB Output is correct
32 Correct 3 ms 5044 KB Output is correct
33 Correct 3 ms 5076 KB Output is correct
34 Correct 3 ms 5172 KB Output is correct
35 Correct 3 ms 5076 KB Output is correct
36 Correct 3 ms 5076 KB Output is correct
37 Correct 4 ms 5172 KB Output is correct
38 Correct 7 ms 5204 KB Output is correct
39 Correct 3 ms 5076 KB Output is correct
40 Correct 3 ms 5076 KB Output is correct
41 Correct 3 ms 5076 KB Output is correct
42 Correct 3 ms 5076 KB Output is correct
43 Correct 4 ms 5076 KB Output is correct
44 Correct 3 ms 5048 KB Output is correct
45 Correct 3 ms 5076 KB Output is correct
46 Correct 3 ms 5076 KB Output is correct
47 Correct 4 ms 5040 KB Output is correct
48 Correct 3 ms 5076 KB Output is correct
49 Correct 4 ms 5076 KB Output is correct
50 Correct 5 ms 5076 KB Output is correct
51 Correct 4 ms 5076 KB Output is correct
52 Correct 4 ms 5076 KB Output is correct
53 Correct 3 ms 5076 KB Output is correct
54 Correct 3 ms 5076 KB Output is correct
55 Correct 119 ms 13732 KB Output is correct
56 Execution timed out 2081 ms 19420 KB Time limit exceeded
57 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 4 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 2 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 2 ms 4948 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 3 ms 5032 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 2 ms 5044 KB Output is correct
21 Correct 2 ms 4948 KB Output is correct
22 Correct 2 ms 5036 KB Output is correct
23 Correct 2 ms 4948 KB Output is correct
24 Correct 2 ms 4948 KB Output is correct
25 Correct 2 ms 5036 KB Output is correct
26 Correct 2 ms 4948 KB Output is correct
27 Correct 2 ms 5036 KB Output is correct
28 Correct 2 ms 4948 KB Output is correct
29 Correct 4 ms 5048 KB Output is correct
30 Correct 3 ms 5076 KB Output is correct
31 Correct 4 ms 5096 KB Output is correct
32 Correct 3 ms 5044 KB Output is correct
33 Correct 3 ms 5076 KB Output is correct
34 Correct 3 ms 5172 KB Output is correct
35 Correct 3 ms 5076 KB Output is correct
36 Correct 3 ms 5076 KB Output is correct
37 Correct 4 ms 5172 KB Output is correct
38 Correct 7 ms 5204 KB Output is correct
39 Correct 3 ms 5076 KB Output is correct
40 Correct 3 ms 5076 KB Output is correct
41 Correct 3 ms 5076 KB Output is correct
42 Correct 3 ms 5076 KB Output is correct
43 Correct 4 ms 5076 KB Output is correct
44 Correct 3 ms 5048 KB Output is correct
45 Correct 3 ms 5076 KB Output is correct
46 Correct 3 ms 5076 KB Output is correct
47 Correct 4 ms 5040 KB Output is correct
48 Correct 3 ms 5076 KB Output is correct
49 Correct 4 ms 5076 KB Output is correct
50 Correct 5 ms 5076 KB Output is correct
51 Correct 4 ms 5076 KB Output is correct
52 Correct 4 ms 5076 KB Output is correct
53 Correct 3 ms 5076 KB Output is correct
54 Correct 3 ms 5076 KB Output is correct
55 Correct 141 ms 14280 KB Output is correct
56 Execution timed out 2041 ms 18364 KB Time limit exceeded
57 Halted 0 ms 0 KB -