oj.uz

Submission #2882

# Submission time Handle Problem Language Result Execution time Memory
2882 2013-08-01T09:46:02 Z cki86201 간선 파괴 (GA5_destroy) C++
25 / 100
 2500 ms 2668 KB 
#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;
int check[550];

void DFS(int x)
{
	check[x]=q+1;
	int i;
	for(i=0;i<edge[x].size();i++){
		if(check[edge[x][i].en]==q+1)continue;
		if(edge[x][i].c>=l&&edge[x][i].c<=r)continue;
		DFS(edge[x][i].en);
	}
}

void solve()
{
	int i,ret=0;
	for(i=1;i<=V;i++){
		if(check[i]!=q+1){ret++;DFS(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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1220 KB Output is correct
2 Correct 0 ms 1220 KB Output is correct
3 Correct 0 ms 1220 KB Output is correct
4 Correct 0 ms 1220 KB Output is correct
5 Correct 0 ms 1220 KB Output is correct
6 Correct 0 ms 1220 KB Output is correct
7 Correct 0 ms 1220 KB Output is correct
8 Correct 0 ms 1220 KB Output is correct
9 Correct 0 ms 1220 KB Output is correct
10 Correct 0 ms 1220 KB Output is correct
11 Correct 0 ms 1220 KB Output is correct
12 Correct 0 ms 1220 KB Output is correct
13 Correct 0 ms 1220 KB Output is correct
14 Correct 0 ms 1220 KB Output is correct
15 Correct 0 ms 1220 KB Output is correct
16 Correct 0 ms 1220 KB Output is correct
17 Correct 0 ms 1220 KB Output is correct
18 Correct 0 ms 1220 KB Output is correct
19 Correct 0 ms 1220 KB Output is correct
20 Correct 0 ms 1220 KB Output is correct
21 Correct 0 ms 1220 KB Output is correct
22 Correct 0 ms 1220 KB Output is correct

Subtask #2
0.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 176 ms 1484 KB Output is correct
2 Correct 168 ms 1484 KB Output is correct
3 Correct 192 ms 1616 KB Output is correct
4 Correct 480 ms 2276 KB Output is correct
5 Correct 480 ms 2144 KB Output is correct
6 Execution timed out 2500 ms 2276 KB Program timed out
7 Halted 0 ms 0 KB -

Subtask #3
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Runtime error 16 ms 2668 KB SIGSEGV Segmentation fault
2 Halted 0 ms 0 KB -