oj.uz

Submission #620986

# Submission time Handle Problem Language Result Execution time Memory
620986 2022-08-03T10:52:20 Z berr Newspapers (CEOI21_newspapers) C++17
4 / 100
 9 ms 460 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
vector<int> adj[1005], vis(1005);
int flag=1;

int dfs(int x, int y)
{
    vis[x]=1;
    int maxk=0, t=0, s=0;
    for(auto i: adj[x])
    {
        if(i==y) continue;
        else if(vis[i]==1)
        {
            flag=0;

        }
        else
        {
            int z=dfs(i, x);
            if(z>1) t++;
            s++;
            maxk=max(z, maxk);
        }
    }
    if(t>=2&&s>2) flag=0;
    return maxk+1;
}
int32_t main()
{
    ios_base::sync_with_stdio(false); cin.tie(0);
    
    int n, m; cin>>n>>m;
    for(int i=0; i<m; i++)
    {
        int x, y; cin>>x>>y;
       adj[x].push_back(y);
       adj[y].push_back(x);
    }
    int ans=0;
    for(int i=1; i<=n; i++)
    {
        flag=1;
        for(int l=1; l<=n; l++) vis[l]=0;
        dfs(i, 0);
        if(flag==1) ans=1;

    }
    if(ans==0) cout<<"NO\n";
    else
    {
    cout<<"YES\n"<<"2 1 1\n";
    }
}

Subtask #1
0.0 / 12.0

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

Subtask #2
4.0 / 8.0

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

Subtask #3
0.0 / 80.0

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