# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1151840 | Ghulam_Junaid | Make them Meet (EGOI24_makethemmeet) | C++20 | 0 ms | 328 KiB |
#include <bits/stdc++.h>
using namespace std;
const int N = 105;
int n, m;
vector<int> g[N], c;
vector<vector<int>> output;
int main(){
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);
}
for (int i = 0; i < 3 * n; i ++){
c.resize(n, 0);
for (int j = n - 1; j >= 0; j -= 4){
c[j] = 1;
if (j - 1 >= 0)
c[j - 1] = 1;
}
output.push_back(c);
c.resize(n, 0);
for (int j = n - 2; j >= 0; j -= 4){
c[j] = 1;
if (j - 1 >= 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... |