#UVa:11503-Virtual Friends

照著題目去實作兩個set的union,並將每次union完後set裡的元素個數輸出。

C++(2.722)

/*******************************************************/
/* UVa 11503 Virtual Friends                           */
/* Author: LanyiKnight [at] knightzone.studio             */
/* Version: 2015/01/09                                 */
/*******************************************************/
#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
using namespace std;

const int FRIEND_LIMITS = 100000;

int findSetNumber(map<string, int> &friendToSet, vector< set<string> > &sets, int &setCount, string friendName){
  int setNumber;
  if( friendToSet.find(friendName) == friendToSet.end() ){
    setNumber = setCount++;
    friendToSet[friendName] = setNumber;
    sets[setNumber].insert(friendName);
  }
  else{
    setNumber = friendToSet[friendName];
  }

  return setNumber;
}


int main(){
  int testcase;
  while( scanf("%d", &testcase) != EOF ){
    for( int t = 0 ; t < testcase ; ++t ){
      int F;
      scanf("%d", &F);

      map<string, int> friendToSet;
      vector< set<string> > sets(2*FRIEND_LIMITS+5);
      int setCount = 0;
      for( int i = 0 ; i < F ; ++i ){
        string friend1, friend2;
        cin >> friend1 >> friend2;

        int set1, set2;
        set1 = findSetNumber( friendToSet, sets, setCount, friend1 );
        set2 = findSetNumber( friendToSet, sets, setCount, friend2 );

        int finalSet = min(set1, set2);
        if( set1 != set2 ){
          int removeSet = max(set1, set2);

          for( set<string>::iterator it = sets[removeSet].begin() ; it != sets[removeSet].end() ; ++it ){
            friendToSet[*it] = finalSet;
            sets[finalSet].insert(*it);
          }
        }

        printf("%d\n", sets[finalSet].size());
      }

    }

  }

  return 0;
}
廣告

Comment

There is no comment on this post. Be the first one.

發表迴響

這個網站採用 Akismet 服務減少垃圾留言。進一步瞭解 Akismet 如何處理網站訪客的留言資料

%d 位部落客按了讚: