oj.uz

답안 #740057

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
740057 2023-05-12T03:57:01 Z abczz 슈퍼트리 잇기 (IOI20_supertrees) C++14
40 / 100
 235 ms 27788 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;*/
      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:35:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   35 |  for (auto [u, v] : V[0]) {
      |            ^
supertrees.cpp:44:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   44 |  for (auto [u, v] : V[1]) {
      |            ^
supertrees.cpp:52:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   52 |   for (auto [u, v] : V[2]) {
      |             ^
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:98:20: 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=1; i<Z.size(); ++i) {
      |                   ~^~~~~~~~~
supertrees.cpp:103:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  103 |     for (int i=0; i+1<Y.size(); ++i) {
      |                   ~~~^~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 352 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 9 ms 1484 KB Output is correct
7 Correct 198 ms 27720 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 352 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 9 ms 1484 KB Output is correct
7 Correct 198 ms 27720 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 8 ms 1492 KB Output is correct
13 Correct 191 ms 27676 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 5 ms 1108 KB Output is correct
17 Correct 94 ms 17720 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 49 ms 7304 KB Output is correct
21 Correct 188 ms 27652 KB Output is correct
22 Correct 185 ms 27580 KB Output is correct
23 Correct 209 ms 27776 KB Output is correct
24 Correct 205 ms 27640 KB Output is correct
25 Correct 89 ms 17688 KB Output is correct
26 Correct 79 ms 17744 KB Output is correct
27 Correct 205 ms 27772 KB Output is correct
28 Correct 204 ms 27788 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 8 ms 1484 KB Output is correct
9 Correct 192 ms 27640 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 10 ms 1484 KB Output is correct
13 Correct 194 ms 27728 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 5 ms 1108 KB Output is correct
17 Correct 120 ms 17196 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 52 ms 7312 KB Output is correct
22 Correct 191 ms 26824 KB Output is correct
23 Correct 197 ms 26836 KB Output is correct
24 Correct 209 ms 26852 KB Output is correct
25 Correct 90 ms 16972 KB Output is correct
26 Correct 85 ms 16996 KB Output is correct
27 Correct 219 ms 26608 KB Output is correct
28 Correct 207 ms 26548 KB Output is correct
29 Correct 108 ms 16640 KB Output is correct

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 52 ms 7072 KB Output is correct
5 Correct 230 ms 26612 KB Output is correct
6 Correct 186 ms 26608 KB Output is correct
7 Correct 214 ms 26592 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 50 ms 6848 KB Output is correct
10 Correct 235 ms 26368 KB Output is correct
11 Correct 193 ms 26348 KB Output is correct
12 Correct 207 ms 26392 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Incorrect 1 ms 212 KB Too many ways to get from 0 to 4, should be 1 found no less than 2
16 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 352 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 9 ms 1484 KB Output is correct
7 Correct 198 ms 27720 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 8 ms 1492 KB Output is correct
13 Correct 191 ms 27676 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 5 ms 1108 KB Output is correct
17 Correct 94 ms 17720 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 49 ms 7304 KB Output is correct
21 Correct 188 ms 27652 KB Output is correct
22 Correct 185 ms 27580 KB Output is correct
23 Correct 209 ms 27776 KB Output is correct
24 Correct 205 ms 27640 KB Output is correct
25 Correct 89 ms 17688 KB Output is correct
26 Correct 79 ms 17744 KB Output is correct
27 Correct 205 ms 27772 KB Output is correct
28 Correct 204 ms 27788 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 328 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 328 KB Output is correct
33 Correct 1 ms 328 KB Output is correct
34 Correct 1 ms 324 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 8 ms 1484 KB Output is correct
37 Correct 192 ms 27640 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 328 KB Output is correct
40 Correct 10 ms 1484 KB Output is correct
41 Correct 194 ms 27728 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 5 ms 1108 KB Output is correct
45 Correct 120 ms 17196 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 52 ms 7312 KB Output is correct
50 Correct 191 ms 26824 KB Output is correct
51 Correct 197 ms 26836 KB Output is correct
52 Correct 209 ms 26852 KB Output is correct
53 Correct 90 ms 16972 KB Output is correct
54 Correct 85 ms 16996 KB Output is correct
55 Correct 219 ms 26608 KB Output is correct
56 Correct 207 ms 26548 KB Output is correct
57 Correct 108 ms 16640 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 4 ms 980 KB Output is correct
61 Correct 94 ms 16236 KB Output is correct
62 Correct 0 ms 212 KB Output is correct
63 Correct 1 ms 340 KB Output is correct
64 Correct 0 ms 212 KB Output is correct
65 Incorrect 48 ms 6724 KB Too many ways to get from 1 to 445, should be 0 found no less than 1
66 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 352 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 9 ms 1484 KB Output is correct
7 Correct 198 ms 27720 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 8 ms 1492 KB Output is correct
13 Correct 191 ms 27676 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 5 ms 1108 KB Output is correct
17 Correct 94 ms 17720 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 49 ms 7304 KB Output is correct
21 Correct 188 ms 27652 KB Output is correct
22 Correct 185 ms 27580 KB Output is correct
23 Correct 209 ms 27776 KB Output is correct
24 Correct 205 ms 27640 KB Output is correct
25 Correct 89 ms 17688 KB Output is correct
26 Correct 79 ms 17744 KB Output is correct
27 Correct 205 ms 27772 KB Output is correct
28 Correct 204 ms 27788 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 328 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 328 KB Output is correct
33 Correct 1 ms 328 KB Output is correct
34 Correct 1 ms 324 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 8 ms 1484 KB Output is correct
37 Correct 192 ms 27640 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 328 KB Output is correct
40 Correct 10 ms 1484 KB Output is correct
41 Correct 194 ms 27728 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 5 ms 1108 KB Output is correct
45 Correct 120 ms 17196 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 52 ms 7312 KB Output is correct
50 Correct 191 ms 26824 KB Output is correct
51 Correct 197 ms 26836 KB Output is correct
52 Correct 209 ms 26852 KB Output is correct
53 Correct 90 ms 16972 KB Output is correct
54 Correct 85 ms 16996 KB Output is correct
55 Correct 219 ms 26608 KB Output is correct
56 Correct 207 ms 26548 KB Output is correct
57 Correct 108 ms 16640 KB Output is correct
58 Correct 1 ms 340 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 1 ms 340 KB Output is correct
61 Correct 52 ms 7072 KB Output is correct
62 Correct 230 ms 26612 KB Output is correct
63 Correct 186 ms 26608 KB Output is correct
64 Correct 214 ms 26592 KB Output is correct
65 Correct 1 ms 340 KB Output is correct
66 Correct 50 ms 6848 KB Output is correct
67 Correct 235 ms 26368 KB Output is correct
68 Correct 193 ms 26348 KB Output is correct
69 Correct 207 ms 26392 KB Output is correct
70 Correct 1 ms 340 KB Output is correct
71 Correct 1 ms 340 KB Output is correct
72 Incorrect 1 ms 212 KB Too many ways to get from 0 to 4, should be 1 found no less than 2
73 Halted 0 ms 0 KB -