oj.uz

Submission #785742

# Submission time Handle Problem Language Result Execution time Memory
785742 2023-07-17T14:13:17 Z gagik_2007 Newspapers (CEOI21_newspapers) C++17
4 / 100
 12 ms 7496 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define ff first
#define ss second

ll ttt;
const ll INF=1e18;
const ll MOD=1e9+7;
const ll N=300007;
ll n,m,k;
vector<ll>g[N];
ll sz[N];
bool used[N];

void dfs(int v, int par=-1){
    // cout<<"YOO"<<endl;
    sz[v]=0;
    for(int to:g[v]){
        if(to!=par){
            dfs(to,v);
            sz[v]=max(sz[v],sz[to]+1);
        }
    }
}

bool is_tree(int v, int par=-1){
    used[v]=true;
    for(int to:g[v]){
        if(to!=par){
            if(used[to])return false;
            if(!is_tree(to,v))return false;
        }
    }
    return true;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    // freopen("output.txt","w",stdout);
    // freopen("input.txt","r",stdin);
    cin>>n>>m;
    // if(m!=n-1)cout<<"NO\n";
    for(int i=0;i<m;i++){
        int x,y;
        cin>>x>>y;
        g[x].push_back(y);
        g[y].push_back(x);
    }
    for(int v=1;v<=n;v++){
        if(!used[v]&&!is_tree(v)){
            cout<<"NO\n";
            return 0;
        }
    }
    for(int v=1;v<=n;v++){
        dfs(v);
        int cnt=0;
        for(int to:g[v]){
            cnt+=(sz[to]>2);
        }
        if(cnt>2){
            cout<<"NOss\n";
            return 0;
        }
    }
    cout<<"YES 1 1\n";
}

Subtask #1
0.0 / 12.0

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

Subtask #2
4.0 / 8.0

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

Subtask #3
0.0 / 80.0

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