oj.uz

Submission #534978

# Submission time Handle Problem Language Result Execution time Memory
534978 2022-03-09T08:17:38 Z Karuk Newspapers (CEOI21_newspapers) C++14
4 / 100
 2 ms 332 KB 
#include<bits/stdc++.h>
using namespace std;
vector<int>v[1001];
int main()
{
    int n,m;
    cin>>n>>m;
    for(int i=0;i<m;i++)
    {
        int x,y;
        cin>>x>>y;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    if(m>=n)cout<<"NO";
    else
    {
        for(int i=1;i<=n;i++)
        {
            for(int j:v[i])
            {
                if(v[i].size()>=3 && v[j].size()>=3)
                {
                    cout<<"NO";
                    return 0;
                }
            }
        }
        cout<<"YES\n1\n1";
    }
    return 0;
}

Subtask #1
0.0 / 12.0

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

Subtask #2
4.0 / 8.0

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