oj.uz

Submission #528169

# Submission time Handle Problem Language Result Execution time Memory
528169 2022-02-19T14:47:41 Z Rafi22 Newspapers (CEOI21_newspapers) C++14
4 / 100
 6 ms 340 KB 
#include <bits/stdc++.h>

using namespace std;

#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define ll long long
ll mod=1000000007;
int inf=1000000007;
ll infl=1000000000000000007;

vector<int>G[1007];
vector<int>res;
bool ok;

void dfs(int v,int o)
{
    bool was=0;
    for(auto u:G[v])
    {
        if(u==o) continue;
        if(sz(G[u])>1)
        {
            if(!was) dfs(u,v);
            else ok=0;
            was=1;
        }
    }
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n,m,a,b;
    cin>>n>>m;
    if(m!=n-1)
    {
        cout<<"NO";
        return 0;
    }
    for(int i=0;i<n-1;i++)
    {
        cin>>a>>b;
        G[a].pb(b);
        G[b].pb(a);
    }
    vector<int>ans;
    bool is=0;
    for(int i=1;i<=n;i++)
    {
        ok=1;
        res.clear();
        dfs(i,0);
        if(ok)
        {
            is=1;
        }
    }
    if(!is) cout<<"NO";
    else
    {
        cout<<"YES"<<endl;
        cout<<1<<endl<<1;
        //for(auto x:ans) cout<<1<<" ";
    }

    return 0;
}

Subtask #1
0.0 / 12.0

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

Subtask #3
0.0 / 80.0

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