oj.uz

Submission #447426

# Submission time Handle Problem Language Result Execution time Memory
447426 2021-07-26T09:57:02 Z Nodir_Bobiev Connecting Supertrees (IOI20_supertrees) C++17
0 / 100
 0 ms 204 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>> ans;
      for(int i = 0; i < n; i ++){
            vector <int> row;
            row.resize(n);
            ans.push_back(row);
      }
      map <int, bool> us;
      for(int i = 0; i < n; i ++){
            if( us[i] ) continue;
            for(int j = 0; j < n; j ++){
                if( p[i][j] ){
                    if( us[j] ) return 0;
                    us[j] = 1;
                    ans[i][j] = ans[j][1] = 1;
                }
            }
      }
      build(ans);
      return 1;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB b[0][0] is not 0
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB b[0][0] is not 0
2 Halted 0 ms 0 KB -

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB b is not symmetric: b[0][1] (1) != b[1][0] (0)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB b is not symmetric: b[0][1] (1) != b[1][0] (0)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB b[0][0] is not 0
2 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB b[0][0] is not 0
2 Halted 0 ms 0 KB -