oj.uz

Submission #945479

# Submission time Handle Problem Language Result Execution time Memory
945479 2024-03-14T00:08:45 Z turtletortles Burza (COCI16_burza) C++17
0 / 160
 1 ms 348 KB 
#include "bits/stdc++.h"
#include <utility>
using namespace std;

#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define endl '\n'
#define debug(x) std::cerr << #x << " = " << x << '\n';

template<typename T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<typename T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

constexpr int MOD = 1e9 + 7;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LLINF = 0x3f3f3f3f3f3f3f3f;

const int MAXN = 405;
vector<int> adj[MAXN];

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int n, k; cin >> n >> k;
  if (k * k >= n) return cout << "DA" << endl, 0;
  k = 20;
  for (int i = 0; i < n - 1; i++) {
    int u, v; cin >> u >> v;
    --u, --v;
    adj[u].push_back(v);
    adj[v].push_back(u);
  }

  vector<vector<int>> paths;
  queue<pair<vector<int>, int>> q;
  q.push({{0}, 0});
  while (q.size()) {
    auto cur = q.front(); q.pop();
    if (cur.first.size() == k + 1) {
      paths.push_back(cur.first);
      continue;
    }

    for (auto to : adj[cur.first.back()]) {
      if (to == cur.second) continue;
      vector<int> npath(cur.first);
      npath.emplace_back(to);
      q.push({npath, cur.first.back()});
    }
  }

  vector<vector<int>> arr[k + 5];
  vector<int> start(paths.size());
  iota(all(start), 0);
  arr[0].push_back(start);
  for (int i = 0; i <= k; i++) {
    for (auto active : arr[i]) if (!active.size()) return cout << "DA" << endl, 0; 
    set<int> s;
    for (auto active : arr[i]) for (auto path : active) s.insert(paths[path][i + 1]);
    for (auto off : s) {  //construct new path without off
      for (auto active : arr[i]) {
        vector<int> nactive;
        for (auto path : active) if (paths[path][i + 1] != off) nactive.push_back(path);
        arr[i + 1].push_back(nactive);
      }
    }
  }

  cout << "NE" << endl;
  return 0;
}

Compilation message

burza.cpp: In function 'int main()':
burza.cpp:39:26: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   39 |     if (cur.first.size() == k + 1) {
      |         ~~~~~~~~~~~~~~~~~^~~~~~~~

Subtask #1
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 16.0

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

Subtask #7
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -