oj.uz

Submission #300225

# Submission time Handle Problem Language Result Execution time Memory
300225 2020-09-17T01:48:44 Z madlogic Connecting Supertrees (IOI20_supertrees) C++17
21 / 100
 273 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);
  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;
      for (int j = 0; j < m - 1; j++)
        answer[cc[j]][cc[j + 1]] = answer[cc[j + 1]][cc[j]] = 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 0 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 384 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 11 ms 1664 KB Output is correct
7 Correct 273 ms 30328 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 384 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 11 ms 1664 KB Output is correct
7 Correct 273 ms 30328 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 1 ms 384 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 1152 KB Output is correct
13 Correct 234 ms 22264 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 6 ms 1152 KB Output is correct
17 Correct 132 ms 17628 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 64 ms 6008 KB Output is correct
21 Correct 246 ms 23260 KB Output is correct
22 Correct 238 ms 22136 KB Output is correct
23 Correct 259 ms 26360 KB Output is correct
24 Correct 246 ms 22136 KB Output is correct
25 Correct 117 ms 13304 KB Output is correct
26 Correct 107 ms 12248 KB Output is correct
27 Correct 271 ms 28408 KB Output is correct
28 Correct 265 ms 22268 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 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Incorrect 1 ms 256 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 0 ms 256 KB Output is correct
2 Incorrect 1 ms 256 KB Too few ways to get from 0 to 1, should be 2 found 1
3 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 384 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 11 ms 1664 KB Output is correct
7 Correct 273 ms 30328 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 1 ms 384 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 1152 KB Output is correct
13 Correct 234 ms 22264 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 6 ms 1152 KB Output is correct
17 Correct 132 ms 17628 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 64 ms 6008 KB Output is correct
21 Correct 246 ms 23260 KB Output is correct
22 Correct 238 ms 22136 KB Output is correct
23 Correct 259 ms 26360 KB Output is correct
24 Correct 246 ms 22136 KB Output is correct
25 Correct 117 ms 13304 KB Output is correct
26 Correct 107 ms 12248 KB Output is correct
27 Correct 271 ms 28408 KB Output is correct
28 Correct 265 ms 22268 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 0 ms 256 KB Output is correct
32 Incorrect 1 ms 256 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 0 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 384 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 11 ms 1664 KB Output is correct
7 Correct 273 ms 30328 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 1 ms 384 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 1152 KB Output is correct
13 Correct 234 ms 22264 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 6 ms 1152 KB Output is correct
17 Correct 132 ms 17628 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 64 ms 6008 KB Output is correct
21 Correct 246 ms 23260 KB Output is correct
22 Correct 238 ms 22136 KB Output is correct
23 Correct 259 ms 26360 KB Output is correct
24 Correct 246 ms 22136 KB Output is correct
25 Correct 117 ms 13304 KB Output is correct
26 Correct 107 ms 12248 KB Output is correct
27 Correct 271 ms 28408 KB Output is correct
28 Correct 265 ms 22268 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 0 ms 256 KB Output is correct
32 Incorrect 1 ms 256 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -