oj.uz

Submission #558087

# Submission time Handle Problem Language Result Execution time Memory
558087 2022-05-06T18:58:19 Z status_coding Newspapers (CEOI21_newspapers) C++14
4 / 100
 3 ms 2644 KB 
#include <bits/stdc++.h>

using namespace std;

int n,m;

vector<int> v[100005];

int fr[100005];

void dfs(int p, int par, int d)
{
    fr[d]++;

    for(int it : v[p])
    {
        if(it == par)
            continue;

        if((int)v[it].size() == 1)
            continue;

        dfs(it, p, d+1);
    }
}

int main()
{
    cin>>n>>m;

    if(m > n-1)
    {
        cout<<"NO";
        return 0;
    }

    for(int i=1;i<n;i++)
    {
        int x, y;
        cin>>x>>y;

        v[x].push_back(y);
        v[y].push_back(x);
    }

    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
            fr[j] = 0;

        dfs(i, 0, 1);

        bool ok = true;

        for(int j=1;j<=n;j++)
            if(fr[j] > 1)
                ok=false;

        if(ok)
        {
            cout<<"YES\n";
            cout<<"1 1";
            return 0;
        }
    }

    cout<<"NO";
    return 0;
}

Subtask #1
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
3 Partially correct 1 ms 2644 KB Failed to provide a successful strategy.
4 Partially correct 1 ms 2644 KB Failed to provide a successful strategy.
5 Partially correct 1 ms 2644 KB Failed to provide a successful strategy.
6 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
7 Correct 1 ms 2644 KB Output is correct
8 Incorrect 2 ms 2644 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
4.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Partially correct 1 ms 2644 KB Failed to provide a successful strategy.
3 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
4 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
5 Partially correct 1 ms 2644 KB Failed to provide a successful strategy.
6 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
7 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
8 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
9 Partially correct 1 ms 2644 KB Failed to provide a successful strategy.
10 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
11 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
12 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
13 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
14 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
15 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
16 Partially correct 3 ms 2644 KB Failed to provide a successful strategy.
17 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
18 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
19 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
20 Partially correct 3 ms 2644 KB Failed to provide a successful strategy.

Subtask #3
0.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
3 Partially correct 1 ms 2644 KB Failed to provide a successful strategy.
4 Partially correct 1 ms 2644 KB Failed to provide a successful strategy.
5 Partially correct 1 ms 2644 KB Failed to provide a successful strategy.
6 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
7 Correct 1 ms 2644 KB Output is correct
8 Incorrect 2 ms 2644 KB Output isn't correct
9 Halted 0 ms 0 KB -