#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
#define pb push_back
#define rsz resize
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
using pi = pair<int,int>;
#define f first
#define s second
#define mp make_pair
namespace output {
void pr(int x) {
cout << x;
}
void pr(long x) {
cout << x;
}
void pr(ll x) {
cout << x;
}
void pr(unsigned x) {
cout << x;
}
void pr(unsigned long x) {
cout << x;
}
void pr(unsigned long long x) {
cout << x;
}
void pr(float x) {
cout << x;
}
void pr(double x) {
cout << x;
}
void pr(long double x) {
cout << x;
}
void pr(char x) {
cout << x;
}
void pr(const char * x) {
cout << x;
}
void pr(const string & x) {
cout << x;
}
void pr(bool x) {
pr(x ? "true" : "false");
}
template < class T1, class T2 > void pr(const pair < T1, T2 > & x);
template < class T > void pr(const T & x);
template < class T, class...Ts > void pr(const T & t,
const Ts & ...ts) {
pr(t);
pr(ts...);
}
template < class T1, class T2 > void pr(const pair < T1, T2 > & x) {
pr("{", x.f, ", ", x.s, "}");
}
template < class T > void pr(const T & x) {
pr("{"); // const iterator needed for vector<bool>
bool fst = 1;
for (const auto & a: x) pr(!fst ? ", " : "", a), fst = 0;
pr("}");
}
void ps() {
pr("\n");
} // print w/ spaces
template < class T, class...Ts > void ps(const T & t,
const Ts & ...ts) {
pr(t);
if (sizeof...(ts)) pr(" ");
ps(ts...);
}
void pc() {
cout << "]" << endl;
} // debug w/ commas
template < class T, class...Ts > void pc(const T & t,
const Ts & ...ts) {
pr(t);
if (sizeof...(ts)) pr(", ");
pc(ts...);
}
#define dbg(x...) pr("[", #x, "] = ["), pc(x);
}
#ifndef ONLINE_JUDGE
using namespace output;
#else
using namespace output;
#define dbg(x...)
#endif
const int MX = 2000;
const int MOD = (int) (1e9 + 7);
const ll INF = (ll) 1e18;
int n, m;
int inc(int u, int v) {
return MX * u + v;
}
set<int> adj[MX];
vi fin[MX * MX];
bool vis[MX * MX];
bool done[MX * MX];
vector<pi> ed;
int anc[MX * MX];
bool found = false;
vi ret;
int cnt = 0;
void dfs(int v, int p) {
if (found) return;
vis[v] = true;
// dbg(v, p);
for (int to : fin[v]) {
if (found) return;
if (!done[to]) {
if (!found && vis[to]) {
++cnt;
found = true;
int curr = v;
// dbg(curr, to);
while(curr != to) {
// dbg(curr);
ret.pb((curr % 2000) + 1);
curr = anc[curr];
}
// dbg(to);
ret.pb((to % 2000) + 1);
return;
} else {
anc[to] = v;
// dbg("GO", to/2000, to%2000);
dfs(to, v);
}
}
}
done[v] = true;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
for (int i = 0; i < m; i++) {
int u, v; cin >> u >> v;
u--, v--;
adj[u].insert(v), adj[v].insert(u);
ed.pb(mp(u, v));
ed.pb(mp(v, u));
}
vector<pi> nods;
for (int i = 0; i < sz(ed); i++) {
int u = ed[i].f, v = ed[i].s;
for (int j = 0; j < n; j++) {
// dbg(u, v, j, adj[v].count(j), adj[u].count(j));
if (j != u && j != v && adj[v].count(j) && !adj[u].count(j)) {
// dbg(u, v, v, j);
// ps(inc(u, v), inc(v, j));
fin[inc(u, v)].pb(inc(v, j));
nods.pb(mp(u, v));
nods.pb(mp(v, j));
}
}
}
for (auto &x : nods) {
// dbg(x.f, x.s);
// if (deg[inc(x.f, x.s)] != 0) continue;
if (found) break;
if (!done[inc(x.f, x.s)]) dfs(inc(x.f, x.s), -1);
}
if (!found) cout << "no" << '\n';
else {
for (auto x : ret) {
cout << x << " ";
}
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
64 ms |
94456 KB |
Output is correct |
| 2 |
Correct |
66 ms |
94328 KB |
Output is correct |
| 3 |
Correct |
64 ms |
94328 KB |
Output is correct |
| 4 |
Correct |
68 ms |
94328 KB |
Output is correct |
| 5 |
Correct |
63 ms |
94328 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
65 ms |
94456 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
64 ms |
94416 KB |
Output is correct |
| 2 |
Correct |
65 ms |
94460 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
67 ms |
94712 KB |
Wrong adjacency |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
77 ms |
95648 KB |
Output is correct |
| 2 |
Correct |
75 ms |
96040 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
96 ms |
98196 KB |
Output is correct |
| 2 |
Correct |
94 ms |
97136 KB |
Output is correct |
| 3 |
Correct |
200 ms |
104664 KB |
Output is correct |
| 4 |
Correct |
208 ms |
105300 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
123 ms |
102092 KB |
Output is correct |
| 2 |
Correct |
126 ms |
104472 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1064 ms |
119696 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1065 ms |
254284 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1050 ms |
105112 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
