被坑了!!10^9 - (-10^9) 会超过 0x3f3f3f3f , 搞的我 2 2 2 0 999999999 1 -999999999 2 这组直接输出 - 1
#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<cmath>
#include<cassert>
#include<cstring>
#include<iomanip>
using namespace std;
#ifdef _WIN32
#define i64 __int64
#define out64 "%I64d\n"
#define in64 "%I64d"
#else
#define i64 long long
#define out64 "%lld\n"
#define in64 "%lld"
#endif
/************ for topcoder by zz1215 *******************/
#define FOR(i,a,b) for( int i = (a) ; i <= (b) ; i ++)
#define FFF(i,a) for( int i = 0 ; i < (a) ; i ++)
#define FFD(i,a,b) for( int i = (a) ; i >= (b) ; i --)
#define S64(a) scanf(in64,&a)
#define SS(a) scanf("%d",&a)
#define LL(a) ((a)<<1)
#define RR(a) (((a)<<1)+1)
#define pb push_back
#define CL(Q) while(!Q.empty())Q.pop()
#define MM(name,what) memset(name,what,sizeof(name))
#define MAX(a,b) ((a)>(b)?(a):(b))
#define MIN(a,b) ((a)<(b)?(a):(b))
#define read freopen("in.txt","r",stdin)
#define write freopen("out.txt","w",stdout)
const int inf = 0x3f3f3f3f;
const i64 inf64 = 0x3f3f3f3f3f3f3f3fLL;
const double oo = 10e9;
const double eps = 10e-9;
const double pi = acos(-1.0);
const int maxn = 2111;
struct zz
{
int x;
int id;
bool operator < (const zz & cmp) const
{
return x<cmp.x;
}
}zx;
vector<zz>v;
int c,n,k,m;
int dpy[maxn];
int dpn[maxn];
bool vis[maxn];
int cnt[maxn];
vector<int>g[maxn];
void df(int now)
{
vis[now]=true;
int to;
dpn[now]=0;
dpy[now]=1;
for(int i=0;i<g[now].size();i++)
{
to=g[now][i];
if(!vis[to] && cnt[to]>0)
{
df(to);
dpn[now]+=max(dpn[to],dpy[to]);
dpy[now]+=dpn[to];
}
}
return ;
}
bool find()
{
MM(vis,false);
int re=0;
for(int i=1;i<=n;i++)
{
if(cnt[i]>0 && !vis[i])
{
df(i);
re+=max(dpy[i],dpn[i]);
}
}
return re>=k;
}
int start()
{
MM(cnt,0);
int lend=0;
int rend=0;
cnt[v[0].id]++;
int ans=-1;
int tot=1;
while(true)
{
if(tot>=k && find())
{
while(cnt[v[lend].id]>1)
{
cnt[v[lend].id]--;
lend++;
}
if(ans==-1)
{
ans = v[rend].x-v[lend].x;
}
else
{
ans=min(ans,v[rend].x-v[lend].x);
}
cnt[v[lend].id]--;
tot--;
assert(cnt[v[lend].id]==0);
lend++;
}
else
{
rend++;
while(rend<v.size() && cnt[v[rend].id]>0)
{
cnt[v[rend].id]++;
rend++;
}
if(rend<v.size())
{
assert(cnt[v[rend].id]==0);
tot++;
cnt[v[rend].id]++;
}
else
{
break;
}
}
}
return ans;
}
int main()
{
int T;
cin>>T;
for(int tt=1;tt<=T;tt++)
{
cin>>c>>n>>k>>m;
v.clear();
for(int i=1;i<=c;i++)
{
SS(zx.x);
SS(zx.id);
v.pb(zx);
}
sort(v.begin(),v.end());
int now,to;
for(int i=1;i<=n;i++)
{
g[i].clear();
}
for(int i=1;i<=m;i++)
{
SS(now);
SS(to);
g[now].pb(to);
g[to].pb(now);
}
cout<<"Case #"<<tt<<": "<<start()<<endl;
}
return 0;
}