oj.uz

답안 #300237

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
300237 2020-09-17T02:05:13 Z madlogic 슈퍼트리 잇기 (IOI20_supertrees) C++17
40 / 100
 273 ms 30200 KB 
#include "supertrees.h"
#include <bits/stdc++.h>

using namespace std;

int construct(std::vector<std::vector<int>> p) {
  int n = p.size();
  vector<vector<int>> adj(n);
  bool two = false;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) if (p[i][j]) {
      two |= p[i][j] == 2;
      adj[i].push_back(j);
      adj[j].push_back(i);
    }
  }
  vector<int> cc;
  vector<bool> vis(n);
  function<void(int)> dfs = [&](int u) {
    vis[u] = true;
    cc.push_back(u);
    for (int to : adj[u]) if (!vis[to]) {
      dfs(to);
    }
  };
  vector<vector<int>> answer(n, vector<int>(n));
  for (int i = 0; i < n; i++) {
    if (!vis[i]) {
      dfs(i);
      int m = cc.size();
      int edges = 0;
      for (int p : cc)
        edges += adj[p].size();
      edges /= 2;
      if (m == 2 && two)
        return 0;
      // if (edges >= m) 
      //   return 0;
      for (int j = 0; j < m - 1; j++)
        answer[cc[j]][cc[j + 1]] = answer[cc[j + 1]][cc[j]] = 1;
      if (m > 2 && two)
        answer[cc[0]][cc[m - 1]] = answer[cc[m - 1]][cc[0]] = 1;
      for (int j = 0; j < m; j++) {
        for (int k = 0; k < m; k++) {
          if (p[cc[j]][cc[k]] == 0)
            return 0;
        }
      }
      cc.clear();
    }
  }
  build(answer);
  return 1;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 288 KB Output is correct
5 Correct 1 ms 288 KB Output is correct
6 Correct 11 ms 1792 KB Output is correct
7 Correct 271 ms 30200 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 288 KB Output is correct
5 Correct 1 ms 288 KB Output is correct
6 Correct 11 ms 1792 KB Output is correct
7 Correct 271 ms 30200 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 11 ms 1280 KB Output is correct
13 Correct 240 ms 22136 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 6 ms 1024 KB Output is correct
17 Correct 126 ms 17528 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 60 ms 6008 KB Output is correct
21 Correct 238 ms 23288 KB Output is correct
22 Correct 234 ms 22136 KB Output is correct
23 Correct 260 ms 26236 KB Output is correct
24 Correct 244 ms 22136 KB Output is correct
25 Correct 104 ms 13304 KB Output is correct
26 Correct 98 ms 12152 KB Output is correct
27 Correct 271 ms 28408 KB Output is correct
28 Correct 244 ms 22264 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 10 ms 1152 KB Output is correct
9 Correct 233 ms 22136 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 12 ms 1664 KB Output is correct
13 Correct 262 ms 30200 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 6 ms 1024 KB Output is correct
17 Correct 127 ms 17528 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 59 ms 5880 KB Output is correct
22 Correct 243 ms 23160 KB Output is correct
23 Correct 251 ms 22140 KB Output is correct
24 Correct 268 ms 28280 KB Output is correct
25 Correct 97 ms 12280 KB Output is correct
26 Correct 103 ms 13304 KB Output is correct
27 Correct 243 ms 22264 KB Output is correct
28 Correct 259 ms 26328 KB Output is correct
29 Correct 95 ms 12280 KB Output is correct

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 59 ms 5880 KB Output is correct
5 Correct 251 ms 23160 KB Output is correct
6 Correct 234 ms 22360 KB Output is correct
7 Correct 264 ms 26328 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 61 ms 5880 KB Output is correct
10 Correct 253 ms 23288 KB Output is correct
11 Correct 243 ms 22392 KB Output is correct
12 Correct 273 ms 28284 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Incorrect 1 ms 256 KB Too many ways to get from 4 to 8, should be 1 found no less than 2
15 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 288 KB Output is correct
5 Correct 1 ms 288 KB Output is correct
6 Correct 11 ms 1792 KB Output is correct
7 Correct 271 ms 30200 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 11 ms 1280 KB Output is correct
13 Correct 240 ms 22136 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 6 ms 1024 KB Output is correct
17 Correct 126 ms 17528 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 60 ms 6008 KB Output is correct
21 Correct 238 ms 23288 KB Output is correct
22 Correct 234 ms 22136 KB Output is correct
23 Correct 260 ms 26236 KB Output is correct
24 Correct 244 ms 22136 KB Output is correct
25 Correct 104 ms 13304 KB Output is correct
26 Correct 98 ms 12152 KB Output is correct
27 Correct 271 ms 28408 KB Output is correct
28 Correct 244 ms 22264 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 1 ms 256 KB Output is correct
32 Correct 1 ms 256 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 1 ms 256 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 10 ms 1152 KB Output is correct
37 Correct 233 ms 22136 KB Output is correct
38 Correct 1 ms 256 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 12 ms 1664 KB Output is correct
41 Correct 262 ms 30200 KB Output is correct
42 Correct 1 ms 256 KB Output is correct
43 Correct 1 ms 256 KB Output is correct
44 Correct 6 ms 1024 KB Output is correct
45 Correct 127 ms 17528 KB Output is correct
46 Correct 1 ms 256 KB Output is correct
47 Correct 1 ms 256 KB Output is correct
48 Correct 1 ms 256 KB Output is correct
49 Correct 59 ms 5880 KB Output is correct
50 Correct 243 ms 23160 KB Output is correct
51 Correct 251 ms 22140 KB Output is correct
52 Correct 268 ms 28280 KB Output is correct
53 Correct 97 ms 12280 KB Output is correct
54 Correct 103 ms 13304 KB Output is correct
55 Correct 243 ms 22264 KB Output is correct
56 Correct 259 ms 26328 KB Output is correct
57 Correct 95 ms 12280 KB Output is correct
58 Correct 1 ms 256 KB Output is correct
59 Correct 1 ms 256 KB Output is correct
60 Correct 6 ms 1152 KB Output is correct
61 Correct 130 ms 20600 KB Output is correct
62 Correct 1 ms 256 KB Output is correct
63 Incorrect 1 ms 256 KB Too many ways to get from 0 to 9, should be 1 found no less than 2
64 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 288 KB Output is correct
5 Correct 1 ms 288 KB Output is correct
6 Correct 11 ms 1792 KB Output is correct
7 Correct 271 ms 30200 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 11 ms 1280 KB Output is correct
13 Correct 240 ms 22136 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 6 ms 1024 KB Output is correct
17 Correct 126 ms 17528 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 60 ms 6008 KB Output is correct
21 Correct 238 ms 23288 KB Output is correct
22 Correct 234 ms 22136 KB Output is correct
23 Correct 260 ms 26236 KB Output is correct
24 Correct 244 ms 22136 KB Output is correct
25 Correct 104 ms 13304 KB Output is correct
26 Correct 98 ms 12152 KB Output is correct
27 Correct 271 ms 28408 KB Output is correct
28 Correct 244 ms 22264 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 1 ms 256 KB Output is correct
32 Correct 1 ms 256 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 1 ms 256 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 10 ms 1152 KB Output is correct
37 Correct 233 ms 22136 KB Output is correct
38 Correct 1 ms 256 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 12 ms 1664 KB Output is correct
41 Correct 262 ms 30200 KB Output is correct
42 Correct 1 ms 256 KB Output is correct
43 Correct 1 ms 256 KB Output is correct
44 Correct 6 ms 1024 KB Output is correct
45 Correct 127 ms 17528 KB Output is correct
46 Correct 1 ms 256 KB Output is correct
47 Correct 1 ms 256 KB Output is correct
48 Correct 1 ms 256 KB Output is correct
49 Correct 59 ms 5880 KB Output is correct
50 Correct 243 ms 23160 KB Output is correct
51 Correct 251 ms 22140 KB Output is correct
52 Correct 268 ms 28280 KB Output is correct
53 Correct 97 ms 12280 KB Output is correct
54 Correct 103 ms 13304 KB Output is correct
55 Correct 243 ms 22264 KB Output is correct
56 Correct 259 ms 26328 KB Output is correct
57 Correct 95 ms 12280 KB Output is correct
58 Correct 1 ms 256 KB Output is correct
59 Correct 1 ms 256 KB Output is correct
60 Correct 1 ms 256 KB Output is correct
61 Correct 59 ms 5880 KB Output is correct
62 Correct 251 ms 23160 KB Output is correct
63 Correct 234 ms 22360 KB Output is correct
64 Correct 264 ms 26328 KB Output is correct
65 Correct 1 ms 256 KB Output is correct
66 Correct 61 ms 5880 KB Output is correct
67 Correct 253 ms 23288 KB Output is correct
68 Correct 243 ms 22392 KB Output is correct
69 Correct 273 ms 28284 KB Output is correct
70 Correct 1 ms 256 KB Output is correct
71 Incorrect 1 ms 256 KB Too many ways to get from 4 to 8, should be 1 found no less than 2
72 Halted 0 ms 0 KB -