oj.uz

Submission #1047575

# Submission time Handle Problem Language Result Execution time Memory
1047575 2024-08-07T14:07:40 Z 12345678 Newspapers (CEOI21_newspapers) C++17
0 / 100
 0 ms 348 KB 
#include <bits/stdc++.h>

using namespace std;

const int nx=1e3+5;

int n, m, u, v, dsu[nx], f;

int find(int x)
{
    if (dsu[x]==x) return x;
    return dsu[x]=find(dsu[x]);
}

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>m;
    for (int i=1; i<=n; i++) dsu[i]=i;
    for (int i=1; i<=m; i++)
    {
        cin>>u>>v;
        if (find(u)==find(v)) f=1;
        dsu[find(u)]=find(v);
    }
    if (f) cout<<"NO";
    else cout<<"YES";
}

Subtask #1
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 80.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -