oj.uz

Submission #524075

# Submission time Handle Problem Language Result Execution time Memory
524075 2022-02-08T15:23:16 Z Turkhuu Connecting Supertrees (IOI20_supertrees) C++17
56 / 100
 215 ms 26180 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>> 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.get(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;
          s.unite(i, k);
        }
      }
    }
  }
  vector<bool> b(n, false);
  for(int i = 0; i < n; i++){
    if(b[s.get(i)]){
      continue;
    }
    b[i] = true;
    int cur = i;
    for(int j : v2[i]){
      if(s.get(j) != j){
        if(a[i][s.get(j)] != 2){
          return 0;
        }
        continue;
      }
      for(int k : v2[j]){
        if((a[i][k] != 1 && s.get(k) == i) || (a[i][k] == 1 && s.get(k) != i)){
          return 0;
        }
      }
      ans[cur][j] = 1;
      ans[j][cur] = 1;
      b[j] = true;
      cur = j;
    }
    if(cur == i){
      continue;
    }
    if(ans[i][cur]){
      return 0;
    }
    ans[i][cur] = 1;
    ans[cur][i] = 1;
  }
	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 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 8 ms 1356 KB Output is correct
7 Correct 190 ms 26180 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 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 8 ms 1356 KB Output is correct
7 Correct 190 ms 26180 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 8 ms 1100 KB Output is correct
13 Correct 172 ms 22212 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 4 ms 844 KB Output is correct
17 Correct 87 ms 14980 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 43 ms 5804 KB Output is correct
21 Correct 176 ms 22536 KB Output is correct
22 Correct 170 ms 22084 KB Output is correct
23 Correct 186 ms 24260 KB Output is correct
24 Correct 169 ms 22084 KB Output is correct
25 Correct 82 ms 12740 KB Output is correct
26 Correct 73 ms 12160 KB Output is correct
27 Correct 183 ms 25100 KB Output is correct
28 Correct 170 ms 22020 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 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 7 ms 1100 KB Output is correct
9 Correct 184 ms 22264 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 8 ms 1344 KB Output is correct
13 Correct 199 ms 26104 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Incorrect 1 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 0 ms 204 KB Output is correct
4 Correct 46 ms 5828 KB Output is correct
5 Correct 187 ms 22560 KB Output is correct
6 Correct 187 ms 22112 KB Output is correct
7 Correct 196 ms 24132 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 45 ms 5724 KB Output is correct
10 Correct 181 ms 22576 KB Output is correct
11 Correct 184 ms 22132 KB Output is correct
12 Correct 215 ms 25212 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 51 ms 5880 KB Output is correct
17 Correct 189 ms 22552 KB Output is correct
18 Correct 184 ms 22676 KB Output is correct
19 Correct 179 ms 22248 KB Output is correct
20 Correct 173 ms 22020 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 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 8 ms 1356 KB Output is correct
7 Correct 190 ms 26180 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 8 ms 1100 KB Output is correct
13 Correct 172 ms 22212 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 4 ms 844 KB Output is correct
17 Correct 87 ms 14980 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 43 ms 5804 KB Output is correct
21 Correct 176 ms 22536 KB Output is correct
22 Correct 170 ms 22084 KB Output is correct
23 Correct 186 ms 24260 KB Output is correct
24 Correct 169 ms 22084 KB Output is correct
25 Correct 82 ms 12740 KB Output is correct
26 Correct 73 ms 12160 KB Output is correct
27 Correct 183 ms 25100 KB Output is correct
28 Correct 170 ms 22020 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 7 ms 1100 KB Output is correct
37 Correct 184 ms 22264 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 8 ms 1344 KB Output is correct
41 Correct 199 ms 26104 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Incorrect 1 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 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 8 ms 1356 KB Output is correct
7 Correct 190 ms 26180 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 8 ms 1100 KB Output is correct
13 Correct 172 ms 22212 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 4 ms 844 KB Output is correct
17 Correct 87 ms 14980 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 43 ms 5804 KB Output is correct
21 Correct 176 ms 22536 KB Output is correct
22 Correct 170 ms 22084 KB Output is correct
23 Correct 186 ms 24260 KB Output is correct
24 Correct 169 ms 22084 KB Output is correct
25 Correct 82 ms 12740 KB Output is correct
26 Correct 73 ms 12160 KB Output is correct
27 Correct 183 ms 25100 KB Output is correct
28 Correct 170 ms 22020 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 7 ms 1100 KB Output is correct
37 Correct 184 ms 22264 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 8 ms 1344 KB Output is correct
41 Correct 199 ms 26104 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Incorrect 1 ms 204 KB Answer gives possible 1 while actual possible 0
44 Halted 0 ms 0 KB -