oj.uz

Submission #300229

# Submission time Handle Problem Language Result Execution time Memory
300229 2020-09-17T01:52:07 Z madlogic Connecting Supertrees (IOI20_supertrees) C++17
21 / 100
 270 ms 30332 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 (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 384 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 268 ms 30332 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 384 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 268 ms 30332 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 234 ms 22136 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 6 ms 1024 KB Output is correct
17 Correct 136 ms 17528 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 66 ms 5964 KB Output is correct
21 Correct 242 ms 23160 KB Output is correct
22 Correct 242 ms 22136 KB Output is correct
23 Correct 264 ms 26232 KB Output is correct
24 Correct 241 ms 22136 KB Output is correct
25 Correct 108 ms 13304 KB Output is correct
26 Correct 109 ms 12280 KB Output is correct
27 Correct 270 ms 28280 KB Output is correct
28 Correct 237 ms 22136 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Incorrect 1 ms 288 KB Answer gives possible 1 while actual possible 0
5 Halted 0 ms 0 KB -

Subtask #4
0 / 35.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 61 ms 5984 KB Output is correct
5 Correct 248 ms 23288 KB Output is correct
6 Correct 242 ms 22140 KB Output is correct
7 Correct 263 ms 26360 KB Output is correct
8 Incorrect 1 ms 384 KB b[4][4] is not 0
9 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 384 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 268 ms 30332 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 234 ms 22136 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 6 ms 1024 KB Output is correct
17 Correct 136 ms 17528 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 66 ms 5964 KB Output is correct
21 Correct 242 ms 23160 KB Output is correct
22 Correct 242 ms 22136 KB Output is correct
23 Correct 264 ms 26232 KB Output is correct
24 Correct 241 ms 22136 KB Output is correct
25 Correct 108 ms 13304 KB Output is correct
26 Correct 109 ms 12280 KB Output is correct
27 Correct 270 ms 28280 KB Output is correct
28 Correct 237 ms 22136 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 256 KB Output is correct
32 Incorrect 1 ms 288 KB Answer gives possible 1 while actual possible 0
33 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 384 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 268 ms 30332 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 234 ms 22136 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 6 ms 1024 KB Output is correct
17 Correct 136 ms 17528 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 66 ms 5964 KB Output is correct
21 Correct 242 ms 23160 KB Output is correct
22 Correct 242 ms 22136 KB Output is correct
23 Correct 264 ms 26232 KB Output is correct
24 Correct 241 ms 22136 KB Output is correct
25 Correct 108 ms 13304 KB Output is correct
26 Correct 109 ms 12280 KB Output is correct
27 Correct 270 ms 28280 KB Output is correct
28 Correct 237 ms 22136 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 256 KB Output is correct
32 Incorrect 1 ms 288 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -