Tấn công thành trì

#include<iostream>

using namespace std;
int m;
int adj[100][100];
int point[100];
int visited[100];
int egdes[10000][2];
int cost[10000];
int nedge;
int minScore = -1;
int stack[100];
int queue[10000];
int head, tail;
int circle[100];
int ncircle;

void dfs(int s){
	for (int i=0;i<m;i++) visited[i]=0;
	head=0;
	ncircle=-1;
	stack[head]=s;
	visited[s]=1;
	while(head>=0){
//		cout<<"stack ";
//		for (int i=0;i<=head;i++) cout<<stack[i]<<" ";
//		cout<<endl;
		int top = stack[head];
		for (int i=0;i<m;i++){
			if (i==s && adj[top][i] && head >=2){
				ncircle = head+1;
				for (int j=0;j<ncircle;j++) circle[j]=stack[j];
				circle[ncircle++]=s;
				return;
			} else if (adj[top][i] && !visited[i]){
				stack[++head]=i;
				visited[i]=1;
				break;
			}
			if (i==m-1){
				head--;
			}
		}
	}
}

int main(){
	ios::sync_with_stdio(false);
	freopen("TanCong.txt","r",stdin);
	int T;
	cin>>T;
	for (int tc=1;tc<=T;tc++){
		cout<<"Case #"<<tc<<endl;
		cin>>m;
		for (int i=0;i<m;i++){
			for (int j=0;j<m;j++){
				adj[i][j]=0;
			}
		}
		for (int i=0;i<m;i++){
			
			// 
			int tmp;
			cin>>tmp;
			cin>>point[tmp];
			int tmp2;
			cin>>tmp2;
			for (int j=0;j<tmp2;j++){
				int tmp3;
				cin>>tmp3;
				adj[tmp][tmp3]=1;
				adj[tmp3][tmp]=1;
			}
		}
//		for (int i=0;i<m;i++){
//			for (int j=0;j<m;j++){
//				cout<<adj[i][j]<<" ";
//			}
//			cout<<endl;
//		}
		int e=0;
		int score=0;
		while (e<m){
			dfs(e);
			if (ncircle == -1){
				e++;
			} else {
//				for (int i=0;i<ncircle;i++) cout<<circle[i]<<" ";
//				cout<<endl;
				int minsum=point[circle[0]]+point[circle[1]], mina=circle[0], minb=circle[1];
				for (int i=1;i<ncircle-1;i++){
					int j=i+1;
					if (point[circle[i]]+point[circle[j]]<minsum){
						minsum=point[circle[i]]+point[circle[j]];
						mina=circle[i];
						minb=circle[j];
					}
				}
				score+=minsum;
				adj[mina][minb]=0;
				adj[minb][mina]=0;
//				cout<<mina<<" "<<minb<<endl;
//				cout<<minsum<<" "<<mina<<" "<<minb<<endl;
			}
		}
		cout<<score<<endl;
	}
}