oj.uz

Submission #1016091

# Submission time Handle Problem Language Result Execution time Memory
1016091 2024-07-07T11:37:04 Z GrindMachine Colors (RMI18_colors) C++17
100 / 100
 411 ms 34688 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

struct DSU {
    vector<int> par, rankk;
    vector<int> good;
    vector<array<int,4>> history;

    DSU() {

    }

    DSU(int n) {
        init(n);
    }

    void init(int n) {
        par = vector<int>(n + 1);
        rankk = vector<int>(n + 1);
        good = vector<int>(n + 1);
        rep(i, n + 1) create(i);
    }

    void create(int u) {
        par[u] = u;
        rankk[u] = 0;
    }

    int find(int u) {
        if (u == par[u]) return u;
        else return find(par[u]);
    }

    bool same(int u, int v) {
        return find(u) == find(v);
    }

    void merge(int u, int v, int id) {
        u = find(u), v = find(v);
        if (u == v) return;

        history.pb({id,u,par[u],rankk[u]});
        history.pb({id,v,par[v],rankk[v]});

        if (rankk[u] == rankk[v]) rankk[u]++;
        if (rankk[u] < rankk[v]) swap(u, v);

        par[v] = u;
    }

    void rollback(int id){
        while(!history.empty()){
            auto [idd,u,pu,rnku] = history.back();
            if(idd != id) break;
            history.pop_back();
            par[u] = pu;
            rankk[u] = rnku;
        }
    }
};

void solve(int test_case)
{
    int n,m; cin >> n >> m;
    vector<int> a(n+5), b(n+5);
    rep1(i,n) cin >> a[i];
    rep1(i,n) cin >> b[i];
    vector<pii> edges(m+5);
    rep1(i,m) cin >> edges[i].ff >> edges[i].ss;

    vector<pii> edge_range(m+5);
    rep1(i,m){
        auto [u,v] = edges[i];
        int l1 = b[u], r1 = a[u];
        int l2 = b[v], r2 = a[v];
        int l3 = max(l1,l2), r3 = min(r1,r2);
        edge_range[i] = {l3,r3};
    }

    vector<vector<int>> ax(n+5), bx(n+5);
    rep1(i,n) ax[a[i]].pb(i), bx[b[i]].pb(i);

    int ans = 1;
    DSU dsu(n);
    int ptr = 1;

    auto go = [&](vector<int> &edge_ids, int l, int r, auto &&go) -> void{
        if(l > r) return;
        int mid = (l+r) >> 1;

        // x in [l,mid]
        vector<int> nxt;
        int curr_ptr = ptr++;

        trav(id,edge_ids){
            auto [u,v] = edges[id];
            auto [lx,rx] = edge_range[id];
            if(lx > mid or rx < l) conts;
            if(lx <= l and rx >= mid){
                dsu.merge(u,v,curr_ptr);
            }
            else{
                nxt.pb(id);
            }
        }

        if(l != mid){
            go(nxt,l,mid,go);
        }
        else{
            // calc ans for x = mid
            trav(i,ax[mid]){
                dsu.good[dsu.find(i)] = 1;
            }

            trav(i,bx[mid]){
                int p = dsu.find(i);
                ans &= dsu.good[p];
            }

            trav(i,ax[mid]){
                dsu.good[dsu.find(i)] = 0;
            }
        }

        dsu.rollback(curr_ptr);

        // x in [mid+1,r]
        nxt.clear();
        curr_ptr = ptr++;

        trav(id,edge_ids){
            auto [u,v] = edges[id];
            auto [lx,rx] = edge_range[id];
            if(lx > r or rx < mid+1) conts;
            if(lx <= mid+1 and rx >= r){
                dsu.merge(u,v,curr_ptr);
            }
            else{
                nxt.pb(id);
            }
        }

        go(nxt,mid+1,r,go);
        dsu.rollback(curr_ptr);
    };

    vector<int> edge_ids;
    rep1(i,m){
        if(edge_range[i].ff <= edge_range[i].ss){
            edge_ids.pb(i);
        }
    }

    go(edge_ids,1,n,go);

    cout << ans << endl;

    /*

    rev(x,n,1){
        DSU dsu(n);
        rep1(i,m){
            auto [l,r] = edge_range[i];
            if(l <= x and x <= r){
                auto [u,v] = edges[i];
                dsu.merge(u,v);
            }
        }

        rep1(i,n){
            if(a[i] == x){
                dsu.good[dsu.find(i)] = 1;
            }
        }

        rep1(i,n){
            if(b[i] == x){
                int p = dsu.find(i);
                ans &= dsu.good[p];
            }
        }
    }

    cout << ans << endl;

    */
}

int main()
{
    fastio;

    int t = 1;
    cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 348 KB Output is correct
2 Correct 20 ms 348 KB Output is correct
3 Correct 3 ms 604 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 588 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 348 KB Output is correct
2 Correct 32 ms 344 KB Output is correct
3 Correct 4 ms 604 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 348 KB Output is correct
2 Correct 32 ms 344 KB Output is correct
3 Correct 4 ms 604 KB Output is correct
4 Correct 133 ms 536 KB Output is correct
5 Correct 287 ms 9448 KB Output is correct
6 Correct 411 ms 28368 KB Output is correct

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 348 KB Output is correct
2 Correct 20 ms 348 KB Output is correct
3 Correct 3 ms 604 KB Output is correct
4 Correct 68 ms 348 KB Output is correct
5 Correct 32 ms 344 KB Output is correct
6 Correct 4 ms 604 KB Output is correct
7 Correct 60 ms 344 KB Output is correct
8 Correct 22 ms 344 KB Output is correct
9 Correct 4 ms 604 KB Output is correct

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 520 KB Output is correct
2 Correct 275 ms 11400 KB Output is correct
3 Correct 235 ms 23872 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 348 KB Output is correct
2 Correct 9 ms 604 KB Output is correct
3 Correct 4 ms 348 KB Output is correct

Subtask #8
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 348 KB Output is correct
2 Correct 20 ms 348 KB Output is correct
3 Correct 3 ms 604 KB Output is correct
4 Correct 46 ms 588 KB Output is correct
5 Correct 68 ms 348 KB Output is correct
6 Correct 32 ms 344 KB Output is correct
7 Correct 4 ms 604 KB Output is correct
8 Correct 133 ms 536 KB Output is correct
9 Correct 287 ms 9448 KB Output is correct
10 Correct 411 ms 28368 KB Output is correct
11 Correct 60 ms 344 KB Output is correct
12 Correct 22 ms 344 KB Output is correct
13 Correct 4 ms 604 KB Output is correct
14 Correct 123 ms 520 KB Output is correct
15 Correct 275 ms 11400 KB Output is correct
16 Correct 235 ms 23872 KB Output is correct
17 Correct 23 ms 348 KB Output is correct
18 Correct 9 ms 604 KB Output is correct
19 Correct 4 ms 348 KB Output is correct
20 Correct 67 ms 652 KB Output is correct
21 Correct 254 ms 14152 KB Output is correct
22 Correct 355 ms 34688 KB Output is correct