提出 #62565554

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
#define ll long long
struct node
{
	int x,y,z;
};
node ans[200005];
int cnt,tot,cnt1;
int n,m,sum[200005];
vector<pair<int,int>>e[200005],q[200005];
pair<int,int>e1[200005];
bool vis[200005];

void dfs(int u,int fa,int k)
{
	bool f=1;
	vis[u]=1;
	for(int i=0;i<e[u].size();i++)
	{
		int v=e[u][i].first;
		if(v!=fa&&v!=i)
		{
			if(f)
			{
				f=0;
				dfs(v,u,k);
			}
			else
			{
				q[k].push_back({v,e[u][i].second});
			}
		}
		else
		{
			q[k].push_back({v,e[u][i].second});
		}
	}
}
int main() {
    cin>>n>>m;
    for(int i=1;i<=m;i++)
    {
    	int x,y;
    	cin>>x>>y;
    	e[x].push_back({y,i});
    	e[y].push_back({x,i});
    	e1[i]={x,y};
	}
	queue<int>g;
	for(int i=1;i<=n;i++)
	{
		if(!vis[i])
		{
			dfs(i,0,i);
			sum[++tot]=i;
			g.push(sum[tot]);
		}
	 } 
	 g.pop();
	for(int t=1;t<=tot;t++)
	{
		int i=sum[t];
		if(i==1&&q[i].size()==0)
		{
			g.push(i);
		}
		for(int j=0;j<q[i].size()&&!g.empty();j++)
		{
			if(g.front()==i)
			{
				g.pop();
				continue;
			}
			ans[++cnt]=(node){q[i][j].second,q[i][j].first,g.front()};
			g.pop();
		}
	}
	cout<<cnt<<"\n";
	for(int i=1;i<=cnt;i++)
	{
		cout<<ans[i].x<<" "<<ans[i].y<<" "<<ans[i].z<<"\n";
		
	}
    return 0;
}

提出情報

コンパイルエラー

Main.cpp: In function ‘void dfs(int, int, int)’:
Main.cpp:19:22: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<std::pair<int, int> >::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   19 |         for(int i=0;i<e[u].size();i++)
      |                     ~^~~~~~~~~~~~
Main.cpp: In function ‘int main()’:
Main.cpp:68:30: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<std::pair<int, int> >::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   68 |                 for(int j=0;j<q[i].size()&&!g.empty();j++)
      |                             ~^~~~~~~~~~~~

ジャッジ結果