#include <bits/stdc++.h>
#pragma GCC optimize ("O2,unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;
const int inf=1000000010;
const ll INF=10000000000000010LL;
const int mod=1000000007;
const int MAXN=300010, LOG=20;
int n, m, k, u, v, x, y, t, a, b, ans;
int last[MAXN], sz;
pii stk[MAXN];
bool mark[MAXN];
vector<pii> G[MAXN];
inline void add(int v, int e){
if (last[v]){
while (last[v]){
stk[sz].second<<" ";
last[stk[sz--].first]=0;
}
cout<<"\n";
}
stk[++sz]={v, e};
last[v]=sz;
}
void dfs(int node){
while (G[node].size()){
pii p=G[node].back();
G[node].pop_back();
int v=p.first, e=p.second;
if (mark[e]) continue ;
mark[e]=1;
dfs(v);
add(v, e);
}
}
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
cin>>n>>m;
for (int i=1; i<=m; i++){
cin>>u>>v;
G[u].pb({v, i});
G[v].pb({u, i});
}
dfs(1);
add(stk[1].first, 0);
return 0;
}
Compilation message
postmen.cpp: In function 'void add(int, int)':
postmen.cpp:34:18: error: invalid operands of types 'int' and 'const char [2]' to binary 'operator<<'
34 | stk[sz].second<<" ";
| ~~~~~~~~~~~~~~^~~~~
| | |
| int const char [2]
