oj.uz

Submission #883140

# Submission time Handle Problem Language Result Execution time Memory
883140 2023-12-04T15:58:38 Z AkibAzmain Connecting Supertrees (IOI20_supertrees) C++17
40 / 100
 176 ms 24196 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 < array < bool, 3 > > pt (n);
  vector < pair < int, int > > dsu (n);
  for (int i = 0; i < n; ++i) dsu[i].first = -1, dsu[i].second = 1;
  auto dsuc = [&] (int x)
  {
    while (dsu[x].first != -1) x = dsu[x].first;
    return x;
  };
  for (int i = 0; i < n; ++i)
    for (int j = i + 1; j < n; ++j)
      if (p[i][j])
        {
          if (p[i][j] == 3) return 0;
          pt[i][p[i][j]] = pt[j][p[i][j]] = true;
          int ci = dsuc (i), cj = dsuc (j);
          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] && dsuc (i) == dsuc (j)) return 0;
  map < int, array < set < int >, 3 > > m;
  for (int i = 0; i < n; ++i)
    {
      int ci = dsuc (i);
      if (pt[i][1]) m[ci][1].insert (i);
      if (pt[i][2]) m[ci][2].insert (i);
    }
  for (auto &[xx, x] : m)
    {
      if (x[1].empty () && x[2].empty ()) continue;
      int p = -1;
      for (auto &y : x[1])
        {
          if (x[2].size () && !x[2].count (y)) return 0;
          if (p >= 0) ans[p][y] = ans[y][p] = 1;
          p = y;
        }
      if (x[2].empty ()) continue;
      if (x[2].size () - x[1].size () <= (1 + x[1].empty ())) return 0;
      int pp = p;
      for (auto &y : x[2])
        {
          if (x[1].count (y)) continue;
          if (p >= 0) ans[p][y] = ans[y][p] = 1;
          p = y;
          if (pp == -1) pp = y;
        }
      ans[p][pp] = ans[pp][p] = 1;
    }
  build (ans);
  return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:52:39: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   52 |       if (x[2].size () - x[1].size () <= (1 + x[1].empty ())) return 0;
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 432 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1184 KB Output is correct
7 Correct 157 ms 23352 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 432 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1184 KB Output is correct
7 Correct 157 ms 23352 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1372 KB Output is correct
13 Correct 155 ms 23380 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 856 KB Output is correct
17 Correct 72 ms 14060 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 41 ms 6224 KB Output is correct
21 Correct 155 ms 24068 KB Output is correct
22 Correct 158 ms 24144 KB Output is correct
23 Correct 162 ms 24188 KB Output is correct
24 Correct 164 ms 24144 KB Output is correct
25 Correct 66 ms 14160 KB Output is correct
26 Correct 64 ms 14080 KB Output is correct
27 Correct 160 ms 24196 KB Output is correct
28 Correct 154 ms 24148 KB Output is correct

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 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 412 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 7 ms 1372 KB Output is correct
9 Correct 154 ms 23360 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1212 KB Output is correct
13 Correct 159 ms 23304 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 72 ms 13892 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 39 ms 6380 KB Output is correct
22 Correct 157 ms 23888 KB Output is correct
23 Correct 158 ms 24012 KB Output is correct
24 Correct 172 ms 23888 KB Output is correct
25 Correct 66 ms 13908 KB Output is correct
26 Correct 67 ms 13960 KB Output is correct
27 Correct 156 ms 23876 KB Output is correct
28 Correct 163 ms 23976 KB Output is correct
29 Correct 65 ms 13956 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 440 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 39 ms 6488 KB Output is correct
5 Correct 155 ms 23404 KB Output is correct
6 Correct 154 ms 23532 KB Output is correct
7 Correct 176 ms 23540 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 39 ms 6264 KB Output is correct
10 Correct 162 ms 23376 KB Output is correct
11 Correct 158 ms 23324 KB Output is correct
12 Correct 159 ms 23396 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 436 KB Output is correct
16 Incorrect 17 ms 3844 KB Answer gives possible 0 while actual possible 1
17 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 432 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1184 KB Output is correct
7 Correct 157 ms 23352 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1372 KB Output is correct
13 Correct 155 ms 23380 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 856 KB Output is correct
17 Correct 72 ms 14060 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 41 ms 6224 KB Output is correct
21 Correct 155 ms 24068 KB Output is correct
22 Correct 158 ms 24144 KB Output is correct
23 Correct 162 ms 24188 KB Output is correct
24 Correct 164 ms 24144 KB Output is correct
25 Correct 66 ms 14160 KB Output is correct
26 Correct 64 ms 14080 KB Output is correct
27 Correct 160 ms 24196 KB Output is correct
28 Correct 154 ms 24148 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 412 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 7 ms 1372 KB Output is correct
37 Correct 154 ms 23360 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 7 ms 1212 KB Output is correct
41 Correct 159 ms 23304 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 4 ms 860 KB Output is correct
45 Correct 72 ms 13892 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 39 ms 6380 KB Output is correct
50 Correct 157 ms 23888 KB Output is correct
51 Correct 158 ms 24012 KB Output is correct
52 Correct 172 ms 23888 KB Output is correct
53 Correct 66 ms 13908 KB Output is correct
54 Correct 67 ms 13960 KB Output is correct
55 Correct 156 ms 23876 KB Output is correct
56 Correct 163 ms 23976 KB Output is correct
57 Correct 65 ms 13956 KB Output is correct
58 Correct 0 ms 600 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 3 ms 860 KB Output is correct
61 Correct 70 ms 14076 KB Output is correct
62 Correct 0 ms 432 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Incorrect 17 ms 3932 KB Answer gives possible 0 while actual possible 1
66 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 432 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1184 KB Output is correct
7 Correct 157 ms 23352 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1372 KB Output is correct
13 Correct 155 ms 23380 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 856 KB Output is correct
17 Correct 72 ms 14060 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 41 ms 6224 KB Output is correct
21 Correct 155 ms 24068 KB Output is correct
22 Correct 158 ms 24144 KB Output is correct
23 Correct 162 ms 24188 KB Output is correct
24 Correct 164 ms 24144 KB Output is correct
25 Correct 66 ms 14160 KB Output is correct
26 Correct 64 ms 14080 KB Output is correct
27 Correct 160 ms 24196 KB Output is correct
28 Correct 154 ms 24148 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 412 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 7 ms 1372 KB Output is correct
37 Correct 154 ms 23360 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 7 ms 1212 KB Output is correct
41 Correct 159 ms 23304 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 4 ms 860 KB Output is correct
45 Correct 72 ms 13892 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 39 ms 6380 KB Output is correct
50 Correct 157 ms 23888 KB Output is correct
51 Correct 158 ms 24012 KB Output is correct
52 Correct 172 ms 23888 KB Output is correct
53 Correct 66 ms 13908 KB Output is correct
54 Correct 67 ms 13960 KB Output is correct
55 Correct 156 ms 23876 KB Output is correct
56 Correct 163 ms 23976 KB Output is correct
57 Correct 65 ms 13956 KB Output is correct
58 Correct 0 ms 440 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 39 ms 6488 KB Output is correct
62 Correct 155 ms 23404 KB Output is correct
63 Correct 154 ms 23532 KB Output is correct
64 Correct 176 ms 23540 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 39 ms 6264 KB Output is correct
67 Correct 162 ms 23376 KB Output is correct
68 Correct 158 ms 23324 KB Output is correct
69 Correct 159 ms 23396 KB Output is correct
70 Correct 0 ms 348 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 0 ms 436 KB Output is correct
73 Incorrect 17 ms 3844 KB Answer gives possible 0 while actual possible 1
74 Halted 0 ms 0 KB -