oj.uz

답안 #740020

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
740020 2023-05-11T23:59:58 Z abczz 슈퍼트리 잇기 (IOI20_supertrees) C++17
40 / 100
 222 ms 28108 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], R[1000][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;
    if (B[u]) X[u].push_back(v);
    else if (B[v]) X[v].push_back(u);
    a = dsu(u), b = dsu(v);
    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()) {
      a = dsu(i);
      if (R[a][X[i][0]]) continue;
      R[a][X[i][0]] = true;
      if (D[X[i][0]]) {
        F[i][X[i][0]] = F[X[i][0]][i] = 1;
        for (int j=0; j<X[i].size(); ++j) {
          if (!D[X[i][j]]) return 0;
        }
        continue;
      }
      F[i][X[i][0]] = F[X[i][0]][i] = 1;
      for (int j=0; j+1<X[i].size(); ++j) {
        D[X[i][j]] = true;
        F[X[i][j]][X[i][j+1]] = F[X[i][j+1]][X[i][j]] = 1;
      }
      D[X[i].back()] = true;
      F[i][X[i].back()] = F[X[i].back()][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:69:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |         for (int j=0; j<X[i].size(); ++j) {
      |                       ~^~~~~~~~~~~~
supertrees.cpp:75:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |       for (int j=0; j+1<X[i].size(); ++j) {
      |                     ~~~^~~~~~~~~~~~
supertrees.cpp:93:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   93 |     for (int i=1; i<Z.size(); ++i) {
      |                   ~^~~~~~~~~
supertrees.cpp:98:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   98 |     for (int i=0; i+1<Y.size(); ++i) {
      |                   ~~~^~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 244 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 1356 KB Output is correct
7 Correct 195 ms 26188 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 244 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 1356 KB Output is correct
7 Correct 195 ms 26188 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 10 ms 1356 KB Output is correct
13 Correct 208 ms 26108 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 5 ms 980 KB Output is correct
17 Correct 108 ms 16132 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 65 ms 6816 KB Output is correct
21 Correct 178 ms 26104 KB Output is correct
22 Correct 189 ms 26200 KB Output is correct
23 Correct 190 ms 26224 KB Output is correct
24 Correct 175 ms 26076 KB Output is correct
25 Correct 77 ms 16128 KB Output is correct
26 Correct 80 ms 16216 KB Output is correct
27 Correct 205 ms 26092 KB Output is correct
28 Correct 169 ms 26104 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 8 ms 1380 KB Output is correct
9 Correct 176 ms 26096 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 12 ms 1380 KB Output is correct
13 Correct 191 ms 26112 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 5 ms 980 KB Output is correct
17 Correct 90 ms 16108 KB Output is correct
18 Correct 1 ms 340 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 6736 KB Output is correct
22 Correct 222 ms 28084 KB Output is correct
23 Correct 199 ms 28096 KB Output is correct
24 Correct 189 ms 28044 KB Output is correct
25 Correct 88 ms 18180 KB Output is correct
26 Correct 81 ms 18156 KB Output is correct
27 Correct 180 ms 28060 KB Output is correct
28 Correct 185 ms 28024 KB Output is correct
29 Correct 97 ms 18176 KB Output is correct

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 47 ms 6804 KB Output is correct
5 Correct 174 ms 26084 KB Output is correct
6 Correct 194 ms 26092 KB Output is correct
7 Correct 183 ms 26092 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 47 ms 6824 KB Output is correct
10 Correct 182 ms 28108 KB Output is correct
11 Correct 171 ms 28028 KB Output is correct
12 Correct 213 ms 28044 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Incorrect 20 ms 4748 KB Answer gives possible 0 while actual possible 1
17 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 244 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 1356 KB Output is correct
7 Correct 195 ms 26188 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 10 ms 1356 KB Output is correct
13 Correct 208 ms 26108 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 5 ms 980 KB Output is correct
17 Correct 108 ms 16132 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 65 ms 6816 KB Output is correct
21 Correct 178 ms 26104 KB Output is correct
22 Correct 189 ms 26200 KB Output is correct
23 Correct 190 ms 26224 KB Output is correct
24 Correct 175 ms 26076 KB Output is correct
25 Correct 77 ms 16128 KB Output is correct
26 Correct 80 ms 16216 KB Output is correct
27 Correct 205 ms 26092 KB Output is correct
28 Correct 169 ms 26104 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 8 ms 1380 KB Output is correct
37 Correct 176 ms 26096 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 0 ms 340 KB Output is correct
40 Correct 12 ms 1380 KB Output is correct
41 Correct 191 ms 26112 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 0 ms 340 KB Output is correct
44 Correct 5 ms 980 KB Output is correct
45 Correct 90 ms 16108 KB Output is correct
46 Correct 1 ms 340 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 6736 KB Output is correct
50 Correct 222 ms 28084 KB Output is correct
51 Correct 199 ms 28096 KB Output is correct
52 Correct 189 ms 28044 KB Output is correct
53 Correct 88 ms 18180 KB Output is correct
54 Correct 81 ms 18156 KB Output is correct
55 Correct 180 ms 28060 KB Output is correct
56 Correct 185 ms 28024 KB Output is correct
57 Correct 97 ms 18176 KB Output is correct
58 Correct 1 ms 332 KB Output is correct
59 Correct 1 ms 332 KB Output is correct
60 Correct 4 ms 1112 KB Output is correct
61 Correct 90 ms 18104 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 340 KB Output is correct
65 Incorrect 24 ms 4744 KB Answer gives possible 0 while actual possible 1
66 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 244 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 1356 KB Output is correct
7 Correct 195 ms 26188 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 10 ms 1356 KB Output is correct
13 Correct 208 ms 26108 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 5 ms 980 KB Output is correct
17 Correct 108 ms 16132 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 65 ms 6816 KB Output is correct
21 Correct 178 ms 26104 KB Output is correct
22 Correct 189 ms 26200 KB Output is correct
23 Correct 190 ms 26224 KB Output is correct
24 Correct 175 ms 26076 KB Output is correct
25 Correct 77 ms 16128 KB Output is correct
26 Correct 80 ms 16216 KB Output is correct
27 Correct 205 ms 26092 KB Output is correct
28 Correct 169 ms 26104 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 8 ms 1380 KB Output is correct
37 Correct 176 ms 26096 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 0 ms 340 KB Output is correct
40 Correct 12 ms 1380 KB Output is correct
41 Correct 191 ms 26112 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 0 ms 340 KB Output is correct
44 Correct 5 ms 980 KB Output is correct
45 Correct 90 ms 16108 KB Output is correct
46 Correct 1 ms 340 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 6736 KB Output is correct
50 Correct 222 ms 28084 KB Output is correct
51 Correct 199 ms 28096 KB Output is correct
52 Correct 189 ms 28044 KB Output is correct
53 Correct 88 ms 18180 KB Output is correct
54 Correct 81 ms 18156 KB Output is correct
55 Correct 180 ms 28060 KB Output is correct
56 Correct 185 ms 28024 KB Output is correct
57 Correct 97 ms 18176 KB Output is correct
58 Correct 1 ms 340 KB Output is correct
59 Correct 0 ms 340 KB Output is correct
60 Correct 1 ms 340 KB Output is correct
61 Correct 47 ms 6804 KB Output is correct
62 Correct 174 ms 26084 KB Output is correct
63 Correct 194 ms 26092 KB Output is correct
64 Correct 183 ms 26092 KB Output is correct
65 Correct 0 ms 340 KB Output is correct
66 Correct 47 ms 6824 KB Output is correct
67 Correct 182 ms 28108 KB Output is correct
68 Correct 171 ms 28028 KB Output is correct
69 Correct 213 ms 28044 KB Output is correct
70 Correct 1 ms 340 KB Output is correct
71 Correct 0 ms 340 KB Output is correct
72 Correct 1 ms 332 KB Output is correct
73 Incorrect 20 ms 4748 KB Answer gives possible 0 while actual possible 1
74 Halted 0 ms 0 KB -