oj.uz

Submission #984419

# Submission time Handle Problem Language Result Execution time Memory
984419 2024-05-16T15:49:15 Z alexdd Newspapers (CEOI21_newspapers) C++17
4 / 100
 1 ms 600 KB 
#include<iostream>
#include<vector>
using namespace std;
int n,m,root;
vector<int> con[1005];
bool isfrunza[1005];
bool rau;
void dfs(int nod, int par)
{
    int cntf=0,cntn=0;
    for(auto adj:con[nod])
    {
        if(adj!=par)
        {
            if(isfrunza[adj]) cntf++;
            else cntn++;
            dfs(adj,nod);
        }
    }
    if(cntn>2)
    {
        rau=1;
    }
}
signed main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);
    cin>>n>>m;
    int a,b;
    for(int i=1;i<=m;i++)
    {
        cin>>a>>b;
        con[a].push_back(b);
        con[b].push_back(a);
    }
    if(m!=n-1)
    {
        cout<<"NO\n";
        return 0;
    }
    if(n==1)
    {
        cout<<"YES\n";
        cout<<1<<"\n"<<1;
        return 0;
    }
    if(n==2)
    {
        cout<<"YES\n";
        cout<<2<<"\n"<<"2 2";
        return 0;
    }
    root=-1;
    for(int i=1;i<=n;i++)
    {
        if((int)con[i].size() > 1)
        {
            if(root==-1) root=i;
        }
        else
            isfrunza[i]=1;
    }
    dfs(root,0);
    if(rau)
    {
        cout<<"NO\n";
        return 0;
    }
    cout<<"YES\n";
    cout<<1<<"\n"<<1;
    return 0;
}

Subtask #1
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Partially correct 1 ms 348 KB Failed to provide a successful strategy.
4 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
5 Partially correct 1 ms 344 KB Failed to provide a successful strategy.
6 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
7 Correct 0 ms 600 KB Output is correct
8 Incorrect 0 ms 344 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 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
4 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
5 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
6 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
7 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
8 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
9 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
10 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
11 Partially correct 1 ms 348 KB Failed to provide a successful strategy.
12 Partially correct 1 ms 344 KB Failed to provide a successful strategy.
13 Partially correct 1 ms 344 KB Failed to provide a successful strategy.
14 Partially correct 1 ms 348 KB Failed to provide a successful strategy.
15 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
16 Partially correct 1 ms 348 KB Failed to provide a successful strategy.
17 Partially correct 1 ms 348 KB Failed to provide a successful strategy.
18 Partially correct 1 ms 348 KB Failed to provide a successful strategy.
19 Partially correct 1 ms 344 KB Failed to provide a successful strategy.
20 Partially correct 1 ms 344 KB Failed to provide a successful strategy.

Subtask #3
0.0 / 80.0

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