제출 #799749

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
799749		TB_	Joker (BOI20_joker)	C++17	0 / 100	1 ms	468 KiB

Joker

#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 StreetHandler{
    vl degree, height;
    vpl edge;
    int n;
    int possible = 0;
    StreetHandler(int n) : n(n) {
        height.assign(n, 0);
        degree.assign(n, 0);
    }


    void addEdge(int a, int b){
        if(degree[a] && degree[b]){
            if(height[a]%2 == height[b]%2) possible++;
        }else{
            if(height[b] > height[a]) swap(a, b);
            height[b] = height[a]+1;
        }
        edge.pb({a, b});
        degree[a]++;
        degree[b]++;
    }  


    void backtrack(){
        int a, b;
        tie(a, b) = edge[edge.size()-1]; 
        degree[a]--;
        degree[b]--;

        if(degree[a] && degree[b]){
            if(height[a]%2 == height[b]%2) possible--;
        }else{
            height[b] = 0;
        }
        edge.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);
    fo(x, q){
        cin >> from >> to;
        queries[from/((int)sqrt(n))].pb({to-1, from-1, x});
    }
    fo(i, 1000){
        sort(rall(queries[i]));
    }
    StreetHandler sh(n);
    vi ans(q, 0);
    int lo = 0, hi = n-1;
    fo(section, 1000){
        for(auto query : queries[section]){
            tie(to, from, que) = query;
            fo(i, hi-to) sh.addEdge(edges[hi-i].F,edges[hi-i].S);
            hi=to;

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


    return 0;
}

• Subtask 1: 0 / 6
• Subtask 2: 0 / 8
• Subtask 3: 0 / 25
• Subtask 4: 0 / 10
• Subtask 5: 0 / 22
• Subtask 6: 0 / 29