oj.uz

Submission #373225

# Submission time Handle Problem Language Result Execution time Memory
373225 2021-03-03T21:33:45 Z Matteo_Verz Connecting Supertrees (IOI20_supertrees) C++17
46 / 100
 939 ms 24300 KB 
#include "supertrees.h"
#include <bits/stdc++.h>

using namespace std;

vector<vector<int>> answer;
vector <int> viz;
bool ok = true;

void Solve_Component(int node, vector <vector <int>> p, int comp) {
  int n = p.size();
  viz[node] = comp;

  for(int i = 0; i < n; i++)
    if(p[node][i] > 0)
      viz[i] = comp; // mark each node as part of the component

  vector <bool> isroot(n, false);
  for(int i = 0; i < n; i++)
    if(viz[i] == comp) isroot[i] = true; // we consider each node as the "root"

  vector <int> roots;
  for(int i = 0; i < n; i++) { // we go through each node
    if(isroot[i] == true) {
      roots.push_back(i);
      for(int j = 0; j < n; j++) {
        if(i == j) continue;

        if(p[i][j] == 1) { // if there is only 1 path from i to j => i is parent of j
          answer[i][j] = answer[j][i] = 1;
          isroot[j] = false;
        }
      }
    }
  }

  if(roots.size() == 1) return; // it's fine, we only have a tree
  if(roots.size() == 2) { // we have a cycle of length 2 => impossible
    ok = false;
    return;
  }

  for(int i = 0; i < roots.size() - 1; i++)
    answer[roots[i]][roots[i + 1]] = answer[roots[i + 1]][roots[i]] = 1; // we connect the roots
  answer[roots[0]][roots.back()] = answer[roots.back()][roots[0]] = 1;
}

int construct(vector<vector<int>> p) {
  int n = p.size();

  answer.resize(n);
  for(int i = 0; i < n; i++) answer[i].resize(n);

  // last subtask, p[i][j] == 3
  for(int i = 0; i < n; i++) {
    for(int j = 0; j < n; j++)
      if(p[i][j] > 2) return 0;
  }

  viz.resize(n);
  int cc(0);
  for(int i = 0; i < n; i++)
     if(viz[i] == 0)
       Solve_Component(i, p, ++cc); // solve for each component

  if(ok == false)
    return 0;

  build(answer);
  return 1;
}

Compilation message

supertrees.cpp: In function 'void Solve_Component(int, std::vector<std::vector<int> >, int)':
supertrees.cpp:43:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |   for(int i = 0; i < roots.size() - 1; i++)
      |                  ~~^~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 15 ms 1236 KB Output is correct
7 Correct 252 ms 24044 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 15 ms 1236 KB Output is correct
7 Correct 252 ms 24044 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 380 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 17 ms 1324 KB Output is correct
13 Correct 866 ms 24272 KB Output is correct
14 Incorrect 1 ms 364 KB Answer gives possible 1 while actual possible 0
15 Halted 0 ms 0 KB -

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 17 ms 1324 KB Output is correct
9 Correct 919 ms 24172 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 12 ms 1324 KB Output is correct
13 Correct 247 ms 24172 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Incorrect 1 ms 364 KB Answer gives possible 1 while actual possible 0
16 Halted 0 ms 0 KB -

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 75 ms 6252 KB Output is correct
5 Correct 262 ms 24044 KB Output is correct
6 Correct 527 ms 24172 KB Output is correct
7 Correct 259 ms 24044 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 70 ms 6252 KB Output is correct
10 Correct 282 ms 24172 KB Output is correct
11 Correct 398 ms 24172 KB Output is correct
12 Correct 269 ms 24172 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 73 ms 6252 KB Output is correct
17 Correct 254 ms 24044 KB Output is correct
18 Correct 272 ms 24044 KB Output is correct
19 Correct 277 ms 24300 KB Output is correct
20 Correct 939 ms 24172 KB Output is correct

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 15 ms 1236 KB Output is correct
7 Correct 252 ms 24044 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 380 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 17 ms 1324 KB Output is correct
13 Correct 866 ms 24272 KB Output is correct
14 Incorrect 1 ms 364 KB Answer gives possible 1 while actual possible 0
15 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 15 ms 1236 KB Output is correct
7 Correct 252 ms 24044 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 380 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 17 ms 1324 KB Output is correct
13 Correct 866 ms 24272 KB Output is correct
14 Incorrect 1 ms 364 KB Answer gives possible 1 while actual possible 0
15 Halted 0 ms 0 KB -