oj.uz

답안 #2676

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
2676 2013-07-30T14:46:34 Z gs13068 간선 파괴 (GA5_destroy) C++
100 / 100
 1356 ms 19012 KB 
#include<cstdio>
#include<vector>

#define BUCKET_SIZE 7

int s[300000];
int e[300000];

struct edge
{
int s;
int e;
} temp;

std::vector<edge> pre[2400];
std::vector<edge> suf[2400];
int parent[1000];
int height[1000];

inline int root(int x)
{
return parent[x]==x?x:parent[x]=root(parent[x]);
}

inline void combine(int a,int b)
{
a=root(a);
b=root(b);
if(height[a]<height[b])parent[a]=b;
else parent[b]=a;
if(height[a]==height[b])height[b]++;
}

int main()
{
int i,j,k,n,m,l,r,q;
scanf("%d%d",&n,&m);
for(i=0;i<m;i++)
{
scanf("%d%d",&s[i],&e[i]);
s[i]--;e[i]--;
}
for(i=0;i<n;i++)
{
parent[i]=i;
height[i]=0;
}
for(i=0;i<m;i++)
{
combine(s[i],e[i]);
if((i&((1<<BUCKET_SIZE)-1))==(1<<BUCKET_SIZE)-1)
{
for(j=0;j<n;j++)if(parent[j]!=j)
{
temp.s=j;
temp.e=parent[j];
pre[i>>BUCKET_SIZE].push_back(temp);
}
}
}
for(i=0;i<n;i++)
{
parent[i]=i;
height[i]=0;
}
for(i=m-1;i>=0;i--)
{
combine(s[i],e[i]);
if(!(i&((1<<BUCKET_SIZE)-1)))
{
for(j=0;j<n;j++)if(parent[j]!=j)
{
temp.s=j;
temp.e=parent[j];
suf[i>>BUCKET_SIZE].push_back(temp);
}
}
}
scanf("%d",&q);
for(i=0;i<q;i++)
{
scanf("%d%d",&l,&r);
l--;r--;
for(j=0;j<n;j++)
{
parent[j]=j;
height[j]=0;
}
j=(l>>BUCKET_SIZE)-1;
if(j>=0)for(k=0;k<pre[j].size();k++)combine(pre[j][k].s,pre[j][k].e);
for(k=(l>>BUCKET_SIZE)<<BUCKET_SIZE;k<l;k++)combine(s[k],e[k]);
j=(r>>BUCKET_SIZE)+1;
for(k=0;k<suf[j].size();k++)combine(suf[j][k].s,suf[j][k].e);
for(k=r+1;k<((r>>BUCKET_SIZE)+1)<<BUCKET_SIZE;k++)combine(s[k],e[k]);
k=0;
for(j=0;j<n;j++)if(parent[j]==j)k++;
printf("%d\n",k);
}
}

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 3672 KB Output is correct
2 Correct 0 ms 3672 KB Output is correct
3 Correct 0 ms 3672 KB Output is correct
4 Correct 0 ms 3672 KB Output is correct
5 Correct 0 ms 3672 KB Output is correct
6 Correct 0 ms 3672 KB Output is correct
7 Correct 0 ms 3672 KB Output is correct
8 Correct 0 ms 3672 KB Output is correct
9 Correct 0 ms 3672 KB Output is correct
10 Correct 0 ms 3672 KB Output is correct
11 Correct 0 ms 3672 KB Output is correct
12 Correct 0 ms 3672 KB Output is correct
13 Correct 0 ms 3672 KB Output is correct
14 Correct 0 ms 3672 KB Output is correct
15 Correct 0 ms 3672 KB Output is correct
16 Correct 0 ms 3672 KB Output is correct
17 Correct 0 ms 3672 KB Output is correct
18 Correct 0 ms 3672 KB Output is correct
19 Correct 0 ms 3672 KB Output is correct
20 Correct 0 ms 3672 KB Output is correct
21 Correct 0 ms 3672 KB Output is correct
22 Correct 0 ms 3672 KB Output is correct

Subtask #2
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 4464 KB Output is correct
2 Correct 40 ms 4464 KB Output is correct
3 Correct 36 ms 4596 KB Output is correct
4 Correct 56 ms 6708 KB Output is correct
5 Correct 48 ms 6708 KB Output is correct
6 Correct 392 ms 6576 KB Output is correct
7 Correct 388 ms 6444 KB Output is correct
8 Correct 384 ms 6444 KB Output is correct
9 Correct 36 ms 3672 KB Output is correct
10 Correct 36 ms 3672 KB Output is correct
11 Correct 36 ms 3672 KB Output is correct
12 Correct 56 ms 6708 KB Output is correct
13 Correct 56 ms 6708 KB Output is correct
14 Correct 52 ms 6708 KB Output is correct
15 Correct 28 ms 3672 KB Output is correct
16 Correct 28 ms 3672 KB Output is correct
17 Correct 12 ms 3672 KB Output is correct
18 Correct 8 ms 3672 KB Output is correct
19 Correct 4 ms 3672 KB Output is correct
20 Correct 4 ms 3672 KB Output is correct
21 Correct 0 ms 3672 KB Output is correct
22 Correct 0 ms 3672 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1292 ms 10044 KB Output is correct
2 Correct 1284 ms 9636 KB Output is correct
3 Correct 1300 ms 19012 KB Output is correct
4 Correct 1268 ms 10044 KB Output is correct
5 Correct 1260 ms 7328 KB Output is correct
6 Correct 1296 ms 19012 KB Output is correct
7 Correct 1260 ms 6924 KB Output is correct
8 Correct 1308 ms 7328 KB Output is correct
9 Correct 1268 ms 3936 KB Output is correct
10 Correct 1356 ms 3936 KB Output is correct
11 Correct 1236 ms 7060 KB Output is correct
12 Correct 1272 ms 19012 KB Output is correct
13 Correct 1228 ms 12504 KB Output is correct
14 Correct 1260 ms 12504 KB Output is correct
15 Correct 1136 ms 3808 KB Output is correct
16 Correct 1084 ms 3804 KB Output is correct
17 Correct 524 ms 3672 KB Output is correct
18 Correct 508 ms 3672 KB Output is correct
19 Correct 144 ms 3672 KB Output is correct
20 Correct 180 ms 3672 KB Output is correct
21 Correct 100 ms 3672 KB Output is correct
22 Correct 100 ms 3672 KB Output is correct