oj.uz

Submission #740055

# Submission time Handle Problem Language Result Execution time Memory
740055 2023-05-12T03:47:57 Z abczz Connecting Supertrees (IOI20_supertrees) C++17
40 / 100
 253 ms 27884 KB 
#include "supertrees.h"
#include <iostream>
#include <vector>
#include <array>
#define ll int

using namespace std;

vector <ll> X[1000];
vector <ll> Z, Y, W;
vector<array<ll, 2>> V[3];
vector<vector<int>> F;
vector <int> tmp;
bool B[1000], D[1000], E[1000];
ll n, a, b, z, P[1000], G[1000];
ll dsu(ll u) {
	if (P[u] == u) return u;
	else return P[u] = dsu(P[u]);
}
int construct(std::vector<std::vector<int>> p) {
	n = p.size();
	for (int i=0; i<n; ++i) P[i] = i;
	for (int i=0; i<n; ++i) {
		F.push_back(tmp);
		for (int j=0; j<n; ++j) {
			F[i].push_back(0);
			if (p[i][j] == 3) return 0;
			if (p[i][j]) {
				a = dsu(i), b = dsu(j);
				if (a != b) P[a] = b;
			}
      if (j > i) V[p[i][j]].push_back({i, j});
		}
	}
	for (auto [u, v] : V[0]) {
		a = dsu(u), b = dsu(v);
		if (a == b) return 0;
	}
  for (int i=0; i<n; ++i) {
    a = dsu(i);
    G[i] = a;
  }
	for (int i=0; i<n; ++i) P[i] = i;
	for (auto [u, v] : V[1]) {
		a = dsu(u), b = dsu(v);
		if (a != b) {
			P[a] = b;
			B[u] = B[v] = true;
			F[u][v] = F[v][u] = 1;
		}
	}
  for (auto [u, v] : V[2]) {
    E[u] = E[v] = 1;
    a = dsu(u), b = dsu(v);
    if (B[u]) X[u].push_back(v);
    if (B[v]) X[v].push_back(u);
    if (a == b) return 0;
  }
  for (int i=0; i<n; ++i) {
    if (B[i] && X[i].size() == 1) return 0;
  }
	for (int i=0; i<n; ++i) {
    if (B[i] && X[i].size()) {
      cout << i << " " << X[i].size() << endl;
      for (auto u : X[i]) {
        cout << u << " ";
      }
      cout << endl;
      if (D[X[i][0]]) continue;
      D[i] = true;
      a = dsu(i), b = dsu(X[i][0]);
      if (a != b) {
        P[a] = b;
        F[i][X[i][0]] = F[X[i][0]][i] = 1;
      }
      for (int j=0; j+1<X[i].size(); ++j) {
        a = dsu(X[i][j]), b = dsu(X[i][j+1]);
        D[X[i][j]] = true;
        if (a != b) {
          z = X[i][j+1];
          P[a] = b;
          F[X[i][j]][X[i][j+1]] = F[X[i][j+1]][X[i][j]] = 1;
        }
      }
      D[X[i].back()] = true;
      F[i][z] = F[z][i] = 1;
    }
  }
  for (int i=0; i<n; ++i) {
    if (!B[i] && !D[i] && E[i]) {
      Z.push_back(i);
    }
  }
  while (Z.size()) {
    Y.clear();
    W.clear();
    if (Z.size() <= 2) return 0;
    Y.push_back(Z[0]);
    for (int i=1; i<Z.size(); ++i) {
      if (G[Z[0]] == G[Z[i]]) Y.push_back(Z[i]);
      else W.push_back(Z[i]);
    }
    if (Y.size() <= 2) return 0;
    for (int i=0; i+1<Y.size(); ++i) {
      F[Y[i]][Y[i+1]] = F[Y[i+1]][Y[i]] = 1;
    }
    F[Y[0]][Y.back()] = F[Y.back()][Y[0]] = 1;
    swap(Z, W);
  }
	build(F);
	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:76:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   76 |       for (int j=0; j+1<X[i].size(); ++j) {
      |                     ~~~^~~~~~~~~~~~
supertrees.cpp:99:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   99 |     for (int i=1; i<Z.size(); ++i) {
      |                   ~^~~~~~~~~
supertrees.cpp:104:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  104 |     for (int i=0; i+1<Y.size(); ++i) {
      |                   ~~~^~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 8 ms 1484 KB Output is correct
7 Correct 192 ms 27200 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 8 ms 1484 KB Output is correct
7 Correct 192 ms 27200 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 8 ms 1480 KB Output is correct
13 Correct 183 ms 27172 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 4 ms 1108 KB Output is correct
17 Correct 90 ms 17312 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 45 ms 7248 KB Output is correct
21 Correct 175 ms 27276 KB Output is correct
22 Correct 190 ms 27204 KB Output is correct
23 Correct 253 ms 27248 KB Output is correct
24 Correct 181 ms 27228 KB Output is correct
25 Correct 90 ms 17336 KB Output is correct
26 Correct 79 ms 17280 KB Output is correct
27 Correct 188 ms 27208 KB Output is correct
28 Correct 212 ms 27240 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 13 ms 1488 KB Output is correct
9 Correct 197 ms 27196 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 8 ms 1484 KB Output is correct
13 Correct 194 ms 27180 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 4 ms 1124 KB Output is correct
17 Correct 91 ms 17420 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 44 ms 7284 KB Output is correct
22 Correct 198 ms 27616 KB Output is correct
23 Correct 176 ms 27684 KB Output is correct
24 Correct 202 ms 27584 KB Output is correct
25 Correct 100 ms 17652 KB Output is correct
26 Correct 81 ms 17692 KB Output is correct
27 Correct 183 ms 27884 KB Output is correct
28 Correct 206 ms 27796 KB Output is correct
29 Correct 107 ms 17892 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 48 ms 7232 KB Output is correct
5 Correct 178 ms 27672 KB Output is correct
6 Correct 177 ms 27596 KB Output is correct
7 Correct 187 ms 27664 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 47 ms 7212 KB Output is correct
10 Correct 184 ms 27720 KB Output is correct
11 Correct 191 ms 27788 KB Output is correct
12 Correct 202 ms 27636 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Incorrect 1 ms 320 KB secret mismatch
16 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 8 ms 1484 KB Output is correct
7 Correct 192 ms 27200 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 8 ms 1480 KB Output is correct
13 Correct 183 ms 27172 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 4 ms 1108 KB Output is correct
17 Correct 90 ms 17312 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 45 ms 7248 KB Output is correct
21 Correct 175 ms 27276 KB Output is correct
22 Correct 190 ms 27204 KB Output is correct
23 Correct 253 ms 27248 KB Output is correct
24 Correct 181 ms 27228 KB Output is correct
25 Correct 90 ms 17336 KB Output is correct
26 Correct 79 ms 17280 KB Output is correct
27 Correct 188 ms 27208 KB Output is correct
28 Correct 212 ms 27240 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 324 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 328 KB Output is correct
36 Correct 13 ms 1488 KB Output is correct
37 Correct 197 ms 27196 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 8 ms 1484 KB Output is correct
41 Correct 194 ms 27180 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 4 ms 1124 KB Output is correct
45 Correct 91 ms 17420 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 44 ms 7284 KB Output is correct
50 Correct 198 ms 27616 KB Output is correct
51 Correct 176 ms 27684 KB Output is correct
52 Correct 202 ms 27584 KB Output is correct
53 Correct 100 ms 17652 KB Output is correct
54 Correct 81 ms 17692 KB Output is correct
55 Correct 183 ms 27884 KB Output is correct
56 Correct 206 ms 27796 KB Output is correct
57 Correct 107 ms 17892 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 1 ms 340 KB Output is correct
60 Correct 5 ms 1108 KB Output is correct
61 Correct 97 ms 17572 KB Output is correct
62 Correct 1 ms 340 KB Output is correct
63 Correct 1 ms 340 KB Output is correct
64 Correct 1 ms 324 KB Output is correct
65 Incorrect 46 ms 7300 KB secret mismatch
66 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 8 ms 1484 KB Output is correct
7 Correct 192 ms 27200 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 8 ms 1480 KB Output is correct
13 Correct 183 ms 27172 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 4 ms 1108 KB Output is correct
17 Correct 90 ms 17312 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 45 ms 7248 KB Output is correct
21 Correct 175 ms 27276 KB Output is correct
22 Correct 190 ms 27204 KB Output is correct
23 Correct 253 ms 27248 KB Output is correct
24 Correct 181 ms 27228 KB Output is correct
25 Correct 90 ms 17336 KB Output is correct
26 Correct 79 ms 17280 KB Output is correct
27 Correct 188 ms 27208 KB Output is correct
28 Correct 212 ms 27240 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 324 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 328 KB Output is correct
36 Correct 13 ms 1488 KB Output is correct
37 Correct 197 ms 27196 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 8 ms 1484 KB Output is correct
41 Correct 194 ms 27180 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 4 ms 1124 KB Output is correct
45 Correct 91 ms 17420 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 44 ms 7284 KB Output is correct
50 Correct 198 ms 27616 KB Output is correct
51 Correct 176 ms 27684 KB Output is correct
52 Correct 202 ms 27584 KB Output is correct
53 Correct 100 ms 17652 KB Output is correct
54 Correct 81 ms 17692 KB Output is correct
55 Correct 183 ms 27884 KB Output is correct
56 Correct 206 ms 27796 KB Output is correct
57 Correct 107 ms 17892 KB Output is correct
58 Correct 1 ms 340 KB Output is correct
59 Correct 1 ms 328 KB Output is correct
60 Correct 1 ms 212 KB Output is correct
61 Correct 48 ms 7232 KB Output is correct
62 Correct 178 ms 27672 KB Output is correct
63 Correct 177 ms 27596 KB Output is correct
64 Correct 187 ms 27664 KB Output is correct
65 Correct 1 ms 212 KB Output is correct
66 Correct 47 ms 7212 KB Output is correct
67 Correct 184 ms 27720 KB Output is correct
68 Correct 191 ms 27788 KB Output is correct
69 Correct 202 ms 27636 KB Output is correct
70 Correct 1 ms 340 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Incorrect 1 ms 320 KB secret mismatch
73 Halted 0 ms 0 KB -