# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1098570 | Trisanu_Das | Make them Meet (EGOI24_makethemmeet) | C++17 | 1812 ms | 1048576 KiB |
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;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> g(n);
vector<vector<int>> adj(n, vector<int>(n, 0));
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
if (x == y || adj[x][y]) continue;
g[x].push_back(y);
g[y].push_back(x);
adj[x][y] = adj[y][x] = 1;
}
if (!count_if(g.begin(), g.end(), [&](const vector<int>& v) { return v.size() < n - 1; })) {
int q = n + (n % 2);
vector<int> circ(q), col(q, 0);
iota(circ.begin(), circ.end(), 0);
cout << 2 * (q - 1) << endl;
for (int _ = 0; _ < q - 1; _++) {
for (int i = 0; i < q / 2; i++) {
col[circ[i]] = col[circ[q - 1 - i]] = i;
}
for (int i = 0; i < n; i++) cout << col[i] << ' ';
cout << endl;
for (int i = 0; i < n; i++) cout << col[i] << ' ';
Compilation message (stderr)
# | 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... |