oj.uz

Submission #524029

# Submission time Handle Problem Language Result Execution time Memory
524029 2022-02-08T14:34:07 Z Turkhuu Connecting Supertrees (IOI20_supertrees) C++17
56 / 100
 195 ms 28444 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] != 1 && s.parent[k] == i) || (a[i][k] == 1 && 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 1 ms 204 KB Output is correct
2 Correct 0 ms 288 KB Output is correct
3 Correct 1 ms 288 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 292 KB Output is correct
6 Correct 9 ms 1448 KB Output is correct
7 Correct 195 ms 28444 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 288 KB Output is correct
3 Correct 1 ms 288 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 292 KB Output is correct
6 Correct 9 ms 1448 KB Output is correct
7 Correct 195 ms 28444 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 292 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 8 ms 1192 KB Output is correct
13 Correct 162 ms 23980 KB Output is correct
14 Correct 1 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 86 ms 16888 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 43 ms 6312 KB Output is correct
21 Correct 176 ms 24572 KB Output is correct
22 Correct 166 ms 24132 KB Output is correct
23 Correct 192 ms 26092 KB Output is correct
24 Correct 162 ms 24052 KB Output is correct
25 Correct 86 ms 14760 KB Output is correct
26 Correct 68 ms 14148 KB Output is correct
27 Correct 181 ms 27112 KB Output is correct
28 Correct 161 ms 24004 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 332 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 296 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 8 ms 1228 KB Output is correct
9 Correct 164 ms 24044 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 7 ms 1484 KB Output is correct
13 Correct 171 ms 28076 KB Output is correct
14 Correct 0 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 1 ms 288 KB Output is correct
4 Correct 44 ms 6292 KB Output is correct
5 Correct 189 ms 24536 KB Output is correct
6 Correct 168 ms 24004 KB Output is correct
7 Correct 188 ms 26104 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 49 ms 6308 KB Output is correct
10 Correct 165 ms 24556 KB Output is correct
11 Correct 163 ms 24004 KB Output is correct
12 Correct 177 ms 27076 KB Output is correct
13 Correct 0 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 43 ms 6280 KB Output is correct
17 Correct 187 ms 24536 KB Output is correct
18 Correct 168 ms 24644 KB Output is correct
19 Correct 186 ms 24260 KB Output is correct
20 Correct 162 ms 24044 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 288 KB Output is correct
3 Correct 1 ms 288 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 292 KB Output is correct
6 Correct 9 ms 1448 KB Output is correct
7 Correct 195 ms 28444 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 292 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 8 ms 1192 KB Output is correct
13 Correct 162 ms 23980 KB Output is correct
14 Correct 1 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 86 ms 16888 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 43 ms 6312 KB Output is correct
21 Correct 176 ms 24572 KB Output is correct
22 Correct 166 ms 24132 KB Output is correct
23 Correct 192 ms 26092 KB Output is correct
24 Correct 162 ms 24052 KB Output is correct
25 Correct 86 ms 14760 KB Output is correct
26 Correct 68 ms 14148 KB Output is correct
27 Correct 181 ms 27112 KB Output is correct
28 Correct 161 ms 24004 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 0 ms 332 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 296 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 8 ms 1228 KB Output is correct
37 Correct 164 ms 24044 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 7 ms 1484 KB Output is correct
41 Correct 171 ms 28076 KB Output is correct
42 Correct 0 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 288 KB Output is correct
3 Correct 1 ms 288 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 292 KB Output is correct
6 Correct 9 ms 1448 KB Output is correct
7 Correct 195 ms 28444 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 292 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 8 ms 1192 KB Output is correct
13 Correct 162 ms 23980 KB Output is correct
14 Correct 1 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 86 ms 16888 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 43 ms 6312 KB Output is correct
21 Correct 176 ms 24572 KB Output is correct
22 Correct 166 ms 24132 KB Output is correct
23 Correct 192 ms 26092 KB Output is correct
24 Correct 162 ms 24052 KB Output is correct
25 Correct 86 ms 14760 KB Output is correct
26 Correct 68 ms 14148 KB Output is correct
27 Correct 181 ms 27112 KB Output is correct
28 Correct 161 ms 24004 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 0 ms 332 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 296 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 8 ms 1228 KB Output is correct
37 Correct 164 ms 24044 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 7 ms 1484 KB Output is correct
41 Correct 171 ms 28076 KB Output is correct
42 Correct 0 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 -