This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mxN = 5007;
vector<int> g[mxN];
int32_t main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n, m;
cin >> n >> m;
for (int i = 0; i < m; ++i) {
int u, v;
cin >> u >> v;
g[u].push_back(v);
g[v].push_back(u);
}
set<int> left;
left.clear();
for (int u = 1; u <= n; ++u) {
left.insert(u);
}
for (int u = 1; u <= n; ++u) {
if (!left.count(u)) {
continue;
}
set<int> check = {u};
for (auto v : g[u]) {
check.insert(v);
}
for (int v = 1; v <= n; ++v) {
if (!check.count(v) && left.count(v)) {
left.erase(u);
left.erase(v);
break;
}
}
}
if ((int)left.size() < n / 3) {
cout << "1" << "\n";
return 0;
}
auto it = left.begin();
for (int i = 0; i < n / 3; ++i) {
cout << *it << ' ';
++it;
}
cout << "\n";
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |