oj.uz

답안 #963856

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
963856 2024-04-15T20:13:49 Z nguyentunglam 슈퍼트리 잇기 (IOI20_supertrees) C++17
96 / 100
 198 ms 24188 KB 
#include "supertrees.h"
#ifdef ngu
#include "grader.cpp"
#endif // ngu
#include <vector>
#include<bits/stdc++.h>
using namespace std;


int construct(std::vector<std::vector<int>> p) {
	int n = p.size();

  auto valid = [&] (vector<int> a, vector<int> b, int c) {
    for(int &j : a) for(int &k : b) if (p[j][k] != c) return false;
    return true;
  };

	vector<int> vis(n), arr;

  auto dfs = [&] (auto self, int u) -> void {
    vis[u] = 1;
    arr.push_back(u);
    for(int v = 0; v < n; v++) if (!vis[v] && p[u][v] == 1) self(self, v);
  };

	std::vector<std::vector<int>> answer(n, vector<int> (n));

  auto add = [&] (int u, int v) {
    answer[u][v] = answer[v][u] = 1;
  };

  vector<vector<int> > connected;

  for(int i = 0; i < n; i++) if (!vis[i]) {
    arr.clear();
    dfs(dfs, i);
    if (!valid(arr, arr, 1)) return 0;
    connected.push_back(arr);
    for(int j = 1; j < arr.size(); j++) {
      answer[arr[j]][arr[j - 1]] = answer[arr[j - 1]][arr[j]] = 1;
    }
  }

  for(int i = 0; i < n; i++) vis[i] = 0;

  for(auto &arr : connected) {
    for(auto &j : arr) for(int k = 0; k < n; k++) if (p[j][k] != p[arr[0]][k]) return 0;
  }

  auto _dfs = [&] (auto self, int u) -> void {
    vis[u] = 1;
    arr.push_back(u);
    for(int v = 0; v < connected.size(); v++) if (!vis[v] && p[connected[u][0]][connected[v][0]] == 2) {
      self(self, v);
    }
  };

  for(int i = 0; i < connected.size(); i++) if (!vis[i]) {
    arr.clear();
    _dfs(_dfs, i);
    for(int &k : arr) for(int &j : arr) if (j != k) {
      if (p[connected[k][0]][connected[j][0]] != 2) return 0;
    }
    if (arr.size() == 1) continue;
    if (arr.size() < 3) return 0;
    for(int i = 1; i < arr.size(); i++) {
      add(connected[arr[i]][0], connected[arr[i - 1]][0]);
    }
    add(connected[arr[0]][0], connected[arr.back()][0]);
  }

  build(answer);

	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:39:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |     for(int j = 1; j < arr.size(); j++) {
      |                    ~~^~~~~~~~~~~~
supertrees.cpp:58:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |   for(int i = 0; i < connected.size(); i++) if (!vis[i]) {
      |                  ~~^~~~~~~~~~~~~~~~~~
supertrees.cpp:66:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |     for(int i = 1; i < arr.size(); i++) {
      |                    ~~^~~~~~~~~~~~
supertrees.cpp: In instantiation of 'construct(std::vector<std::vector<int> >)::<lambda(auto:24, int)> [with auto:24 = construct(std::vector<std::vector<int> >)::<lambda(auto:24, int)>]':
supertrees.cpp:60:17:   required from here
supertrees.cpp:53:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |     for(int v = 0; v < connected.size(); v++) if (!vis[v] && p[connected[u][0]][connected[v][0]] == 2) {
      |                    ~~^~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 6 ms 1372 KB Output is correct
7 Correct 158 ms 23476 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 6 ms 1372 KB Output is correct
7 Correct 158 ms 23476 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 7 ms 1188 KB Output is correct
13 Correct 159 ms 23336 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 436 KB Output is correct
16 Correct 3 ms 960 KB Output is correct
17 Correct 76 ms 13496 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 39 ms 6304 KB Output is correct
21 Correct 159 ms 23280 KB Output is correct
22 Correct 156 ms 23472 KB Output is correct
23 Correct 166 ms 23428 KB Output is correct
24 Correct 163 ms 23304 KB Output is correct
25 Correct 66 ms 13392 KB Output is correct
26 Correct 70 ms 13400 KB Output is correct
27 Correct 159 ms 23276 KB Output is correct
28 Correct 160 ms 23496 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 7 ms 1184 KB Output is correct
9 Correct 160 ms 23380 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1372 KB Output is correct
13 Correct 159 ms 23380 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 856 KB Output is correct
17 Correct 71 ms 14324 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 40 ms 6240 KB Output is correct
22 Correct 175 ms 24144 KB Output is correct
23 Correct 164 ms 24088 KB Output is correct
24 Correct 198 ms 24188 KB Output is correct
25 Correct 67 ms 14156 KB Output is correct
26 Correct 73 ms 14216 KB Output is correct
27 Correct 159 ms 24032 KB Output is correct
28 Correct 160 ms 24148 KB Output is correct
29 Correct 68 ms 14220 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 436 KB Output is correct
4 Correct 39 ms 6364 KB Output is correct
5 Correct 151 ms 23344 KB Output is correct
6 Correct 167 ms 23300 KB Output is correct
7 Correct 164 ms 23404 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 47 ms 6224 KB Output is correct
10 Correct 163 ms 23284 KB Output is correct
11 Correct 158 ms 23380 KB Output is correct
12 Correct 162 ms 23344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 44 ms 6236 KB Output is correct
17 Correct 160 ms 22696 KB Output is correct
18 Correct 164 ms 23480 KB Output is correct
19 Correct 158 ms 23120 KB Output is correct
20 Correct 162 ms 23684 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 6 ms 1372 KB Output is correct
7 Correct 158 ms 23476 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 7 ms 1188 KB Output is correct
13 Correct 159 ms 23336 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 436 KB Output is correct
16 Correct 3 ms 960 KB Output is correct
17 Correct 76 ms 13496 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 39 ms 6304 KB Output is correct
21 Correct 159 ms 23280 KB Output is correct
22 Correct 156 ms 23472 KB Output is correct
23 Correct 166 ms 23428 KB Output is correct
24 Correct 163 ms 23304 KB Output is correct
25 Correct 66 ms 13392 KB Output is correct
26 Correct 70 ms 13400 KB Output is correct
27 Correct 159 ms 23276 KB Output is correct
28 Correct 160 ms 23496 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 7 ms 1184 KB Output is correct
37 Correct 160 ms 23380 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 7 ms 1372 KB Output is correct
41 Correct 159 ms 23380 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 3 ms 856 KB Output is correct
45 Correct 71 ms 14324 KB Output is correct
46 Correct 1 ms 344 KB Output is correct
47 Correct 0 ms 344 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 40 ms 6240 KB Output is correct
50 Correct 175 ms 24144 KB Output is correct
51 Correct 164 ms 24088 KB Output is correct
52 Correct 198 ms 24188 KB Output is correct
53 Correct 67 ms 14156 KB Output is correct
54 Correct 73 ms 14216 KB Output is correct
55 Correct 159 ms 24032 KB Output is correct
56 Correct 160 ms 24148 KB Output is correct
57 Correct 68 ms 14220 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 1 ms 544 KB Output is correct
60 Correct 3 ms 928 KB Output is correct
61 Correct 81 ms 14212 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 40 ms 6236 KB Output is correct
66 Correct 66 ms 14232 KB Output is correct
67 Correct 64 ms 14216 KB Output is correct
68 Correct 66 ms 14164 KB Output is correct
69 Correct 65 ms 14076 KB Output is correct

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 6 ms 1372 KB Output is correct
7 Correct 158 ms 23476 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 7 ms 1188 KB Output is correct
13 Correct 159 ms 23336 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 436 KB Output is correct
16 Correct 3 ms 960 KB Output is correct
17 Correct 76 ms 13496 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 39 ms 6304 KB Output is correct
21 Correct 159 ms 23280 KB Output is correct
22 Correct 156 ms 23472 KB Output is correct
23 Correct 166 ms 23428 KB Output is correct
24 Correct 163 ms 23304 KB Output is correct
25 Correct 66 ms 13392 KB Output is correct
26 Correct 70 ms 13400 KB Output is correct
27 Correct 159 ms 23276 KB Output is correct
28 Correct 160 ms 23496 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 7 ms 1184 KB Output is correct
37 Correct 160 ms 23380 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 7 ms 1372 KB Output is correct
41 Correct 159 ms 23380 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 3 ms 856 KB Output is correct
45 Correct 71 ms 14324 KB Output is correct
46 Correct 1 ms 344 KB Output is correct
47 Correct 0 ms 344 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 40 ms 6240 KB Output is correct
50 Correct 175 ms 24144 KB Output is correct
51 Correct 164 ms 24088 KB Output is correct
52 Correct 198 ms 24188 KB Output is correct
53 Correct 67 ms 14156 KB Output is correct
54 Correct 73 ms 14216 KB Output is correct
55 Correct 159 ms 24032 KB Output is correct
56 Correct 160 ms 24148 KB Output is correct
57 Correct 68 ms 14220 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 1 ms 436 KB Output is correct
61 Correct 39 ms 6364 KB Output is correct
62 Correct 151 ms 23344 KB Output is correct
63 Correct 167 ms 23300 KB Output is correct
64 Correct 164 ms 23404 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 47 ms 6224 KB Output is correct
67 Correct 163 ms 23284 KB Output is correct
68 Correct 158 ms 23380 KB Output is correct
69 Correct 162 ms 23344 KB Output is correct
70 Correct 0 ms 348 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 0 ms 348 KB Output is correct
73 Correct 44 ms 6236 KB Output is correct
74 Correct 160 ms 22696 KB Output is correct
75 Correct 164 ms 23480 KB Output is correct
76 Correct 158 ms 23120 KB Output is correct
77 Correct 162 ms 23684 KB Output is correct
78 Correct 0 ms 348 KB Output is correct
79 Correct 1 ms 544 KB Output is correct
80 Correct 3 ms 928 KB Output is correct
81 Correct 81 ms 14212 KB Output is correct
82 Correct 0 ms 348 KB Output is correct
83 Correct 0 ms 348 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 40 ms 6236 KB Output is correct
86 Correct 66 ms 14232 KB Output is correct
87 Correct 64 ms 14216 KB Output is correct
88 Correct 66 ms 14164 KB Output is correct
89 Correct 65 ms 14076 KB Output is correct
90 Correct 0 ms 344 KB Output is correct
91 Correct 1 ms 348 KB Output is correct
92 Correct 3 ms 868 KB Output is correct
93 Correct 66 ms 14160 KB Output is correct
94 Correct 0 ms 344 KB Output is correct
95 Correct 1 ms 348 KB Output is correct
96 Incorrect 0 ms 348 KB Answer gives possible 1 while actual possible 0
97 Halted 0 ms 0 KB -