OJ Board

Code: Select all

#include<stdio.h>
#include<string.h>
#define max 100
int set[max];
int cc;

int rootof(int node)
{
	while(set[node]>0) node=set[node];
	return node;
}


void setunion(int pr,int cr)
{set[pr]+=set[cr];  set[cr]=pr;}


void disjointset(int v1, int v2)
{
	int r1=rootof(v1);
	int r2=rootof(v2);

	if(r1!=r2)
	{
		if(set[r1]<set[r2])
		{setunion(r1,r2); if(v1!=r1)set[v1]=set[v2]=r1;}		
		
		else
		{setunion(r2,r1); if(v2!=r2)set[v1]=set[v2]=r2;}
		
		cc--;
	}
}

void initgrp(int n)
{
	int c1;
	for(c1=0;c1<n;c1++) set[c1]=-1;
	cc=n;
}

int main()
{
	char ips[3];
	int f=0;
	while(1)
	{
		gets(ips);
		
		if(ips[0]==' ')
		{if(f)printf("%d\n",cc);break;}
		
		if(strlen(ips)==1)
		{
			if(f)printf("%d\n",cc);
			initgrp(ips[0]-'A'+1);
			if(!f)f=1;
		}
		
		else if(strlen(ips)==2)
			disjointset(ips[0]-'A',ips[1]-'A');
	}
	return 0;
}

Code: Select all

#include <iostream>
#include <vector>
#include <deque>
#include <string>
using namespace std;

int main(void){
  int n;
  cin >> n;
  char max;
  cin >> max;
   for (int i = 0; i < n; i++){
    int maxNodes = max - 'A' + 1;
    //Read the edges from the input
    vector < vector<int> > graph;
    graph.reserve(maxNodes);
    string in;
    while(true && cin >> in){
      if (in.length() == 1){
        max = in[0];
        break;
      }
      else{
        //Add this to the adjacency list
        int from = in[0] - 'A';
        int to = in[1] - 'A';
        graph[from].push_back(to);
        graph[to].push_back(from);
      }
    }

    bool visited[26];
    for (int j = 0; j < maxNodes; j++)
      visited[j] = false;

    int parts = 0;

    while (true){
      int left = -1;

      for (int j = 0; j < maxNodes; j++){
        if (!visited[j]){
          left = j;
          break;
        }
      }
      if (left == -1) break;
      parts ++;
      deque <int> dfs;
      dfs.push_front(left);
      while (!dfs.empty()){
        int current = dfs[0];
        dfs.pop_front();
        visited[current] = true;
        int len = graph[current].size();
        for (int j = 0; j < len; j ++)
          if (!visited[graph[current][j]]) dfs.push_front(graph[current][j]);
      }

    }
    cout << parts << endl << endl;
  }
  return 0;
}

Code: Select all

maybe parsing error..
already solved..

Code: Select all

Acc.. 

Thank you

Code: Select all

AC

Code: Select all

have AC.