oj.uz

Submission #826976

# Submission time Handle Problem Language Result Execution time Memory
826976 2023-08-16T07:41:03 Z NeroZein Newspapers (CEOI21_newspapers) C++17
0 / 100
 1 ms 344 KB 
#include "bits/stdc++.h"
using namespace std;

#ifdef Nero
#include "Deb.h"
#else
#define deb(...)
#endif

const int N = 1e3 + 3;

vector<int> g[N]; 

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int n, m;
  cin >> n >> m;
  for (int i = 0; i < m; ++i) {
    int u, v;
    cin >> u >> v;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  vector<int> freq(2); 
  vector<int> color(n + 1, -1); 
  function<void(int, bool)> Dfs = [&](int v, bool c) {
    color[v] = c;
    freq[c]++; 
    for (int u : g[v]) {
      if (color[u] == -1) {
        Dfs(u, !c); 
      }
    }
  };
  Dfs(1, 1);
  if (n > 4) {
    cout << "NO" << '\n';
  } else {
    cout << "YES" << '\n';
    if (n == 1) {
      cout << 1 << '\n' << 1 << '\n';
    }
    if (n == 2) {
      cout << 2 << '\n' << 1 << ' ' << 1 << '\n';
    }
    if (n == 3) {
      cout << 2 << '\n' << 2 << ' ' << 2 << '\n';
    }
    if (n == 4) {
      cout << 4 << '\n' << 2 << ' ' << 2 << ' ' << 3 << ' ' << 3 << '\n';
    }
  }
  return 0;
}

Subtask #1
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Incorrect 0 ms 344 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0.0 / 8.0

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

Subtask #3
0.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Incorrect 0 ms 344 KB Output isn't correct
4 Halted 0 ms 0 KB -