Submission #431192

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
431192	2021-06-17 10:13:51	saleh	Connecting Supertrees (IOI20_supertrees)	C++17	100 / 100	346 ms	22380 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;
const int MAXN = 1000 + 23;
vector<int> v[MAXN], v2[MAXN];
set<int> r, r2;
int n, num1[MAXN], num2[MAXN];// par[MAXN],
bitset<MAXN> b2[MAXN];
int construct(vector<vector<int>> p) {
  n = p.size();
  for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) if (p[i][j] == 3) return 0;
  for (int i = 0; i < n; i++) r.insert(i), v[i].push_back(i);
  for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) if (p[i][j] == 1) num1[i]++;
  for (int i = 0; i < n; i++) if (r.find(i) != r.end()) for (int j = i + 1; j < n; j++) if (r.find(j) != r.end()) if (p[i][j] == 1) {
    while (v[j].size()) {
//      par[v[j].back()] = i;
      v[i].push_back(v[j].back());
      v[j].pop_back();
    }
    r.erase(j);
  }
  vector<vector<int>> ans;
  for (int i = 0; i < n; i++) {
    vector<int> row;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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