oj.uz

Submission #1054417

# Submission time Handle Problem Language Result Execution time Memory
1054417 2024-08-12T09:44:07 Z kunzaZa183 Newspapers (CEOI21_newspapers) C++17
4 / 100
 7 ms 612 KB 
#include <bits/stdc++.h>
using namespace std;
int main() {
  cin.tie(0)->sync_with_stdio(0);
  int n, m;
  cin >> n >> m;
  if (m >= n) {
    cout << "NO\n";
    return 0;
  }

  const int maxn = 1000;
  vector<int> adjlist[maxn];
  for (int i = 0; i < m; i++) {
    int a, b;
    cin >> a >> b;
    a--, b--;
    adjlist[a].push_back(b), adjlist[b].push_back(a);
  }

  function<int(int, int)> dfs = [&](int cur, int par) {
    int maxi = 0;
    for (auto a : adjlist[cur])
      if (a != par)
        maxi = max(maxi, dfs(a, cur));
    return maxi + 1;
  };

  for (int i = 0; i < n; i++) {
    vector<int> vi;
    for (auto a : adjlist[i])
      vi.push_back(dfs(a, i));

    int ct = 0;
    for (auto a : vi) {
      if (a >= 3)
        ct++;
    }

    if (ct >= 2 && vi.size() >= 3) {
      cout << "NO\n";
      return 0;
    }
  }

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

Subtask #1
0.0 / 12.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 Correct 0 ms 348 KB Output is correct
8 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
9 Correct 0 ms 348 KB Output is correct
10 Incorrect 0 ms 348 KB Output isn't correct
11 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 1 ms 348 KB Failed to provide a successful strategy.
3 Partially correct 1 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 1 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 6 ms 348 KB Failed to provide a successful strategy.
12 Partially correct 3 ms 348 KB Failed to provide a successful strategy.
13 Partially correct 3 ms 480 KB Failed to provide a successful strategy.
14 Partially correct 3 ms 348 KB Failed to provide a successful strategy.
15 Partially correct 4 ms 480 KB Failed to provide a successful strategy.
16 Partially correct 7 ms 480 KB Failed to provide a successful strategy.
17 Partially correct 7 ms 608 KB Failed to provide a successful strategy.
18 Partially correct 7 ms 604 KB Failed to provide a successful strategy.
19 Partially correct 7 ms 604 KB Failed to provide a successful strategy.
20 Partially correct 7 ms 612 KB Failed to provide a successful strategy.

Subtask #3
0.0 / 80.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 Correct 0 ms 348 KB Output is correct
8 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
9 Correct 0 ms 348 KB Output is correct
10 Incorrect 0 ms 348 KB Output isn't correct
11 Halted 0 ms 0 KB -