제출 #300460

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
300460	2020-09-17 07:32:29	mohammad	슈퍼트리 잇기 (IOI20_supertrees)	C++14	40 / 100	299 ms	22392 KiB

supertrees

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll ;
int root[1020] , de[1020] , use[1020] , r[1020];
ll find(int u){
  if(root[u] == u) return u;
  return root[u] = find(root[u]);
}
int construct(vector<vector<int>> p) {
  int n = p.size();
  vector<vector<int>> answer(n , vector<int>(n , 0));
  for(int i = 0 ; i < n ; ++i){
    if(p[i][i] != 1) return 0 ;
    root[i] = i ; 
  }
  for(int i = 0 ; i < n; ++i)
    for(int j = 0 ; j < n; ++j){
      if(p[i][j] == 2 || p[i][j] == 0) r[i]++ ;
      if(!p[i][j]) continue ;
      root[find(i)] = find(j);
    }
  for(int i = 0 ; i < n ; ++i) {
    if(r[i] == n - 1) de[i] = 1;
    else de[i] = 0 ;
    find(i);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 11 / 11
• Subtask 2: 10 / 10
• Subtask 3: 19 / 19
• Subtask 4: 0 / 35
• Subtask 5: 0 / 21
• Subtask 6: 0 / 4