| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1354489 | TroySer | Make them Meet (EGOI24_makethemmeet) | C++20 | 0 ms | 344 KiB |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N, M;
cin >> N >> M;
vector<vector<ll> > adjList(N);
for (ll i = 0; i < M; i++) {
ll ui, vi;
cin >> ui >> vi;
adjList[ui].push_back(vi);
adjList[vi].push_back(ui);
}
cout << N << endl;
for (ll i = 0; i <= N; i++) {
vector<ll> A(N);
for (ll j = 0; j < N; j++) {
A[(j + i) % N] = j/2;
}
for (ll j = 0; j < N; j++) {
if (j != 0) cout << " ";
cout << A[j];
}
cout << endl;
}
}| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
