| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1234144 | toast12 | Make them Meet (EGOI24_makethemmeet) | C++20 | 0 ms | 328 KiB |
#include <bits/stdc++.h>
using namespace std;
int main() {
// star graph
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
}
cout << 3 << '\n';
for (int i = 0; i < n; i++) cout << 0 << ' ';
cout << '\n';
cout << 1 << ' ' << 1 << ' ';
for (int i = 2; i < n; i++) cout << 0 << ' ';
cout << '\n';
for (int i = 0; i < n; i++) cout << 0 << ' ';
cout << '\n';
return 0;
}| # | 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... | ||||
