提出 #44564855

---

ソースコード 拡げる

#include <bits/stdc++.h>
#define int long long
#define mp make_pair
#define pb push_back
#define ld long double
#define pii pair<int,int>
#define sz(x) (int)x.size()
#define piii pair<pii,pii>
#define precise cout<<fixed<<setprecision(10)
#define st first
#define nd second
#define ins insert
#define vi vector<int>
#define BOOST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
using namespace std;
const int MAX=2e5+5;
int zalatwione=0;
bool O[MAX];
bool used[MAX];
char s[MAX];
int p[MAX];
vector<pair<int,int>>P[MAX];
char color[MAX];
int Find(int u){
  if (p[u]!=u)p[u]=Find(p[u]);
  return p[u];
}
void Union(int u,int v){
  assert(Find(u)!=Find(v));
  p[Find(u)]=Find(v);
}
int32_t main()
{
  BOOST;
  int n,m;
  cin>>n>>m;
  for (int i=1;i<=m;i++){
    int a,b;
    char c;
    cin>>a>>b>>c;
    color[i]=c;
    P[a].pb(mp(b,i));
    P[b].pb(mp(a,i));
  }
  for (int i=1;i<=n;i++)p[i]=i;
  for (int i=1;i<=n;i++)cin>>s[i];
  for (int i=1;i<=n;i++){
    for (auto it:P[i]){
      if (color[it.nd]==s[i] && color[it.nd]==s[it.st]){
        int u=i;
        int v=it.st;
        if (Find(u)!=Find(v)){
          Union(u,v);
          assert(!used[it.nd]);
          used[it.nd]=true;
          O[u]=true,O[v]=true;
        }
      }
    }
  }
  queue<int>q;
  for (int i=1;i<=n;i++){
    if (O[i]){
      q.push(i);
    }
  }
  while (!q.empty()){
    int u=q.front();
    q.pop();
    for (auto it:P[u]){
      if (O[it.st])continue;
     // cout<<"KOLEJKA "<<u<<" "<<it.st<<" "<<O[it.st]<<" "<<s[it.st]<<" "<<color[it.nd]<<"\n";
      if (!O[it.st] && color[it.nd]==s[it.st] && Find(u)!=Find(it.st)){
        O[it.st]=true;
        used[it.nd]=true;
        Union(u,it.st);
        q.push(it.st);
      }
    }
  }

  for (int i=1;i<=n;i++){
    if (!O[i]){
      cout<<"No";
      return 0;
    }
  }
  for (int i=1;i<=n;i++){
    for (auto it:P[i]){
      int u=i;
      int v=it.st;
      if (Find(u)!=Find(v)){
        Union(u,v);
        used[it.nd]=true;
      }
    }
  }
  cout<<"Yes\n";
  vi ans;
  for (int i=1;i<=m;i++){
    if (used[i])ans.pb(i);
  }
  assert(sz(ans)==n-1);
  for (auto it:ans)cout<<it<<" ";
  return 0;
}

提出情報

ジャッジ結果