#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using db = double;
using ii = pair<int, int>;
using pl = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vii = vector<ii>;
using vpl = vector<pl>;
#define mp make_pair
#define pb push_back
#define pp pop_back
#define ff first
#define ss second
#define lb lower_bound
#define ub upper_bound
#define all(x) (x).begin() , (x).end()
ld dist(ld x, ld y, ld a, ld b) { return sqrt((x-a)*(x-a) + (y-b)*(y-b)); }
ll gcd(ll a , ll b){ return b ? gcd(b , a % b) : a ;}
ll lcm(ll a , ll b){ return (a * b) / gcd(a , b);}
ll fact(ll n) { return n > 1?(n * fact(n-1)):1;}
const int MOD = 1000*1000*1000+7;
const long double EPS = 0.000000001;
const double PI = 3.14159265358979323846;
const long long INF = 1e18;
const int nx[4] = {0, 0, -1, 1}, ny[4] = {1, -1, 0, 0};
int n, m; vector<ii>adj[500024];
bool queued[500024], vis[500024];
int dfs(int v, int p=-1)
{
if(queued[v]) {
cout<<v+1<<" ";
return v;
}
queued[v]=1;
for(auto u:adj[v]) {
if(u.ff==p||vis[u.ss]) continue;
vis[u.ss]=true; int next=dfs(u.ff, v);
if(next!=v) {
queued[v]=0;
cout<<v+1<<" ";
return next;
}
cout<<"\n";
}
return -1;
}
int32_t main()
{
ios::sync_with_stdio(0); cin.tie(0);cout.tie(0);
cin>>n>>m;
for(int l=0;l<m;l++) {
int a, b; cin>>a>>b; a--; b--;
adj[a].pb({b, l}); adj[b].pb({a, l});
}
for(int l=0;l<n;l++) dfs(l);
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
11980 KB |
Output is correct |
2 |
Correct |
7 ms |
11980 KB |
Output is correct |
3 |
Correct |
7 ms |
12064 KB |
Output is correct |
4 |
Correct |
8 ms |
12108 KB |
Output is correct |
5 |
Correct |
7 ms |
12108 KB |
Output is correct |
6 |
Correct |
9 ms |
12148 KB |
Output is correct |
7 |
Correct |
14 ms |
12592 KB |
Output is correct |
8 |
Correct |
8 ms |
12236 KB |
Output is correct |
9 |
Correct |
78 ms |
15240 KB |
Output is correct |
10 |
Correct |
8 ms |
12204 KB |
Output is correct |
11 |
Correct |
8 ms |
12108 KB |
Output is correct |
12 |
Correct |
52 ms |
15644 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
11980 KB |
Output is correct |
2 |
Correct |
7 ms |
11980 KB |
Output is correct |
3 |
Correct |
7 ms |
12064 KB |
Output is correct |
4 |
Correct |
8 ms |
12156 KB |
Output is correct |
5 |
Correct |
7 ms |
12072 KB |
Output is correct |
6 |
Correct |
9 ms |
12236 KB |
Output is correct |
7 |
Correct |
19 ms |
12620 KB |
Output is correct |
8 |
Correct |
8 ms |
12204 KB |
Output is correct |
9 |
Correct |
76 ms |
15172 KB |
Output is correct |
10 |
Correct |
8 ms |
12108 KB |
Output is correct |
11 |
Correct |
8 ms |
12108 KB |
Output is correct |
12 |
Correct |
51 ms |
15684 KB |
Output is correct |
13 |
Correct |
64 ms |
24884 KB |
Output is correct |
14 |
Correct |
55 ms |
16836 KB |
Output is correct |
15 |
Correct |
53 ms |
16184 KB |
Output is correct |
16 |
Correct |
64 ms |
24900 KB |
Output is correct |
17 |
Correct |
62 ms |
16576 KB |
Output is correct |
18 |
Correct |
64 ms |
18756 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
11980 KB |
Output is correct |
2 |
Correct |
7 ms |
11980 KB |
Output is correct |
3 |
Correct |
7 ms |
11980 KB |
Output is correct |
4 |
Correct |
8 ms |
12108 KB |
Output is correct |
5 |
Correct |
8 ms |
12092 KB |
Output is correct |
6 |
Correct |
9 ms |
12236 KB |
Output is correct |
7 |
Correct |
14 ms |
12664 KB |
Output is correct |
8 |
Correct |
8 ms |
12236 KB |
Output is correct |
9 |
Correct |
77 ms |
15200 KB |
Output is correct |
10 |
Correct |
8 ms |
12108 KB |
Output is correct |
11 |
Correct |
8 ms |
12236 KB |
Output is correct |
12 |
Correct |
52 ms |
15696 KB |
Output is correct |
13 |
Correct |
63 ms |
24936 KB |
Output is correct |
14 |
Correct |
56 ms |
16836 KB |
Output is correct |
15 |
Correct |
53 ms |
16184 KB |
Output is correct |
16 |
Correct |
63 ms |
24900 KB |
Output is correct |
17 |
Correct |
62 ms |
16588 KB |
Output is correct |
18 |
Correct |
60 ms |
18756 KB |
Output is correct |
19 |
Correct |
443 ms |
77816 KB |
Output is correct |
20 |
Correct |
382 ms |
37248 KB |
Output is correct |
21 |
Correct |
348 ms |
33640 KB |
Output is correct |
22 |
Correct |
446 ms |
77832 KB |
Output is correct |
23 |
Execution timed out |
697 ms |
27328 KB |
Time limit exceeded |
24 |
Halted |
0 ms |
0 KB |
- |