oj.uz

Submission #524052

# Submission time Handle Problem Language Result Execution time Memory
524052 2022-02-08T14:48:01 Z Turkhuu Connecting Supertrees (IOI20_supertrees) C++17
56 / 100
 236 ms 34008 KB 
#include "supertrees.h"
#include <vector>
#include <bits/stdc++.h>

using namespace std;

struct dsu{
  int n;
  vector<int> size, parent;
 
  dsu(int _n) : n(_n), size(n, 1), parent(n){
    iota(parent.begin(), parent.end(), 0);
  }
 
  int get(int a){
    return a == parent[a] ? a : parent[a] = get(parent[a]);
  }
 
  bool unite(int b, int a){
    a = get(a);
    b = get(b);
    if(a == b){
      return 0;
    }
    size[b] += size[a];
    parent[a] = b;
    return 1;
  }
};

int construct(vector<vector<int>> a){
	int n = a.size();
  vector<vector<int>> g(n);
  vector<vector<int>> ans(n, vector<int>(n, 0));
	vector<vector<int>> v1(n),v2(n);
	for(int i = 0; i < n; i++){
		for(int j = i + 1; j < n; j++){
			if(a[i][j] == 1){
				v1[i].push_back(j);
				v1[j].push_back(i);

			} else if(a[i][j] == 2){
				v2[i].push_back(j);
        v2[j].push_back(i);
			} else if(a[i][j] == 3){
        return 0;
      }
		}
	}
  dsu s(n);
  for(int i = 0; i < n; i++){
    if(s.parent[i] == i){
      for(int j = 0; j < n; j++){
        for(int k : v1[i]){
          if(a[k][j] != a[i][j]){
            return 0;
          }
          ans[i][k] = 1;
          ans[k][i] = 1;
          g[i].push_back(k);
          g[k].push_back(i);
          s.unite(i, k);
        }
      }
    }
  }
  vector<bool> b(n, false);
  for(int i = 0; i < n; i++){
    if(s.parent[i] != i || b[s.parent[i]]){
      continue;
    }
    b[i] = true;
    int cur = i;
    int cnt = 1;
    for(int j : v2[i]){
      if(s.parent[j] != j){
        if(a[i][s.parent[j]] != 2){
          return 0;
        }
        continue;
      }
      for(int k : v2[j]){
        if((a[i][k] != 1 && s.parent[k] == i) || (a[i][k] == 1 && s.parent[k] != i)){
          return 0;
        }
      }
      ans[cur][j] = 1;
      ans[j][cur] = 1;
      g[cur].push_back(j);
      g[j].push_back(cur);
      b[j] = true;
      cur = j;
      cnt += 1;
    }
    if(cnt == 1){
      continue;
    }
    if(cnt == 2){
      return 0;
    }
    ans[i][cur] = 1;
    ans[cur][i] = 1;
    g[i].push_back(cur);
    g[cur].push_back(i);
  }
  // for(int i = 0; i < n; i++){
    // int cnt = s.parent[i] == i ? (int)v1[i].size() + 2 : 1;
    // if((int)g[i].size() != cnt){
      // return 0;
    // }
  // }
	build(ans);
	return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 12 ms 1736 KB Output is correct
7 Correct 219 ms 34008 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 12 ms 1736 KB Output is correct
7 Correct 219 ms 34008 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 292 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 8 ms 1272 KB Output is correct
13 Correct 181 ms 24008 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 272 KB Output is correct
16 Correct 4 ms 936 KB Output is correct
17 Correct 89 ms 17004 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 62 ms 8152 KB Output is correct
21 Correct 214 ms 30560 KB Output is correct
22 Correct 192 ms 29172 KB Output is correct
23 Correct 217 ms 31968 KB Output is correct
24 Correct 180 ms 24236 KB Output is correct
25 Correct 99 ms 19692 KB Output is correct
26 Correct 71 ms 14572 KB Output is correct
27 Correct 236 ms 33116 KB Output is correct
28 Correct 181 ms 24268 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 292 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 296 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 8 ms 1228 KB Output is correct
9 Correct 163 ms 22596 KB Output is correct
10 Correct 1 ms 288 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 8 ms 1484 KB Output is correct
13 Correct 182 ms 26716 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Incorrect 0 ms 204 KB Answer gives possible 1 while actual possible 0
16 Halted 0 ms 0 KB -

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 50 ms 8168 KB Output is correct
5 Correct 204 ms 30560 KB Output is correct
6 Correct 181 ms 29052 KB Output is correct
7 Correct 217 ms 31964 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 49 ms 6256 KB Output is correct
10 Correct 178 ms 24620 KB Output is correct
11 Correct 160 ms 24088 KB Output is correct
12 Correct 180 ms 27244 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 292 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 44 ms 6548 KB Output is correct
17 Correct 177 ms 24556 KB Output is correct
18 Correct 183 ms 27964 KB Output is correct
19 Correct 177 ms 26756 KB Output is correct
20 Correct 169 ms 24220 KB Output is correct

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 12 ms 1736 KB Output is correct
7 Correct 219 ms 34008 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 292 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 8 ms 1272 KB Output is correct
13 Correct 181 ms 24008 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 272 KB Output is correct
16 Correct 4 ms 936 KB Output is correct
17 Correct 89 ms 17004 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 62 ms 8152 KB Output is correct
21 Correct 214 ms 30560 KB Output is correct
22 Correct 192 ms 29172 KB Output is correct
23 Correct 217 ms 31968 KB Output is correct
24 Correct 180 ms 24236 KB Output is correct
25 Correct 99 ms 19692 KB Output is correct
26 Correct 71 ms 14572 KB Output is correct
27 Correct 236 ms 33116 KB Output is correct
28 Correct 181 ms 24268 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 292 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 1 ms 296 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 8 ms 1228 KB Output is correct
37 Correct 163 ms 22596 KB Output is correct
38 Correct 1 ms 288 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 8 ms 1484 KB Output is correct
41 Correct 182 ms 26716 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Incorrect 0 ms 204 KB Answer gives possible 1 while actual possible 0
44 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 12 ms 1736 KB Output is correct
7 Correct 219 ms 34008 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 292 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 8 ms 1272 KB Output is correct
13 Correct 181 ms 24008 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 272 KB Output is correct
16 Correct 4 ms 936 KB Output is correct
17 Correct 89 ms 17004 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 62 ms 8152 KB Output is correct
21 Correct 214 ms 30560 KB Output is correct
22 Correct 192 ms 29172 KB Output is correct
23 Correct 217 ms 31968 KB Output is correct
24 Correct 180 ms 24236 KB Output is correct
25 Correct 99 ms 19692 KB Output is correct
26 Correct 71 ms 14572 KB Output is correct
27 Correct 236 ms 33116 KB Output is correct
28 Correct 181 ms 24268 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 292 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 1 ms 296 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 8 ms 1228 KB Output is correct
37 Correct 163 ms 22596 KB Output is correct
38 Correct 1 ms 288 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 8 ms 1484 KB Output is correct
41 Correct 182 ms 26716 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Incorrect 0 ms 204 KB Answer gives possible 1 while actual possible 0
44 Halted 0 ms 0 KB -