| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1351424 | fv3 | Social Engineering (EGOI22_socialengineering) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#include "socialengineering.h"
using namespace std;
void SocialEngineering(int n, int m, vector<pair<int,int>> edges){
vector<int> deg(n);
vector<set<int>> adj(n);
for (auto [u, v] : edges) {
u--;
v--;
adj[u].insert(v);
adj[v].insert(u);
deg[u]++;
deg[v]++;
}
for (int i = 0; i < n; i++) {
if (deg[i] % 2) {
return;
}
}
for (int u; (u = GetMove()); ) {
u--;
int last = 0;
while (u != 0) {
for (int v : adj[u]) {
if (v != last) {
MakeMove(v + 1);
last = u;
u = v;
break;
}
}
}
}
return;
}
#ifdef LOCAL
#include "grader.cpp"
#endif
