oj.uz

Submission #300235

# Submission time Handle Problem Language Result Execution time Memory
300235 2020-09-17T02:00:34 Z madlogic Connecting Supertrees (IOI20_supertrees) C++17
11 / 100
 260 ms 30328 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);
  bool two = false;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) if (p[i][j]) {
      two |= p[i][j] == 2;
      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 (m == 1) 
        continue;
      if (m == 2 && two)
        return 0;
      // if (edges >= m) 
      //   return 0;
      for (int j = 0; j < m - 1; j++)
        answer[cc[j]][cc[j + 1]] = answer[cc[j + 1]][cc[j]] = 1;
      if (two)
        answer[cc[0]][cc[m - 1]] = answer[cc[m - 1]][cc[0]] = 1;
      for (int j = 0; j < m; j++) {
        for (int k = 0; k < m; k++) {
          if (p[cc[j]][cc[k]] == 0)
            return 0;
        }
      }
      cc.clear();
    }
  }
  build(answer);
  return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 11 ms 1664 KB Output is correct
7 Correct 260 ms 30328 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 11 ms 1664 KB Output is correct
7 Correct 260 ms 30328 KB Output is correct
8 Incorrect 1 ms 256 KB Answer gives possible 0 while actual possible 1
9 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 256 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 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 11 ms 1664 KB Output is correct
7 Correct 260 ms 30328 KB Output is correct
8 Incorrect 1 ms 256 KB Answer gives possible 0 while actual possible 1
9 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 11 ms 1664 KB Output is correct
7 Correct 260 ms 30328 KB Output is correct
8 Incorrect 1 ms 256 KB Answer gives possible 0 while actual possible 1
9 Halted 0 ms 0 KB -