提出詳細

提出id	提出時刻	ユーザー名	問題	言語	判定状況	判定	実行時間
114765	2023-10-24 07:50:02	Eug1ena	J	cpp	11/11	AC	10

//#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
constexpr lint mod = 1e9 + 7;
#define all(x) begin(x), end(x)
#define bitcount(n) __builtin_popcountll((lint)(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzll(x))
#define rep(i, n) for(int i = 0; i < int(n); i++)
#define rep2(i, l, r) for(int i = int(l); i < int(r); i++)
#define repr(i, n) for(int i = int(n) - 1; i >= 0; i--)
#define repr2(i, l, r) for(int i = int(r) - 1; i >= int(l); i--)
#define accumulate you cannot use this word!
constexpr int inf9 = 1e9; constexpr lint inf18 = 1e18;
inline void Yes(bool condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class itr> void array_output(itr start, itr goal){ for(auto i = start; i != goal; i++) cout << (i == start ? "" : " ") << (*i); cout << endl; }
template<class itr> void cins(itr first, itr last){ for(auto i = first; i != last; i++){ cin >> (*i); } }
template<class T> T gcd(T a, T b){ if(b) return gcd(b, a % b); else return a; }
template<class T> T lcm(T a, T b){ return a / gcd(a, b) * b; }
template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b){ if(b < a){ a = b; return 1; } return 0; }
inline int has(lint i, int j){ return (i >> j) & 1; }
int dy[4] = {1, 0, -1, 0}; int dx[4] = {0, 1, 0, -1};
bool is_inside(lint y, lint x, lint H, lint W){ return (0 <= y && y < H && 0 <= x && x < W); }

struct io_init {
    io_init() {
        cin.tie(nullptr); cout.tie(nullptr);
        std::ios::sync_with_stdio(false);
    }
} io_init;

struct UnionFind{
    int sz;
    vector<int> data;
    
    UnionFind(int n): sz(n), data(n, -1) { }
    
    int find(int k){
        if(data[k] < 0){
            return k;
        }else{
            return data[k] = find(data[k]);
        }
    }
    
    void unite(int a, int b){
        a = find(a), b = find(b);
        if(a == b) return;
        if(-data[a] < -data[b]){
            swap(a, b);
        }
        data[a] += data[b];
        data[b] = a;
    }
    
    int size(int k){
        return -data[find(k)];
    }
    
    bool is_group(int a, int b){
        return find(a) == find(b);
    }
    
    vector<int> roots(){
        vector<int> ret;
        rep(i, sz){
            if(data[i] < 0) ret.push_back(i);
        }
        return ret;
    }
    
    vector<vector<int>> groups(){
        vector<vector<int>> group_list(sz);
        rep(i, sz){
            group_list[find(i)].push_back(i);
        }
        
        vector<vector<int>> ret;
        for(auto& vec: group_list){
            if(!vec.empty()){
                ret.push_back(vec);
            }
        }
        return ret;
    }
};


int main(){
    int n, m, x;
    lint p;
    cin >> n >> m >> x >> p;
    lint b[n], t[m];
    rep(i, n) cin >> b[i];
    rep(i, m) cin >> t[i];
    
    UnionFind uf(m);
    rep(_, x){
        int u, v;
        cin >> u >> v;
        u--, v--;
        uf.unite(u, v);
    }
    
    vector<bool> should_be_removed(m, false);
    for(lint pos: b){
        rep(i, m){
            if(abs(pos - t[i]) <= p){
                should_be_removed[i] = true;
            }
        }
    }
    
    set<int> should_be_removed_group;
    rep(i, m){
        if(should_be_removed[i]){
            should_be_removed_group.insert(uf.find(i));
        }
    }
    
    cout << should_be_removed_group.size() << endl;
}

case1.txt AC 2
case2.txt AC 3
case3.txt AC 6
case4.txt AC 8
case5.txt AC 7
case6.txt AC 8
case9.txt AC 7
case10.txt AC 10
case11.txt AC 9
case13.txt AC 8
sample1.txt AC 7
10 AC10 AC