# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1067616 | 2024-08-20T21:35:38 Z | MilosMilutinovic | Make them Meet (EGOI24_makethemmeet) | C++14 | 1 ms | 348 KB |
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); int n, m; cin >> n >> m; vector<vector<int>> g(n); for (int i = 0; i < m; i++) { int u, v; cin >> u >> v; g[u].push_back(v); g[v].push_back(u); } auto Subtask1 = [&]() { return m == n - 1 && (int) g[0].size() == n - 1; }; auto Subtask2 = [&]() { return m == n * (n - 1) / 2; }; auto Subtask3 = [&]() { bool ok = (m == n - 1); for (int i = 0; i < n; i++) { for (int j : g[i]) { if (abs(i - j) > 1) { ok = false; } } } return ok; }; if (Subtask1()) { // Subtask 1 cout << 2 * (n - 1) + 1 << '\n'; for (int i = 0; i < n; i++) { cout << 1 << " "; } cout << '\n'; for (int i = 1; i < n; i++) { for (int j = 0; j < n; j++) { if (j == 0 || j == i) { cout << 1 << " "; } else { cout << 2 << " "; } } cout << '\n'; for (int j = 0; j < n; j++) { if (j == 0 || j == i) { cout << 1 << " "; } else { cout << 2 << " "; } } cout << '\n'; } return 0; } if (Subtask3()) { cout << (n - 1) * (n - 1) << '\n'; for (int i = 0; i + 1 < n; i++) { for (int j = 0; j + 1 < n; j++) { int col = 2; for (int k = 0; k < n; k++) { if (k == j || k == j + 1) { cout << 1 << " "; } else { cout << col << " "; } } cout << '\n'; } } return 0; } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 1 ms | 344 KB | Output is correct |
5 | Correct | 1 ms | 348 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | Unexpected end of file - int32 expected |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Incorrect | 0 ms | 348 KB | If people start at 1 and 2, then they can avoid each other |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 1 ms | 344 KB | Output is correct |
5 | Correct | 1 ms | 348 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
7 | Correct | 0 ms | 348 KB | Output is correct |
8 | Incorrect | 0 ms | 348 KB | If people start at 1 and 2, then they can avoid each other |
9 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 1 ms | 344 KB | Output is correct |
5 | Correct | 1 ms | 348 KB | Output is correct |
6 | Correct | 1 ms | 348 KB | Output is correct |
7 | Incorrect | 0 ms | 348 KB | Unexpected end of file - int32 expected |
8 | Halted | 0 ms | 0 KB | - |