oj.uz

Submission #883080

# Submission time Handle Problem Language Result Execution time Memory
883080 2023-12-04T13:26:39 Z AkibAzmain Connecting Supertrees (IOI20_supertrees) C++17
19 / 100
 169 ms 24148 KB 
#include <bits/stdc++.h>
using namespace std;
#include "supertrees.h"
#include <vector>

int construct(std::vector<std::vector<int>> p) {
  int n = p.size();
  std::vector<std::vector<int>> ans (n, vector < int > (n));
  vector < pair < int, int > > dsu (n);
  for (int i = 0; i < n; ++i) dsu[i].first = -1, dsu[i].second = 1;
  for (int i = 0; i < n; ++i)
    {
      if (p[i][i] != 1) return 0;
      for (int j = i + 1; j < n; ++j)
        {
          if (p[j][i] != p[i][j]) return 0;
          if (p[i][j] == 2)
            {
              int ci = i, cj = j;
              while (dsu[ci].first != -1) ci = dsu[ci].first;
              while (dsu[cj].first != -1) cj = dsu[cj].first;
              if (ci != cj)
                {
                  if (dsu[ci].second < dsu[cj].second) swap (ci, cj);
                  dsu[cj].first = ci;
                  dsu[ci].second += dsu[cj].second;
                }
            }
        }
    }
  for (int i = 0; i < n; ++i)
    for (int j = i + 1; j < n; ++j)
      if (p[i][j] == 0)
        {
          if (p[j][i] != p[i][j]) return 0;
          int ci = i, cj = j;
          while (dsu[ci].first != -1) ci = dsu[ci].first;
          while (dsu[cj].first != -1) cj = dsu[cj].first;
          if (ci == cj) return 0;
        }
  map < int, vector < int > > s;
  for (int i = 0; i < n; ++i)
    {
      int ci = i;
      while (dsu[ci].first != -1) ci = dsu[ci].first;
      s[ci].push_back (i);
    }
  for (auto &[y, ss] : s)
    {
      for (int i = 1; i < ss.size (); ++i) ans[ss[i]][ss[i - 1]] = ans[ss[i - 1]][ss[i]] = 1;
      if (ss.size () == 2) return 0;
      if (ss.size () > 2) ans[ss.front ()][ss.back ()] = ans[ss.back ()][ss.front ()] = 1;
    }
  build (ans);
  return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:50:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |       for (int i = 1; i < ss.size (); ++i) ans[ss[i]][ss[i - 1]] = ans[ss[i - 1]][ss[i]] = 1;
      |                       ~~^~~~~~~~~~~~

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 1 ms 348 KB Too few ways to get from 0 to 1, should be 1 found 0
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 1 ms 348 KB Too few ways to get from 0 to 1, should be 1 found 0
3 Halted 0 ms 0 KB -

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 432 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 6 ms 1184 KB Output is correct
9 Correct 148 ms 24144 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1168 KB Output is correct
13 Correct 144 ms 24148 KB Output is correct
14 Correct 1 ms 500 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 64 ms 14204 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 432 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 37 ms 6260 KB Output is correct
22 Correct 163 ms 24084 KB Output is correct
23 Correct 150 ms 24148 KB Output is correct
24 Correct 149 ms 23988 KB Output is correct
25 Correct 71 ms 14208 KB Output is correct
26 Correct 61 ms 14220 KB Output is correct
27 Correct 147 ms 24148 KB Output is correct
28 Correct 169 ms 24004 KB Output is correct
29 Correct 58 ms 14160 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 1 ms 348 KB Too few ways to get from 1 to 2, should be 1 found 0
4 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 1 ms 348 KB Too few ways to get from 0 to 1, should be 1 found 0
3 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 1 ms 348 KB Too few ways to get from 0 to 1, should be 1 found 0
3 Halted 0 ms 0 KB -