oj.uz

Submission #883154

# Submission time Handle Problem Language Result Execution time Memory
883154 2023-12-04T16:25:04 Z AkibAzmain Connecting Supertrees (IOI20_supertrees) C++17
40 / 100
 198 ms 22348 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);
  set < int > r;
  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;
          if (p[i][j] == 1 && !r.count (i) && !r.count (j))
            ans[i][j] = 1, ans[j][i] = 1, r.insert (j);
          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[2].empty ()) continue;
      if (x[2].size () <= 2) return 0;
      int pr = *prev (x[2].end ());
      for (auto &y : x[2])
        {
          if (r.count (y)) continue;
          ans[pr][y] = ans[y][pr] = 1;
          pr = y;
        }
    }
  build (ans);
  return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 360 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 7 ms 1116 KB Output is correct
7 Correct 150 ms 22036 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 360 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 7 ms 1116 KB Output is correct
7 Correct 150 ms 22036 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 600 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 8 ms 1116 KB Output is correct
13 Correct 148 ms 22040 KB Output is correct
14 Correct 0 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 70 ms 12552 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 36 ms 5796 KB Output is correct
21 Correct 150 ms 22256 KB Output is correct
22 Correct 152 ms 22248 KB Output is correct
23 Correct 152 ms 22276 KB Output is correct
24 Correct 146 ms 22100 KB Output is correct
25 Correct 61 ms 12112 KB Output is correct
26 Correct 61 ms 12296 KB Output is correct
27 Correct 153 ms 22280 KB Output is correct
28 Correct 145 ms 22100 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 1 ms 344 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 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 6 ms 1100 KB Output is correct
9 Correct 145 ms 22100 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 6 ms 1116 KB Output is correct
13 Correct 147 ms 22044 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 600 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 64 ms 12112 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 37 ms 5772 KB Output is correct
22 Correct 147 ms 22024 KB Output is correct
23 Correct 151 ms 22160 KB Output is correct
24 Correct 153 ms 22280 KB Output is correct
25 Correct 62 ms 12112 KB Output is correct
26 Correct 58 ms 12040 KB Output is correct
27 Correct 146 ms 22036 KB Output is correct
28 Correct 165 ms 22096 KB Output is correct
29 Correct 56 ms 12116 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 37 ms 5720 KB Output is correct
5 Correct 198 ms 22048 KB Output is correct
6 Correct 143 ms 22348 KB Output is correct
7 Correct 167 ms 22276 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 40 ms 5712 KB Output is correct
10 Correct 151 ms 22028 KB Output is correct
11 Correct 154 ms 22276 KB Output is correct
12 Correct 156 ms 22200 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Incorrect 39 ms 5888 KB Too many ways to get from 23 to 308, should be 1 found no less than 2
17 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 360 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 7 ms 1116 KB Output is correct
7 Correct 150 ms 22036 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 600 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 8 ms 1116 KB Output is correct
13 Correct 148 ms 22040 KB Output is correct
14 Correct 0 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 70 ms 12552 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 36 ms 5796 KB Output is correct
21 Correct 150 ms 22256 KB Output is correct
22 Correct 152 ms 22248 KB Output is correct
23 Correct 152 ms 22276 KB Output is correct
24 Correct 146 ms 22100 KB Output is correct
25 Correct 61 ms 12112 KB Output is correct
26 Correct 61 ms 12296 KB Output is correct
27 Correct 153 ms 22280 KB Output is correct
28 Correct 145 ms 22100 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 1 ms 344 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 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 6 ms 1100 KB Output is correct
37 Correct 145 ms 22100 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 6 ms 1116 KB Output is correct
41 Correct 147 ms 22044 KB Output is correct
42 Correct 0 ms 344 KB Output is correct
43 Correct 0 ms 600 KB Output is correct
44 Correct 3 ms 860 KB Output is correct
45 Correct 64 ms 12112 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 37 ms 5772 KB Output is correct
50 Correct 147 ms 22024 KB Output is correct
51 Correct 151 ms 22160 KB Output is correct
52 Correct 153 ms 22280 KB Output is correct
53 Correct 62 ms 12112 KB Output is correct
54 Correct 58 ms 12040 KB Output is correct
55 Correct 146 ms 22036 KB Output is correct
56 Correct 165 ms 22096 KB Output is correct
57 Correct 56 ms 12116 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 5 ms 860 KB Output is correct
61 Correct 73 ms 12320 KB Output is correct
62 Correct 1 ms 348 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 1 ms 348 KB Output is correct
65 Incorrect 39 ms 5708 KB Too many ways to get from 11 to 477, should be 1 found no less than 2
66 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 360 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 7 ms 1116 KB Output is correct
7 Correct 150 ms 22036 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 600 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 8 ms 1116 KB Output is correct
13 Correct 148 ms 22040 KB Output is correct
14 Correct 0 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 70 ms 12552 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 36 ms 5796 KB Output is correct
21 Correct 150 ms 22256 KB Output is correct
22 Correct 152 ms 22248 KB Output is correct
23 Correct 152 ms 22276 KB Output is correct
24 Correct 146 ms 22100 KB Output is correct
25 Correct 61 ms 12112 KB Output is correct
26 Correct 61 ms 12296 KB Output is correct
27 Correct 153 ms 22280 KB Output is correct
28 Correct 145 ms 22100 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 1 ms 344 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 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 6 ms 1100 KB Output is correct
37 Correct 145 ms 22100 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 6 ms 1116 KB Output is correct
41 Correct 147 ms 22044 KB Output is correct
42 Correct 0 ms 344 KB Output is correct
43 Correct 0 ms 600 KB Output is correct
44 Correct 3 ms 860 KB Output is correct
45 Correct 64 ms 12112 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 37 ms 5772 KB Output is correct
50 Correct 147 ms 22024 KB Output is correct
51 Correct 151 ms 22160 KB Output is correct
52 Correct 153 ms 22280 KB Output is correct
53 Correct 62 ms 12112 KB Output is correct
54 Correct 58 ms 12040 KB Output is correct
55 Correct 146 ms 22036 KB Output is correct
56 Correct 165 ms 22096 KB Output is correct
57 Correct 56 ms 12116 KB Output is correct
58 Correct 1 ms 600 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 37 ms 5720 KB Output is correct
62 Correct 198 ms 22048 KB Output is correct
63 Correct 143 ms 22348 KB Output is correct
64 Correct 167 ms 22276 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 40 ms 5712 KB Output is correct
67 Correct 151 ms 22028 KB Output is correct
68 Correct 154 ms 22276 KB Output is correct
69 Correct 156 ms 22200 KB Output is correct
70 Correct 0 ms 348 KB Output is correct
71 Correct 1 ms 348 KB Output is correct
72 Correct 0 ms 348 KB Output is correct
73 Incorrect 39 ms 5888 KB Too many ways to get from 23 to 308, should be 1 found no less than 2
74 Halted 0 ms 0 KB -