# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
783338 | vh50 | Newspapers (CEOI21_newspapers) | C++17 | 0 ms | 340 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>
#define int long long
#define endl "\n"
using namespace std;
const int MAXN = 2e3;
int n, m, marc[MAXN][MAXN];
vector <int> g[MAXN];
void dfs(int a, int r)
{
marc[a][r] = 1;
for(auto v : g[a])
{
if(marc[v][r]) continue;
dfs(v, r);
}
}
main()
{
cin >> n >> m;
if(m == n - 1) cout << "YES" << endl;
else cout << "NO" << endl;
for(int i = 0; i < m; i++)
{
int a, b;
cin >> a >> b;
a--, b--;
g[a].push_back(b);
g[b].push_back(a);
}
}
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... |