답안 #2883

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
2883	2013-08-01T10:00:31 Z	cki86201	간선 파괴 (GA5_destroy)	C++	25 / 100	2500 ms	2672 KB

destroy

#include<stdio.h>
#include<vector>
using namespace std;

//for 60point code;

struct line{
	line(){}
	line(int en,int c):en(en),c(c){}
	int en,c;
};
vector <line> edge[550];
int V,E,r,l,q,wr,re,Q[550];
int check[550];

void BFS(int x)
{
	Q[0]=x;wr=1;re=0;check[x]=q+1;
	while(wr!=re){
		int i,sz=edge[Q[re]].size();
		for(i=0;i<sz;i++){
			line tx=edge[Q[re]][i];
			if(check[tx.en]==q+1 || (tx.c>=l&&tx.c<=r))continue;
			Q[wr++]=tx.en;
			check[tx.en]=q+1;
		}
		re++;
	}
}

void solve()
{
	int i,ret=0;
	for(i=1;i<=V;i++){
		if(check[i]!=q+1){ret++;BFS(i);}
	}
	printf("%d\n",ret);
}

int main()
{
	scanf("%d%d",&V,&E);
	int i;
	for(i=1;i<=E;i++){
		int x,y;
		scanf("%d%d",&x,&y);
		edge[x].push_back(line(y,i));
		edge[y].push_back(line(x,i));
	}
	scanf("%d",&q);
	while(q--){
		scanf("%d%d",&l,&r);
		solve();
	}
	return 0;
}

Subtask #1

25.0 / 25.0

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

Subtask #2

0.0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	164 ms	1488 KB	Output is correct
2	Correct	156 ms	1488 KB	Output is correct
3	Correct	176 ms	1620 KB	Output is correct
4	Correct	432 ms	2280 KB	Output is correct
5	Correct	432 ms	2148 KB	Output is correct
6	Execution timed out	2500 ms	2280 KB	Program timed out
7	Halted	0 ms	0 KB	-

Subtask #3

0.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	16 ms	2672 KB	SIGSEGV Segmentation fault
2	Halted	0 ms	0 KB	-