oj.uz

답안 #372988

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
372988 2021-03-02T21:51:46 Z Matteo_Verz 슈퍼트리 잇기 (IOI20_supertrees) C++17
21 / 100
 267 ms 24300 KB 
#include "supertrees.h"
#include <bits/stdc++.h>

using namespace std;

int construct(vector<vector<int>> p) {
  int n = p.size();
  vector<vector<int>> answer;
  answer.resize(n);
  for(int i = 0; i < n; i++) answer[i].resize(n);

  vector <int> comp;
  // last subtask, p[i][j] == 3
  for(int i = 0; i < n; i++) {
    for(int j = 0; j < n; j++)
      if(p[i][j] > 2) return 0;
    if(p[i][i] == 2 || p[i][i] == 0) return 0;
  }

  vector <bool> isroot;
  int countcomp(0);

  comp.resize(n);
  isroot.resize(n);

  for(int i = 0; i < n; i++) { // we consider i to be the root of the connected component
    if(comp[i] != 0) continue; // it can't be a root
    comp[i] = ++countcomp;
    isroot[i] = true;

    for(int j = 0; j < n; j++) {
      if(i == j) continue;
      if(p[i][j] == 1) { // if there is only 1 edge from i to j
        comp[j] = countcomp;
        answer[i][j] = answer[j][i] = 1;
      }
    }
  }

  // now we connect the roots between them to form a cycle
  // we connect the i-th root with the i+1-th root
  for(int i = 0; i < n; i++) {
    if(isroot[i] == true) {
      for(int j = i + 1; j < n; j++) {
        if(p[i][j] == 2 && isroot[j]) {
          answer[i][j] = answer[j][i] = 1;
          j = n;
        }
      }
    }
  }

  // we connect the last with the first root
  for(int i = 0; i < n; i++) {
    if(isroot[i] == true) {
      for(int j = n - 1; j > i; j--) {
        if(p[i][j] == 2 && isroot[j]) {
          answer[i][j] = answer[j][i] = 1;
          j = 0;
        }
      }
      i = n;
    }
  }

  // now we need to verify if our build is fine
  // 1. We can't have a cycle of length 2
  if(countcomp == 2) {
    for(int i = 0; i < n; i++)
      for(int j = 0; j < n; j++)
        if(p[i][j] == 2)
          return 0;
  }


  for(int i = 0; i < n; i++) {
    for(int j = 0; j < n; j++)
      if(comp[i] != comp[j] && p[i][j] == 1)
        return 0;
      else if(comp[i] == comp[j] && (p[i][j] == 0 || p[i][j] == 2))
        return 0;
  }

  build(answer);
  return 1;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 11 ms 1260 KB Output is correct
7 Correct 260 ms 22124 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 11 ms 1260 KB Output is correct
7 Correct 260 ms 22124 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 13 ms 1260 KB Output is correct
13 Correct 249 ms 22112 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 5 ms 748 KB Output is correct
17 Correct 113 ms 12140 KB Output is correct
18 Correct 1 ms 492 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 66 ms 6252 KB Output is correct
21 Correct 249 ms 24300 KB Output is correct
22 Correct 251 ms 24172 KB Output is correct
23 Correct 260 ms 24044 KB Output is correct
24 Correct 249 ms 24044 KB Output is correct
25 Correct 119 ms 14060 KB Output is correct
26 Correct 103 ms 14060 KB Output is correct
27 Correct 256 ms 24172 KB Output is correct
28 Correct 254 ms 24044 KB Output is correct

Subtask #3
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 380 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 11 ms 1260 KB Output is correct
9 Correct 247 ms 22124 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 364 KB Output is correct
12 Correct 11 ms 1260 KB Output is correct
13 Correct 249 ms 22056 KB Output is correct
14 Incorrect 1 ms 364 KB Answer gives possible 1 while actual possible 0
15 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 63 ms 5868 KB Output is correct
5 Correct 255 ms 22112 KB Output is correct
6 Correct 247 ms 22124 KB Output is correct
7 Correct 267 ms 22124 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Incorrect 68 ms 5996 KB Too few ways to get from 1 to 17, should be 2 found 1
10 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 11 ms 1260 KB Output is correct
7 Correct 260 ms 22124 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 13 ms 1260 KB Output is correct
13 Correct 249 ms 22112 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 5 ms 748 KB Output is correct
17 Correct 113 ms 12140 KB Output is correct
18 Correct 1 ms 492 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 66 ms 6252 KB Output is correct
21 Correct 249 ms 24300 KB Output is correct
22 Correct 251 ms 24172 KB Output is correct
23 Correct 260 ms 24044 KB Output is correct
24 Correct 249 ms 24044 KB Output is correct
25 Correct 119 ms 14060 KB Output is correct
26 Correct 103 ms 14060 KB Output is correct
27 Correct 256 ms 24172 KB Output is correct
28 Correct 254 ms 24044 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 0 ms 364 KB Output is correct
31 Correct 0 ms 364 KB Output is correct
32 Correct 0 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 380 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 11 ms 1260 KB Output is correct
37 Correct 247 ms 22124 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 0 ms 364 KB Output is correct
40 Correct 11 ms 1260 KB Output is correct
41 Correct 249 ms 22056 KB Output is correct
42 Incorrect 1 ms 364 KB Answer gives possible 1 while actual possible 0
43 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 11 ms 1260 KB Output is correct
7 Correct 260 ms 22124 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 13 ms 1260 KB Output is correct
13 Correct 249 ms 22112 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 5 ms 748 KB Output is correct
17 Correct 113 ms 12140 KB Output is correct
18 Correct 1 ms 492 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 66 ms 6252 KB Output is correct
21 Correct 249 ms 24300 KB Output is correct
22 Correct 251 ms 24172 KB Output is correct
23 Correct 260 ms 24044 KB Output is correct
24 Correct 249 ms 24044 KB Output is correct
25 Correct 119 ms 14060 KB Output is correct
26 Correct 103 ms 14060 KB Output is correct
27 Correct 256 ms 24172 KB Output is correct
28 Correct 254 ms 24044 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 0 ms 364 KB Output is correct
31 Correct 0 ms 364 KB Output is correct
32 Correct 0 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 380 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 11 ms 1260 KB Output is correct
37 Correct 247 ms 22124 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 0 ms 364 KB Output is correct
40 Correct 11 ms 1260 KB Output is correct
41 Correct 249 ms 22056 KB Output is correct
42 Incorrect 1 ms 364 KB Answer gives possible 1 while actual possible 0
43 Halted 0 ms 0 KB -