oj.uz

답안 #523994

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
523994 2022-02-08T14:11:56 Z Turkhuu 슈퍼트리 잇기 (IOI20_supertrees) C++17
56 / 100
 281 ms 28064 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){
        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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 276 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 8 ms 1420 KB Output is correct
7 Correct 204 ms 28064 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 276 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 8 ms 1420 KB Output is correct
7 Correct 204 ms 28064 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 292 KB Output is correct
10 Correct 1 ms 288 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 7 ms 1200 KB Output is correct
13 Correct 172 ms 23924 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 940 KB Output is correct
17 Correct 96 ms 16892 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 44 ms 6252 KB Output is correct
21 Correct 180 ms 24476 KB Output is correct
22 Correct 214 ms 24004 KB Output is correct
23 Correct 198 ms 26008 KB Output is correct
24 Correct 218 ms 23960 KB Output is correct
25 Correct 95 ms 14664 KB Output is correct
26 Correct 70 ms 14116 KB Output is correct
27 Correct 203 ms 27052 KB Output is correct
28 Correct 169 ms 23956 KB Output is correct

Subtask #3
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 288 KB Output is correct
3 Correct 1 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 1 ms 292 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 10 ms 1200 KB Output is correct
9 Correct 197 ms 24088 KB Output is correct
10 Correct 1 ms 284 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 8 ms 1436 KB Output is correct
13 Correct 172 ms 28048 KB Output is correct
14 Correct 0 ms 284 KB Output is correct
15 Correct 1 ms 292 KB Output is correct
16 Correct 6 ms 944 KB Output is correct
17 Correct 88 ms 16876 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

# 결과 실행 시간 메모리 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 53 ms 6232 KB Output is correct
5 Correct 203 ms 24540 KB Output is correct
6 Correct 196 ms 24200 KB Output is correct
7 Correct 281 ms 26088 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 45 ms 6252 KB Output is correct
10 Correct 179 ms 24584 KB Output is correct
11 Correct 201 ms 24016 KB Output is correct
12 Correct 182 ms 27064 KB Output is correct
13 Correct 0 ms 288 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 42 ms 6216 KB Output is correct
17 Correct 175 ms 24612 KB Output is correct
18 Correct 205 ms 24596 KB Output is correct
19 Correct 208 ms 24232 KB Output is correct
20 Correct 253 ms 24044 KB Output is correct

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 276 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 8 ms 1420 KB Output is correct
7 Correct 204 ms 28064 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 292 KB Output is correct
10 Correct 1 ms 288 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 7 ms 1200 KB Output is correct
13 Correct 172 ms 23924 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 940 KB Output is correct
17 Correct 96 ms 16892 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 44 ms 6252 KB Output is correct
21 Correct 180 ms 24476 KB Output is correct
22 Correct 214 ms 24004 KB Output is correct
23 Correct 198 ms 26008 KB Output is correct
24 Correct 218 ms 23960 KB Output is correct
25 Correct 95 ms 14664 KB Output is correct
26 Correct 70 ms 14116 KB Output is correct
27 Correct 203 ms 27052 KB Output is correct
28 Correct 169 ms 23956 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 288 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 1 ms 292 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 10 ms 1200 KB Output is correct
37 Correct 197 ms 24088 KB Output is correct
38 Correct 1 ms 284 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 8 ms 1436 KB Output is correct
41 Correct 172 ms 28048 KB Output is correct
42 Correct 0 ms 284 KB Output is correct
43 Correct 1 ms 292 KB Output is correct
44 Correct 6 ms 944 KB Output is correct
45 Correct 88 ms 16876 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 276 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 8 ms 1420 KB Output is correct
7 Correct 204 ms 28064 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 292 KB Output is correct
10 Correct 1 ms 288 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 7 ms 1200 KB Output is correct
13 Correct 172 ms 23924 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 940 KB Output is correct
17 Correct 96 ms 16892 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 44 ms 6252 KB Output is correct
21 Correct 180 ms 24476 KB Output is correct
22 Correct 214 ms 24004 KB Output is correct
23 Correct 198 ms 26008 KB Output is correct
24 Correct 218 ms 23960 KB Output is correct
25 Correct 95 ms 14664 KB Output is correct
26 Correct 70 ms 14116 KB Output is correct
27 Correct 203 ms 27052 KB Output is correct
28 Correct 169 ms 23956 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 288 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 1 ms 292 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 10 ms 1200 KB Output is correct
37 Correct 197 ms 24088 KB Output is correct
38 Correct 1 ms 284 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 8 ms 1436 KB Output is correct
41 Correct 172 ms 28048 KB Output is correct
42 Correct 0 ms 284 KB Output is correct
43 Correct 1 ms 292 KB Output is correct
44 Correct 6 ms 944 KB Output is correct
45 Correct 88 ms 16876 KB Output is correct
46 Incorrect 1 ms 204 KB Answer gives possible 1 while actual possible 0
47 Halted 0 ms 0 KB -