Gecko [ tsuru-no-tsurugi.tokyo ]

Linux tsuru-no-tsurugi 5.15.0-186-generic #196-Ubuntu SMP Sat Jun 20 16:09:34 UTC 2026 x86_64
Apache/2.4.52 (Ubuntu)
Server IP : 192.168.0.18 & Your IP : 216.73.217.105
Domains : Cant Read [ /etc/named.conf ]
User : www-data

Name	Size	Permission	Date
A-cpp	174 B	-rwxr-xr--	2024-08-28 22:43
A-python-2.py	45 B	-rw-r--r--	2024-08-28 22:43
A-python.py	129 B	-rwxr-xr--	2024-08-28 22:43
B-cpp	210 B	-rw-r--r--	2024-08-28 22:43
B-python.py	118 B	-rw-r--r--	2024-08-28 22:43
C-cpp	242 B	-rw-r--r--	2024-08-28 22:43
D-cpp	242 B	-rw-r--r--	2024-08-28 22:43
D-python.py	160 B	-rw-r--r--	2024-08-28 22:43
E-cpp1	595 B	-rw-r--r--	2024-08-28 22:43
E-cpp2	164 B	-rw-r--r--	2024-08-28 22:43
E-python.py	337 B	-rw-r--r--	2024-08-28 22:43
F-cpp	563 B	-rwxr-xr--	2024-08-28 22:43
G-cpp	480 B	-rwxr-xr--	2024-08-28 22:43
H-cpp	1018 B	-rw-r--r--	2024-08-28 22:43
I-cpp	1.59 KB	-rw-r--r--	2024-08-28 22:43
J-cpp	1.16 KB	-rw-r--r--	2024-08-28 22:43
K-cpp	2.04 KB	-rwxr-xr--	2024-08-28 22:43

Rename

#include<bits/stdc++.h>
using namespace std;

vector<int> par(1e5+9,-1);
vector<int> siz(1e5+9,1);

int root(int x){
  while(true){
    if(par[x]==-1)break;
    x=par[x];
  }
  return x;
}

void unite(int u,int v){
  int Root_u = root(u);
  int Root_v = root(v);
  if (Root_u == Root_v) return;
  if(siz[Root_u] < siz[Root_v]){
    par[Root_u] = Root_v;
    siz[Root_v] = siz[Root_u] + siz[Root_v];
  }
  else{
    par[Root_v] = Root_u;
    siz[Root_u] = siz[Root_u] + siz[Root_v];
  }
}

int main(){
  int N, M, X, P;
  cin >> N >> M >> X >> P;
  vector<int> B(N), T(M);
  
  for(int i = 0; i < N; i++){
    cin >> B[i];
  }
  
  for(int i = 0; i < M; i++){
    cin >> T[i];
  }
  
  for(int i = 0; i < X; i++){
    int u, v;
    cin >> u >> v;
    --u;
    --v;
    unite(u,v);
  }
  vector<int> R(M);
  for(int i = 0; i < M; i++){
    R[i] = root(i);
  }
  
  sort(T.begin(),T.end());
  set<int> st;
  for(int i=0; i < N; i++){
    int l, r;
    l = lower_bound(T.begin(), T.end(), B[i] - P) - T.begin();
    r = upper_bound(T.begin(), T.end(), B[i] + P) - T.begin();
    if(l<0) l=0;
    for(int j = l; j < r; j++){
      st.insert(R[j]);
    }
  }
  cout << st.size() << endl;
}