oj.uz

Submission #604067

# Submission time Handle Problem Language Result Execution time Memory
604067 2022-07-24T16:34:54 Z Sam_a17 Connecting Supertrees (IOI20_supertrees) C++14
100 / 100
 221 ms 22140 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define dbg(x) cout << #x << " " << x << endl;
#define uniq(x) x.resize(unique(all(x)) - x.begin());
 
#define pb push_back
#define ld long double
#define ll long long
 
void build(std::vector<std::vector<int>> p);

const int N = 2e5 + 10, M = 1e3 + 10;
// vector<int> cycles[N];
int pr[N];
map<int, vector<int>> mp1, mp2;

struct dsu {
  vector<int> par, sz;

  void init(int n) {
    par.resize(n + 1);
    sz.resize(n + 1);
    
    for(int i = 0; i < n; i++) {
      par[i] = i, sz[i] = 1;
    }
  }

  int find(int a) {
    if(a != par[a]) {
      par[a] = find(par[a]);
    }
    return par[a];
  }
  
  int same(int a, int b) {
    if(find(a) == find(b)) {
      return 1;
    } else {
      return 0;
    }
  }
  
  int merge(int a, int b) {
    a = find(a), b = find(b);
    if(a == b) {
      return 0;
    }
  
    if(sz[a] < sz[b]) {
      swap(a, b);
    }
  
    par[b] = a, sz[a] += sz[b];
    return 1;
  }
} d1, d2;

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

  d1.init(n + 1), d2.init(n + 1);

  for(int i = 0; i < n; i++) {
    for(int j = 0; j < n; j++) {
      if(p[i][j] == 3) {
        return 0;
      }
    }
  }

  vector<vector<int>> answ(n, vector<int>(n, 0));

  for(int i = 0; i < n; i++) {
    for(int j = 0; j < n; j++) {
      if(p[i][j] == 1) {
        d1.merge(i, j);
      }
    }
  }

  for(int i = 0; i < n; i++) {
    int hayr = d1.find(i);
    pr[i] = hayr;
    if(hayr != i) {
      mp1[hayr].push_back(i);
    }
  }

  for(int i = 0; i < n; i++) {
    for(int j = 0; j < n; j++) {
      if(p[i][j] != p[pr[i]][pr[j]]) {
        return 0;
      }
    }
  }

  vector<int> cycle;
  for(int i = 0; i < n; i++) {
    if(pr[i] == i) {
      cycle.push_back(i);
    }
  }

  for(auto i: cycle) {
    for(auto j: cycle) {
      if(p[i][j] == 2) {
        d2.merge(i, j);
      }
    }
  }

  for(auto i: cycle) {
    int hayr = d2.find(i);
    pr[i] = hayr;
    if(hayr != i) {
      mp2[hayr].push_back(i);
    }
  }

  for(auto i: cycle) {
    for(auto j: cycle) {
      if(i != j && p[i][j] != 2 && d2.same(i, j)) {
        return 0; 
      }
    }
  }

  for(auto i: mp1) {
    for(auto j: i.second) {
      answ[i.first][j] = answ[j][i.first] = 1;
    }
  }

  for(auto i: mp2) {
    if(sz(i.second) == 1) {
      return 0;
    }

    int curr = i.first;
    for(auto j: i.second) {
      answ[curr][j] = answ[j][curr] = 1;
      curr = j;
    }
    answ[curr][i.first] = answ[i.first][curr] = 1;
  }

  build(answ);
	return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 7 ms 1200 KB Output is correct
7 Correct 167 ms 22044 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 7 ms 1200 KB Output is correct
7 Correct 167 ms 22044 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 8 ms 1108 KB Output is correct
13 Correct 165 ms 22032 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 5 ms 724 KB Output is correct
17 Correct 87 ms 12048 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 42 ms 5784 KB Output is correct
21 Correct 172 ms 22028 KB Output is correct
22 Correct 179 ms 22044 KB Output is correct
23 Correct 203 ms 21964 KB Output is correct
24 Correct 172 ms 22044 KB Output is correct
25 Correct 71 ms 12108 KB Output is correct
26 Correct 69 ms 12184 KB Output is correct
27 Correct 184 ms 22044 KB Output is correct
28 Correct 198 ms 22012 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 7 ms 1108 KB Output is correct
9 Correct 181 ms 22108 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 8 ms 1152 KB Output is correct
13 Correct 175 ms 22140 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 4 ms 724 KB Output is correct
17 Correct 87 ms 12064 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 55 ms 5748 KB Output is correct
22 Correct 176 ms 22092 KB Output is correct
23 Correct 179 ms 22044 KB Output is correct
24 Correct 181 ms 21980 KB Output is correct
25 Correct 80 ms 12044 KB Output is correct
26 Correct 98 ms 12172 KB Output is correct
27 Correct 196 ms 22028 KB Output is correct
28 Correct 183 ms 22044 KB Output is correct
29 Correct 78 ms 12048 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 44 ms 5768 KB Output is correct
5 Correct 174 ms 22000 KB Output is correct
6 Correct 179 ms 22040 KB Output is correct
7 Correct 177 ms 21992 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 44 ms 5776 KB Output is correct
10 Correct 175 ms 22028 KB Output is correct
11 Correct 221 ms 22108 KB Output is correct
12 Correct 187 ms 22032 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 59 ms 5736 KB Output is correct
17 Correct 186 ms 22040 KB Output is correct
18 Correct 168 ms 22048 KB Output is correct
19 Correct 199 ms 22044 KB Output is correct
20 Correct 173 ms 22032 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 7 ms 1200 KB Output is correct
7 Correct 167 ms 22044 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 8 ms 1108 KB Output is correct
13 Correct 165 ms 22032 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 5 ms 724 KB Output is correct
17 Correct 87 ms 12048 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 42 ms 5784 KB Output is correct
21 Correct 172 ms 22028 KB Output is correct
22 Correct 179 ms 22044 KB Output is correct
23 Correct 203 ms 21964 KB Output is correct
24 Correct 172 ms 22044 KB Output is correct
25 Correct 71 ms 12108 KB Output is correct
26 Correct 69 ms 12184 KB Output is correct
27 Correct 184 ms 22044 KB Output is correct
28 Correct 198 ms 22012 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 7 ms 1108 KB Output is correct
37 Correct 181 ms 22108 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 8 ms 1152 KB Output is correct
41 Correct 175 ms 22140 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 4 ms 724 KB Output is correct
45 Correct 87 ms 12064 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 55 ms 5748 KB Output is correct
50 Correct 176 ms 22092 KB Output is correct
51 Correct 179 ms 22044 KB Output is correct
52 Correct 181 ms 21980 KB Output is correct
53 Correct 80 ms 12044 KB Output is correct
54 Correct 98 ms 12172 KB Output is correct
55 Correct 196 ms 22028 KB Output is correct
56 Correct 183 ms 22044 KB Output is correct
57 Correct 78 ms 12048 KB Output is correct
58 Correct 0 ms 212 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 4 ms 724 KB Output is correct
61 Correct 82 ms 12160 KB Output is correct
62 Correct 0 ms 212 KB Output is correct
63 Correct 0 ms 212 KB Output is correct
64 Correct 0 ms 212 KB Output is correct
65 Correct 59 ms 5708 KB Output is correct
66 Correct 78 ms 12052 KB Output is correct
67 Correct 70 ms 12172 KB Output is correct
68 Correct 74 ms 12060 KB Output is correct
69 Correct 72 ms 12052 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 7 ms 1200 KB Output is correct
7 Correct 167 ms 22044 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 8 ms 1108 KB Output is correct
13 Correct 165 ms 22032 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 5 ms 724 KB Output is correct
17 Correct 87 ms 12048 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 42 ms 5784 KB Output is correct
21 Correct 172 ms 22028 KB Output is correct
22 Correct 179 ms 22044 KB Output is correct
23 Correct 203 ms 21964 KB Output is correct
24 Correct 172 ms 22044 KB Output is correct
25 Correct 71 ms 12108 KB Output is correct
26 Correct 69 ms 12184 KB Output is correct
27 Correct 184 ms 22044 KB Output is correct
28 Correct 198 ms 22012 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 7 ms 1108 KB Output is correct
37 Correct 181 ms 22108 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 8 ms 1152 KB Output is correct
41 Correct 175 ms 22140 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 4 ms 724 KB Output is correct
45 Correct 87 ms 12064 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 55 ms 5748 KB Output is correct
50 Correct 176 ms 22092 KB Output is correct
51 Correct 179 ms 22044 KB Output is correct
52 Correct 181 ms 21980 KB Output is correct
53 Correct 80 ms 12044 KB Output is correct
54 Correct 98 ms 12172 KB Output is correct
55 Correct 196 ms 22028 KB Output is correct
56 Correct 183 ms 22044 KB Output is correct
57 Correct 78 ms 12048 KB Output is correct
58 Correct 0 ms 212 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 0 ms 212 KB Output is correct
61 Correct 44 ms 5768 KB Output is correct
62 Correct 174 ms 22000 KB Output is correct
63 Correct 179 ms 22040 KB Output is correct
64 Correct 177 ms 21992 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 44 ms 5776 KB Output is correct
67 Correct 175 ms 22028 KB Output is correct
68 Correct 221 ms 22108 KB Output is correct
69 Correct 187 ms 22032 KB Output is correct
70 Correct 0 ms 212 KB Output is correct
71 Correct 0 ms 212 KB Output is correct
72 Correct 0 ms 212 KB Output is correct
73 Correct 59 ms 5736 KB Output is correct
74 Correct 186 ms 22040 KB Output is correct
75 Correct 168 ms 22048 KB Output is correct
76 Correct 199 ms 22044 KB Output is correct
77 Correct 173 ms 22032 KB Output is correct
78 Correct 0 ms 212 KB Output is correct
79 Correct 0 ms 212 KB Output is correct
80 Correct 4 ms 724 KB Output is correct
81 Correct 82 ms 12160 KB Output is correct
82 Correct 0 ms 212 KB Output is correct
83 Correct 0 ms 212 KB Output is correct
84 Correct 0 ms 212 KB Output is correct
85 Correct 59 ms 5708 KB Output is correct
86 Correct 78 ms 12052 KB Output is correct
87 Correct 70 ms 12172 KB Output is correct
88 Correct 74 ms 12060 KB Output is correct
89 Correct 72 ms 12052 KB Output is correct
90 Correct 0 ms 212 KB Output is correct
91 Correct 1 ms 212 KB Output is correct
92 Correct 3 ms 596 KB Output is correct
93 Correct 75 ms 8088 KB Output is correct
94 Correct 0 ms 212 KB Output is correct
95 Correct 0 ms 212 KB Output is correct
96 Correct 0 ms 212 KB Output is correct
97 Correct 25 ms 2188 KB Output is correct
98 Correct 71 ms 8212 KB Output is correct
99 Correct 68 ms 8220 KB Output is correct
100 Correct 71 ms 8208 KB Output is correct
101 Correct 70 ms 8208 KB Output is correct
102 Correct 85 ms 8208 KB Output is correct
103 Correct 70 ms 8092 KB Output is correct
104 Correct 68 ms 8092 KB Output is correct
105 Correct 71 ms 8268 KB Output is correct