oj.uz

Submission #300215

# Submission time Handle Problem Language Result Execution time Memory
300215 2020-09-17T01:35:04 Z madlogic Connecting Supertrees (IOI20_supertrees) C++17
0 / 100
 1 ms 384 KB 
#include "supertrees.h"
#include <bits/stdc++.h>

using namespace std;

int construct(std::vector<std::vector<int>> p) {
  int n = p.size();
  vector<vector<int>> adj(n);
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) if (p[i][j]) {
      adj[i].push_back(j);
      adj[j].push_back(i);
    }
  }
  vector<int> cc;
  vector<bool> vis(n);
  function<void(int)> dfs = [&](int u) {
    vis[u] = true;
    cc.push_back(u);
    for (int to : adj[u]) if (!vis[to]) {
      dfs(to);
    }
  };
  vector<vector<int>> answer(n, vector<int>(n));
  for (int i = 0; i < n; i++) {
    if (!vis[i]) {
      dfs(i);
      int m = cc.size();
      int edges = 0;
      for (int p : cc)
        edges += adj[p].size();
      edges /= 2;
      if (edges >= m) 
        return 0;
      cc.clear();
    }
  }
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++)
      if (p[i][j] == 1 && !answer[i][j])
        answer[i][j] = 1;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++)
      if (p[i][j] == 0 && answer[i][j])
        return 0;
  build(answer);
  return 1;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 256 KB Answer gives possible 0 while actual possible 1
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 256 KB Answer gives possible 0 while actual possible 1
2 Halted 0 ms 0 KB -

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 256 KB Answer gives possible 0 while actual possible 1
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 384 KB Answer gives possible 0 while actual possible 1
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 256 KB Answer gives possible 0 while actual possible 1
2 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 256 KB Answer gives possible 0 while actual possible 1
2 Halted 0 ms 0 KB -