oj.uz

Submission #524018

# Submission time Handle Problem Language Result Execution time Memory
524018 2022-02-08T14:30:01 Z Turkhuu Connecting Supertrees (IOI20_supertrees) C++17
56 / 100
 205 ms 27960 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.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;
          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;
    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] != 2 && s.parent[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 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 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 9 ms 1428 KB Output is correct
7 Correct 205 ms 27960 KB Output is correct

Subtask #2
10.0 / 10.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 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 9 ms 1428 KB Output is correct
7 Correct 205 ms 27960 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 288 KB Output is correct
12 Correct 7 ms 1228 KB Output is correct
13 Correct 195 ms 23848 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 7 ms 920 KB Output is correct
17 Correct 80 ms 16716 KB Output is correct
18 Correct 1 ms 284 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 50 ms 6248 KB Output is correct
21 Correct 173 ms 24568 KB Output is correct
22 Correct 165 ms 24004 KB Output is correct
23 Correct 182 ms 26076 KB Output is correct
24 Correct 195 ms 23984 KB Output is correct
25 Correct 73 ms 14572 KB Output is correct
26 Correct 68 ms 14108 KB Output is correct
27 Correct 182 ms 27076 KB Output is correct
28 Correct 171 ms 24020 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 284 KB Output is correct
3 Correct 1 ms 288 KB Output is correct
4 Correct 1 ms 292 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 288 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 8 ms 1148 KB Output is correct
9 Correct 172 ms 23976 KB Output is correct
10 Correct 1 ms 292 KB Output is correct
11 Correct 1 ms 288 KB Output is correct
12 Correct 7 ms 1452 KB Output is correct
13 Correct 172 ms 27880 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 972 KB Output is correct
17 Correct 85 ms 16808 KB Output is correct
18 Incorrect 1 ms 204 KB Answer gives possible 1 while actual possible 0
19 Halted 0 ms 0 KB -

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 292 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 43 ms 6256 KB Output is correct
5 Correct 173 ms 24340 KB Output is correct
6 Correct 166 ms 23864 KB Output is correct
7 Correct 190 ms 25868 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 41 ms 6288 KB Output is correct
10 Correct 168 ms 24388 KB Output is correct
11 Correct 166 ms 23836 KB Output is correct
12 Correct 177 ms 26948 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 41 ms 6260 KB Output is correct
17 Correct 165 ms 24520 KB Output is correct
18 Correct 171 ms 24644 KB Output is correct
19 Correct 173 ms 24360 KB Output is correct
20 Correct 162 ms 24008 KB Output is correct

Subtask #5
0 / 21.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 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 9 ms 1428 KB Output is correct
7 Correct 205 ms 27960 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 288 KB Output is correct
12 Correct 7 ms 1228 KB Output is correct
13 Correct 195 ms 23848 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 7 ms 920 KB Output is correct
17 Correct 80 ms 16716 KB Output is correct
18 Correct 1 ms 284 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 50 ms 6248 KB Output is correct
21 Correct 173 ms 24568 KB Output is correct
22 Correct 165 ms 24004 KB Output is correct
23 Correct 182 ms 26076 KB Output is correct
24 Correct 195 ms 23984 KB Output is correct
25 Correct 73 ms 14572 KB Output is correct
26 Correct 68 ms 14108 KB Output is correct
27 Correct 182 ms 27076 KB Output is correct
28 Correct 171 ms 24020 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 284 KB Output is correct
31 Correct 1 ms 288 KB Output is correct
32 Correct 1 ms 292 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 288 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 8 ms 1148 KB Output is correct
37 Correct 172 ms 23976 KB Output is correct
38 Correct 1 ms 292 KB Output is correct
39 Correct 1 ms 288 KB Output is correct
40 Correct 7 ms 1452 KB Output is correct
41 Correct 172 ms 27880 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 4 ms 972 KB Output is correct
45 Correct 85 ms 16808 KB Output is correct
46 Incorrect 1 ms 204 KB Answer gives possible 1 while actual possible 0
47 Halted 0 ms 0 KB -

Subtask #6
0 / 4.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 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 9 ms 1428 KB Output is correct
7 Correct 205 ms 27960 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 288 KB Output is correct
12 Correct 7 ms 1228 KB Output is correct
13 Correct 195 ms 23848 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 7 ms 920 KB Output is correct
17 Correct 80 ms 16716 KB Output is correct
18 Correct 1 ms 284 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 50 ms 6248 KB Output is correct
21 Correct 173 ms 24568 KB Output is correct
22 Correct 165 ms 24004 KB Output is correct
23 Correct 182 ms 26076 KB Output is correct
24 Correct 195 ms 23984 KB Output is correct
25 Correct 73 ms 14572 KB Output is correct
26 Correct 68 ms 14108 KB Output is correct
27 Correct 182 ms 27076 KB Output is correct
28 Correct 171 ms 24020 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 284 KB Output is correct
31 Correct 1 ms 288 KB Output is correct
32 Correct 1 ms 292 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 288 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 8 ms 1148 KB Output is correct
37 Correct 172 ms 23976 KB Output is correct
38 Correct 1 ms 292 KB Output is correct
39 Correct 1 ms 288 KB Output is correct
40 Correct 7 ms 1452 KB Output is correct
41 Correct 172 ms 27880 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 4 ms 972 KB Output is correct
45 Correct 85 ms 16808 KB Output is correct
46 Incorrect 1 ms 204 KB Answer gives possible 1 while actual possible 0
47 Halted 0 ms 0 KB -