oj.uz

Submission #1097493

# Submission time Handle Problem Language Result Execution time Memory
1097493 2024-10-07T13:26:44 Z alexander707070 Newspapers (CEOI21_newspapers) C++14
4 / 100
 8 ms 14680 KB 
#include<bits/stdc++.h>
#define MAXN 600007
using namespace std;

int n,m,a,b;
vector<int> v[MAXN];

int main(){

    cin>>n>>m;
    for(int i=1;i<=m;i++){
        cin>>a>>b;
        v[a].push_back(b);
        v[b].push_back(a);
    }

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

    for(int i=1;i<=n;i++){
        if(v[i].size()<=2)continue;

        int br=0;
        for(int f:v[i]){
            if(v[f].size()>1)br++;
        }

        if(br>2){
            cout<<"NO\n";
            return 0;
        }
    }

    cout<<"YES\n1\n1\n";

    return 0;
}

Subtask #1
0.0 / 12.0

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

Subtask #3
0.0 / 80.0

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