fork download
copy 
  1. #include<stdio.h>
  2. #include<string.h>
  3. #include<algorithm>
  4. #include<vector>
  5. #define N 100
  6. #define S_SIZE 40
  7. #define TRIE_SIZE 10000
  8. using namespace std;
  9. struct trie_node{int next[26],no;}trie[TRIE_SIZE];
  10. int visit[N],low[N],n,cnt;
  11. char name[N][S_SIZE],s[S_SIZE];
  12. bool G[N][N];
  13. vector<int>ans;
  14. int getno(int i,int p){
  15.     if(!s[i])return trie[p].no;
  16.     return getno(i+1,trie[p].next[s[i]-97]);
  17. }
  18. void dfs(int p,int i){
  19.     int child=0;
  20.     bool is_av=0;
  21.     visit[i]=low[i]=++cnt;
  22.     for(int j=0;j<n;j++)if(G[i][j]&&j!=p){
  23.         if(visit[j])low[i]=min(low[i],visit[j]);
  24.         else{
  25.             dfs(i,j);
  26.             low[i]=min(low[i],low[j]);
  27.             if(low[j]>=visit[i])is_av=1;
  28.             child++;
  29.         }
  30.     }
  31.     if(i==p&&child>1||i!=p&&is_av)ans.push_back(i);
  32. }
  33. bool ans_cmp(int i,int j){
  34.     return strcmp(name[i],name[j])<0;
  35. }
  36. int main(){
  37.     for(int t=1;scanf("%d",&n)&&n;t++){
  38.         if(t>1)putchar('\n');
  39.         int trie_size=1,m;
  40.         memset(trie,-1,sizeof(trie));
  41.         memset(visit,0,sizeof(visit));
  42.         memset(G,0,sizeof(G));
  43.         ans.clear();
  44.         cnt=0;
  45.         for(int i=0;i<n;i++){
  46.             int p=0;
  47.             scanf("%s",name[i]);
  48.             for(int j=0;name[i][j];j++){
  49.                 if(trie[p].next[name[i][j]-97]==-1)trie[p].next[name[i][j]-97]=trie_size++;
  50.                 p=trie[p].next[name[i][j]-97];
  51.             }
  52.             trie[p].no=i;
  53.         }
  54.         scanf("%d",&m);
  55.         for(int i=0;i<m;i++){
  56.             int a,b;
  57.             scanf("%s",s);
  58.             a=getno(0,0);
  59.             scanf("%s",s);
  60.             b=getno(0,0);
  61.             G[a][b]=G[b][a]=1;
  62.         }
  63.         for(int i=0;i<n;i++)if(!visit[i])dfs(i,i);
  64.         sort(ans.begin(),ans.end(),ans_cmp);
  65.         printf("City map #%d: %d camera(s) found\n",t,ans.size());
  66.         for(int i=0;i<ans.size();i++)puts(name[ans[i]]);
  67.     }
  68.     return 0;
  69. }
  70.  
Not running #stdin #stdout 0s 0KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/oIOEd
language:
C++ (gcc 8.3)
created:
13 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!