oj.uz

Submission #998352

# Submission time Handle Problem Language Result Execution time Memory
998352 2024-06-13T17:22:35 Z andrei_iorgulescu Newspapers (CEOI21_newspapers) C++14
4 / 100
 1 ms 484 KB 
#include <bits/stdc++.h>

using namespace std;

int n,m;
vector<int> g[1005];
bool viz[1005];
int lol,cur;
int deg[1005];

void dfs(int nod)
{
    viz[nod] = true;
    cur++;
    for (auto vecin : g[nod])
        if (!viz[vecin])
            dfs(vecin);
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        int x,y;
        cin >> x >> y;
        deg[x]++;
        deg[y]++;
        g[x].push_back(y);
        g[y].push_back(x);
    }
    if (m == n - 1)
        cout << "YES\n1\n1";
    else
        cout << "NO\n";
    return 0;
    for (int i = 1; i <= n; i++)
    {
        if (!viz[i])
        {
            cur = 0;
            dfs(i);
            lol += cur - 1;
        }
    }
    if (lol != m)
    {
        cout << "NO";
        return 0;
    }
    for (int i = 1; i <= n; i++)
    {
        for (auto j : g[i])
        {
            if (deg[i] >= 2 and deg[j] >= 2)
            {
                cout << "NO";
                return 0;
            }
        }
    }
    cout << "YES\n";
    vector<int> nod0;
    vector<int> deggr;
    for (int i = 1; i <= n; i++)
        if (deg[i] == 0)
            nod0.push_back(i);
    for (int i = 1; i <= n; i++)
    {
        if (deg[i] >= 2)
        {
            nod0.push_back(i),nod0.push_back(i);
        }
    }
    for (int i = 1; i <= n; i++)
    {
        if (deg[i] == 1 and deg[g[i][0]] == 1 and g[i][0] > i)
            nod0.push_back(i),nod0.push_back(i);
    }
    cout << (int)nod0.size() << '\n';
    for (auto it : nod0)
        cout << it << ' ';
    return 0;
}

Subtask #1
0.0 / 12.0

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

Subtask #3
0.0 / 80.0

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